[{"isi":1,"project":[{"call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331"}],"abstract":[{"text":"We establish a precise three-term asymptotic expansion, with an optimal estimate of the error term, for the rightmost eigenvalue of an n×n random matrix with independent identically distributed complex entries as n tends to infinity. All terms in the expansion are universal.","lang":"eng"}],"corr_author":"1","language":[{"iso":"eng"}],"oa_version":"Preprint","volume":51,"year":"2023","keyword":["Statistics","Probability and Uncertainty","Statistics and Probability"],"external_id":{"isi":["001112165000004"],"arxiv":["2206.04448"]},"department":[{"_id":"LaEr"}],"intvolume":"        51","page":"2192-2242","_id":"14849","article_processing_charge":"No","date_updated":"2025-09-09T14:23:34Z","status":"public","publisher":"Institute of Mathematical Statistics","acknowledgement":"The second and the fourth author were supported by the ERC Advanced Grant\r\n“RMTBeyond” No. 101020331. The third author was supported by Dr. Max Rössler, the\r\nWalter Haefner Foundation and the ETH Zürich Foundation.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"day":"01","fulldoi":"https://doi.org/10.1214/23-aop1643","date_published":"2023-11-01T00:00:00Z","article_type":"original","publication_status":"published","scopus_import":"1","type":"journal_article","ec_funded":1,"author":[{"orcid":"0000-0002-4901-7992","first_name":"Giorgio","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder","orcid":"0000-0002-2904-1856","first_name":"Dominik J","full_name":"Schröder, Dominik J"},{"full_name":"Xu, Yuanyuan","last_name":"Xu","first_name":"Yuanyuan"}],"month":"11","date_created":"2024-01-22T08:08:41Z","publication_identifier":{"issn":["0091-1798"]},"citation":{"short":"G. Cipolloni, L. Erdös, D.J. Schröder, Y. Xu, The Annals of Probability 51 (2023) 2192–2242.","chicago":"Cipolloni, Giorgio, László Erdös, Dominik J Schröder, and Yuanyuan Xu. “On the Rightmost Eigenvalue of Non-Hermitian Random Matrices.” <i>The Annals of Probability</i>. Institute of Mathematical Statistics, 2023. <a href=\"https://doi.org/10.1214/23-aop1643\">https://doi.org/10.1214/23-aop1643</a>.","ieee":"G. Cipolloni, L. Erdös, D. J. Schröder, and Y. Xu, “On the rightmost eigenvalue of non-Hermitian random matrices,” <i>The Annals of Probability</i>, vol. 51, no. 6. Institute of Mathematical Statistics, pp. 2192–2242, 2023.","apa":"Cipolloni, G., Erdös, L., Schröder, D. J., &#38; Xu, Y. (2023). On the rightmost eigenvalue of non-Hermitian random matrices. <i>The Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/23-aop1643\">https://doi.org/10.1214/23-aop1643</a>","ista":"Cipolloni G, Erdös L, Schröder DJ, Xu Y. 2023. On the rightmost eigenvalue of non-Hermitian random matrices. The Annals of Probability. 51(6), 2192–2242.","ama":"Cipolloni G, Erdös L, Schröder DJ, Xu Y. On the rightmost eigenvalue of non-Hermitian random matrices. <i>The Annals of Probability</i>. 2023;51(6):2192-2242. doi:<a href=\"https://doi.org/10.1214/23-aop1643\">10.1214/23-aop1643</a>","mla":"Cipolloni, Giorgio, et al. “On the Rightmost Eigenvalue of Non-Hermitian Random Matrices.” <i>The Annals of Probability</i>, vol. 51, no. 6, Institute of Mathematical Statistics, 2023, pp. 2192–242, doi:<a href=\"https://doi.org/10.1214/23-aop1643\">10.1214/23-aop1643</a>."},"arxiv":1,"doi":"10.1214/23-aop1643","title":"On the rightmost eigenvalue of non-Hermitian random matrices","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2206.04448","open_access":"1"}],"publication":"The Annals of Probability","issue":"6","quality_controlled":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","editor":[{"first_name":"Sylvia","last_name":"Sullivan","full_name":"Sullivan, Sylvia"},{"full_name":"Hoose, Corinna","last_name":"Hoose","first_name":"Corinna"}],"publisher":"Wiley","title":"Mechanisms for the Self‐Organization of Tropical Deep Convection","publication":"Clouds and Their Climatic Impacts","alternative_title":["Geophysical Monograph Series"],"publication_identifier":{"issn":["2328-8779"],"eisbn":["9781119700357"],"isbn":["9781119700319"]},"citation":{"ama":"Haerter JO, Muller CJ. Mechanisms for the Self‐Organization of Tropical Deep Convection. In: Sullivan S, Hoose C, eds. <i>Clouds and Their Climatic Impacts</i>. Wiley; 2023:179-193. doi:<a href=\"https://doi.org/10.1002/9781119700357.ch8\">10.1002/9781119700357.ch8</a>","ista":"Haerter JO, Muller CJ. 2023.Mechanisms for the Self‐Organization of Tropical Deep Convection. In: Clouds and Their Climatic Impacts. Geophysical Monograph Series, , 179–193.","apa":"Haerter, J. O., &#38; Muller, C. J. (2023). Mechanisms for the Self‐Organization of Tropical Deep Convection. In S. Sullivan &#38; C. Hoose (Eds.), <i>Clouds and Their Climatic Impacts</i> (pp. 179–193). Wiley. <a href=\"https://doi.org/10.1002/9781119700357.ch8\">https://doi.org/10.1002/9781119700357.ch8</a>","mla":"Haerter, Jan O., and Caroline J. Muller. “Mechanisms for the Self‐Organization of Tropical Deep Convection.” <i>Clouds and Their Climatic Impacts</i>, edited by Sylvia Sullivan and Corinna Hoose, Wiley, 2023, pp. 179–93, doi:<a href=\"https://doi.org/10.1002/9781119700357.ch8\">10.1002/9781119700357.ch8</a>.","ieee":"J. O. Haerter and C. J. Muller, “Mechanisms for the Self‐Organization of Tropical Deep Convection,” in <i>Clouds and Their Climatic Impacts</i>, S. Sullivan and C. Hoose, Eds. Wiley, 2023, pp. 179–193.","chicago":"Haerter, Jan O., and Caroline J Muller. “Mechanisms for the Self‐Organization of Tropical Deep Convection.” In <i>Clouds and Their Climatic Impacts</i>, edited by Sylvia Sullivan and Corinna Hoose, 179–93. Wiley, 2023. <a href=\"https://doi.org/10.1002/9781119700357.ch8\">https://doi.org/10.1002/9781119700357.ch8</a>.","short":"J.O. Haerter, C.J. Muller, in:, S. Sullivan, C. Hoose (Eds.), Clouds and Their Climatic Impacts, Wiley, 2023, pp. 179–193."},"doi":"10.1002/9781119700357.ch8","author":[{"full_name":"Haerter, Jan O.","last_name":"Haerter","first_name":"Jan O."},{"full_name":"Muller, Caroline J","first_name":"Caroline J","orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller"}],"page":"179-193","_id":"14853","month":"12","article_processing_charge":"No","date_created":"2024-01-22T08:23:16Z","status":"public","date_updated":"2024-10-09T21:07:59Z","type":"book_chapter","department":[{"_id":"CaMu"}],"language":[{"iso":"eng"}],"oa_version":"None","year":"2023","day":"15","fulldoi":"https://doi.org/10.1002/9781119700357.ch8","publication_status":"published","date_published":"2023-12-15T00:00:00Z","abstract":[{"lang":"eng","text":"Organization – or departure from a random pattern – in tropical deep convection is heavily studied due to its immediate relevance to climate sensitivity and extremes. Low-latitude convection has motivated numerical model idealizations, where the Coriolis force is removed and boundary conditions are simplified spatially and temporally. One of the most stunning aspects of such idealized simulated cloud organization is the spontaneous clumping of convection that can occur without any predetermining external perturbation, such as inhomogeneous surface boundary conditions or large-scale waves. Whereas individual convective rain cells measure only few kilometers in horizontal diameter, the clusters they form can often span hundreds or even thousands of kilometers. Hence, organization may emerge from the very small scales but can show effects at the synoptic scale. We refer to such emergent organization as convective self-organization. Convective self-organization thus features characteristics of emergence, such as non-trivial system-scale pattern formation or hysteresis. We summarize observational evidence for large-scale organization and briefly recap classical idealized modeling studies that yield convective self-aggregation – emergent organization under strongly idealized boundary conditions. We then focus on developing research, where temporal variation, such as the diurnal cycle, or two-way interactive surface properties yield distinct organizational modes. Convectively generated cold pools and mesoscale convective systems, both ubiquitous in nature, are thereby found to potentially play key roles in promoting – rather than suppressing – sustained system-scale organization."}],"corr_author":"1"},{"quality_controlled":"1","issue":"4","doi":"10.2140/paa.2023.5.973","citation":{"ieee":"D. J. Mitrouskas and R. Seiringer, “Ubiquity of bound states for the strongly coupled polaron,” <i>Pure and Applied Analysis</i>, vol. 5, no. 4. Mathematical Sciences Publishers, pp. 973–1008, 2023.","mla":"Mitrouskas, David Johannes, and Robert Seiringer. “Ubiquity of Bound States for the Strongly Coupled Polaron.” <i>Pure and Applied Analysis</i>, vol. 5, no. 4, Mathematical Sciences Publishers, 2023, pp. 973–1008, doi:<a href=\"https://doi.org/10.2140/paa.2023.5.973\">10.2140/paa.2023.5.973</a>.","ama":"Mitrouskas DJ, Seiringer R. Ubiquity of bound states for the strongly coupled polaron. <i>Pure and Applied Analysis</i>. 2023;5(4):973-1008. doi:<a href=\"https://doi.org/10.2140/paa.2023.5.973\">10.2140/paa.2023.5.973</a>","ista":"Mitrouskas DJ, Seiringer R. 2023. Ubiquity of bound states for the strongly coupled polaron. Pure and Applied Analysis. 5(4), 973–1008.","apa":"Mitrouskas, D. J., &#38; Seiringer, R. (2023). Ubiquity of bound states for the strongly coupled polaron. <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/paa.2023.5.973\">https://doi.org/10.2140/paa.2023.5.973</a>","short":"D.J. Mitrouskas, R. Seiringer, Pure and Applied Analysis 5 (2023) 973–1008.","chicago":"Mitrouskas, David Johannes, and Robert Seiringer. “Ubiquity of Bound States for the Strongly Coupled Polaron.” <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers, 2023. <a href=\"https://doi.org/10.2140/paa.2023.5.973\">https://doi.org/10.2140/paa.2023.5.973</a>."},"publication_identifier":{"issn":["2578-5893"],"eissn":["2578-5885"]},"arxiv":1,"publication":"Pure and Applied Analysis","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.03606"}],"title":"Ubiquity of bound states for the strongly coupled polaron","type":"journal_article","date_created":"2024-01-22T08:24:23Z","author":[{"full_name":"Mitrouskas, David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","last_name":"Mitrouskas","first_name":"David Johannes"},{"first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"month":"12","date_published":"2023-12-15T00:00:00Z","publication_status":"published","article_type":"original","scopus_import":"1","day":"15","OA_type":"green","fulldoi":"https://doi.org/10.2140/paa.2023.5.973","OA_place":"repository","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Mathematical Sciences Publishers","intvolume":"         5","department":[{"_id":"RoSe"}],"article_processing_charge":"No","date_updated":"2025-04-23T14:21:39Z","status":"public","page":"973-1008","_id":"14854","abstract":[{"text":"We study the spectrum of the Fröhlich Hamiltonian for the polaron at fixed total momentum. We prove the existence of excited eigenvalues between the ground state energy and the essential spectrum at strong coupling. In fact, our main result shows that the number of excited energy bands diverges in the strong coupling limit. To prove this we derive upper bounds for the min-max values of the corresponding fiber Hamiltonians and compare them with the bottom of the essential spectrum, a lower bound on which was recently obtained by Brooks and Seiringer (Comm. Math. Phys. 404:1 (2023), 287–337). The upper bounds are given in terms of the ground state energy band shifted by momentum-independent excitation energies determined by an effective Hamiltonian of Bogoliubov type.","lang":"eng"}],"corr_author":"1","volume":5,"year":"2023","keyword":["General Medicine"],"external_id":{"arxiv":["2211.03606"]},"language":[{"iso":"eng"}],"oa_version":"Preprint"},{"fulldoi":"https://doi.org/10.1002/anie.202304138","day":"02","date_published":"2023-05-02T00:00:00Z","publication_status":"published","article_number":" e202304138","month":"05","author":[{"last_name":"Becker","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","first_name":"Lea Marie","orcid":"0000-0002-6401-5151","full_name":"Becker, Lea Marie"},{"first_name":"Mélanie","last_name":"Berbon","full_name":"Berbon, Mélanie"},{"full_name":"Vallet, Alicia","first_name":"Alicia","last_name":"Vallet"},{"first_name":"Axelle","last_name":"Grelard","full_name":"Grelard, Axelle"},{"full_name":"Morvan, Estelle","first_name":"Estelle","last_name":"Morvan"},{"full_name":"Bardiaux, Benjamin","last_name":"Bardiaux","first_name":"Benjamin"},{"first_name":"Roman","last_name":"Lichtenecker","full_name":"Lichtenecker, Roman"},{"last_name":"Ernst","first_name":"Matthias","full_name":"Ernst, Matthias"},{"full_name":"Loquet, Antoine","first_name":"Antoine","last_name":"Loquet"},{"full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","last_name":"Schanda"}],"date_created":"2024-01-22T11:54:34Z","type":"other_academic_publication","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/anie.202304138"}],"title":"Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues","publication":"Angewandte Chemie International Edition","citation":{"ieee":"L. M. Becker <i>et al.</i>, <i>Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues</i>, vol. 62, no. 19. Wiley, 2023.","ista":"Becker LM, Berbon M, Vallet A, Grelard A, Morvan E, Bardiaux B, Lichtenecker R, Ernst M, Loquet A, Schanda P. 2023. Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues, Wiley,p.","apa":"Becker, L. M., Berbon, M., Vallet, A., Grelard, A., Morvan, E., Bardiaux, B., … Schanda, P. (2023). <i>Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues</i>. <i>Angewandte Chemie International Edition</i> (Vol. 62). Wiley. <a href=\"https://doi.org/10.1002/anie.202304138\">https://doi.org/10.1002/anie.202304138</a>","ama":"Becker LM, Berbon M, Vallet A, et al. <i>Cover Picture: The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues</i>. Vol 62. Wiley; 2023. doi:<a href=\"https://doi.org/10.1002/anie.202304138\">10.1002/anie.202304138</a>","mla":"Becker, Lea Marie, et al. “Cover Picture: The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues.” <i>Angewandte Chemie International Edition</i>, vol. 62, no. 19, e202304138, Wiley, 2023, doi:<a href=\"https://doi.org/10.1002/anie.202304138\">10.1002/anie.202304138</a>.","short":"L.M. Becker, M. Berbon, A. Vallet, A. Grelard, E. Morvan, B. Bardiaux, R. Lichtenecker, M. Ernst, A. Loquet, P. Schanda, Cover Picture: The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues, Wiley, 2023.","chicago":"Becker, Lea Marie, Mélanie Berbon, Alicia Vallet, Axelle Grelard, Estelle Morvan, Benjamin Bardiaux, Roman Lichtenecker, Matthias Ernst, Antoine Loquet, and Paul Schanda. <i>Cover Picture: The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues</i>. <i>Angewandte Chemie International Edition</i>. Vol. 62. Wiley, 2023. <a href=\"https://doi.org/10.1002/anie.202304138\">https://doi.org/10.1002/anie.202304138</a>."},"publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"doi":"10.1002/anie.202304138","issue":"19","oa_version":"Published Version","language":[{"iso":"eng"}],"keyword":["General Chemistry","Catalysis"],"year":"2023","volume":62,"abstract":[{"lang":"eng","text":"Cover Page"}],"corr_author":"1","_id":"14861","related_material":{"record":[{"status":"public","id":"12675","relation":"other"}],"link":[{"url":"https://doi.org/10.1002/ange.202304138","relation":"translation"}]},"status":"public","date_updated":"2026-06-18T17:41:09Z","article_processing_charge":"No","department":[{"_id":"PaSc"}],"intvolume":"        62","publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"ddc":["540"]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Starting Grant (No. 949120).","ddc":["530"],"oa":1,"has_accepted_license":"1","publisher":"European Geosciences Union","_id":"14864","status":"public","date_updated":"2025-04-14T07:54:10Z","article_processing_charge":"No","department":[{"_id":"CaMu"},{"_id":"ScWa"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"conference":{"start_date":"2023-04-23","end_date":"2023-04-28","location":"Vienna, Austria & Virtual","name":"EGU General Assembly"},"year":"2023","project":[{"_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","grant_number":"949120","call_identifier":"H2020"}],"corr_author":"1","file":[{"date_created":"2024-01-23T13:00:26Z","date_updated":"2024-01-23T13:00:26Z","creator":"dernst","file_size":419736,"success":1,"file_name":"2023_EGU_Stoellner.pdf","checksum":"8d6ddbb359e584b156f991f00196d86b","content_type":"application/pdf","file_id":"14880","relation":"main_file","access_level":"open_access"}],"title":"Measuring spontaneous charging of single aerosol particles","publication":"EGU General Assembly 2023","citation":{"short":"A. Stöllner, I.C. Lenton, C.J. Muller, S.R. Waitukaitis, in:, EGU General Assembly 2023, European Geosciences Union, 2023.","chicago":"Stöllner, Andrea, Isaac C Lenton, Caroline J Muller, and Scott R Waitukaitis. “Measuring Spontaneous Charging of Single Aerosol Particles.” In <i>EGU General Assembly 2023</i>. European Geosciences Union, 2023. <a href=\"https://doi.org/10.5194/egusphere-egu23-6166\">https://doi.org/10.5194/egusphere-egu23-6166</a>.","ieee":"A. Stöllner, I. C. Lenton, C. J. Muller, and S. R. Waitukaitis, “Measuring spontaneous charging of single aerosol particles,” in <i>EGU General Assembly 2023</i>, Vienna, Austria &#38; Virtual, 2023.","mla":"Stöllner, Andrea, et al. “Measuring Spontaneous Charging of Single Aerosol Particles.” <i>EGU General Assembly 2023</i>, 6166, European Geosciences Union, 2023, doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-6166\">10.5194/egusphere-egu23-6166</a>.","ama":"Stöllner A, Lenton IC, Muller CJ, Waitukaitis SR. Measuring spontaneous charging of single aerosol particles. In: <i>EGU General Assembly 2023</i>. European Geosciences Union; 2023. doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-6166\">10.5194/egusphere-egu23-6166</a>","ista":"Stöllner A, Lenton IC, Muller CJ, Waitukaitis SR. 2023. Measuring spontaneous charging of single aerosol particles. EGU General Assembly 2023. EGU General Assembly, 6166.","apa":"Stöllner, A., Lenton, I. C., Muller, C. J., &#38; Waitukaitis, S. R. (2023). Measuring spontaneous charging of single aerosol particles. In <i>EGU General Assembly 2023</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu23-6166\">https://doi.org/10.5194/egusphere-egu23-6166</a>"},"doi":"10.5194/egusphere-egu23-6166","month":"04","article_number":"6166","author":[{"full_name":"Stöllner, Andrea","last_name":"Stöllner","id":"4bdcf7f6-eb97-11eb-a6c2-9981bbdc3bed","first_name":"Andrea","orcid":"0000-0002-0464-8440"},{"last_name":"Lenton","id":"a550210f-223c-11ec-8182-e2d45e817efb","first_name":"Isaac C","orcid":"0000-0002-5010-6984","full_name":"Lenton, Isaac C"},{"full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","first_name":"Caroline J","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2024-01-22T12:09:07Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"conference_abstract","ec_funded":1,"fulldoi":"https://doi.org/10.5194/egusphere-egu23-6166","day":"23","publication_status":"published","file_date_updated":"2024-01-23T13:00:26Z","date_published":"2023-04-23T00:00:00Z"},{"publication_status":"published","file_date_updated":"2024-02-05T08:48:41Z","date_published":"2023-04-23T00:00:00Z","day":"23","fulldoi":"https://doi.org/10.5194/egusphere-egu23-4968","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"conference_abstract","date_created":"2024-01-22T12:10:32Z","author":[{"last_name":"Hwong","id":"1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22","first_name":"Yi-Ling","orcid":"0000-0001-9281-3479","full_name":"Hwong, Yi-Ling"},{"full_name":"Colin, Maxime","last_name":"Colin","first_name":"Maxime"},{"full_name":"Aglas, Philipp","first_name":"Philipp","id":"02eace56-97fc-11ee-b81a-f0939ca85a77","last_name":"Aglas"},{"full_name":"Muller, Caroline J","first_name":"Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"full_name":"Sherwood, Steven","last_name":"Sherwood","first_name":"Steven"}],"article_number":"EGU23-4968","month":"04","doi":"10.5194/egusphere-egu23-4968","citation":{"short":"Y.-L. Hwong, M. Colin, P. Aglas, C.J. Muller, S. Sherwood, in:, EGU General Assembly 2023, European Geosciences Union, 2023.","chicago":"Hwong, Yi-Ling, Maxime Colin, Philipp Aglas, Caroline J Muller, and Steven Sherwood. “Evaluating Memory Properties in Convection Schemes Using Idealised Tests.” In <i>EGU General Assembly 2023</i>. European Geosciences Union, 2023. <a href=\"https://doi.org/10.5194/egusphere-egu23-4968\">https://doi.org/10.5194/egusphere-egu23-4968</a>.","ieee":"Y.-L. Hwong, M. Colin, P. Aglas, C. J. Muller, and S. Sherwood, “Evaluating memory properties in convection schemes using idealised tests,” in <i>EGU General Assembly 2023</i>, Vienna, Austria &#38; Virtual, 2023.","ama":"Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood S. Evaluating memory properties in convection schemes using idealised tests. In: <i>EGU General Assembly 2023</i>. European Geosciences Union; 2023. doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-4968\">10.5194/egusphere-egu23-4968</a>","apa":"Hwong, Y.-L., Colin, M., Aglas, P., Muller, C. J., &#38; Sherwood, S. (2023). Evaluating memory properties in convection schemes using idealised tests. In <i>EGU General Assembly 2023</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu23-4968\">https://doi.org/10.5194/egusphere-egu23-4968</a>","ista":"Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood S. 2023. Evaluating memory properties in convection schemes using idealised tests. EGU General Assembly 2023. EGU General Assembly, EGU23-4968.","mla":"Hwong, Yi-Ling, et al. “Evaluating Memory Properties in Convection Schemes Using Idealised Tests.” <i>EGU General Assembly 2023</i>, EGU23-4968, European Geosciences Union, 2023, doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-4968\">10.5194/egusphere-egu23-4968</a>."},"publication":"EGU General Assembly 2023","title":"Evaluating memory properties in convection schemes using idealised tests","file":[{"relation":"main_file","access_level":"open_access","checksum":"628a27caff437855ab320be46b9e8dcc","file_id":"14936","content_type":"application/pdf","file_name":"2023_EGU_Hwong.pdf","file_size":317541,"success":1,"date_created":"2024-02-05T08:48:41Z","date_updated":"2024-02-05T08:48:41Z","creator":"dernst"}],"corr_author":"1","year":"2023","conference":{"name":"EGU General Assembly","location":"Vienna, Austria & Virtual","start_date":"2023-04-23","end_date":"2023-04-28"},"language":[{"iso":"eng"}],"oa_version":"Published Version","department":[{"_id":"CaMu"}],"article_processing_charge":"No","status":"public","date_updated":"2024-10-09T21:08:04Z","_id":"14865","publisher":"European Geosciences Union","has_accepted_license":"1","oa":1,"ddc":["550"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"23","fulldoi":"https://doi.org/10.5194/egusphere-egu23-15870","publication_status":"published","date_published":"2023-04-23T00:00:00Z","file_date_updated":"2024-02-05T08:10:43Z","author":[{"full_name":"Abramian, Sophie","last_name":"Abramian","first_name":"Sophie"},{"orcid":"0000-0001-5836-5350","first_name":"Caroline J","last_name":"Muller","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J"},{"full_name":"Risi, Camille","first_name":"Camille","last_name":"Risi"}],"month":"04","article_number":"EGU23-15870","date_created":"2024-01-22T12:10:52Z","type":"conference_abstract","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"title":"Extreme precipitation in tropical squall lines","publication":"EGU General Assembly 2023","citation":{"ieee":"S. Abramian, C. J. Muller, and C. Risi, “Extreme precipitation in tropical squall lines,” in <i>EGU General Assembly 2023</i>, Vienna, Austria &#38; Virtual, 2023.","mla":"Abramian, Sophie, et al. “Extreme Precipitation in Tropical Squall Lines.” <i>EGU General Assembly 2023</i>, EGU23-15870, European Geosciences Union, 2023, doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-15870\">10.5194/egusphere-egu23-15870</a>.","apa":"Abramian, S., Muller, C. J., &#38; Risi, C. (2023). Extreme precipitation in tropical squall lines. In <i>EGU General Assembly 2023</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu23-15870\">https://doi.org/10.5194/egusphere-egu23-15870</a>","ista":"Abramian S, Muller CJ, Risi C. 2023. Extreme precipitation in tropical squall lines. EGU General Assembly 2023. EGU General Assembly, EGU23-15870.","ama":"Abramian S, Muller CJ, Risi C. Extreme precipitation in tropical squall lines. In: <i>EGU General Assembly 2023</i>. European Geosciences Union; 2023. doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-15870\">10.5194/egusphere-egu23-15870</a>","short":"S. Abramian, C.J. Muller, C. Risi, in:, EGU General Assembly 2023, European Geosciences Union, 2023.","chicago":"Abramian, Sophie, Caroline J Muller, and Camille Risi. “Extreme Precipitation in Tropical Squall Lines.” In <i>EGU General Assembly 2023</i>. European Geosciences Union, 2023. <a href=\"https://doi.org/10.5194/egusphere-egu23-15870\">https://doi.org/10.5194/egusphere-egu23-15870</a>."},"doi":"10.5194/egusphere-egu23-15870","language":[{"iso":"eng"}],"oa_version":"Published Version","year":"2023","conference":{"name":"EGU General Assembly","location":"Vienna, Austria & Virtual","end_date":"2023-04-28","start_date":"2023-04-23"},"file":[{"file_name":"2023_EGU_Abramian.pdf","file_size":294690,"success":1,"creator":"dernst","date_updated":"2024-02-05T08:10:43Z","date_created":"2024-02-05T08:10:43Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"14935","checksum":"8cd5bb8bf3d48ceefb395b6875819147"}],"corr_author":"1","_id":"14866","article_processing_charge":"No","date_updated":"2024-10-09T21:08:04Z","status":"public","department":[{"_id":"CaMu"}],"has_accepted_license":"1","publisher":"European Geosciences Union","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["550"],"oa":1},{"fulldoi":"https://doi.org/10.5817/cz.muni.eurocomb23-005","day":"01","date_published":"2023-09-01T00:00:00Z","publication_status":"published","file_date_updated":"2024-01-24T09:34:43Z","month":"09","author":[{"id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","last_name":"Anastos","first_name":"Michael","full_name":"Anastos, Michael"}],"date_created":"2024-01-22T12:20:15Z","type":"conference","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"ec_funded":1,"title":"Constructing Hamilton cycles and perfect matchings efficiently","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","publication":"Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications","arxiv":1,"publication_identifier":{"eissn":["2788-3116"]},"citation":{"ieee":"M. Anastos, “Constructing Hamilton cycles and perfect matchings efficiently,” in <i>Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications</i>, Prague, Czech Republic, 2023, pp. 36–41.","mla":"Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.” <i>Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications</i>, Masaryk University Press, 2023, pp. 36–41, doi:<a href=\"https://doi.org/10.5817/cz.muni.eurocomb23-005\">10.5817/cz.muni.eurocomb23-005</a>.","ista":"Anastos M. 2023. Constructing Hamilton cycles and perfect matchings efficiently. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. EUROCOMB: European Conference on Combinatorics, Graph Theory and Applications, 36–41.","ama":"Anastos M. Constructing Hamilton cycles and perfect matchings efficiently. In: <i>Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications</i>. Masaryk University Press; 2023:36-41. doi:<a href=\"https://doi.org/10.5817/cz.muni.eurocomb23-005\">10.5817/cz.muni.eurocomb23-005</a>","apa":"Anastos, M. (2023). Constructing Hamilton cycles and perfect matchings efficiently. In <i>Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications</i> (pp. 36–41). Prague, Czech Republic: Masaryk University Press. <a href=\"https://doi.org/10.5817/cz.muni.eurocomb23-005\">https://doi.org/10.5817/cz.muni.eurocomb23-005</a>","short":"M. Anastos, in:, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, Masaryk University Press, 2023, pp. 36–41.","chicago":"Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.” In <i>Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications</i>, 36–41. Masaryk University Press, 2023. <a href=\"https://doi.org/10.5817/cz.muni.eurocomb23-005\">https://doi.org/10.5817/cz.muni.eurocomb23-005</a>."},"doi":"10.5817/cz.muni.eurocomb23-005","quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"conference":{"name":"EUROCOMB: European Conference on Combinatorics, Graph Theory and Applications","location":"Prague, Czech Republic","start_date":"2023-08-28","end_date":"2023-09-01"},"external_id":{"isi":["001448447300005"],"arxiv":["2209.09860"]},"year":"2023","isi":1,"project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"corr_author":"1","abstract":[{"lang":"eng","text":"<jats:p>Starting with the empty graph on $[n]$, at each round, a set of $K=K(n)$ edges is presented chosen uniformly at random from the ones that have not been presented yet. We are then asked to choose at most one of the presented edges and add it to the current graph. Our goal is to construct a Hamiltonian graph with $(1+o(1))n$ edges within as few rounds as possible. We show that in this process, one can build a Hamiltonian graph of size $(1+o(1))n$ in $(1+o(1))(1+(\\log n)/2K) n$ rounds w.h.p. The case $K=1$ implies that w.h.p. one can build a Hamiltonian graph by choosing $(1+o(1))n$ edges in an online fashion as they appear along the first $(0.5+o(1))n\\log n$ rounds of the random graph process. This answers a question of Frieze, Krivelevich and Michaeli. Observe that the number of rounds is asymptotically optimal as the first $0.5n\\log n$ edges do not span a Hamilton cycle w.h.p. The case $K=\\Theta(\\log n)$ implies that the Hamiltonicity threshold of the corresponding Achlioptas process is at most $(1+o(1))(1+(\\log n)/2K) n$. This matches the $(1-o(1))(1+(\\log n)/2K) n$ lower bound due to Krivelevich, Lubetzky and Sudakov and resolves the problem of determining the Hamiltonicity threshold of the Achlioptas process with $K=\\Theta(\\log n)$. We also show that in the above process one can construct a graph $G$ that spans a matching of size $\\lfloor V(G)/2) \\rfloor$ and $(0.5+o(1))n$ edges within $(1+o(1))(0.5+(\\log n)/2K) n$ rounds w.h.p. Our proof relies on a robust Hamiltonicity property of the strong $4$-core of the binomial random graph which we use as a black-box. This property allows it to absorb paths covering vertices outside the strong $4$-core into a cycle.</jats:p>"}],"file":[{"date_created":"2024-01-24T09:34:43Z","date_updated":"2024-01-24T09:34:43Z","creator":"dernst","file_size":464230,"success":1,"file_name":"2023_Eurocomb_Anastos.pdf","checksum":"fb1d9a1e7389d90ec0e5e76934373cf8","content_type":"application/pdf","file_id":"14881","relation":"main_file","access_level":"open_access"}],"_id":"14867","page":"36-41","status":"public","date_updated":"2025-09-09T14:24:21Z","article_processing_charge":"No","department":[{"_id":"MaKw"}],"publisher":"Masaryk University Press","has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413.\r\n","oa":1,"ddc":["510"]},{"oa":1,"acknowledgement":"This work was supported by M.H.’s NIH R01 grants (NS096786, GM126829) and Salk Cancer Center Support Grant P30 CA014195. M.H. also received financial support from the W.M. Keck Foundation and the NOMIS Foundation. Further, M.H. received support from the AHA-Allen Initiative in Brain Health and Cognitive Impairment award made jointly through the American Heart Association and The Paul G. Allen Frontiers Group (19PABH134610000).\r\n\r\nS.T. and J.C. were supported by Salk’s Women & Science Awards. S.T. also received financial support from the Hewitt Foundation fellowship, and J.C. is a Paul F. Glenn Biology of Aging fellow. J.H. was supported by the National Natural Science Foundation of China (31871317 and 32070635).\r\n\r\nWe thank Roberta Schulte for assistance with in vitro transport assays, for comments that greatly improved the manuscript, and for helping refine the figures presented in this work. We thank Shefali Krishna for creating the diagram for the NPC-DamID method, for her input on super-resolution microscopy analysis, and her insightful comments on this manuscript. We thank all members of the Hetzer lab for helpful discussions of these research ideas and their thoughtful comments on this manuscript. We are also grateful to Salk’s core facilities for their assistance. Specifically, we thank the Next Generation Sequencing Core (NGS) for sequencing our DamID and RNA NGS libraries, the Advanced Biophotonics Core for assistance with super-resolution microscopy, and the Razavi Newman Integrative Genomics and Bioinformatics Core (IGC) for their input on analysis methods for DamID experiments.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.7554/elife.87462","citation":{"ieee":"S. Tyagi <i>et al.</i>, “High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope,” <i>eLife</i>. eLife Sciences Publications, 2023.","mla":"Tyagi, Swati, et al. “High-Precision Mapping of Nuclear Pore-Chromatin Interactions Reveals New Principles of Genome Organization at the Nuclear Envelope.” <i>ELife</i>, eLife Sciences Publications, 2023, doi:<a href=\"https://doi.org/10.7554/elife.87462\">10.7554/elife.87462</a>.","ama":"Tyagi S, Capitanio JS, Xu J, et al. High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope. <i>eLife</i>. 2023. doi:<a href=\"https://doi.org/10.7554/elife.87462\">10.7554/elife.87462</a>","ista":"Tyagi S, Capitanio JS, Xu J, Chen F, Sharma R, Huang J, Hetzer M. 2023. High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope. eLife.","apa":"Tyagi, S., Capitanio, J. S., Xu, J., Chen, F., Sharma, R., Huang, J., &#38; Hetzer, M. (2023). High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.87462\">https://doi.org/10.7554/elife.87462</a>","short":"S. Tyagi, J.S. Capitanio, J. Xu, F. Chen, R. Sharma, J. Huang, M. Hetzer, ELife (2023).","chicago":"Tyagi, Swati, Juliana S. Capitanio, Jiawei Xu, Fei Chen, Rahul Sharma, Jialiang Huang, and Martin Hetzer. “High-Precision Mapping of Nuclear Pore-Chromatin Interactions Reveals New Principles of Genome Organization at the Nuclear Envelope.” <i>ELife</i>. eLife Sciences Publications, 2023. <a href=\"https://doi.org/10.7554/elife.87462\">https://doi.org/10.7554/elife.87462</a>."},"publication":"eLife","publisher":"eLife Sciences Publications","title":"High-precision mapping of nuclear pore-chromatin interactions reveals new principles of genome organization at the nuclear envelope","main_file_link":[{"open_access":"1","url":"https://doi.org/10.7554/eLife.87462.1"}],"type":"journal_article","department":[{"_id":"MaHe"}],"article_processing_charge":"Yes","date_updated":"2024-07-31T11:56:25Z","date_created":"2024-01-22T12:21:56Z","status":"public","author":[{"full_name":"Tyagi, Swati","last_name":"Tyagi","first_name":"Swati"},{"last_name":"Capitanio","first_name":"Juliana S.","full_name":"Capitanio, Juliana S."},{"last_name":"Xu","first_name":"Jiawei","full_name":"Xu, Jiawei"},{"full_name":"Chen, Fei","last_name":"Chen","first_name":"Fei"},{"first_name":"Rahul","last_name":"Sharma","full_name":"Sharma, Rahul"},{"full_name":"Huang, Jialiang","last_name":"Huang","first_name":"Jialiang"},{"last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X","first_name":"Martin W","full_name":"HETZER, Martin W"}],"month":"06","_id":"14868","publication_status":"epub_ahead","article_type":"original","date_published":"2023-06-23T00:00:00Z","corr_author":"1","abstract":[{"text":"The role of nuclear pore complexes (NPCs) in genome organization remains poorly characterized due to technical limitations in probing genome-wide protein-DNA interactions specific to the nuclear periphery. Here, we developed a new sensitive method, NPC-DamID, which combines in vitro reconstitution of nuclear import and DamID technology. The fixation-free method identifies chromatin interactions at the NPCs in intact nuclei from cells and tissues. We found that NPCs are preferentially associated with common and hierarchically arranged super-enhancers (SEs) across multiple cell types. We also uncovered phase-separated condensates at NPCs that compartmentalize and concentrate transcriptional coactivators and structural proteins at SE-regulated genes. Our results support NPCs as anchoring sites for SE regulatory hubs and cell-type-specific transcriptional control.","lang":"eng"}],"day":"23","fulldoi":"https://doi.org/10.7554/elife.87462","year":"2023","language":[{"iso":"eng"}],"oa_version":"Submitted Version"},{"year":"2023","conference":{"name":"Laser Science","location":"Tacoma, WA, United States","end_date":"2023-10-12","start_date":"2023-10-09"},"language":[{"iso":"eng"}],"oa_version":"None","date_published":"2023-10-01T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"We entangled microwave and optical photons for the first time as verified by a measured two-mode vacuum squeezing of 0.7 dB. This electro-optic entanglement is the key resource needed to connect cryogenic quantum circuits."}],"corr_author":"1","day":"01","fulldoi":"https://doi.org/10.1364/ls.2023.lm1f.3","article_processing_charge":"No","date_updated":"2024-10-09T21:07:59Z","date_created":"2024-01-22T12:29:41Z","status":"public","author":[{"full_name":"Sahu, Rishabh","first_name":"Rishabh","orcid":"0000-0001-6264-2162","last_name":"Sahu","id":"47D26E34-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Qiu, Liu","first_name":"Liu","last_name":"Qiu"},{"first_name":"William J","orcid":"0000-0001-9868-2166","id":"29705398-F248-11E8-B48F-1D18A9856A87","last_name":"Hease","full_name":"Hease, William J"},{"orcid":"0000-0003-1397-7876","first_name":"Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87","last_name":"Arnold","full_name":"Arnold, Georg M"},{"last_name":"Minoguchi","first_name":"Yuri","full_name":"Minoguchi, Yuri"},{"last_name":"Rabl","first_name":"Peter","full_name":"Rabl, Peter"},{"last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","first_name":"Johannes M","full_name":"Fink, Johannes M"}],"_id":"14872","article_number":"LM1F.3","month":"10","type":"conference","department":[{"_id":"JoFi"}],"publication":"Frontiers in Optics + Laser Science 2023","title":"Entangling microwaves and telecom wavelength light","publisher":"Optica Publishing Group","doi":"10.1364/ls.2023.lm1f.3","citation":{"ieee":"R. Sahu <i>et al.</i>, “Entangling microwaves and telecom wavelength light,” in <i>Frontiers in Optics + Laser Science 2023</i>, Tacoma, WA, United States, 2023.","ista":"Sahu R, Qiu L, Hease WJ, Arnold GM, Minoguchi Y, Rabl P, Fink JM. 2023. Entangling microwaves and telecom wavelength light. Frontiers in Optics + Laser Science 2023. Laser Science, LM1F.3.","apa":"Sahu, R., Qiu, L., Hease, W. J., Arnold, G. M., Minoguchi, Y., Rabl, P., &#38; Fink, J. M. (2023). Entangling microwaves and telecom wavelength light. In <i>Frontiers in Optics + Laser Science 2023</i>. Tacoma, WA, United States: Optica Publishing Group. <a href=\"https://doi.org/10.1364/ls.2023.lm1f.3\">https://doi.org/10.1364/ls.2023.lm1f.3</a>","ama":"Sahu R, Qiu L, Hease WJ, et al. Entangling microwaves and telecom wavelength light. In: <i>Frontiers in Optics + Laser Science 2023</i>. Optica Publishing Group; 2023. doi:<a href=\"https://doi.org/10.1364/ls.2023.lm1f.3\">10.1364/ls.2023.lm1f.3</a>","mla":"Sahu, Rishabh, et al. “Entangling Microwaves and Telecom Wavelength Light.” <i>Frontiers in Optics + Laser Science 2023</i>, LM1F.3, Optica Publishing Group, 2023, doi:<a href=\"https://doi.org/10.1364/ls.2023.lm1f.3\">10.1364/ls.2023.lm1f.3</a>.","short":"R. Sahu, L. Qiu, W.J. Hease, G.M. Arnold, Y. Minoguchi, P. Rabl, J.M. Fink, in:, Frontiers in Optics + Laser Science 2023, Optica Publishing Group, 2023.","chicago":"Sahu, Rishabh, Liu Qiu, William J Hease, Georg M Arnold, Yuri Minoguchi, Peter Rabl, and Johannes M Fink. “Entangling Microwaves and Telecom Wavelength Light.” In <i>Frontiers in Optics + Laser Science 2023</i>. Optica Publishing Group, 2023. <a href=\"https://doi.org/10.1364/ls.2023.lm1f.3\">https://doi.org/10.1364/ls.2023.lm1f.3</a>."},"publication_identifier":{"isbn":["9781957171296"]},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","arxiv":1,"publication_identifier":{"issn":["2751-4838"]},"citation":{"short":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, TheoretiCS 2 (2023).","chicago":"Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.” <i>TheoretiCS</i>. EPI Sciences, 2023. <a href=\"https://doi.org/10.46298/theoretics.23.4\">https://doi.org/10.46298/theoretics.23.4</a>.","ieee":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “Fast symbolic algorithms for mega-regular games under strong transition fairness,” <i>TheoretiCS</i>, vol. 2. EPI Sciences, 2023.","mla":"Banerjee, Tamajit, et al. “Fast Symbolic Algorithms for Mega-Regular Games under Strong Transition Fairness.” <i>TheoretiCS</i>, vol. 2, 4, EPI Sciences, 2023, doi:<a href=\"https://doi.org/10.46298/theoretics.23.4\">10.46298/theoretics.23.4</a>.","apa":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., &#38; Soudjani, S. (2023). Fast symbolic algorithms for mega-regular games under strong transition fairness. <i>TheoretiCS</i>. EPI Sciences. <a href=\"https://doi.org/10.46298/theoretics.23.4\">https://doi.org/10.46298/theoretics.23.4</a>","ama":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. Fast symbolic algorithms for mega-regular games under strong transition fairness. <i>TheoretiCS</i>. 2023;2. doi:<a href=\"https://doi.org/10.46298/theoretics.23.4\">10.46298/theoretics.23.4</a>","ista":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2023. Fast symbolic algorithms for mega-regular games under strong transition fairness. TheoretiCS. 2, 4."},"doi":"10.46298/theoretics.23.4","title":"Fast symbolic algorithms for mega-regular games under strong transition fairness","publication":"TheoretiCS","type":"journal_article","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"ec_funded":1,"article_number":"4","month":"02","author":[{"last_name":"Banerjee","first_name":"Tamajit","full_name":"Banerjee, Tamajit"},{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"},{"full_name":"Mallik, Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","orcid":"0000-0001-9864-7475","first_name":"Kaushik"},{"first_name":"Anne-Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin"},{"first_name":"Sadegh","last_name":"Soudjani","full_name":"Soudjani, Sadegh"}],"date_created":"2024-01-31T13:40:49Z","fulldoi":"https://doi.org/10.46298/theoretics.23.4","day":"24","article_type":"original","date_published":"2023-02-24T00:00:00Z","file_date_updated":"2024-02-05T10:19:35Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"A previous version of this paper has appeared in TACAS 2022. Authors ordered alphabetically. T. Banerjee was interning with MPI-SWS when this research was conducted. R. Majumdar and A.-K. Schmuck are partially supported by DFG project 389792660 TRR 248–CPEC. A.-K. Schmuck is additionally funded through DFG project (SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093.","ddc":["000"],"oa":1,"has_accepted_license":"1","publisher":"EPI Sciences","department":[{"_id":"ToHe"}],"intvolume":"         2","_id":"14920","status":"public","date_updated":"2025-04-14T07:55:57Z","article_processing_charge":"Yes","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"abstract":[{"lang":"eng","text":"We consider fixpoint algorithms for two-player games on graphs with $\\omega$-regular winning conditions, where the environment is constrained by a strong transition fairness assumption. Strong transition fairness is a widely occurring special case of strong fairness, which requires that any execution is strongly fair with respect to a specified set of live edges: whenever the\r\nsource vertex of a live edge is visited infinitely often along a play, the edge itself is traversed infinitely often along the play as well. We show that, surprisingly, strong transition fairness retains the algorithmic characteristics of the fixpoint algorithms for $\\omega$-regular games -- the new algorithms have the same alternation depth as the classical algorithms but invoke a new type of predecessor operator. For Rabin games with $k$ pairs, the complexity of the new algorithm is $O(n^{k+2}k!)$ symbolic steps, which is independent of the number of live edges in the strong transition fairness assumption. Further, we show that GR(1) specifications with strong transition fairness assumptions can be solved with a 3-nested fixpoint algorithm, same as the usual algorithm. In contrast, strong fairness necessarily requires increasing the alternation depth depending on the number of fairness assumptions. We get symbolic algorithms for (generalized) Rabin, parity and GR(1) objectives under strong transition fairness assumptions as well as a direct symbolic algorithm for qualitative winning in stochastic\r\n$\\omega$-regular games that runs in $O(n^{k+2}k!)$ symbolic steps, improving the state of the art. Finally, we have implemented a BDD-based synthesis engine based on our algorithm. We show on a set of synthetic and real benchmarks that our algorithm is scalable, parallelizable, and outperforms previous algorithms by orders of magnitude."}],"corr_author":"1","file":[{"checksum":"2972d531122a6f15727b396110fb3f5c","file_id":"14940","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_created":"2024-02-05T10:19:35Z","date_updated":"2024-02-05T10:19:35Z","creator":"dernst","file_name":"2023_TheoretiCS_Banerjee.pdf","file_size":917076,"success":1}],"oa_version":"Published Version","language":[{"iso":"eng"}],"external_id":{"arxiv":["2202.07480"]},"year":"2023","volume":2},{"article_processing_charge":"No","status":"public","date_updated":"2025-07-10T11:51:04Z","page":"1178-1183","_id":"14923","department":[{"_id":"MaMo"}],"year":"2023","conference":{"end_date":"2023-06-30","start_date":"2023-06-25","location":"Taipei, Taiwan","name":"ISIT: International Symposium on Information Theory"},"external_id":{"arxiv":["2302.03306"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","abstract":[{"text":"We study the performance of a Bayesian statistician who estimates a rank-one signal corrupted by non-symmetric rotationally invariant noise with a generic distribution of singular values. As the signal-to-noise ratio and the noise structure are unknown, a Gaussian setup is incorrectly assumed. We derive the exact analytic expression for the error of the mismatched Bayes estimator and also provide the analysis of an approximate message passing (AMP) algorithm. The first result exploits the asymptotic behavior of spherical integrals for rectangular matrices and of low-rank matrix perturbations; the second one relies on the design and analysis of an auxiliary AMP. The numerical experiments show that there is a performance gap between the AMP and Bayes estimators, which is due to the incorrect estimation of the signal norm.","lang":"eng"}],"corr_author":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","date_created":"2024-02-02T11:20:39Z","author":[{"full_name":"Fu, Teng","first_name":"Teng","last_name":"Fu"},{"first_name":"YuHao","last_name":"Liu","full_name":"Liu, YuHao"},{"full_name":"Barbier, Jean","last_name":"Barbier","first_name":"Jean"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","orcid":"0000-0002-3242-7020","first_name":"Marco","full_name":"Mondelli, Marco"},{"first_name":"ShanSuo","last_name":"Liang","full_name":"Liang, ShanSuo"},{"last_name":"Hou","first_name":"TianQi","full_name":"Hou, TianQi"}],"month":"06","type":"conference","publication_status":"published","date_published":"2023-06-30T00:00:00Z","scopus_import":"1","day":"30","fulldoi":"https://doi.org/10.1109/isit54713.2023.10206671","quality_controlled":"1","publication":"Proceedings of 2023 IEEE International Symposium on Information Theory","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.03306","open_access":"1"}],"title":"Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise","doi":"10.1109/isit54713.2023.10206671","publication_identifier":{"eissn":["2157-8117"],"isbn":["9781665475549"]},"citation":{"short":"T. Fu, Y. Liu, J. Barbier, M. Mondelli, S. Liang, T. Hou, in:, Proceedings of 2023 IEEE International Symposium on Information Theory, IEEE, 2023, pp. 1178–1183.","chicago":"Fu, Teng, YuHao Liu, Jean Barbier, Marco Mondelli, ShanSuo Liang, and TianQi Hou. “Mismatched Estimation of Non-Symmetric Rank-One Matrices Corrupted by Structured Noise.” In <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, 1178–83. IEEE, 2023. <a href=\"https://doi.org/10.1109/isit54713.2023.10206671\">https://doi.org/10.1109/isit54713.2023.10206671</a>.","ieee":"T. Fu, Y. Liu, J. Barbier, M. Mondelli, S. Liang, and T. Hou, “Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise,” in <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, Taipei, Taiwan, 2023, pp. 1178–1183.","mla":"Fu, Teng, et al. “Mismatched Estimation of Non-Symmetric Rank-One Matrices Corrupted by Structured Noise.” <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>, IEEE, 2023, pp. 1178–83, doi:<a href=\"https://doi.org/10.1109/isit54713.2023.10206671\">10.1109/isit54713.2023.10206671</a>.","apa":"Fu, T., Liu, Y., Barbier, J., Mondelli, M., Liang, S., &#38; Hou, T. (2023). Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. In <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i> (pp. 1178–1183). Taipei, Taiwan: IEEE. <a href=\"https://doi.org/10.1109/isit54713.2023.10206671\">https://doi.org/10.1109/isit54713.2023.10206671</a>","ama":"Fu T, Liu Y, Barbier J, Mondelli M, Liang S, Hou T. Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. In: <i>Proceedings of 2023 IEEE International Symposium on Information Theory</i>. IEEE; 2023:1178-1183. doi:<a href=\"https://doi.org/10.1109/isit54713.2023.10206671\">10.1109/isit54713.2023.10206671</a>","ista":"Fu T, Liu Y, Barbier J, Mondelli M, Liang S, Hou T. 2023. Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. Proceedings of 2023 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 1178–1183."},"arxiv":1},{"quality_controlled":"1","citation":{"mla":"Wu, Diyuan, et al. “Mean-Field Analysis for Heavy Ball Methods: Dropout-Stability, Connectivity, and Global Convergence.” <i>Transactions on Machine Learning Research</i>, ML Research Press, 2023.","ista":"Wu D, Kungurtsev V, Mondelli M. 2023. Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. Transactions on Machine Learning Research. , TMLR, .","apa":"Wu, D., Kungurtsev, V., &#38; Mondelli, M. (2023). Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. In <i>Transactions on Machine Learning Research</i>. ML Research Press.","ama":"Wu D, Kungurtsev V, Mondelli M. Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence. In: <i>Transactions on Machine Learning Research</i>. ML Research Press; 2023.","ieee":"D. Wu, V. Kungurtsev, and M. Mondelli, “Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence,” in <i>Transactions on Machine Learning Research</i>, 2023.","chicago":"Wu, Diyuan, Vyacheslav Kungurtsev, and Marco Mondelli. “Mean-Field Analysis for Heavy Ball Methods: Dropout-Stability, Connectivity, and Global Convergence.” In <i>Transactions on Machine Learning Research</i>. ML Research Press, 2023.","short":"D. Wu, V. Kungurtsev, M. Mondelli, in:, Transactions on Machine Learning Research, ML Research Press, 2023."},"arxiv":1,"title":"Mean-field analysis for heavy ball methods: Dropout-stability, connectivity, and global convergence","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2210.06819","open_access":"1"}],"publication":"Transactions on Machine Learning Research","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"conference","author":[{"full_name":"Wu, Diyuan","id":"1a5914c2-896a-11ed-bdf8-fb80621a0635","last_name":"Wu","first_name":"Diyuan"},{"full_name":"Kungurtsev, Vyacheslav","last_name":"Kungurtsev","first_name":"Vyacheslav"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"}],"month":"02","date_created":"2024-02-02T11:21:56Z","day":"28","publication_status":"published","date_published":"2023-02-28T00:00:00Z","acknowledgement":"D. Wu and M. Mondelli are partially supported by the 2019 Lopez-Loreta Prize. V. Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16_019/0000765 \"Research Center for Informatics\".","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"ddc":["000"],"has_accepted_license":"1","publisher":"ML Research Press","alternative_title":["TMLR"],"department":[{"_id":"MaMo"}],"_id":"14924","article_processing_charge":"No","date_updated":"2026-06-18T17:41:36Z","status":"public","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"corr_author":"1","abstract":[{"lang":"eng","text":"The stochastic heavy ball method (SHB), also known as stochastic gradient descent (SGD) with Polyak's momentum, is widely used in training neural networks. However, despite the remarkable success of such algorithm in practice, its theoretical characterization remains limited. In this paper, we focus on neural networks with two and three layers and provide a rigorous understanding of the properties of the solutions found by SHB: \\emph{(i)} stability after dropping out part of the neurons, \\emph{(ii)} connectivity along a low-loss path, and \\emph{(iii)} convergence to the global optimum.\r\nTo achieve this goal, we take a mean-field view and relate the SHB dynamics to a certain partial differential equation in the limit of large network widths. This mean-field perspective has inspired a recent line of work focusing on SGD while, in contrast, our paper considers an algorithm with momentum. More specifically, after proving existence and uniqueness of the limit differential equations, we show convergence to the global optimum and give a quantitative bound between the mean-field limit and the SHB dynamics of a finite-width network. Armed with this last bound, we are able to establish the dropout-stability and connectivity of SHB solutions."}],"language":[{"iso":"eng"}],"oa_version":"Published Version","year":"2023","external_id":{"arxiv":["2210.06819"]}},{"department":[{"_id":"FrLo"}],"_id":"14949","status":"public","date_updated":"2024-02-12T08:30:21Z","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Many approaches have been proposed to use diffusion models to augment training datasets for downstream tasks, such as classification. However, diffusion models are themselves trained on large datasets, often with noisy annotations, and it remains an open question to which extent these models contribute to downstream classification performance. In particular, it remains unclear if they generalize enough to improve over directly using the additional data of their pre-training process for augmentation. We systematically evaluate a range of existing methods to generate images from diffusion models and study new extensions to assess their benefit for data augmentation. Personalizing diffusion models towards the target data outperforms simpler prompting strategies. However, using the pre-training data of the diffusion model alone, via a simple nearest-neighbor retrieval procedure, leads to even stronger downstream performance. Our study explores the potential of diffusion models in generating new training data, and surprisingly finds that these sophisticated models are not yet able to beat a simple and strong image retrieval baseline on simple downstream vision tasks."}],"file":[{"creator":"ptazenko","date_updated":"2024-02-07T14:57:32Z","date_created":"2024-02-07T14:57:32Z","file_size":27325153,"file_name":"Burg_et_al_2023_Image_retrieval_outperforms.pdf","file_id":"14950","content_type":"application/pdf","checksum":"af87ddea7908923426365347b9c87ba7","access_level":"open_access","relation":"main_file"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors would like to thank Varad Gunjal and Vishaal Udandarao. MFB thanks the International Max Planck Research School for Intelligent Systems (IMPRS-IS).","oa":1,"ddc":["000"],"publisher":"ML Research Press","has_accepted_license":"1","alternative_title":["TMLR"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"journal_article","month":"12","author":[{"first_name":"Max","last_name":"Burg","full_name":"Burg, Max"},{"full_name":"Wenzel, Florian","first_name":"Florian","last_name":"Wenzel"},{"full_name":"Zietlow, Dominik","last_name":"Zietlow","first_name":"Dominik"},{"first_name":"Max","last_name":"Horn","full_name":"Horn, Max"},{"first_name":"Osama","last_name":"Makansi","full_name":"Makansi, Osama"},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Russell, Chris","first_name":"Chris","last_name":"Russell"}],"date_created":"2024-02-07T14:57:39Z","day":"10","publication_status":"published","date_published":"2023-12-10T00:00:00Z","article_type":"original","file_date_updated":"2024-02-07T14:57:32Z","quality_controlled":"1","publication_identifier":{"eissn":["2835-8856"]},"citation":{"ista":"Burg M, Wenzel F, Zietlow D, Horn M, Makansi O, Locatello F, Russell C. 2023. Image retrieval outperforms diffusion models on data augmentation. Journal of Machine Learning Research.","ama":"Burg M, Wenzel F, Zietlow D, et al. Image retrieval outperforms diffusion models on data augmentation. <i>Journal of Machine Learning Research</i>. 2023.","apa":"Burg, M., Wenzel, F., Zietlow, D., Horn, M., Makansi, O., Locatello, F., &#38; Russell, C. (2023). Image retrieval outperforms diffusion models on data augmentation. <i>Journal of Machine Learning Research</i>. ML Research Press.","mla":"Burg, Max, et al. “Image Retrieval Outperforms Diffusion Models on Data Augmentation.” <i>Journal of Machine Learning Research</i>, ML Research Press, 2023.","ieee":"M. Burg <i>et al.</i>, “Image retrieval outperforms diffusion models on data augmentation,” <i>Journal of Machine Learning Research</i>. ML Research Press, 2023.","chicago":"Burg, Max, Florian Wenzel, Dominik Zietlow, Max Horn, Osama Makansi, Francesco Locatello, and Chris Russell. “Image Retrieval Outperforms Diffusion Models on Data Augmentation.” <i>Journal of Machine Learning Research</i>. ML Research Press, 2023.","short":"M. Burg, F. Wenzel, D. Zietlow, M. Horn, O. Makansi, F. Locatello, C. Russell, Journal of Machine Learning Research (2023)."},"title":"Image retrieval outperforms diffusion models on data augmentation","main_file_link":[{"url":"https://openreview.net/forum?id=xflYdGZMpv","open_access":"1"}],"publication":"Journal of Machine Learning Research"},{"citation":{"ama":"Xu D, Yao D, Lachapelle S, et al. A sparsity principle for partially observable causal representation learning. In: <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. OpenReview; 2023.","ista":"Xu D, Yao D, Lachapelle S, Taslakian P, von Kügelgen J, Locatello F, Magliacane S. 2023. A sparsity principle for partially observable causal representation learning. Causal Representation Learning Workshop at NeurIPS 2023. CRL: Causal Representation Learning Workshop at NeurIPS, 54.","apa":"Xu, D., Yao, D., Lachapelle, S., Taslakian, P., von Kügelgen, J., Locatello, F., &#38; Magliacane, S. (2023). A sparsity principle for partially observable causal representation learning. In <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. New Orleans, LA, United States: OpenReview.","mla":"Xu, Danru, et al. “A Sparsity Principle for Partially Observable Causal Representation Learning.” <i>Causal Representation Learning Workshop at NeurIPS 2023</i>, 54, OpenReview, 2023.","ieee":"D. Xu <i>et al.</i>, “A sparsity principle for partially observable causal representation learning,” in <i>Causal Representation Learning Workshop at NeurIPS 2023</i>, New Orleans, LA, United States, 2023.","chicago":"Xu, Danru, Dingling Yao, Sebastien Lachapelle, Perouz Taslakian, Julius von Kügelgen, Francesco Locatello, and Sara Magliacane. “A Sparsity Principle for Partially Observable Causal Representation Learning.” In <i>Causal Representation Learning Workshop at NeurIPS 2023</i>. OpenReview, 2023.","short":"D. Xu, D. Yao, S. Lachapelle, P. Taslakian, J. von Kügelgen, F. Locatello, S. Magliacane, in:, Causal Representation Learning Workshop at NeurIPS 2023, OpenReview, 2023."},"title":"A sparsity principle for partially observable causal representation learning","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Whr6uobelR"}],"publication":"Causal Representation Learning Workshop at NeurIPS 2023","quality_controlled":"1","day":"05","OA_type":"green","publication_status":"published","file_date_updated":"2024-02-13T08:50:53Z","date_published":"2023-12-05T00:00:00Z","OA_place":"repository","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"type":"conference","month":"12","article_number":"54","author":[{"first_name":"Danru","last_name":"Xu","full_name":"Xu, Danru"},{"last_name":"Yao","id":"d3e02e50-48a8-11ee-8f62-c108061797fa","first_name":"Dingling","full_name":"Yao, Dingling"},{"first_name":"Sebastien","last_name":"Lachapelle","full_name":"Lachapelle, Sebastien"},{"first_name":"Perouz","last_name":"Taslakian","full_name":"Taslakian, Perouz"},{"last_name":"von Kügelgen","first_name":"Julius","full_name":"von Kügelgen, Julius"},{"orcid":"0000-0002-4850-0683","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco"},{"full_name":"Magliacane, Sara","last_name":"Magliacane","first_name":"Sara"}],"date_created":"2024-02-07T15:17:51Z","publisher":"OpenReview","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was initiated at the Second Bellairs Workshop on Causality held at the Bellairs Research Institute, January 6–13, 2022; we thank all workshop participants for providing a stimulating research environment. The research of DX and SM was supported by the Air Force Office of Scientific Research under award number FA8655-22-1-7155. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the United States Air Force. We also thank SURF for the support in using the Dutch National Supercomputer Snellius. DY was supported by an Amazon fellowship and the International Max Planck Research School for Intelligent Systems (IMPRS-IS). Work done outside of Amazon. SL was supported by an IVADO excellence PhD scholarship and by Samsung Electronics Co., Ldt. JvK acknowledges support from the German Federal Ministry of Education and Research (BMBF)\r\nthrough the Tübingen AI Center (FKZ: 01IS18039B).\r\n","oa":1,"ddc":["000"],"abstract":[{"lang":"eng","text":"Causal representation learning (CRL) aims at identifying high-level causal variables from low-level data, e.g. images. Current methods usually assume that all causal variables are captured in the high-dimensional observations. In this work, we focus on learning causal representations from data under partial observability, i.e., when some of the causal variables are not observed in the measurements, and the set of masked variables changes across the different samples. We introduce some initial theoretical results for identifying causal variables under partial observability by exploiting a sparsity regularizer, focusing in particular on the linear and piecewise linear mixing function case. We provide a theorem that allows us to identify the causal variables up to permutation and element-wise linear transformations in the linear case and a lemma that allows us to identify causal variables up to linear transformation in the piecewise case. Finally, we provide a conjecture that would allow us to identify the causal variables up to permutation and element-wise linear transformations also in the piecewise linear case. We test the theorem and conjecture on simulated data, showing the effectiveness of our method."}],"file":[{"success":1,"file_name":"2023_CRL_Xu.pdf","file_size":552357,"date_updated":"2024-02-13T08:50:53Z","date_created":"2024-02-13T08:50:53Z","creator":"dernst","relation":"main_file","access_level":"open_access","checksum":"484efc27bda75ed6666044989695d9b6","content_type":"application/pdf","file_id":"14982"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"conference":{"location":"New Orleans, LA, United States","name":"CRL: Causal Representation Learning Workshop at NeurIPS","end_date":"2023-12-15","start_date":"2023-12-15"},"year":"2023","department":[{"_id":"FrLo"}],"_id":"14958","status":"public","date_updated":"2025-02-04T12:37:34Z","article_processing_charge":"No"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"arxiv":1,"citation":{"short":"F. Montagna, N. Noceti, L. Rosasco, F. Locatello, ArXiv (n.d.).","chicago":"Montagna, Francesco, Nicoletta Noceti, Lorenzo Rosasco, and Francesco Locatello. “Shortcuts for Causal Discovery of Nonlinear Models by Score Matching.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2310.14246\">https://doi.org/10.48550/arXiv.2310.14246</a>.","ieee":"F. Montagna, N. Noceti, L. Rosasco, and F. Locatello, “Shortcuts for causal discovery of nonlinear models by score matching,” <i>arXiv</i>. .","ista":"Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery of nonlinear models by score matching. arXiv, 2310.14246.","ama":"Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery of nonlinear models by score matching. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2310.14246\">10.48550/arXiv.2310.14246</a>","apa":"Montagna, F., Noceti, N., Rosasco, L., &#38; Locatello, F. (n.d.). Shortcuts for causal discovery of nonlinear models by score matching. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2310.14246\">https://doi.org/10.48550/arXiv.2310.14246</a>","mla":"Montagna, Francesco, et al. “Shortcuts for Causal Discovery of Nonlinear Models by Score Matching.” <i>ArXiv</i>, 2310.14246, doi:<a href=\"https://doi.org/10.48550/arXiv.2310.14246\">10.48550/arXiv.2310.14246</a>."},"doi":"10.48550/arXiv.2310.14246","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.14246"}],"title":"Shortcuts for causal discovery of nonlinear models by score matching","publication":"arXiv","department":[{"_id":"FrLo"}],"type":"preprint","article_number":"2310.14246","_id":"14961","month":"10","author":[{"full_name":"Montagna, Francesco","last_name":"Montagna","first_name":"Francesco"},{"full_name":"Noceti, Nicoletta","last_name":"Noceti","first_name":"Nicoletta"},{"first_name":"Lorenzo","last_name":"Rosasco","full_name":"Rosasco, Lorenzo"},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"}],"date_updated":"2024-10-09T21:08:10Z","status":"public","date_created":"2024-02-08T15:31:46Z","article_processing_charge":"No","fulldoi":"https://doi.org/10.48550/arXiv.2310.14246","day":"22","corr_author":"1","abstract":[{"lang":"eng","text":"The use of simulated data in the field of causal discovery is ubiquitous due to the scarcity of annotated real data. Recently, Reisach et al., 2021 highlighted the emergence of patterns in simulated linear data, which displays increasing marginal variance in the casual direction. As an ablation in their experiments, Montagna et al., 2023 found that similar patterns may emerge in\r\nnonlinear models for the variance of the score vector $\\nabla \\log p_{\\mathbf{X}}$, and introduced the ScoreSort algorithm. In this work, we formally define and characterize this score-sortability pattern of nonlinear additive noise models. We find that it defines a class of identifiable (bivariate) causal models overlapping with nonlinear additive noise models. We\r\ntheoretically demonstrate the advantages of ScoreSort in terms of statistical efficiency compared to prior state-of-the-art score matching-based methods and empirically show the score-sortability of the most common synthetic benchmarks in the literature. Our findings remark (1) the lack of diversity in the data as an important limitation in the evaluation of nonlinear causal discovery approaches, (2) the importance of thoroughly testing different settings within a problem class, and (3) the importance of analyzing statistical properties in\r\ncausal discovery, where research is often limited to defining identifiability conditions of the model. "}],"publication_status":"submitted","date_published":"2023-10-22T00:00:00Z","oa_version":"Preprint","language":[{"iso":"eng"}],"external_id":{"arxiv":["2310.14246"]},"year":"2023"},{"abstract":[{"lang":"eng","text":"In this paper, we show that recent advances in video representation learning\r\nand pre-trained vision-language models allow for substantial improvements in\r\nself-supervised video object localization. We propose a method that first\r\nlocalizes objects in videos via a slot attention approach and then assigns text\r\nto the obtained slots. The latter is achieved by an unsupervised way to read\r\nlocalized semantic information from the pre-trained CLIP model. The resulting\r\nvideo object localization is entirely unsupervised apart from the implicit\r\nannotation contained in CLIP, and it is effectively the first unsupervised\r\napproach that yields good results on regular video benchmarks."}],"publication_status":"submitted","date_published":"2023-09-18T00:00:00Z","fulldoi":"https://doi.org/10.48550/arXiv.2309.09858","day":"18","external_id":{"arxiv":["2309.09858"]},"year":"2023","oa_version":"Preprint","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"type":"preprint","date_updated":"2024-02-12T10:12:22Z","date_created":"2024-02-08T15:33:39Z","status":"public","article_processing_charge":"No","month":"09","_id":"14962","article_number":"2309.09858","author":[{"full_name":"Fan, Ke","last_name":"Fan","first_name":"Ke"},{"full_name":"Bai, Zechen","first_name":"Zechen","last_name":"Bai"},{"full_name":"Xiao, Tianjun","last_name":"Xiao","first_name":"Tianjun"},{"last_name":"Zietlow","first_name":"Dominik","full_name":"Zietlow, Dominik"},{"first_name":"Max","last_name":"Horn","full_name":"Horn, Max"},{"last_name":"Zhao","first_name":"Zixu","full_name":"Zhao, Zixu"},{"full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel","last_name":"Carl-Johann Simon-Gabriel","first_name":"Carl-Johann Simon-Gabriel"},{"full_name":"Shou, Mike Zheng","first_name":"Mike Zheng","last_name":"Shou"},{"first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"},{"full_name":"Schiele, Bernt","last_name":"Schiele","first_name":"Bernt"},{"full_name":"Brox, Thomas","last_name":"Brox","first_name":"Thomas"},{"last_name":"Zhang","first_name":"Zheng","full_name":"Zhang, Zheng"},{"first_name":"Yanwei","last_name":"Fu","full_name":"Fu, Yanwei"},{"last_name":"He","first_name":"Tong","full_name":"He, Tong"}],"doi":"10.48550/arXiv.2309.09858","arxiv":1,"citation":{"apa":"Fan, K., Bai, Z., Xiao, T., Zietlow, D., Horn, M., Zhao, Z., … He, T. (n.d.). Unsupervised open-vocabulary object localization in videos. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.09858\">https://doi.org/10.48550/arXiv.2309.09858</a>","ama":"Fan K, Bai Z, Xiao T, et al. Unsupervised open-vocabulary object localization in videos. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.09858\">10.48550/arXiv.2309.09858</a>","ista":"Fan K, Bai Z, Xiao T, Zietlow D, Horn M, Zhao Z, Carl-Johann Simon-Gabriel C-JS-G, Shou MZ, Locatello F, Schiele B, Brox T, Zhang Z, Fu Y, He T. Unsupervised open-vocabulary object localization in videos. arXiv, 2309.09858.","mla":"Fan, Ke, et al. “Unsupervised Open-Vocabulary Object Localization in Videos.” <i>ArXiv</i>, 2309.09858, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.09858\">10.48550/arXiv.2309.09858</a>.","ieee":"K. Fan <i>et al.</i>, “Unsupervised open-vocabulary object localization in videos,” <i>arXiv</i>. .","chicago":"Fan, Ke, Zechen Bai, Tianjun Xiao, Dominik Zietlow, Max Horn, Zixu Zhao, Carl-Johann Simon-Gabriel Carl-Johann Simon-Gabriel, et al. “Unsupervised Open-Vocabulary Object Localization in Videos.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.09858\">https://doi.org/10.48550/arXiv.2309.09858</a>.","short":"K. Fan, Z. Bai, T. Xiao, D. Zietlow, M. Horn, Z. Zhao, C.-J.S.-G. Carl-Johann Simon-Gabriel, M.Z. Shou, F. Locatello, B. Schiele, T. Brox, Z. Zhang, Y. Fu, T. He, ArXiv (n.d.)."},"publication":"arXiv","title":"Unsupervised open-vocabulary object localization in videos","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2309.09858"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"external_id":{"arxiv":["2309.00233"]},"year":"2023","oa_version":"Preprint","language":[{"iso":"eng"}],"abstract":[{"text":"Unsupervised object-centric learning methods allow the partitioning of scenes\r\ninto entities without additional localization information and are excellent\r\ncandidates for reducing the annotation burden of multiple-object tracking (MOT)\r\npipelines. Unfortunately, they lack two key properties: objects are often split\r\ninto parts and are not consistently tracked over time. In fact,\r\nstate-of-the-art models achieve pixel-level accuracy and temporal consistency\r\nby relying on supervised object detection with additional ID labels for the\r\nassociation through time. This paper proposes a video object-centric model for\r\nMOT. It consists of an index-merge module that adapts the object-centric slots\r\ninto detection outputs and an object memory module that builds complete object\r\nprototypes to handle occlusions. Benefited from object-centric learning, we\r\nonly require sparse detection labels (0%-6.25%) for object localization and\r\nfeature binding. Relying on our self-supervised\r\nExpectation-Maximization-inspired loss for object association, our approach\r\nrequires no ID labels. Our experiments significantly narrow the gap between the\r\nexisting object-centric model and the fully supervised state-of-the-art and\r\noutperform several unsupervised trackers.","lang":"eng"}],"date_published":"2023-09-01T00:00:00Z","publication_status":"submitted","fulldoi":"https://doi.org/10.48550/arXiv.2309.00233","day":"01","status":"public","date_updated":"2024-02-12T10:16:21Z","date_created":"2024-02-08T15:34:43Z","article_processing_charge":"No","_id":"14963","article_number":"2309.00233","month":"09","author":[{"full_name":"Zhao, Zixu","first_name":"Zixu","last_name":"Zhao"},{"first_name":"Jiaze","last_name":"Wang","full_name":"Wang, Jiaze"},{"full_name":"Horn, Max","last_name":"Horn","first_name":"Max"},{"full_name":"Ding, Yizhuo","first_name":"Yizhuo","last_name":"Ding"},{"full_name":"He, Tong","first_name":"Tong","last_name":"He"},{"last_name":"Bai","first_name":"Zechen","full_name":"Bai, Zechen"},{"full_name":"Zietlow, Dominik","first_name":"Dominik","last_name":"Zietlow"},{"last_name":"Carl-Johann Simon-Gabriel","first_name":"Carl-Johann Simon-Gabriel","full_name":"Carl-Johann Simon-Gabriel, Carl-Johann Simon-Gabriel"},{"full_name":"Shuai, Bing","last_name":"Shuai","first_name":"Bing"},{"last_name":"Tu","first_name":"Zhuowen","full_name":"Tu, Zhuowen"},{"full_name":"Brox, Thomas","first_name":"Thomas","last_name":"Brox"},{"full_name":"Schiele, Bernt","last_name":"Schiele","first_name":"Bernt"},{"full_name":"Fu, Yanwei","first_name":"Yanwei","last_name":"Fu"},{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello"},{"last_name":"Zhang","first_name":"Zheng","full_name":"Zhang, Zheng"},{"full_name":"Xiao, Tianjun","last_name":"Xiao","first_name":"Tianjun"}],"department":[{"_id":"FrLo"}],"type":"preprint","publication":"arXiv","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2309.00233"}],"title":"Object-centric multiple object tracking","doi":"10.48550/arXiv.2309.00233","arxiv":1,"citation":{"apa":"Zhao, Z., Wang, J., Horn, M., Ding, Y., He, T., Bai, Z., … Xiao, T. (n.d.). Object-centric multiple object tracking. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.00233\">https://doi.org/10.48550/arXiv.2309.00233</a>","ista":"Zhao Z, Wang J, Horn M, Ding Y, He T, Bai Z, Zietlow D, Carl-Johann Simon-Gabriel C-JS-G, Shuai B, Tu Z, Brox T, Schiele B, Fu Y, Locatello F, Zhang Z, Xiao T. Object-centric multiple object tracking. arXiv, 2309.00233.","ama":"Zhao Z, Wang J, Horn M, et al. Object-centric multiple object tracking. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.00233\">10.48550/arXiv.2309.00233</a>","mla":"Zhao, Zixu, et al. “Object-Centric Multiple Object Tracking.” <i>ArXiv</i>, 2309.00233, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.00233\">10.48550/arXiv.2309.00233</a>.","ieee":"Z. Zhao <i>et al.</i>, “Object-centric multiple object tracking,” <i>arXiv</i>. .","chicago":"Zhao, Zixu, Jiaze Wang, Max Horn, Yizhuo Ding, Tong He, Zechen Bai, Dominik Zietlow, et al. “Object-Centric Multiple Object Tracking.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.00233\">https://doi.org/10.48550/arXiv.2309.00233</a>.","short":"Z. Zhao, J. Wang, M. Horn, Y. Ding, T. He, Z. Bai, D. Zietlow, C.-J.S.-G. Carl-Johann Simon-Gabriel, B. Shuai, Z. Tu, T. Brox, B. Schiele, Y. Fu, F. Locatello, Z. Zhang, T. Xiao, ArXiv (n.d.)."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"ipc":"C12Q1/68 ; G06V10/82 ; G06V20/69 ; G16B40/30","has_accepted_license":"1","publication_date":"2023-05-25","oa":1,"ddc":["540"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","abstract":[{"lang":"eng","text":"A method of determining a correspondence between a first biological property of a cell and one or more further biological properties of cells is provided. The first biological property and the further biological properties are determined by different analysis techniques and each are contained in a respective one of a plurality of sets of biological properties. The method includes the steps of: converting the plurality of sets of biological properties into corresponding representations in a representation format which is invariant to the technologies used to derive the biological properties; determining, in said representation format, a representation from each of the converted sets of further biological properties which most closely matches the first representation of the first biological property; and re-converting the determined representations from the representation format back to the biological properties associated with the determined representations and thereby determining a correspondence between the first biological property and each of the further biological properties."}],"application_date":"2021-04-21","file":[{"checksum":"55ed444b176b48e4fb4d609ea895de36","file_id":"14966","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_created":"2024-02-08T15:41:51Z","date_updated":"2024-02-08T15:41:51Z","creator":"ptazenko","file_size":2893462,"file_name":"Patent_FrLo_US20230162818A1.pdf","success":1}],"year":"2023","ipn":"US20230162818A1","oa_version":"Published Version","department":[{"_id":"FrLo"}],"status":"public","date_updated":"2025-01-29T10:53:48Z","article_processing_charge":"No","_id":"14965","page":"9","citation":{"ieee":"J. Ficek, K.-V. Lehmann, F. Locatello, G. Raetsch, and S. Stark, “Methods of determining correspondences between biological properties of cells.” 2023.","apa":"Ficek, J., Lehmann, K.-V., Locatello, F., Raetsch, G., &#38; Stark, S. (2023). Methods of determining correspondences between biological properties of cells.","ista":"Ficek J, Lehmann K-V, Locatello F, Raetsch G, Stark S. 2023. Methods of determining correspondences between biological properties of cells.","ama":"Ficek J, Lehmann K-V, Locatello F, Raetsch G, Stark S. Methods of determining correspondences between biological properties of cells. 2023.","mla":"Ficek, Joanna, et al. <i>Methods of Determining Correspondences between Biological Properties of Cells</i>. 2023.","short":"J. Ficek, K.-V. Lehmann, F. Locatello, G. Raetsch, S. Stark, (2023).","chicago":"Ficek, Joanna, Kjong-Van Lehmann, Francesco Locatello, Gunnar  Raetsch, and Stefan Stark. “Methods of Determining Correspondences between Biological Properties of Cells,” 2023."},"application_number":"PCT/EP2021/060318","title":"Methods of determining correspondences between biological properties of cells","extern":"1","date_published":"2023-05-25T00:00:00Z","file_date_updated":"2024-02-08T15:41:51Z","day":"25","OA_place":"repository","type":"patent","date_created":"2024-02-08T15:52:21Z","month":"05","applicant":["ETH Zürich"],"author":[{"last_name":"Ficek","first_name":"Joanna","full_name":"Ficek, Joanna"},{"first_name":"Kjong-Van","last_name":"Lehmann","full_name":"Lehmann, Kjong-Van"},{"last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"full_name":"Raetsch, Gunnar ","last_name":"Raetsch","first_name":"Gunnar "},{"last_name":"Stark","first_name":"Stefan","full_name":"Stark, Stefan"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","ddc":["000"],"oa":1,"quality_controlled":"1","citation":{"ista":"Zhang C, Janzing D, van der Schaar M, Locatello F, Spirtes P, Zhang K, Schölkopf B, Uhler C. Causality in the time of LLMs: Round table discussion results of CLeaR 2023. 2nd Conference on Causal Learning and Reasoning. CLeaR: Conference on Causal Learning and Reasoning.","apa":"Zhang, C., Janzing, D., van der Schaar, M., Locatello, F., Spirtes, P., Zhang, K., … Uhler, C. (n.d.). Causality in the time of LLMs: Round table discussion results of CLeaR 2023. In <i>2nd Conference on Causal Learning and Reasoning</i>. Tübingen, Germany.","ama":"Zhang C, Janzing D, van der Schaar M, et al. Causality in the time of LLMs: Round table discussion results of CLeaR 2023. In: <i>2nd Conference on Causal Learning and Reasoning</i>.","mla":"Zhang, Cheng, et al. “Causality in the Time of LLMs: Round Table Discussion Results of CLeaR 2023.” <i>2nd Conference on Causal Learning and Reasoning</i>.","ieee":"C. Zhang <i>et al.</i>, “Causality in the time of LLMs: Round table discussion results of CLeaR 2023,” in <i>2nd Conference on Causal Learning and Reasoning</i>, Tübingen, Germany.","chicago":"Zhang, Cheng, Dominik Janzing, Mihaela  van der Schaar, Francesco Locatello, Peter Spirtes, Kun Zhang, Bernhard Schölkopf, and Caroline Uhler. “Causality in the Time of LLMs: Round Table Discussion Results of CLeaR 2023.” In <i>2nd Conference on Causal Learning and Reasoning</i>, n.d.","short":"C. Zhang, D. Janzing, M. van der Schaar, F. Locatello, P. Spirtes, K. Zhang, B. Schölkopf, C. Uhler, in:, 2nd Conference on Causal Learning and Reasoning, n.d."},"title":"Causality in the time of LLMs: Round table discussion results of CLeaR 2023","has_accepted_license":"1","publication":"2nd Conference on Causal Learning and Reasoning","department":[{"_id":"FrLo"}],"type":"conference","month":"05","_id":"14974","author":[{"full_name":"Zhang, Cheng","last_name":"Zhang","first_name":"Cheng"},{"full_name":"Janzing, Dominik","first_name":"Dominik","last_name":"Janzing"},{"first_name":"Mihaela ","last_name":"van der Schaar","full_name":"van der Schaar, Mihaela "},{"full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683"},{"full_name":"Spirtes, Peter","last_name":"Spirtes","first_name":"Peter"},{"full_name":"Zhang, Kun","last_name":"Zhang","first_name":"Kun"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline"}],"date_updated":"2025-08-05T11:19:37Z","date_created":"2024-02-08T16:03:18Z","status":"public","article_processing_charge":"No","day":"01","abstract":[{"lang":"eng","text":"The field of machine learning and AI has witnessed remarkable breakthroughs with the emergence of LLMs, which have also sparked a lively debate in the causal community. As researchers in this field, we are interested in exploring how LLMs relate to causality research, and how we can leverage the technology to advance it. In the second conference of Causal Learning and Reasoning (CLeaR), 2023, we held a round table discussion to gather and integrate the diverse perspectives of the CLeaR community on this topic.\r\nThere is a general consensus that LLMs are not yet capable of causal reasoning at the current\r\nstage but has a lot of potential with public available information by CLeaR 2023. Enhancing causal machine learning is vital not only for its own sake but also to help LLMs improve their performance, especially regarding trustworthiness. In this document, we present both the summary and the raw outcome of the round table discussion. We acknowledge that with the progress of both fields, the opportunities and impact may rapidly change. We will repeat the same exercise in CLeaR 2024 to document the evolution."}],"file":[{"date_updated":"2024-02-08T16:03:08Z","date_created":"2024-02-08T16:03:08Z","creator":"ptazenko","file_size":215629,"file_name":"CLeaR23_roundtable_discussion.pdf","checksum":"105ff58e55de866ce76967f3a95e82f7","content_type":"application/pdf","file_id":"14975","relation":"main_file","access_level":"open_access"}],"file_date_updated":"2024-02-08T16:03:08Z","date_published":"2023-05-01T00:00:00Z","publication_status":"submitted","oa_version":"Submitted Version","language":[{"iso":"eng"}],"conference":{"name":"CLeaR: Conference on Causal Learning and Reasoning","location":"Tübingen, Germany","end_date":"2023-04-14","start_date":"2023-04-11"},"year":"2023"}]