[{"type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"We compare finite rank perturbations of the following three ensembles of complex rectangular random matrices: First, a generalised Wishart ensemble with one random and two fixed correlation matrices introduced by Borodin and Péché, second, the product of two independent random matrices where one has correlated entries, and third, the case when the two random matrices become also coupled through a fixed matrix. The singular value statistics of all three ensembles is shown to be determinantal and we derive double contour integral representations for their respective kernels. Three different kernels are found in the limit of infinite matrix dimension at the origin of the spectrum. They depend on finite rank perturbations of the correlation and coupling matrices and are shown to be integrable. The first kernel (I) is found for two independent matrices from the second, and two weakly coupled matrices from the third ensemble. It generalises the Meijer G-kernel for two independent and uncorrelated matrices. The third kernel (III) is obtained for the generalised Wishart ensemble and for two strongly coupled matrices. It further generalises the perturbed Bessel kernel of Desrosiers and Forrester. Finally, kernel (II), found for the ensemble of two coupled matrices, provides an interpolation between the kernels (I) and (III), generalising previous findings of part of the authors."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7423","intvolume":" 55","title":"Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles","status":"public","oa_version":"Preprint","article_processing_charge":"No","day":"01","citation":{"apa":"Akemann, G., Checinski, T., Liu, D., & Strahov, E. (2019). Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. Institute of Mathematical Statistics. https://doi.org/10.1214/18-aihp888","ieee":"G. Akemann, T. Checinski, D. Liu, and E. Strahov, “Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles,” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, vol. 55, no. 1. Institute of Mathematical Statistics, pp. 441–479, 2019.","ista":"Akemann G, Checinski T, Liu D, Strahov E. 2019. Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 55(1), 441–479.","ama":"Akemann G, Checinski T, Liu D, Strahov E. Finite rank perturbations in products of coupled random matrices: From one correlated to two Wishart ensembles. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 2019;55(1):441-479. doi:10.1214/18-aihp888","chicago":"Akemann, Gernot, Tomasz Checinski, Dangzheng Liu, and Eugene Strahov. “Finite Rank Perturbations in Products of Coupled Random Matrices: From One Correlated to Two Wishart Ensembles.” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. Institute of Mathematical Statistics, 2019. https://doi.org/10.1214/18-aihp888.","short":"G. Akemann, T. Checinski, D. Liu, E. Strahov, Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 55 (2019) 441–479.","mla":"Akemann, Gernot, et al. “Finite Rank Perturbations in Products of Coupled Random Matrices: From One Correlated to Two Wishart Ensembles.” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, vol. 55, no. 1, Institute of Mathematical Statistics, 2019, pp. 441–79, doi:10.1214/18-aihp888."},"publication":"Annales de l'Institut Henri Poincaré, Probabilités et Statistiques","page":"441-479","article_type":"original","date_published":"2019-02-01T00:00:00Z","year":"2019","publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}],"publication_status":"published","author":[{"full_name":"Akemann, Gernot","last_name":"Akemann","first_name":"Gernot"},{"last_name":"Checinski","first_name":"Tomasz","full_name":"Checinski, Tomasz"},{"full_name":"Liu, Dangzheng","id":"2F947E34-F248-11E8-B48F-1D18A9856A87","last_name":"Liu","first_name":"Dangzheng"},{"first_name":"Eugene","last_name":"Strahov","full_name":"Strahov, Eugene"}],"volume":55,"date_created":"2020-01-30T10:36:50Z","date_updated":"2023-09-06T14:58:39Z","publication_identifier":{"issn":["0246-0203"]},"month":"02","main_file_link":[{"url":"https://arxiv.org/abs/1704.05224","open_access":"1"}],"external_id":{"arxiv":["1704.05224"],"isi":["000456070200013"]},"oa":1,"isi":1,"quality_controlled":"1","doi":"10.1214/18-aihp888","language":[{"iso":"eng"}]},{"day":"01","article_processing_charge":"No","date_published":"2019-04-01T00:00:00Z","publication":"Molecular Ecology","citation":{"ama":"Toups MA, Rodrigues N, Perrin N, Kirkpatrick M. A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology. 2019;28(8):1877-1889. doi:10.1111/mec.14990","ista":"Toups MA, Rodrigues N, Perrin N, Kirkpatrick M. 2019. A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology. 28(8), 1877–1889.","apa":"Toups, M. A., Rodrigues, N., Perrin, N., & Kirkpatrick, M. (2019). A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.14990","ieee":"M. A. Toups, N. Rodrigues, N. Perrin, and M. Kirkpatrick, “A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog,” Molecular Ecology, vol. 28, no. 8. Wiley, pp. 1877–1889, 2019.","mla":"Toups, Melissa A., et al. “A Reciprocal Translocation Radically Reshapes Sex‐linked Inheritance in the Common Frog.” Molecular Ecology, vol. 28, no. 8, Wiley, 2019, pp. 1877–89, doi:10.1111/mec.14990.","short":"M.A. Toups, N. Rodrigues, N. Perrin, M. Kirkpatrick, Molecular Ecology 28 (2019) 1877–1889.","chicago":"Toups, Melissa A, Nicolas Rodrigues, Nicolas Perrin, and Mark Kirkpatrick. “A Reciprocal Translocation Radically Reshapes Sex‐linked Inheritance in the Common Frog.” Molecular Ecology. Wiley, 2019. https://doi.org/10.1111/mec.14990."},"article_type":"original","page":"1877-1889","abstract":[{"text":"X and Y chromosomes can diverge when rearrangements block recombination between them. Here we present the first genomic view of a reciprocal translocation that causes two physically unconnected pairs of chromosomes to be coinherited as sex chromosomes. In a population of the common frog (Rana temporaria), both pairs of X and Y chromosomes show extensive sequence differentiation, but not degeneration of the Y chromosomes. A new method based on gene trees shows both chromosomes are sex‐linked. Furthermore, the gene trees from the two Y chromosomes have identical topologies, showing they have been coinherited since the reciprocal translocation occurred. Reciprocal translocations can thus reshape sex linkage on a much greater scale compared with inversions, the type of rearrangement that is much better known in sex chromosome evolution, and they can greatly amplify the power of sexually antagonistic selection to drive genomic rearrangement. Two more populations show evidence of other rearrangements, suggesting that this species has unprecedented structural polymorphism in its sex chromosomes.","lang":"eng"}],"issue":"8","type":"journal_article","oa_version":"None","_id":"7421","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"A reciprocal translocation radically reshapes sex‐linked inheritance in the common frog","status":"public","intvolume":" 28","month":"04","publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"doi":"10.1111/mec.14990","language":[{"iso":"eng"}],"external_id":{"pmid":["30576024"],"isi":["000468200800004"]},"isi":1,"quality_controlled":"1","author":[{"full_name":"Toups, Melissa A","id":"4E099E4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9752-7380","first_name":"Melissa A","last_name":"Toups"},{"last_name":"Rodrigues","first_name":"Nicolas","full_name":"Rodrigues, Nicolas"},{"full_name":"Perrin, Nicolas","last_name":"Perrin","first_name":"Nicolas"},{"last_name":"Kirkpatrick","first_name":"Mark","full_name":"Kirkpatrick, Mark"}],"date_created":"2020-01-30T10:33:05Z","date_updated":"2023-09-06T15:00:13Z","volume":28,"year":"2019","pmid":1,"publication_status":"published","department":[{"_id":"BeVi"}],"publisher":"Wiley"},{"author":[{"full_name":"Abusalah, Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87","last_name":"Abusalah","first_name":"Hamza M"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan"},{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482","first_name":"Michael","last_name":"Walter","full_name":"Walter, Michael"}],"date_updated":"2023-09-06T15:26:06Z","date_created":"2020-01-30T09:26:14Z","volume":11477,"year":"2019","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer International Publishing","ec_funded":1,"conference":{"start_date":"2019-05-19","location":"Darmstadt, Germany","end_date":"2019-05-23","name":"International Conference on the Theory and Applications of Cryptographic Techniques"},"doi":"10.1007/978-3-030-17656-3_10","language":[{"iso":"eng"}],"external_id":{"isi":["000483516200010"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/252"}],"isi":1,"quality_controlled":"1","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"month":"04","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030176556","9783030176563"],"issn":["0302-9743"]},"oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7411","status":"public","title":"Reversible proofs of sequential work","intvolume":" 11477","abstract":[{"text":"Proofs of sequential work (PoSW) are proof systems where a prover, upon receiving a statement χ and a time parameter T computes a proof ϕ(χ,T) which is efficiently and publicly verifiable. The proof can be computed in T sequential steps, but not much less, even by a malicious party having large parallelism. A PoSW thus serves as a proof that T units of time have passed since χ\r\n\r\nwas received.\r\n\r\nPoSW were introduced by Mahmoody, Moran and Vadhan [MMV11], a simple and practical construction was only recently proposed by Cohen and Pietrzak [CP18].\r\n\r\nIn this work we construct a new simple PoSW in the random permutation model which is almost as simple and efficient as [CP18] but conceptually very different. Whereas the structure underlying [CP18] is a hash tree, our construction is based on skip lists and has the interesting property that computing the PoSW is a reversible computation.\r\nThe fact that the construction is reversible can potentially be used for new applications like constructing proofs of replication. We also show how to “embed” the sloth function of Lenstra and Weselowski [LW17] into our PoSW to get a PoSW where one additionally can verify correctness of the output much more efficiently than recomputing it (though recent constructions of “verifiable delay functions” subsume most of the applications this construction was aiming at).","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"date_published":"2019-04-24T00:00:00Z","publication":"Advances in Cryptology – EUROCRYPT 2019","citation":{"ama":"Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible proofs of sequential work. In: Advances in Cryptology – EUROCRYPT 2019. Vol 11477. Springer International Publishing; 2019:277-291. doi:10.1007/978-3-030-17656-3_10","ieee":"H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “Reversible proofs of sequential work,” in Advances in Cryptology – EUROCRYPT 2019, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.","apa":"Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2019). Reversible proofs of sequential work. In Advances in Cryptology – EUROCRYPT 2019 (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International Publishing. https://doi.org/10.1007/978-3-030-17656-3_10","ista":"Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 11477, 277–291.","short":"H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291.","mla":"Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.","chicago":"Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “Reversible Proofs of Sequential Work.” In Advances in Cryptology – EUROCRYPT 2019, 11477:277–91. Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-17656-3_10."},"page":"277-291","day":"24","article_processing_charge":"No","scopus_import":"1"},{"oa_version":"None","status":"public","title":"Isolation of synaptic vesicles from genetically engineered cultured neurons","intvolume":" 312","_id":"7406","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Background\r\nSynaptic vesicles (SVs) are an integral part of the neurotransmission machinery, and isolation of SVs from their host neuron is necessary to reveal their most fundamental biochemical and functional properties in in vitro assays. Isolated SVs from neurons that have been genetically engineered, e.g. to introduce genetically encoded indicators, are not readily available but would permit new insights into SV structure and function. Furthermore, it is unclear if cultured neurons can provide sufficient starting material for SV isolation procedures.\r\n\r\nNew method\r\nHere, we demonstrate an efficient ex vivo procedure to obtain functional SVs from cultured rat cortical neurons after genetic engineering with a lentivirus.\r\n\r\nResults\r\nWe show that ∼108 plated cortical neurons allow isolation of suitable SV amounts for functional analysis and imaging. We found that SVs isolated from cultured neurons have neurotransmitter uptake comparable to that of SVs isolated from intact cortex. Using total internal reflection fluorescence (TIRF) microscopy, we visualized an exogenous SV-targeted marker protein and demonstrated the high efficiency of SV modification.\r\n\r\nComparison with existing methods\r\nObtaining SVs from genetically engineered neurons currently generally requires the availability of transgenic animals, which is constrained by technical (e.g. cost and time) and biological (e.g. developmental defects and lethality) limitations.\r\n\r\nConclusions\r\nThese results demonstrate the modification and isolation of functional SVs using cultured neurons and viral transduction. The ability to readily obtain SVs from genetically engineered neurons will permit linking in situ studies to in vitro experiments in a variety of genetic contexts."}],"type":"journal_article","date_published":"2019-01-15T00:00:00Z","article_type":"original","page":"114-121","publication":"Journal of Neuroscience Methods","citation":{"ama":"Mckenzie C, Spanova M, Johnson AJ, et al. Isolation of synaptic vesicles from genetically engineered cultured neurons. Journal of Neuroscience Methods. 2019;312:114-121. doi:10.1016/j.jneumeth.2018.11.018","ieee":"C. Mckenzie et al., “Isolation of synaptic vesicles from genetically engineered cultured neurons,” Journal of Neuroscience Methods, vol. 312. Elsevier, pp. 114–121, 2019.","apa":"Mckenzie, C., Spanova, M., Johnson, A. J., Kainrath, S., Zheden, V., Sitte, H. H., & Janovjak, H. L. (2019). Isolation of synaptic vesicles from genetically engineered cultured neurons. Journal of Neuroscience Methods. Elsevier. https://doi.org/10.1016/j.jneumeth.2018.11.018","ista":"Mckenzie C, Spanova M, Johnson AJ, Kainrath S, Zheden V, Sitte HH, Janovjak HL. 2019. Isolation of synaptic vesicles from genetically engineered cultured neurons. Journal of Neuroscience Methods. 312, 114–121.","short":"C. Mckenzie, M. Spanova, A.J. Johnson, S. Kainrath, V. Zheden, H.H. Sitte, H.L. Janovjak, Journal of Neuroscience Methods 312 (2019) 114–121.","mla":"Mckenzie, Catherine, et al. “Isolation of Synaptic Vesicles from Genetically Engineered Cultured Neurons.” Journal of Neuroscience Methods, vol. 312, Elsevier, 2019, pp. 114–21, doi:10.1016/j.jneumeth.2018.11.018.","chicago":"Mckenzie, Catherine, Miroslava Spanova, Alexander J Johnson, Stephanie Kainrath, Vanessa Zheden, Harald H. Sitte, and Harald L Janovjak. “Isolation of Synaptic Vesicles from Genetically Engineered Cultured Neurons.” Journal of Neuroscience Methods. Elsevier, 2019. https://doi.org/10.1016/j.jneumeth.2018.11.018."},"day":"15","article_processing_charge":"No","scopus_import":"1","date_created":"2020-01-30T09:12:19Z","date_updated":"2023-09-06T15:27:29Z","volume":312,"author":[{"last_name":"Mckenzie","first_name":"Catherine","id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","full_name":"Mckenzie, Catherine"},{"full_name":"Spanova, Miroslava","id":"44A924DC-F248-11E8-B48F-1D18A9856A87","first_name":"Miroslava","last_name":"Spanova"},{"full_name":"Johnson, Alexander J","first_name":"Alexander J","last_name":"Johnson","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2739-8843"},{"id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","last_name":"Kainrath","first_name":"Stephanie","full_name":"Kainrath, Stephanie"},{"id":"39C5A68A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9438-4783","first_name":"Vanessa","last_name":"Zheden","full_name":"Zheden, Vanessa"},{"last_name":"Sitte","first_name":"Harald H.","full_name":"Sitte, Harald H."},{"full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak"}],"publication_status":"published","department":[{"_id":"HaJa"},{"_id":"Bio"}],"publisher":"Elsevier","year":"2019","pmid":1,"ec_funded":1,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.jneumeth.2018.11.018","isi":1,"quality_controlled":"1","project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564"},{"grant_number":"I03630","_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants"},{"_id":"2548AE96-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","call_identifier":"FWF","name":"Molecular Drug Targets"}],"external_id":{"isi":["000456220900013"],"pmid":["30496761"]},"month":"01","publication_identifier":{"issn":["0165-0270"]}},{"author":[{"full_name":"Yu, Chen","first_name":"Chen","last_name":"Yu"},{"full_name":"Tang, Hanlin","last_name":"Tang","first_name":"Hanlin"},{"last_name":"Renggli","first_name":"Cedric","full_name":"Renggli, Cedric"},{"full_name":"Kassing, Simon","first_name":"Simon","last_name":"Kassing"},{"last_name":"Singla","first_name":"Ankit","full_name":"Singla, Ankit"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Zhang, Ce","first_name":"Ce","last_name":"Zhang"},{"first_name":"Ji","last_name":"Liu","full_name":"Liu, Ji"}],"date_created":"2020-02-02T23:01:06Z","date_updated":"2023-09-06T15:21:48Z","volume":"2019-June","year":"2019","publication_status":"published","publisher":"IMLS","department":[{"_id":"DaAl"}],"conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2019-06-15","location":"Long Beach, CA, United States","start_date":"2019-06-10"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1810.07766","open_access":"1"}],"oa":1,"external_id":{"isi":["000684034307036"],"arxiv":["1810.07766"]},"isi":1,"quality_controlled":"1","month":"06","publication_identifier":{"isbn":["9781510886988"]},"oa_version":"Preprint","_id":"7437","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Distributed learning over unreliable networks","abstract":[{"text":"Most of today's distributed machine learning systems assume reliable networks: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: Can we design machine learning systems that are tolerant to network unreliability during training? With this motivation, we focus on a theoretical problem of independent interest-given a standard distributed parameter server architecture, if every communication between the worker and the server has a non-zero probability p of being dropped, does there exist an algorithm that still converges, and at what speed? The technical contribution of this paper is a novel theoretical analysis proving that distributed learning over unreliable network can achieve comparable convergence rate to centralized or distributed learning over reliable networks. Further, we prove that the influence of the packet drop rate diminishes with the growth of the number of parameter servers. We map this theoretical result onto a real-world scenario, training deep neural networks over an unreliable network layer, and conduct network simulation to validate the system improvement by allowing the networks to be unreliable.","lang":"eng"}],"type":"conference","date_published":"2019-06-01T00:00:00Z","publication":"36th International Conference on Machine Learning, ICML 2019","citation":{"chicago":"Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.” In 36th International Conference on Machine Learning, ICML 2019, 2019–June:12481–512. IMLS, 2019.","short":"C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang, J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS, 2019, pp. 12481–12512.","mla":"Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” 36th International Conference on Machine Learning, ICML 2019, vol. 2019–June, IMLS, 2019, pp. 12481–512.","apa":"Yu, C., Tang, H., Renggli, C., Kassing, S., Singla, A., Alistarh, D.-A., … Liu, J. (2019). Distributed learning over unreliable networks. In 36th International Conference on Machine Learning, ICML 2019 (Vol. 2019–June, pp. 12481–12512). Long Beach, CA, United States: IMLS.","ieee":"C. Yu et al., “Distributed learning over unreliable networks,” in 36th International Conference on Machine Learning, ICML 2019, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 12481–12512.","ista":"Yu C, Tang H, Renggli C, Kassing S, Singla A, Alistarh D-A, Zhang C, Liu J. 2019. Distributed learning over unreliable networks. 36th International Conference on Machine Learning, ICML 2019. ICML: International Conference on Machine Learning vol. 2019–June, 12481–12512.","ama":"Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks. In: 36th International Conference on Machine Learning, ICML 2019. Vol 2019-June. IMLS; 2019:12481-12512."},"page":"12481-12512","day":"01","article_processing_charge":"No","scopus_import":"1"}]