[{"department":[{"_id":"DaAl"},{"_id":"ToHe"}],"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html","open_access":"1"}],"title":"WoodFisher: Efficient second-order approximation for neural network compression","author":[{"id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","full_name":"Singh, Sidak Pal","last_name":"Singh","first_name":"Sidak Pal"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"external_id":{"arxiv":["2004.14340"]},"project":[{"grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"day":"06","abstract":[{"lang":"eng","text":"Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep\r\nneural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as\r\nillustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher."}],"oa_version":"Published Version","ec_funded":1,"alternative_title":["Advances in Neural Information Processing Systems"],"scopus_import":"1","corr_author":"1","publication_status":"published","citation":{"mla":"Singh, Sidak Pal, and Dan-Adrian Alistarh. <i>WoodFisher: Efficient Second-Order Approximation for Neural Network Compression</i>. Vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 18098–109.","ieee":"S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.","apa":"Singh, S. P., &#38; Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression (Vol. 33, pp. 18098–18109). Presented at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.","chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression,” 33:18098–109. Neural Information Processing Systems Foundation, 2020.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Vol 33. Neural Information Processing Systems Foundation; 2020:18098-18109.","short":"S.P. Singh, D.-A. Alistarh, in:, Neural Information Processing Systems Foundation, 2020, pp. 18098–18109.","ista":"Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. NeurIPS: Conference on Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 33, 18098–18109."},"volume":33,"article_processing_charge":"No","month":"12","oa":1,"date_published":"2020-12-06T00:00:00Z","publication_identifier":{"issn":["1049-5258"],"isbn":["9781713829546"]},"quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2020-12-12","location":"Vancouver, Canada","start_date":"2020-12-06"},"date_created":"2021-07-04T22:01:26Z","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","page":"18098-18109","_id":"9632","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko, Alexandra Peste, and other members of the group for fruitful discussions.","intvolume":"        33","publisher":"Neural Information Processing Systems Foundation","status":"public","type":"conference","date_updated":"2025-05-14T11:27:23Z"},{"_id":"9708","oa_version":"Published Version","year":"2020","abstract":[{"text":"This research data supports 'Hard antinodal gap revealed by quantum oscillations in the pseudogap regime of underdoped high-Tc superconductors'. A Readme file for plotting each figure is provided.","lang":"eng"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"29","date_updated":"2025-07-10T11:54:51Z","type":"research_data_reference","publisher":"Apollo - University of Cambridge","status":"public","doi":"10.17863/cam.50169","related_material":{"record":[{"id":"7942","status":"public","relation":"used_in_publication"}]},"has_accepted_license":"1","title":"Accompanying dataset for 'Hard antinodal gap revealed by quantum oscillations in the pseudogap regime of underdoped high-Tc superconductors'","date_published":"2020-05-29T00:00:00Z","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.17863/CAM.50169"}],"month":"05","article_processing_charge":"No","citation":{"ista":"Hartstein M, Hsu Y-T, Modic KA, Porras J, Loew T, Le Tacon M, Zuo H, Wang J, Zhu Z, Chan M, McDonald R, Lonzarich G, Keimer B, Sebastian S, Harrison N. 2020. Accompanying dataset for ‘Hard antinodal gap revealed by quantum oscillations in the pseudogap regime of underdoped high-Tc superconductors’, Apollo - University of Cambridge, <a href=\"https://doi.org/10.17863/cam.50169\">10.17863/cam.50169</a>.","short":"M. Hartstein, Y.-T. Hsu, K.A. Modic, J. Porras, T. Loew, M. Le Tacon, H. Zuo, J. Wang, Z. Zhu, M. Chan, R. McDonald, G. Lonzarich, B. Keimer, S. Sebastian, N. Harrison, (2020).","chicago":"Hartstein, Mate, Yu-Te Hsu, Kimberly A Modic, Juan Porras, Toshinao Loew, Matthieu Le Tacon, Huakun Zuo, et al. “Accompanying Dataset for ‘Hard Antinodal Gap Revealed by Quantum Oscillations in the Pseudogap Regime of Underdoped High-Tc Superconductors.’” Apollo - University of Cambridge, 2020. <a href=\"https://doi.org/10.17863/cam.50169\">https://doi.org/10.17863/cam.50169</a>.","ama":"Hartstein M, Hsu Y-T, Modic KA, et al. Accompanying dataset for “Hard antinodal gap revealed by quantum oscillations in the pseudogap regime of underdoped high-Tc superconductors.” 2020. doi:<a href=\"https://doi.org/10.17863/cam.50169\">10.17863/cam.50169</a>","apa":"Hartstein, M., Hsu, Y.-T., Modic, K. A., Porras, J., Loew, T., Le Tacon, M., … Harrison, N. (2020). Accompanying dataset for “Hard antinodal gap revealed by quantum oscillations in the pseudogap regime of underdoped high-Tc superconductors.” Apollo - University of Cambridge. <a href=\"https://doi.org/10.17863/cam.50169\">https://doi.org/10.17863/cam.50169</a>","ieee":"M. Hartstein <i>et al.</i>, “Accompanying dataset for ‘Hard antinodal gap revealed by quantum oscillations in the pseudogap regime of underdoped high-Tc superconductors.’” Apollo - University of Cambridge, 2020.","mla":"Hartstein, Mate, et al. <i>Accompanying Dataset for “Hard Antinodal Gap Revealed by Quantum Oscillations in the Pseudogap Regime of Underdoped High-Tc Superconductors.”</i> Apollo - University of Cambridge, 2020, doi:<a href=\"https://doi.org/10.17863/cam.50169\">10.17863/cam.50169</a>."},"department":[{"_id":"KiMo"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_created":"2021-07-23T10:00:35Z","author":[{"first_name":"Mate","full_name":"Hartstein, Mate","last_name":"Hartstein"},{"last_name":"Hsu","full_name":"Hsu, Yu-Te","first_name":"Yu-Te"},{"orcid":"0000-0001-9760-3147","first_name":"Kimberly A","last_name":"Modic","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","full_name":"Modic, Kimberly A"},{"last_name":"Porras","first_name":"Juan","full_name":"Porras, Juan"},{"last_name":"Loew","full_name":"Loew, Toshinao","first_name":"Toshinao"},{"last_name":"Le Tacon","full_name":"Le Tacon, Matthieu","first_name":"Matthieu"},{"first_name":"Huakun","full_name":"Zuo, Huakun","last_name":"Zuo"},{"full_name":"Wang, Jinhua","first_name":"Jinhua","last_name":"Wang"},{"first_name":"Zengwei","full_name":"Zhu, Zengwei","last_name":"Zhu"},{"full_name":"Chan, Mun","first_name":"Mun","last_name":"Chan"},{"full_name":"McDonald, Ross","last_name":"McDonald","first_name":"Ross"},{"first_name":"Gilbert","last_name":"Lonzarich","full_name":"Lonzarich, Gilbert"},{"full_name":"Keimer, Bernhard","last_name":"Keimer","first_name":"Bernhard"},{"first_name":"Suchitra","full_name":"Sebastian, Suchitra","last_name":"Sebastian"},{"full_name":"Harrison, Neil","last_name":"Harrison","first_name":"Neil"}],"license":"https://creativecommons.org/licenses/by/4.0/"},{"doi":"10.1021/jacs.9b13450.s001","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"8040"}]},"status":"public","publisher":"American Chemical Society ","type":"research_data_reference","date_updated":"2025-07-10T11:55:01Z","abstract":[{"lang":"eng","text":"Additional analyses of the trajectories"}],"day":"20","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9713","year":"2020","oa_version":"Published Version","author":[{"last_name":"Gupta","first_name":"Chitrak","full_name":"Gupta, Chitrak"},{"first_name":"Umesh","full_name":"Khaniya, Umesh","last_name":"Khaniya"},{"full_name":"Chan, Chun Kit","first_name":"Chun Kit","last_name":"Chan"},{"last_name":"Dehez","full_name":"Dehez, Francois","first_name":"Francois"},{"full_name":"Shekhar, Mrinal","last_name":"Shekhar","first_name":"Mrinal"},{"last_name":"Gunner","full_name":"Gunner, M.R.","first_name":"M.R."},{"first_name":"Leonid A","full_name":"Sazanov, Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989"},{"first_name":"Christophe","full_name":"Chipot, Christophe","last_name":"Chipot"},{"full_name":"Singharoy, Abhishek","last_name":"Singharoy","first_name":"Abhishek"}],"date_created":"2021-07-23T12:02:39Z","article_processing_charge":"No","month":"05","department":[{"_id":"LeSa"}],"citation":{"apa":"Gupta, C., Khaniya, U., Chan, C. K., Dehez, F., Shekhar, M., Gunner, M. R., … Singharoy, A. (2020). Supporting information. American Chemical Society . <a href=\"https://doi.org/10.1021/jacs.9b13450.s001\">https://doi.org/10.1021/jacs.9b13450.s001</a>","ieee":"C. Gupta <i>et al.</i>, “Supporting information.” American Chemical Society , 2020.","mla":"Gupta, Chitrak, et al. <i>Supporting Information</i>. American Chemical Society , 2020, doi:<a href=\"https://doi.org/10.1021/jacs.9b13450.s001\">10.1021/jacs.9b13450.s001</a>.","chicago":"Gupta, Chitrak, Umesh Khaniya, Chun Kit Chan, Francois Dehez, Mrinal Shekhar, M.R. Gunner, Leonid A Sazanov, Christophe Chipot, and Abhishek Singharoy. “Supporting Information.” American Chemical Society , 2020. <a href=\"https://doi.org/10.1021/jacs.9b13450.s001\">https://doi.org/10.1021/jacs.9b13450.s001</a>.","ama":"Gupta C, Khaniya U, Chan CK, et al. Supporting information. 2020. doi:<a href=\"https://doi.org/10.1021/jacs.9b13450.s001\">10.1021/jacs.9b13450.s001</a>","ista":"Gupta C, Khaniya U, Chan CK, Dehez F, Shekhar M, Gunner MR, Sazanov LA, Chipot C, Singharoy A. 2020. Supporting information, American Chemical Society , <a href=\"https://doi.org/10.1021/jacs.9b13450.s001\">10.1021/jacs.9b13450.s001</a>.","short":"C. Gupta, U. Khaniya, C.K. Chan, F. Dehez, M. Shekhar, M.R. Gunner, L.A. Sazanov, C. Chipot, A. Singharoy, (2020)."},"date_published":"2020-05-20T00:00:00Z","title":"Supporting information"},{"type":"research_data_reference","publisher":"Public Library of Science","status":"public","date_updated":"2025-06-12T06:58:06Z","doi":"10.1371/journal.pcbi.1007642.s001","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"7569"}]},"_id":"9776","year":"2020","oa_version":"Published Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","day":"25","date_created":"2021-08-06T07:15:04Z","author":[{"orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","last_name":"Grah","first_name":"Rok","full_name":"Grah, Rok"},{"first_name":"Tamar","last_name":"Friedlander","full_name":"Friedlander, Tamar"}],"date_published":"2020-02-25T00:00:00Z","title":"Supporting information","article_processing_charge":"No","month":"02","department":[{"_id":"GaTk"}],"citation":{"ista":"Grah R, Friedlander T. 2020. Supporting information, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s001\">10.1371/journal.pcbi.1007642.s001</a>.","short":"R. Grah, T. Friedlander, (2020).","apa":"Grah, R., &#38; Friedlander, T. (2020). Supporting information. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s001\">https://doi.org/10.1371/journal.pcbi.1007642.s001</a>","mla":"Grah, Rok, and Tamar Friedlander. <i>Supporting Information</i>. Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s001\">10.1371/journal.pcbi.1007642.s001</a>.","ieee":"R. Grah and T. Friedlander, “Supporting information.” Public Library of Science, 2020.","chicago":"Grah, Rok, and Tamar Friedlander. “Supporting Information.” Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s001\">https://doi.org/10.1371/journal.pcbi.1007642.s001</a>.","ama":"Grah R, Friedlander T. Supporting information. 2020. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s001\">10.1371/journal.pcbi.1007642.s001</a>"}},{"date_updated":"2025-06-12T06:58:06Z","publisher":"Public Library of Science","type":"research_data_reference","status":"public","doi":"10.1371/journal.pcbi.1007642.s002","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7569"}]},"_id":"9777","oa_version":"None","year":"2020","day":"25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2021-08-06T07:21:51Z","author":[{"orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","first_name":"Rok","last_name":"Grah","full_name":"Grah, Rok"},{"first_name":"Tamar","full_name":"Friedlander, Tamar","last_name":"Friedlander"}],"title":"Maximizing crosstalk","date_published":"2020-02-25T00:00:00Z","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1371/journal.pcbi.1007642.s002"}],"month":"02","article_processing_charge":"No","citation":{"short":"R. Grah, T. Friedlander, (2020).","ista":"Grah R, Friedlander T. 2020. Maximizing crosstalk, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">10.1371/journal.pcbi.1007642.s002</a>.","ama":"Grah R, Friedlander T. Maximizing crosstalk. 2020. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">10.1371/journal.pcbi.1007642.s002</a>","chicago":"Grah, Rok, and Tamar Friedlander. “Maximizing Crosstalk.” Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">https://doi.org/10.1371/journal.pcbi.1007642.s002</a>.","mla":"Grah, Rok, and Tamar Friedlander. <i>Maximizing Crosstalk</i>. Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">10.1371/journal.pcbi.1007642.s002</a>.","ieee":"R. Grah and T. Friedlander, “Maximizing crosstalk.” Public Library of Science, 2020.","apa":"Grah, R., &#38; Friedlander, T. (2020). Maximizing crosstalk. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">https://doi.org/10.1371/journal.pcbi.1007642.s002</a>"},"department":[{"_id":"GaTk"}]},{"department":[{"_id":"GaTk"}],"citation":{"short":"R. Grah, T. Friedlander, (2020).","ista":"Grah R, Friedlander T. 2020. Distribution of crosstalk values, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">10.1371/journal.pcbi.1007642.s003</a>.","ieee":"R. Grah and T. Friedlander, “Distribution of crosstalk values.” Public Library of Science, 2020.","mla":"Grah, Rok, and Tamar Friedlander. <i>Distribution of Crosstalk Values</i>. Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">10.1371/journal.pcbi.1007642.s003</a>.","apa":"Grah, R., &#38; Friedlander, T. (2020). Distribution of crosstalk values. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">https://doi.org/10.1371/journal.pcbi.1007642.s003</a>","ama":"Grah R, Friedlander T. Distribution of crosstalk values. 2020. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">10.1371/journal.pcbi.1007642.s003</a>","chicago":"Grah, Rok, and Tamar Friedlander. “Distribution of Crosstalk Values.” Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">https://doi.org/10.1371/journal.pcbi.1007642.s003</a>."},"article_processing_charge":"No","month":"02","date_published":"2020-02-25T00:00:00Z","title":"Distribution of crosstalk values","author":[{"last_name":"Grah","first_name":"Rok","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","full_name":"Grah, Rok","orcid":"0000-0003-2539-3560"},{"full_name":"Friedlander, Tamar","last_name":"Friedlander","first_name":"Tamar"}],"date_created":"2021-08-06T07:24:37Z","day":"25","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2020","oa_version":"Published Version","_id":"9779","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7569"}]},"doi":"10.1371/journal.pcbi.1007642.s003","type":"research_data_reference","publisher":"Public Library of Science","status":"public","date_updated":"2025-06-12T06:58:06Z"},{"day":"22","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"text":"PADREV : 4,4'-dimethoxy[1,1'-biphenyl]-2,2',5,5'-tetrol\r\nSpace Group: C 2 (5), Cell: a 24.488(16)Å b 5.981(4)Å c 3.911(3)Å, α 90° β 91.47(3)° γ 90°","lang":"eng"}],"oa_version":"Published Version","year":"2020","_id":"9780","related_material":{"record":[{"id":"8329","status":"public","relation":"used_in_publication"}]},"doi":"10.5517/ccdc.csd.cc24vsrk","date_updated":"2023-09-05T16:03:47Z","type":"research_data_reference","publisher":"CCDC","status":"public","citation":{"ista":"Schlemmer W, Nothdurft P, Petzold A, Riess G, Frühwirt P, Schmallegger M, Gescheidt-Demner G, Fischer R, Freunberger SA, Kern W, Spirk S. 2020. CCDC 1991959: Experimental Crystal Structure Determination, CCDC, <a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">10.5517/ccdc.csd.cc24vsrk</a>.","short":"W. Schlemmer, P. Nothdurft, A. Petzold, G. Riess, P. Frühwirt, M. Schmallegger, G. Gescheidt-Demner, R. Fischer, S.A. Freunberger, W. Kern, S. Spirk, (2020).","apa":"Schlemmer, W., Nothdurft, P., Petzold, A., Riess, G., Frühwirt, P., Schmallegger, M., … Spirk, S. (2020). CCDC 1991959: Experimental Crystal Structure Determination. CCDC. <a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">https://doi.org/10.5517/ccdc.csd.cc24vsrk</a>","mla":"Schlemmer, Werner, et al. <i>CCDC 1991959: Experimental Crystal Structure Determination</i>. CCDC, 2020, doi:<a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">10.5517/ccdc.csd.cc24vsrk</a>.","ieee":"W. Schlemmer <i>et al.</i>, “CCDC 1991959: Experimental Crystal Structure Determination.” CCDC, 2020.","ama":"Schlemmer W, Nothdurft P, Petzold A, et al. CCDC 1991959: Experimental Crystal Structure Determination. 2020. doi:<a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">10.5517/ccdc.csd.cc24vsrk</a>","chicago":"Schlemmer, Werner, Philipp Nothdurft, Alina Petzold, Gisbert Riess, Philipp Frühwirt, Max Schmallegger, Georg Gescheidt-Demner, et al. “CCDC 1991959: Experimental Crystal Structure Determination.” CCDC, 2020. <a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">https://doi.org/10.5517/ccdc.csd.cc24vsrk</a>."},"department":[{"_id":"StFr"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://dx.doi.org/10.5517/ccdc.csd.cc24vsrk"}],"month":"03","article_processing_charge":"No","title":"CCDC 1991959: Experimental Crystal Structure Determination","date_published":"2020-03-22T00:00:00Z","author":[{"first_name":"Werner","last_name":"Schlemmer","full_name":"Schlemmer, Werner"},{"last_name":"Nothdurft","full_name":"Nothdurft, Philipp","first_name":"Philipp"},{"first_name":"Alina","full_name":"Petzold, Alina","last_name":"Petzold"},{"last_name":"Riess","full_name":"Riess, Gisbert","first_name":"Gisbert"},{"last_name":"Frühwirt","full_name":"Frühwirt, Philipp","first_name":"Philipp"},{"last_name":"Schmallegger","first_name":"Max","full_name":"Schmallegger, Max"},{"first_name":"Georg","full_name":"Gescheidt-Demner, Georg","last_name":"Gescheidt-Demner"},{"last_name":"Fischer","full_name":"Fischer, Roland","first_name":"Roland"},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319"},{"last_name":"Kern","full_name":"Kern, Wolfgang","first_name":"Wolfgang"},{"first_name":"Stefan","full_name":"Spirk, Stefan","last_name":"Spirk"}],"date_created":"2021-08-06T07:41:07Z"},{"date_published":"2020-10-15T00:00:00Z","title":"Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7957472.v1"}],"article_processing_charge":"No","month":"10","oa":1,"department":[{"_id":"BeVi"},{"_id":"NiBa"}],"citation":{"short":"C. Fraisse, J.J. Welch, (2020).","ista":"Fraisse C, Welch JJ. 2020. Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes, Royal Society of London, <a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">10.6084/m9.figshare.7957472.v1</a>.","mla":"Fraisse, Christelle, and John J. Welch. <i>Simulation Code for Fig S2 from the Distribution of Epistasis on Simple Fitness Landscapes</i>. Royal Society of London, 2020, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">10.6084/m9.figshare.7957472.v1</a>.","ieee":"C. Fraisse and J. J. Welch, “Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes.” Royal Society of London, 2020.","apa":"Fraisse, C., &#38; Welch, J. J. (2020). Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes. Royal Society of London. <a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">https://doi.org/10.6084/m9.figshare.7957472.v1</a>","chicago":"Fraisse, Christelle, and John J. Welch. “Simulation Code for Fig S2 from the Distribution of Epistasis on Simple Fitness Landscapes.” Royal Society of London, 2020. <a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">https://doi.org/10.6084/m9.figshare.7957472.v1</a>.","ama":"Fraisse C, Welch JJ. Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes. 2020. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">10.6084/m9.figshare.7957472.v1</a>"},"date_created":"2021-08-06T11:18:15Z","author":[{"orcid":"0000-0001-8441-5075","full_name":"Fraisse, Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","first_name":"Christelle","last_name":"Fraisse"},{"last_name":"Welch","first_name":"John J.","full_name":"Welch, John J."}],"_id":"9798","year":"2020","oa_version":"Published Version","OA_type":"hybrid","day":"15","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","abstract":[{"lang":"eng","text":"Fitness interactions between mutations can influence a population’s evolution in many different ways. While epistatic effects are difficult to measure precisely, important information is captured by the mean and variance of log fitnesses for individuals carrying different numbers of mutations. We derive predictions for these quantities from a class of simple fitness landscapes, based on models of optimizing selection on quantitative traits. We also explore extensions to the models, including modular pleiotropy, variable effect sizes, mutational bias and maladaptation of the wild type. We illustrate our approach by reanalysing a large dataset of mutant effects in a yeast snoRNA. Though characterized by some large epistatic effects, these data give a good overall fit to the non-epistatic null model, suggesting that epistasis might have limited influence on the evolutionary dynamics in this system. We also show how the amount of epistasis depends on both the underlying fitness landscape and the distribution of mutations, and so is expected to vary in consistent ways between new mutations, standing variation and fixed mutations."}],"status":"public","publisher":"Royal Society of London","type":"research_data_reference","date_updated":"2025-07-10T11:53:24Z","doi":"10.6084/m9.figshare.7957472.v1","OA_place":"publisher","related_material":{"record":[{"id":"6467","relation":"used_in_publication","status":"public"}]}},{"title":"Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes","date_published":"2020-10-15T00:00:00Z","oa":1,"month":"10","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.7957469.v1","open_access":"1"}],"citation":{"ista":"Fraisse C, Welch JJ. 2020. Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes, Royal Society of London, <a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">10.6084/m9.figshare.7957469.v1</a>.","short":"C. Fraisse, J.J. Welch, (2020).","apa":"Fraisse, C., &#38; Welch, J. J. (2020). Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes. Royal Society of London. <a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">https://doi.org/10.6084/m9.figshare.7957469.v1</a>","mla":"Fraisse, Christelle, and John J. Welch. <i>Simulation Code for Fig S1 from the Distribution of Epistasis on Simple Fitness Landscapes</i>. Royal Society of London, 2020, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">10.6084/m9.figshare.7957469.v1</a>.","ieee":"C. Fraisse and J. J. Welch, “Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes.” Royal Society of London, 2020.","chicago":"Fraisse, Christelle, and John J. Welch. “Simulation Code for Fig S1 from the Distribution of Epistasis on Simple Fitness Landscapes.” Royal Society of London, 2020. <a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">https://doi.org/10.6084/m9.figshare.7957469.v1</a>.","ama":"Fraisse C, Welch JJ. Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes. 2020. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">10.6084/m9.figshare.7957469.v1</a>"},"department":[{"_id":"BeVi"},{"_id":"NiBa"}],"date_created":"2021-08-06T11:26:57Z","author":[{"orcid":"0000-0001-8441-5075","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","full_name":"Fraisse, Christelle","first_name":"Christelle","last_name":"Fraisse"},{"last_name":"Welch","first_name":"John J.","full_name":"Welch, John J."}],"_id":"9799","oa_version":"Published Version","year":"2020","OA_type":"hybrid","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","day":"15","abstract":[{"lang":"eng","text":"Fitness interactions between mutations can influence a population’s evolution in many different ways. While epistatic effects are difficult to measure precisely, important information is captured by the mean and variance of log fitnesses for individuals carrying different numbers of mutations. We derive predictions for these quantities from a class of simple fitness landscapes, based on models of optimizing selection on quantitative traits. We also explore extensions to the models, including modular pleiotropy, variable effect sizes, mutational bias and maladaptation of the wild type. We illustrate our approach by reanalysing a large dataset of mutant effects in a yeast snoRNA. Though characterized by some large epistatic effects, these data give a good overall fit to the non-epistatic null model, suggesting that epistasis might have limited influence on the evolutionary dynamics in this system. We also show how the amount of epistasis depends on both the underlying fitness landscape and the distribution of mutations, and so is expected to vary in consistent ways between new mutations, standing variation and fixed mutations."}],"date_updated":"2025-07-10T11:53:23Z","status":"public","type":"research_data_reference","publisher":"Royal Society of London","doi":"10.6084/m9.figshare.7957469.v1","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"6467"}]},"OA_place":"publisher"},{"department":[{"_id":"KrCh"}],"citation":{"short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2020. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners, Royal Society, <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>.","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. 2020. doi:<a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.” Royal Society, 2020. <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">https://doi.org/10.6084/m9.figshare.5973013.v1</a>.","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.","mla":"Ibsen-Jensen, Rasmus, et al. <i>Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners</i>. Royal Society, 2020, doi:<a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>.","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society. <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">https://doi.org/10.6084/m9.figshare.5973013.v1</a>"},"month":"10","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.5973013.v1"}],"oa":1,"date_published":"2020-10-15T00:00:00Z","title":"Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners","author":[{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"date_created":"2021-08-06T13:09:57Z","day":"15","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","abstract":[{"lang":"eng","text":"Data and mathematica notebooks for plotting figures from Language learning with communication between learners"}],"OA_type":"hybrid","year":"2020","oa_version":"Published Version","_id":"9814","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"198"}]},"OA_place":"publisher","doi":"10.6084/m9.figshare.5973013.v1","publisher":"Royal Society","type":"research_data_reference","status":"public","date_updated":"2025-04-15T08:12:20Z"},{"date_updated":"2025-07-10T11:52:55Z","publisher":"IEEE","type":"journal_article","status":"public","intvolume":"        26","acknowledgement":"This work was partially supported by JSPS Grant-in-Aid forYoung Scientists (Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176). This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria through resources providedby Scientific Computing. We would like to express my grati-tude to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.","doi":"10.1109/TVCG.2018.2883628","_id":"5681","page":"2288-2302","acknowledged_ssus":[{"_id":"ScienComp"}],"year":"2020","pmid":1,"isi":1,"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-16T22:59:21Z","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1941-0506"],"issn":["1077-2626"]},"quality_controlled":"1","file_date_updated":"2020-10-08T08:34:53Z","date_published":"2020-06-01T00:00:00Z","oa":1,"volume":26,"month":"06","article_processing_charge":"No","citation":{"apa":"Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., &#38; Ando, R. (2020). Simulating liquids on dynamically warping grids. <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">https://doi.org/10.1109/TVCG.2018.2883628</a>","mla":"Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 26, no. 6, IEEE, 2020, pp. 2288–302, doi:<a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">10.1109/TVCG.2018.2883628</a>.","ieee":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids on dynamically warping grids,” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020.","chicago":"Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi Ando. “Simulating Liquids on Dynamically Warping Grids.” <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">https://doi.org/10.1109/TVCG.2018.2883628</a>.","ama":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically warping grids. <i>IEEE Transactions on Visualization and Computer Graphics</i>. 2020;26(6):2288-2302. doi:<a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">10.1109/TVCG.2018.2883628</a>","ista":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 26(6), 2288–2302.","short":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions on Visualization and Computer Graphics 26 (2020) 2288–2302."},"publication_status":"published","scopus_import":"1","has_accepted_license":"1","oa_version":"Submitted Version","publication":"IEEE Transactions on Visualization and Computer Graphics","issue":"6","abstract":[{"text":"We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms.","lang":"eng"}],"day":"01","ddc":["006"],"external_id":{"isi":["000532295600014"],"pmid":["30507534"]},"author":[{"full_name":"Hikaru, Ibayashi","first_name":"Ibayashi","last_name":"Hikaru"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","first_name":"Christopher J"},{"full_name":"Thuerey, Nils","first_name":"Nils","last_name":"Thuerey"},{"first_name":"Takeo","last_name":"Igarashi","full_name":"Igarashi, Takeo"},{"first_name":"Ryoichi","full_name":"Ando, Ryoichi","last_name":"Ando"}],"title":"Simulating liquids on dynamically warping grids","file":[{"file_size":21910098,"content_type":"application/pdf","date_created":"2020-10-08T08:34:53Z","access_level":"open_access","relation":"main_file","date_updated":"2020-10-08T08:34:53Z","checksum":"8d4c55443a0ee335bb5bb652de503042","file_id":"8626","creator":"wojtan","file_name":"preprint.pdf","success":1}],"department":[{"_id":"ChWo"}]},{"page":"319-378","_id":"6358","pmid":1,"year":"2020","article_type":"original","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Springer Nature","type":"journal_article","date_updated":"2025-06-12T07:27:20Z","intvolume":"       178","doi":"10.1007/s10955-019-02434-w","file_date_updated":"2020-07-14T12:47:28Z","date_published":"2020-01-01T00:00:00Z","volume":178,"month":"01","article_processing_charge":"Yes (via OA deal)","oa":1,"citation":{"apa":"Carlen, E. A., &#38; Maas, J. (2020). Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-019-02434-w\">https://doi.org/10.1007/s10955-019-02434-w</a>","mla":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” <i>Journal of Statistical Physics</i>, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:<a href=\"https://doi.org/10.1007/s10955-019-02434-w\">10.1007/s10955-019-02434-w</a>.","ieee":"E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems,” <i>Journal of Statistical Physics</i>, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.","chicago":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” <i>Journal of Statistical Physics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10955-019-02434-w\">https://doi.org/10.1007/s10955-019-02434-w</a>.","ama":"Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. <i>Journal of Statistical Physics</i>. 2020;178(2):319-378. doi:<a href=\"https://doi.org/10.1007/s10955-019-02434-w\">10.1007/s10955-019-02434-w</a>","ista":"Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. 178(2), 319–378.","short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378."},"date_created":"2019-04-30T07:34:18Z","arxiv":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1572-9613"],"issn":["0022-4715"]},"quality_controlled":"1","ec_funded":1,"oa_version":"Published Version","publication":"Journal of Statistical Physics","issue":"2","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117"},{"grant_number":"F06504","name":"Taming Complexity in Partial Differential Systems","call_identifier":"FWF","_id":"260482E2-B435-11E9-9278-68D0E5697425"}],"day":"01","ddc":["500"],"abstract":[{"text":"We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras.  Our settingcovers  arbitrary  skew-derivations  and  it  provides  a  unified  framework  that  simultaneously  generalizes  recently  constructed  transport  metrics  for  Markov  chains,  Lindblad  equations,  and  the  Fermi  Ornstein–Uhlenbeck  semigroup.   We  develop  a  non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature  bounds,  logarithmic  Sobolev  inequalities,  transport-entropy  inequalities,  andspectral gap estimates.","lang":"eng"}],"publication_status":"published","corr_author":"1","scopus_import":"1","related_material":{"link":[{"url":"https://doi.org/10.1007/s10955-020-02671-4","relation":"erratum"}]},"has_accepted_license":"1","title":"Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems","file":[{"file_size":905538,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:28Z","date_created":"2019-12-23T12:03:09Z","file_id":"7209","checksum":"7b04befbdc0d4982c0ee945d25d19872","creator":"dernst","file_name":"2019_JourStatistPhysics_Carlen.pdf"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"JaMa"}],"external_id":{"pmid":["33223567"],"arxiv":["1811.04572"],"isi":["000498933300001"]},"author":[{"first_name":"Eric A.","last_name":"Carlen","full_name":"Carlen, Eric A."},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338"}]},{"citation":{"ama":"Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. <i>Electronic Journal of Probability</i>. 2020;25. doi:<a href=\"https://doi.org/10.1214/20-EJP479\">10.1214/20-EJP479</a>","chicago":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2020. <a href=\"https://doi.org/10.1214/20-EJP479\">https://doi.org/10.1214/20-EJP479</a>.","apa":"Dareiotis, K., &#38; Gerencser, M. (2020). On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/20-EJP479\">https://doi.org/10.1214/20-EJP479</a>","mla":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” <i>Electronic Journal of Probability</i>, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:<a href=\"https://doi.org/10.1214/20-EJP479\">10.1214/20-EJP479</a>.","ieee":"K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift,” <i>Electronic Journal of Probability</i>, vol. 25. Institute of Mathematical Statistics, 2020.","ista":"Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 25, 82.","short":"K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020)."},"article_processing_charge":"No","month":"07","volume":25,"oa":1,"date_published":"2020-07-16T00:00:00Z","file_date_updated":"2020-09-21T13:15:02Z","quality_controlled":"1","publication_identifier":{"eissn":["1083-6489"]},"language":[{"iso":"eng"}],"date_created":"2019-04-30T07:40:17Z","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","isi":1,"year":"2020","_id":"6359","doi":"10.1214/20-EJP479","intvolume":"        25","type":"journal_article","publisher":"Institute of Mathematical Statistics","status":"public","date_updated":"2023-10-16T09:22:50Z","department":[{"_id":"JaMa"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"file":[{"date_created":"2020-09-21T13:15:02Z","date_updated":"2020-09-21T13:15:02Z","relation":"main_file","access_level":"open_access","file_id":"8549","creator":"dernst","checksum":"8e7c42e72596f6889d786e8e8b89994f","success":1,"file_name":"2020_EJournProbab_Dareiotis.pdf","file_size":273042,"content_type":"application/pdf"}],"title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","author":[{"first_name":"Konstantinos","last_name":"Dareiotis","full_name":"Dareiotis, Konstantinos"},{"full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser"}],"external_id":{"arxiv":["1812.04583"],"isi":["000550150700001"]},"abstract":[{"text":"The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients.","lang":"eng"}],"day":"16","ddc":["510"],"publication":"Electronic Journal of Probability","oa_version":"Published Version","has_accepted_license":"1","article_number":"82","scopus_import":"1","publication_status":"published"},{"oa_version":"Preprint","ec_funded":1,"project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"},{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"day":"01","abstract":[{"text":"We prove a central limit theorem for the difference of linear eigenvalue statistics of a sample covariance matrix W˜ and its minor W. We find that the fluctuation of this difference is much smaller than those of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of W˜ and W. Our result identifies the fluctuation of the spatial derivative of the approximate Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar result for Wigner matrices, for sample covariance matrices, the fluctuation may entirely vanish.","lang":"eng"}],"issue":"3","publication":"Random Matrices: Theory and Application","scopus_import":"1","publication_status":"published","article_number":"2050006","title":"Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices","department":[{"_id":"LaEr"}],"main_file_link":[{"url":"https://arxiv.org/abs/1806.08751","open_access":"1"}],"external_id":{"arxiv":["1806.08751"],"isi":["000547464400001"]},"author":[{"orcid":"0000-0002-4901-7992","first_name":"Giorgio","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio"},{"orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"}],"year":"2020","_id":"6488","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","isi":1,"intvolume":"         9","status":"public","publisher":"World Scientific Publishing","type":"journal_article","date_updated":"2025-07-10T11:53:26Z","doi":"10.1142/S2010326320500069","date_published":"2020-07-01T00:00:00Z","citation":{"ieee":"G. Cipolloni and L. Erdös, “Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices,” <i>Random Matrices: Theory and Application</i>, vol. 9, no. 3. World Scientific Publishing, 2020.","mla":"Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear Eigenvalue Statistics for Sample Covariance Matrices.” <i>Random Matrices: Theory and Application</i>, vol. 9, no. 3, 2050006, World Scientific Publishing, 2020, doi:<a href=\"https://doi.org/10.1142/S2010326320500069\">10.1142/S2010326320500069</a>.","apa":"Cipolloni, G., &#38; Erdös, L. (2020). Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. <i>Random Matrices: Theory and Application</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S2010326320500069\">https://doi.org/10.1142/S2010326320500069</a>","chicago":"Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear Eigenvalue Statistics for Sample Covariance Matrices.” <i>Random Matrices: Theory and Application</i>. World Scientific Publishing, 2020. <a href=\"https://doi.org/10.1142/S2010326320500069\">https://doi.org/10.1142/S2010326320500069</a>.","ama":"Cipolloni G, Erdös L. Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. <i>Random Matrices: Theory and Application</i>. 2020;9(3). doi:<a href=\"https://doi.org/10.1142/S2010326320500069\">10.1142/S2010326320500069</a>","short":"G. Cipolloni, L. Erdös, Random Matrices: Theory and Application 9 (2020).","ista":"Cipolloni G, Erdös L. 2020. Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. Random Matrices: Theory and Application. 9(3), 2050006."},"article_processing_charge":"No","month":"07","volume":9,"oa":1,"date_created":"2019-05-26T21:59:14Z","arxiv":1,"publication_identifier":{"issn":["2010-3263"],"eissn":["2010-3271"]},"quality_controlled":"1","language":[{"iso":"eng"}]},{"main_file_link":[{"url":"https://arxiv.org/abs/1312.2337","open_access":"1"}],"department":[{"_id":"UlWa"}],"title":"Are two given maps homotopic? An algorithmic viewpoint","author":[{"full_name":"Filakovský, Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","last_name":"Filakovský","first_name":"Marek"},{"first_name":"Lukas","full_name":"Vokřínek, Lukas","last_name":"Vokřínek"}],"external_id":{"isi":["000522437400004"],"arxiv":["1312.2337"]},"publication":"Foundations of Computational Mathematics","abstract":[{"lang":"eng","text":"This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to 𝐴⊆𝑋."}],"day":"01","project":[{"grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory","call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425"}],"oa_version":"Preprint","publication_status":"published","scopus_import":"1","oa":1,"month":"04","article_processing_charge":"No","volume":20,"citation":{"apa":"Filakovský, M., &#38; Vokřínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. <i>Foundations of Computational Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10208-019-09419-x\">https://doi.org/10.1007/s10208-019-09419-x</a>","mla":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” <i>Foundations of Computational Mathematics</i>, vol. 20, Springer Nature, 2020, pp. 311–30, doi:<a href=\"https://doi.org/10.1007/s10208-019-09419-x\">10.1007/s10208-019-09419-x</a>.","ieee":"M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” <i>Foundations of Computational Mathematics</i>, vol. 20. Springer Nature, pp. 311–330, 2020.","ama":"Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. <i>Foundations of Computational Mathematics</i>. 2020;20:311-330. doi:<a href=\"https://doi.org/10.1007/s10208-019-09419-x\">10.1007/s10208-019-09419-x</a>","chicago":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” <i>Foundations of Computational Mathematics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10208-019-09419-x\">https://doi.org/10.1007/s10208-019-09419-x</a>.","ista":"Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.","short":"M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330."},"date_published":"2020-04-01T00:00:00Z","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"issn":["1615-3375"],"eissn":["1615-3383"]},"arxiv":1,"date_created":"2019-06-16T21:59:14Z","isi":1,"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6563","page":"311-330","year":"2020","doi":"10.1007/s10208-019-09419-x","date_updated":"2025-07-10T11:53:32Z","type":"journal_article","status":"public","publisher":"Springer Nature","intvolume":"        20"},{"oa_version":"Submitted Version","ec_funded":1,"ddc":["000"],"abstract":[{"lang":"eng","text":"We consider the monotone variational inequality problem in a Hilbert space and describe a projection-type method with inertial terms under the following properties: (a) The method generates a strongly convergent iteration sequence; (b) The method requires, at each iteration, only one projection onto the feasible set and two evaluations of the operator; (c) The method is designed for variational inequality for which the underline operator is monotone and uniformly continuous; (d) The method includes an inertial term. The latter is also shown to speed up the convergence in our numerical results. A comparison with some related methods is given and indicates that the new method is promising."}],"day":"01","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"publication":"Numerical Algorithms","scopus_import":"1","publication_status":"published","corr_author":"1","has_accepted_license":"1","title":"An efficient projection-type method for monotone variational inequalities in Hilbert spaces","department":[{"_id":"VlKo"}],"file":[{"file_size":359654,"content_type":"application/pdf","file_name":"ExtragradientMethodPaper.pdf","date_updated":"2020-07-14T12:47:34Z","access_level":"open_access","relation":"main_file","date_created":"2019-10-01T13:14:10Z","checksum":"bb1a1eb3ebb2df380863d0db594673ba","creator":"kschuh","file_id":"6927"}],"external_id":{"isi":["000528979000015"]},"author":[{"orcid":"0000-0001-9224-7139","last_name":"Shehu","first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","full_name":"Shehu, Yekini"},{"full_name":"Li, Xiao-Huan","last_name":"Li","first_name":"Xiao-Huan"},{"last_name":"Dong","full_name":"Dong, Qiao-Li","first_name":"Qiao-Li"}],"year":"2020","_id":"6593","page":"365-388","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"article_type":"original","intvolume":"        84","date_updated":"2024-11-04T13:52:40Z","type":"journal_article","publisher":"Springer Nature","status":"public","acknowledgement":"The research of this author is supported by the ERC grant at the IST.","doi":"10.1007/s11075-019-00758-y","date_published":"2020-05-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:34Z","citation":{"ista":"Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.","short":"Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388.","apa":"Shehu, Y., Li, X.-H., &#38; Dong, Q.-L. (2020). An efficient projection-type method for monotone variational inequalities in Hilbert spaces. <i>Numerical Algorithms</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11075-019-00758-y\">https://doi.org/10.1007/s11075-019-00758-y</a>","ieee":"Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for monotone variational inequalities in Hilbert spaces,” <i>Numerical Algorithms</i>, vol. 84. Springer Nature, pp. 365–388, 2020.","mla":"Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” <i>Numerical Algorithms</i>, vol. 84, Springer Nature, 2020, pp. 365–88, doi:<a href=\"https://doi.org/10.1007/s11075-019-00758-y\">10.1007/s11075-019-00758-y</a>.","ama":"Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. <i>Numerical Algorithms</i>. 2020;84:365-388. doi:<a href=\"https://doi.org/10.1007/s11075-019-00758-y\">10.1007/s11075-019-00758-y</a>","chicago":"Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” <i>Numerical Algorithms</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11075-019-00758-y\">https://doi.org/10.1007/s11075-019-00758-y</a>."},"oa":1,"month":"05","article_processing_charge":"No","volume":84,"date_created":"2019-06-27T20:09:33Z","publication_identifier":{"issn":["1017-1398"],"eissn":["1572-9265"]},"quality_controlled":"1","language":[{"iso":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","isi":1,"year":"2020","page":"3619-3642","_id":"6748","doi":"10.1214/20-AOS1945","intvolume":"        48","type":"journal_article","publisher":"Institute of Mathematical Statistics","status":"public","date_updated":"2024-10-21T06:02:33Z","citation":{"short":"A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642.","ista":"Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 48(6), 3619–3642.","ama":"Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network via displacement convexity. <i>Annals of Statistics</i>. 2020;48(6):3619-3642. doi:<a href=\"https://doi.org/10.1214/20-AOS1945\">10.1214/20-AOS1945</a>","chicago":"Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2020. <a href=\"https://doi.org/10.1214/20-AOS1945\">https://doi.org/10.1214/20-AOS1945</a>.","ieee":"A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural network via displacement convexity,” <i>Annals of Statistics</i>, vol. 48, no. 6. Institute of Mathematical Statistics, pp. 3619–3642, 2020.","mla":"Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” <i>Annals of Statistics</i>, vol. 48, no. 6, Institute of Mathematical Statistics, 2020, pp. 3619–42, doi:<a href=\"https://doi.org/10.1214/20-AOS1945\">10.1214/20-AOS1945</a>.","apa":"Javanmard, A., Mondelli, M., &#38; Montanari, A. (2020). Analysis of a two-layer neural network via displacement convexity. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/20-AOS1945\">https://doi.org/10.1214/20-AOS1945</a>"},"volume":48,"article_processing_charge":"No","month":"12","oa":1,"date_published":"2020-12-11T00:00:00Z","quality_controlled":"1","publication_identifier":{"issn":["1932-6157"],"eissn":["1941-7330"]},"language":[{"iso":"eng"}],"date_created":"2019-07-31T09:39:42Z","arxiv":1,"day":"11","abstract":[{"lang":"eng","text":"Fitting a function by using linear combinations of a large number N of `simple' components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is non-convex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches.\r\nHere we consider the problem of learning a concave function f on a compact convex domain Ω⊆ℝd, using linear combinations of `bump-like' components (neurons). The parameters to be fitted are the centers of N bumps, and the resulting empirical risk minimization problem is highly non-convex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over Ω. Further, when the bump width δ tends to 0, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of δ,N. Explaining this phenomenon, and understanding the dependence on δ,N in a quantitative manner remains an outstanding challenge."}],"publication":"Annals of Statistics","issue":"6","oa_version":"Preprint","scopus_import":"1","publication_status":"published","department":[{"_id":"MaMo"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.01375"}],"title":"Analysis of a two-layer neural network via displacement convexity","author":[{"full_name":"Javanmard, Adel","last_name":"Javanmard","first_name":"Adel"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"},{"first_name":"Andrea","full_name":"Montanari, Andrea","last_name":"Montanari"}],"external_id":{"arxiv":["1901.01375"],"isi":["000598369200021"]}},{"language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"issn":["1050-9631"],"eissn":["1098-1063"]},"date_created":"2019-08-11T21:59:24Z","oa":1,"volume":30,"month":"04","article_processing_charge":"No","citation":{"short":"F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.","ista":"Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 30(4), 302–313.","ieee":"F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration in self-organizing spherical grids,” <i>Hippocampus</i>, vol. 30, no. 4. Wiley, pp. 302–313, 2020.","mla":"Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” <i>Hippocampus</i>, vol. 30, no. 4, Wiley, 2020, pp. 302–13, doi:<a href=\"https://doi.org/10.1002/hipo.23144\">10.1002/hipo.23144</a>.","apa":"Stella, F., Urdapilleta, E., Luo, Y., &#38; Treves, A. (2020). Partial coherence and frustration in self-organizing spherical grids. <i>Hippocampus</i>. Wiley. <a href=\"https://doi.org/10.1002/hipo.23144\">https://doi.org/10.1002/hipo.23144</a>","ama":"Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration in self-organizing spherical grids. <i>Hippocampus</i>. 2020;30(4):302-313. doi:<a href=\"https://doi.org/10.1002/hipo.23144\">10.1002/hipo.23144</a>","chicago":"Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” <i>Hippocampus</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/hipo.23144\">https://doi.org/10.1002/hipo.23144</a>."},"file_date_updated":"2020-07-14T12:47:40Z","date_published":"2020-04-01T00:00:00Z","doi":"10.1002/hipo.23144","date_updated":"2025-05-22T11:13:25Z","type":"journal_article","status":"public","publisher":"Wiley","intvolume":"        30","isi":1,"article_type":"original","user_id":"9947682f-b9fa-11ee-9c4a-b3ffaafe6614","_id":"6796","page":"302-313","year":"2020","pmid":1,"author":[{"first_name":"Federico","full_name":"Stella, Federico","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","last_name":"Stella","orcid":"0000-0001-9439-3148"},{"last_name":"Urdapilleta","first_name":"Eugenio","full_name":"Urdapilleta, Eugenio"},{"first_name":"Yifan","full_name":"Luo, Yifan","last_name":"Luo"},{"first_name":"Alessandro","last_name":"Treves","full_name":"Treves, Alessandro"}],"external_id":{"pmid":["31339190"],"isi":["000477299600001"]},"file":[{"file_size":2370658,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:40Z","access_level":"open_access","relation":"main_file","date_created":"2019-08-12T07:53:33Z","creator":"dernst","checksum":"7b54d22bfbfc0d1188a9ea24d985bfb2","file_id":"6800","file_name":"2019_Hippocampus_Stella.pdf"}],"department":[{"_id":"JoCs"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"title":"Partial coherence and frustration in self-organizing spherical grids","has_accepted_license":"1","publication_status":"published","scopus_import":"1","issue":"4","publication":"Hippocampus","abstract":[{"text":"Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses.","lang":"eng"}],"day":"01","ddc":["570"],"oa_version":"Published Version"},{"author":[{"full_name":"Jahr, Wiebke","first_name":"Wiebke","last_name":"Jahr","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2340-7431","full_name":"Velicky, Philipp","first_name":"Philipp","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","last_name":"Velicky"},{"orcid":"0000-0001-8559-3973","first_name":"Johann G","full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl"}],"external_id":{"pmid":["31344404"],"isi":["000525860400005"]},"department":[{"_id":"JoDa"}],"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/"}],"title":"Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens","scopus_import":"1","publication_status":"published","day":"01","abstract":[{"text":"Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions.","lang":"eng"}],"project":[{"grant_number":"I03600","name":"Optical control of synaptic function via adhesion molecules","call_identifier":"FWF","_id":"265CB4D0-B435-11E9-9278-68D0E5697425"},{"name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration","_id":"2668BFA0-B435-11E9-9278-68D0E5697425","grant_number":"LT00057"}],"issue":"3","publication":"Methods","oa_version":"Submitted Version","quality_controlled":"1","publication_identifier":{"issn":["1046-2023"]},"language":[{"iso":"eng"}],"date_created":"2019-08-12T16:36:32Z","citation":{"ista":"Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3), 27–41.","short":"W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.","ama":"Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. <i>Methods</i>. 2020;174(3):27-41. doi:<a href=\"https://doi.org/10.1016/j.ymeth.2019.07.019\">10.1016/j.ymeth.2019.07.019</a>","chicago":"Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” <i>Methods</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.ymeth.2019.07.019\">https://doi.org/10.1016/j.ymeth.2019.07.019</a>.","apa":"Jahr, W., Velicky, P., &#38; Danzl, J. G. (2020). Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. <i>Methods</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ymeth.2019.07.019\">https://doi.org/10.1016/j.ymeth.2019.07.019</a>","ieee":"W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” <i>Methods</i>, vol. 174, no. 3. Elsevier, pp. 27–41, 2020.","mla":"Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” <i>Methods</i>, vol. 174, no. 3, Elsevier, 2020, pp. 27–41, doi:<a href=\"https://doi.org/10.1016/j.ymeth.2019.07.019\">10.1016/j.ymeth.2019.07.019</a>."},"oa":1,"volume":174,"article_processing_charge":"No","month":"03","date_published":"2020-03-01T00:00:00Z","doi":"10.1016/j.ymeth.2019.07.019","intvolume":"       174","date_updated":"2025-04-14T09:39:25Z","status":"public","publisher":"Elsevier","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"article_type":"original","pmid":1,"year":"2020","_id":"6808","page":"27-41"},{"date_published":"2020-06-01T00:00:00Z","citation":{"ama":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. <i>Communications in Mathematical Physics</i>. 2020;376:1311-1395. doi:<a href=\"https://doi.org/10.1007/s00220-019-03555-9\">10.1007/s00220-019-03555-9</a>","chicago":"Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” <i>Communications in Mathematical Physics</i>. Springer, 2020. <a href=\"https://doi.org/10.1007/s00220-019-03555-9\">https://doi.org/10.1007/s00220-019-03555-9</a>.","mla":"Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” <i>Communications in Mathematical Physics</i>, vol. 376, Springer, 2020, pp. 1311–95, doi:<a href=\"https://doi.org/10.1007/s00220-019-03555-9\">10.1007/s00220-019-03555-9</a>.","ieee":"C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime,” <i>Communications in Mathematical Physics</i>, vol. 376. Springer, pp. 1311–1395, 2020.","apa":"Boccato, C., Brennecke, C., Cenatiempo, S., &#38; Schlein, B. (2020). Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-019-03555-9\">https://doi.org/10.1007/s00220-019-03555-9</a>","short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical Physics 376 (2020) 1311–1395.","ista":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 376, 1311–1395."},"oa":1,"volume":376,"article_processing_charge":"No","month":"06","arxiv":1,"date_created":"2019-09-24T17:30:59Z","quality_controlled":"1","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"language":[{"iso":"eng"}],"year":"2020","_id":"6906","page":"1311-1395","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","isi":1,"article_type":"original","intvolume":"       376","date_updated":"2025-04-14T07:27:00Z","type":"journal_article","publisher":"Springer","status":"public","doi":"10.1007/s00220-019-03555-9","acknowledgement":"We would like to thank P. T. Nam and R. Seiringer for several useful discussions and\r\nfor suggesting us to use the localization techniques from [9]. C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges support from the NCCR SwissMAP and from the Swiss National Foundation of Science (Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties of Bose–Einstein condensates”.","title":"Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime","department":[{"_id":"RoSe"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1812.03086"}],"external_id":{"isi":["000536053300012"],"arxiv":["1812.03086"]},"author":[{"last_name":"Boccato","id":"342E7E22-F248-11E8-B48F-1D18A9856A87","first_name":"Chiara","full_name":"Boccato, Chiara"},{"full_name":"Brennecke, Christian","last_name":"Brennecke","first_name":"Christian"},{"full_name":"Cenatiempo, Serena","first_name":"Serena","last_name":"Cenatiempo"},{"full_name":"Schlein, Benjamin","last_name":"Schlein","first_name":"Benjamin"}],"oa_version":"Preprint","ec_funded":1,"abstract":[{"text":"We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime. We show that low-energy states exhibit complete Bose–Einstein condensation with an optimal bound on the number of orthogonal excitations. This extends recent results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing the assumption of small interaction potential.","lang":"eng"}],"day":"01","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"publication":"Communications in Mathematical Physics","scopus_import":"1","publication_status":"published"}]