[{"acknowledgement":"R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40). M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. This research work is partially drawn from the PhD dissertation of R.H.","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936"}],"author":[{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"file_date_updated":"2022-01-26T07:36:03Z","issue":"9","page":"7657-7666","abstract":[{"text":"We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.","lang":"eng"}],"conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","location":"Virtual","start_date":"2021-02-02","end_date":"2021-02-09"},"date_updated":"2022-05-24T06:36:54Z","type":"conference","intvolume":"        35","ddc":["000"],"publication_identifier":{"isbn":["978-1-57735-866-4"],"issn":["2159-5399"],"eissn":["2374-3468"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"AAAI Press","file":[{"checksum":"0f06995fba06dbcfa7ed965fc66027ff","date_updated":"2022-01-26T07:36:03Z","relation":"main_file","access_level":"open_access","creator":"mlechner","file_id":"10678","success":1,"file_size":4302669,"file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","date_created":"2022-01-26T07:36:03Z","content_type":"application/pdf"}],"title":"Liquid time-constant networks","_id":"10671","date_published":"2021-05-28T00:00:00Z","date_created":"2022-01-25T15:48:36Z","publication_status":"published","citation":{"ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:7657-7666.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2021). Liquid time-constant networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.","mla":"Hasani, Ramin, et al. “Liquid Time-Constant Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66.","chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:7657–66. AAAI Press, 2021.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666."},"oa_version":"Published Version","quality_controlled":"1","has_accepted_license":"1","external_id":{"arxiv":["2006.04439"]},"month":"05","language":[{"iso":"eng"}],"status":"public","year":"2021","article_processing_charge":"No","day":"28","alternative_title":["Technical Tracks"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"arxiv":1,"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":35,"oa":1},{"volume":17,"oa":1,"isi":1,"arxiv":1,"publication":"Logical Methods in Computer Science","keyword":["computer science","computer science and game theory","logic in computer science"],"project":[{"grant_number":"M02369","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"doi":"10.23638/LMCS-17(1:10)2021","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"03","year":"2021","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","month":"02","has_accepted_license":"1","external_id":{"arxiv":["1905.03588"],"isi":["000658724600010"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","date_created":"2022-01-25T16:32:13Z","publication_status":"published","citation":{"ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1. International Federation for Computational Logic, p. 10:1-10:23, 2021.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. 2021;17(1):10:1-10:23. doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>","apa":"Aghajohari, M., Avni, G., &#38; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2021. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>.","mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","ista":"Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23."},"date_published":"2021-02-03T00:00:00Z","_id":"10674","title":"Determinacy in discrete-bidding infinite-duration games","file":[{"date_created":"2022-01-26T08:04:50Z","file_name":"2021_LMCS_AGHAJOHAR.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"b35586a50ed1ca8f44767de116d18d81","date_updated":"2022-01-26T08:04:50Z","success":1,"file_id":"10690","file_size":819878,"creator":"alisjak"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"ToHe"}],"publisher":"International Federation for Computational Logic","publication_identifier":{"eissn":["1860-5974"]},"ddc":["510"],"type":"journal_article","intvolume":"        17","date_updated":"2023-08-17T06:56:42Z","article_type":"original","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets."}],"page":"10:1-10:23","file_date_updated":"2022-01-26T08:04:50Z","issue":"1","author":[{"last_name":"Aghajohari","first_name":"Milad","full_name":"Aghajohari, Milad"},{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).\r\n"},{"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","oa":1,"volume":2,"oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","year":"2021","month":"10","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","alternative_title":["Conference Series"],"day":"01","publisher":"TU Wien Academic Press","department":[{"_id":"ToHe"}],"file":[{"file_id":"10689","file_size":390555,"success":1,"creator":"cchlebak","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","date_updated":"2022-01-26T08:04:29Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2021_FCAD2021_Kragl.pdf","date_created":"2022-01-26T08:04:29Z"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2021-10-01T00:00:00Z","_id":"10688","title":"The Civl verifier","citation":{"ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>.","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>."},"publication_status":"published","date_created":"2022-01-26T08:01:30Z","file_date_updated":"2022-01-26T08:04:29Z","acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","first_name":"Bernhard"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"}],"date_updated":"2022-01-26T08:20:41Z","conference":{"end_date":"2021-10-22","start_date":"2021-10-20","name":"FMCAD: Formal Methods in Computer-Aided Design","location":"Virtual"},"abstract":[{"lang":"eng","text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier."}],"page":"143–152","type":"conference","intvolume":"         2","editor":[{"first_name":"Piskac","full_name":"Ruzica, Piskac","last_name":"Ruzica"},{"full_name":"Whalen, Michael W.","first_name":"Michael W.","last_name":"Whalen"}],"publication_identifier":{"isbn":["978-3-85448-046-4"]},"ddc":["000"]},{"scopus_import":"1","oa_version":"Preprint","external_id":{"arxiv":["2005.06636"]},"quality_controlled":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","year":"2021","month":"01","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"01","doi":"10.1137/1.9781611976465.38","project":[{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","arxiv":1,"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.06636"}],"author":[{"orcid":"0000-0001-5588-8287","first_name":"Guy","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","full_name":"Jecker, Ismael R","first_name":"Ismael R"},{"orcid":"0000-0002-4681-1699","first_name":"Dorde","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","date_updated":"2025-07-14T09:10:12Z","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Virtual","start_date":"2021-01-10","end_date":"2021-01-13"},"abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}],"page":"617-636","type":"conference","editor":[{"full_name":"Marx, Dániel","first_name":"Dániel","last_name":"Marx"}],"publication_identifier":{"isbn":["978-1-61197-646-5"]},"publisher":"Society for Industrial and Applied Mathematics","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"date_published":"2021-01-01T00:00:00Z","_id":"10694","title":"Infinite-duration all-pay bidding games","ec_funded":1,"publication_status":"published","citation":{"apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>","ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636."},"date_created":"2022-01-27T12:11:23Z"},{"doi":"10.1112/s0010437x21007351","keyword":["Algebra and Number Theory"],"publication":"Compositio Mathematica","arxiv":1,"isi":1,"oa":1,"volume":157,"oa_version":"Preprint","quality_controlled":"1","external_id":{"arxiv":["1909.03266"],"isi":["000667289300001"]},"month":"06","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2021","status":"public","day":"28","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Cambridge University Press","department":[{"_id":"TiBr"}],"title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","_id":"10711","date_published":"2021-06-28T00:00:00Z","citation":{"mla":"Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>, vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>.","chicago":"Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.” <i>Compositio Mathematica</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>.","short":"P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021) 1610–1651.","ama":"Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. 2021;157(7):1610-1651. doi:<a href=\"https://doi.org/10.1112/s0010437x21007351\">10.1112/s0010437x21007351</a>","ieee":"P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum of partial sums of Kloosterman sums and other trace functions,” <i>Compositio Mathematica</i>, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.","apa":"Autissier, P., Bonolis, D., &#38; Lamzouri, Y. (2021). The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>","ista":"Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica. 157(7), 1610–1651."},"publication_status":"published","date_created":"2022-02-01T08:10:43Z","acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions.","author":[{"first_name":"Pascal","full_name":"Autissier, Pascal","last_name":"Autissier"},{"first_name":"Dante","full_name":"Bonolis, Dante","id":"6A459894-5FDD-11E9-AF35-BB24E6697425","last_name":"Bonolis"},{"last_name":"Lamzouri","full_name":"Lamzouri, Youness","first_name":"Youness"}],"main_file_link":[{"url":"https://arxiv.org/abs/1909.03266","open_access":"1"}],"issue":"7","page":"1610-1651","abstract":[{"lang":"eng","text":"In this paper, we investigate the distribution of the maximum of partial sums of families of  m -periodic complex-valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near-optimal range. Our results apply to partial sums of Kloosterman sums and other families of  ℓ -adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are able to construct families of  m -periodic complex-valued functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality is sharp."}],"article_type":"original","date_updated":"2023-08-17T06:59:16Z","intvolume":"       157","type":"journal_article","publication_identifier":{"eissn":["1570-5846"],"issn":["0010-437X"]}},{"date_updated":"2023-10-17T11:26:45Z","page":"2079-2100","abstract":[{"text":"We prove an adiabatic theorem for the Landau–Pekar equations. This allows us to derive new results on the accuracy of their use as effective equations for the time evolution generated by the Fröhlich Hamiltonian with large coupling constant α. In particular, we show that the time evolution of Pekar product states with coherent phonon field and the electron being trapped by the phonons is well approximated by the Landau–Pekar equations until times short compared to α2.","lang":"eng"}],"article_type":"original","issue":"7","author":[{"id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","last_name":"Leopold","orcid":"0000-0002-0495-6822","first_name":"Nikolai K","full_name":"Leopold, Nikolai K"},{"full_name":"Rademacher, Simone Anna Elvira","first_name":"Simone Anna Elvira","orcid":"0000-0001-5059-4466","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher"},{"first_name":"Benjamin","full_name":"Schlein, Benjamin","last_name":"Schlein"},{"first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"}],"acknowledgement":"N. L. and R. S. gratefully acknowledge financial support by the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for stimulating discussions about the time-evolution of a polaron.\r\n","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.12532"}],"publication_identifier":{"issn":["2157-5045"],"eissn":["1948-206X"]},"intvolume":"        14","type":"journal_article","publisher":"Mathematical Sciences Publishers","department":[{"_id":"RoSe"}],"publication_status":"published","citation":{"ista":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021.  The Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.","ama":"Leopold NK, Rademacher SAE, Schlein B, Seiringer R.  The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. 2021;14(7):2079-2100. doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>","ieee":"N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar equations: Adiabatic theorem and accuracy,” <i>Analysis and PDE</i>, vol. 14, no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.","apa":"Leopold, N. K., Rademacher, S. A. E., Schlein, B., &#38; Seiringer, R. (2021).  The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>","chicago":"Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and Robert Seiringer. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>. Mathematical Sciences Publishers, 2021. <a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">https://doi.org/10.2140/APDE.2021.14.2079</a>.","mla":"Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.” <i>Analysis and PDE</i>, vol. 14, no. 7, Mathematical Sciences Publishers, 2021, pp. 2079–100, doi:<a href=\"https://doi.org/10.2140/APDE.2021.14.2079\">10.2140/APDE.2021.14.2079</a>.","short":"N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE 14 (2021) 2079–2100."},"date_created":"2022-02-06T23:01:33Z","date_published":"2021-11-10T00:00:00Z","_id":"10738","title":" The Landau–Pekar equations: Adiabatic theorem and accuracy","ec_funded":1,"external_id":{"isi":["000733976600004"],"arxiv":["1904.12532"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"10","article_processing_charge":"No","year":"2021","status":"public","language":[{"iso":"eng"}],"month":"11","isi":1,"publication":"Analysis and PDE","arxiv":1,"doi":"10.2140/APDE.2021.14.2079","project":[{"call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"}],"oa":1,"volume":14},{"citation":{"ista":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","apa":"Rzadkowski, W., Lemeshko, M., &#38; Mentink, J. H. (n.d.). Artificial neural network states for non-additive systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>","ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. .","ama":"Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for non-additive systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","mla":"Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2105.15193\">10.48550/arXiv.2105.15193</a>.","chicago":"Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial Neural Network States for Non-Additive Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2105.15193\">https://doi.org/10.48550/arXiv.2105.15193</a>."},"publication_status":"submitted","date_created":"2022-02-17T11:18:57Z","oa":1,"ec_funded":1,"title":"Artificial neural network states for non-additive systems","date_published":"2021-05-31T00:00:00Z","_id":"10762","publication":"arXiv","arxiv":1,"doi":"10.48550/arXiv.2105.15193","department":[{"_id":"MiLe"}],"project":[{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"day":"31","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2021","status":"public","type":"preprint","page":"2105.15193","abstract":[{"lang":"eng","text":"Methods inspired from machine learning have recently attracted great interest in the computational study of quantum many-particle systems. So far, however, it has proven challenging to deal with microscopic models in which the total number of particles is not conserved. To address this issue, we propose a new variant of neural network states, which we term neural coherent states. Taking the Fröhlich impurity model as a case study, we show that neural coherent states can learn the ground state of non-additive systems very well. In particular, we observe substantial improvement over the standard coherent state estimates in the most challenging intermediate coupling regime. Our approach is generic and does not assume specific details of the system, suggesting wide applications."}],"external_id":{"arxiv":["2105.15193"]},"date_updated":"2023-09-07T13:44:16Z","acknowledgement":"We acknowledge fruitful discussions with Giacomo Bighin, Giammarco Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy of Sciences and has received funding from the EU Horizon 2020 programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences, FOM and STW.","author":[{"last_name":"Rzadkowski","id":"48C55298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech","first_name":"Wojciech"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko"},{"first_name":"Johan H.","full_name":"Mentink, Johan H.","last_name":"Mentink"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2105.15193"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10759"}]}},{"article_processing_charge":"No","type":"preprint","language":[{"iso":"eng"}],"status":"public","year":"2021","month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"07","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10799"}]},"author":[{"full_name":"Konstantinov, Nikola H","first_name":"Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","last_name":"Konstantinov"},{"full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0002-4561-241X","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.05996"}],"external_id":{"arxiv":["2102.05996"]},"date_updated":"2023-09-07T13:42:08Z","abstract":[{"text":"Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality.","lang":"eng"}],"article_number":"2102.05996","date_published":"2021-06-07T00:00:00Z","_id":"10803","oa":1,"title":"Fairness through regularization for learning to rank","citation":{"apa":"Konstantinov, N. H., &#38; Lampert, C. (n.d.). Fairness through regularization for learning to rank. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>","ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. .","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","chicago":"Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>.","mla":"Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” <i>ArXiv</i>, 2102.05996, doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>.","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996."},"publication_status":"submitted","date_created":"2022-02-28T14:13:59Z","doi":"10.48550/arXiv.2102.05996","department":[{"_id":"ChLa"}],"publication":"arXiv","arxiv":1},{"volume":1,"oa":1,"publication":"JACS Au","project":[{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"},{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"keyword":["general medicine"],"doi":"10.1021/jacsau.1c00349","day":"22","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"11","year":"2021","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","related_material":{"link":[{"url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr","relation":"earlier_version"}],"record":[{"id":"12885","status":"public","relation":"dissertation_contains"}]},"date_created":"2022-03-02T15:24:16Z","publication_status":"published","citation":{"ista":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.","apa":"Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca, J., De Roo, J., &#38; Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>","ama":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. 2021;1(11):1898-1903. doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>","ieee":"M. Calcabrini <i>et al.</i>, “Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate,” <i>JACS Au</i>, vol. 1, no. 11. American Chemical Society, pp. 1898–1903, 2021.","short":"M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca, J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.","mla":"Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>, vol. 1, no. 11, American Chemical Society, 2021, pp. 1898–903, doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>.","chicago":"Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” <i>JACS Au</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>."},"title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","ec_funded":1,"_id":"10806","date_published":"2021-11-22T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_id":"10807","success":1,"file_size":1257973,"creator":"cchlebak","access_level":"open_access","relation":"main_file","date_updated":"2022-03-02T15:33:18Z","checksum":"1c66a35369e911312a359111420318a9","content_type":"application/pdf","date_created":"2022-03-02T15:33:18Z","file_name":"2021_JACSAu_Calcabrini.pdf"}],"department":[{"_id":"MaIb"}],"publisher":"American Chemical Society","ddc":["540"],"publication_identifier":{"eissn":["2691-3704"],"issn":["2691-3704"]},"intvolume":"         1","type":"journal_article","page":"1898-1903","abstract":[{"text":"Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.","lang":"eng"}],"article_type":"original","date_updated":"2023-05-05T08:45:36Z","acknowledgement":"This work was financially supported by IST Austria and the Werner Siemens Foundation. M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. The work was also financially supported by University of Basel, SNSF NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects.","author":[{"full_name":"Calcabrini, Mariano","first_name":"Mariano","last_name":"Calcabrini","id":"45D7531A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dietger","full_name":"Van den Eynden, Dietger","last_name":"Van den Eynden"},{"first_name":"Sergi","full_name":"Sanchez Ribot, Sergi","id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a","last_name":"Sanchez Ribot"},{"last_name":"Pokratath","first_name":"Rohan","full_name":"Pokratath, Rohan"},{"last_name":"Llorca","full_name":"Llorca, Jordi","first_name":"Jordi"},{"last_name":"De Roo","full_name":"De Roo, Jonathan","first_name":"Jonathan"},{"orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez"}],"file_date_updated":"2022-03-02T15:33:18Z","issue":"11"},{"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"type":"journal_article","intvolume":"       371","abstract":[{"text":"Thermoelectric materials are engines that convert heat into an electrical current. Intuitively, the efficiency of this process depends on how many electrons (charge carriers) can move and how easily they do so, how much energy those moving electrons transport, and how easily the temperature gradient is maintained. In terms of material properties, an excellent thermoelectric material requires a high electrical conductivity σ, a high Seebeck coefficient S (a measure of the induced thermoelectric voltage as a function of temperature gradient), and a low thermal conductivity κ. The challenge is that these three properties are strongly interrelated in a conflicting manner (1). On page 722 of this issue, Roychowdhury et al. (2) have found a way to partially break these ties in silver antimony telluride (AgSbTe2) with the addition of cadmium (Cd) cations, which increase the ordering in this inherently disordered thermoelectric material.","lang":"eng"}],"page":"678-679","article_type":"letter_note","date_updated":"2023-08-17T07:00:35Z","author":[{"last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","first_name":"Yu","full_name":"Liu, Yu"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"issue":"6530","date_created":"2022-03-03T09:51:48Z","citation":{"short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.","chicago":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>.","mla":"Liu, Yu, and Maria Ibáñez. “Tidying up the Mess.” <i>Science</i>, vol. 371, no. 6530, American Association for the Advancement of Science, 2021, pp. 678–79, doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>.","apa":"Liu, Y., &#38; Ibáñez, M. (2021). Tidying up the mess. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abg0886\">https://doi.org/10.1126/science.abg0886</a>","ieee":"Y. Liu and M. Ibáñez, “Tidying up the mess,” <i>Science</i>, vol. 371, no. 6530. American Association for the Advancement of Science, pp. 678–679, 2021.","ama":"Liu Y, Ibáñez M. Tidying up the mess. <i>Science</i>. 2021;371(6530):678-679. doi:<a href=\"https://doi.org/10.1126/science.abg0886\">10.1126/science.abg0886</a>","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679."},"publication_status":"published","title":"Tidying up the mess","_id":"10809","date_published":"2021-02-12T00:00:00Z","department":[{"_id":"MaIb"}],"publisher":"American Association for the Advancement of Science","pmid":1,"day":"12","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"02","year":"2021","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","quality_controlled":"1","external_id":{"pmid":["33574201"],"isi":["000617551600027"]},"oa_version":"None","scopus_import":"1","volume":371,"publication":"Science","isi":1,"keyword":["multidisciplinary"],"doi":"10.1126/science.abg0886"},{"has_accepted_license":"1","quality_controlled":"1","related_material":{"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/spot-the-difference/"}],"record":[{"relation":"software","id":"10110","status":"public"}]},"scopus_import":"1","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"16","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2021","status":"public","month":"12","publication":"Nature Computational Science","acknowledged_ssus":[{"_id":"SSU"}],"doi":"10.1038/s43588-021-00157-1","project":[{"call_identifier":"H2020","grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse"},{"grant_number":"Z00312","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425"}],"keyword":["general medicine"],"oa":1,"volume":1,"date_updated":"2023-08-10T22:30:10Z","abstract":[{"text":"Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks.","lang":"eng"}],"article_type":"original","page":"830-842","issue":"12","file_date_updated":"2022-06-18T22:30:03Z","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/647800"}],"acknowledgement":"We thank A. Aertsen, N. Kopell, W. Maass, A. Roth, F. Stella and T. Vogels for critically reading earlier versions of the manuscript. We are grateful to F. Marr and C. Altmutter for excellent technical assistance, E. Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria for efficient support. Finally, we thank T. Carnevale, L. Erdös, M. Hines, D. Nykamp and D. Schröder for useful discussions, and R. Friedrich and S. Wiechert for sharing unpublished data. This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692, P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award to P.J. and P 31815 to S.J.G.).","author":[{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","last_name":"Guzmán","full_name":"Guzmán, José","first_name":"José","orcid":"0000-0003-2209-5242"},{"last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","first_name":"Alois"},{"last_name":"Espinoza Martinez","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4710-2082","first_name":"Claudia ","full_name":"Espinoza Martinez, Claudia "},{"last_name":"Zhang","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Xiaomin","first_name":"Xiaomin"},{"id":"4952F31E-F248-11E8-B48F-1D18A9856A87","last_name":"Suter","orcid":"0000-0002-9885-6936","first_name":"Benjamin","full_name":"Suter, Benjamin"},{"first_name":"Peter M","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas"}],"publication_identifier":{"issn":["2662-8457"]},"ddc":["610"],"intvolume":"         1","type":"journal_article","file":[{"checksum":"9fec5b667909ef52be96d502e4f8c2ae","date_updated":"2022-06-18T22:30:03Z","access_level":"open_access","embargo":"2022-06-17","relation":"main_file","file_size":1699466,"file_id":"11430","creator":"patrickd","file_name":"Guzmanetal2021.pdf","date_created":"2022-06-02T12:51:07Z","content_type":"application/pdf"},{"embargo":"2022-06-17","relation":"supplementary_material","access_level":"open_access","date_updated":"2022-06-18T22:30:03Z","checksum":"52a005b13a114e3c3a28fa6bbe8b1a8d","creator":"patrickd","file_id":"11431","file_size":3005651,"date_created":"2022-06-02T12:53:47Z","file_name":"Guzmanetal2021Suppl.pdf","content_type":"application/pdf","title":"Supplementary Material"}],"publisher":"Springer Nature","department":[{"_id":"PeJo"}],"citation":{"mla":"Guzmán, José, et al. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” <i>Nature Computational Science</i>, vol. 1, no. 12, Springer Nature, 2021, pp. 830–42, doi:<a href=\"https://doi.org/10.1038/s43588-021-00157-1\">10.1038/s43588-021-00157-1</a>.","chicago":"Guzmán, José, Alois Schlögl, Claudia  Espinoza Martinez, Xiaomin Zhang, Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3 Network.” <i>Nature Computational Science</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s43588-021-00157-1\">https://doi.org/10.1038/s43588-021-00157-1</a>.","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, Nature Computational Science 1 (2021) 830–842.","ieee":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M. Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network,” <i>Nature Computational Science</i>, vol. 1, no. 12. Springer Nature, pp. 830–842, 2021.","ama":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. <i>Nature Computational Science</i>. 2021;1(12):830-842. doi:<a href=\"https://doi.org/10.1038/s43588-021-00157-1\">10.1038/s43588-021-00157-1</a>","apa":"Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., &#38; Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. <i>Nature Computational Science</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s43588-021-00157-1\">https://doi.org/10.1038/s43588-021-00157-1</a>","ista":"Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021. How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network. Nature Computational Science. 1(12), 830–842."},"publication_status":"published","date_created":"2022-03-04T08:32:36Z","date_published":"2021-12-16T00:00:00Z","_id":"10816","ec_funded":1,"title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network"},{"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","date_created":"2021-05-25T15:08:49Z","file_name":"2021_TVCG_Feng.pdf","file_id":"9427","success":1,"file_size":6183002,"creator":"kschuh","access_level":"open_access","relation":"main_file","date_updated":"2021-05-25T15:08:49Z","checksum":"a78e6ac94e33ade4ffaea66943d5f7dc"}],"publisher":"IEEE","department":[{"_id":"BeBi"}],"publication_status":"published","citation":{"ista":"Feng X, Liu J, Wang H, Yang Y, Bao H, Bickel B, Xu W. 2021. Computational design of skinned Quad-Robots. IEEE Transactions on Visualization and Computer Graphics. 27(6), 2881–2895.","ama":"Feng X, Liu J, Wang H, et al. Computational design of skinned Quad-Robots. <i>IEEE Transactions on Visualization and Computer Graphics</i>. 2021;27(6). doi:<a href=\"https://doi.org/10.1109/TVCG.2019.2957218\">10.1109/TVCG.2019.2957218</a>","ieee":"X. Feng <i>et al.</i>, “Computational design of skinned Quad-Robots,” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 27, no. 6. IEEE, 2021.","apa":"Feng, X., Liu, J., Wang, H., Yang, Y., Bao, H., Bickel, B., &#38; Xu, W. (2021). Computational design of skinned Quad-Robots. <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2019.2957218\">https://doi.org/10.1109/TVCG.2019.2957218</a>","mla":"Feng, Xudong, et al. “Computational Design of Skinned Quad-Robots.” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 27, no. 6, 2881–2895, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/TVCG.2019.2957218\">10.1109/TVCG.2019.2957218</a>.","chicago":"Feng, Xudong, Jiafeng Liu, Huamin Wang, Yin Yang, Hujun Bao, Bernd Bickel, and Weiwei Xu. “Computational Design of Skinned Quad-Robots.” <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/TVCG.2019.2957218\">https://doi.org/10.1109/TVCG.2019.2957218</a>.","short":"X. Feng, J. Liu, H. Wang, Y. Yang, H. Bao, B. Bickel, W. Xu, IEEE Transactions on Visualization and Computer Graphics 27 (2021)."},"date_created":"2021-05-23T22:01:42Z","title":"Computational design of skinned Quad-Robots","ec_funded":1,"_id":"9408","date_published":"2021-06-01T00:00:00Z","article_number":"2881-2895","abstract":[{"text":"We present a computational design system that assists users to model, optimize, and fabricate quad-robots with soft skins. Our system addresses the challenging task of predicting their physical behavior by fully integrating the multibody dynamics of the mechanical skeleton and the elastic behavior of the soft skin. The developed motion control strategy uses an alternating optimization scheme to avoid expensive full space time-optimization, interleaving space-time optimization for the skeleton, and frame-by-frame optimization for the full dynamics. The output are motor torques to drive the robot to achieve a user prescribed motion trajectory. We also provide a collection of convenient engineering tools and empirical manufacturing guidance to support the fabrication of the designed quad-robot. We validate the feasibility of designs generated with our system through physics simulations and with a physically-fabricated prototype.","lang":"eng"}],"date_updated":"2023-08-08T13:45:46Z","acknowledgement":"The authors would like to thank anonymous reviewers for their constructive comments. Weiwei Xu is partially supported by Zhejiang Lab. Yin Yang is partially spported by NSF under Grant Nos. CHS 1845024 and 1717972. Weiwei Xu and Hujun Bao are supported by Fundamental Research Funds for the Central Universities. This project has received funding from the European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme (Grant agreement No 715767).","author":[{"full_name":"Feng, Xudong","first_name":"Xudong","last_name":"Feng"},{"last_name":"Liu","full_name":"Liu, Jiafeng","first_name":"Jiafeng"},{"last_name":"Wang","first_name":"Huamin","full_name":"Wang, Huamin"},{"last_name":"Yang","full_name":"Yang, Yin","first_name":"Yin"},{"first_name":"Hujun","full_name":"Bao, Hujun","last_name":"Bao"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd"},{"full_name":"Xu, Weiwei","first_name":"Weiwei","last_name":"Xu"}],"issue":"6","file_date_updated":"2021-05-25T15:08:49Z","ddc":["000"],"publication_identifier":{"eissn":["10772626"],"issn":["19410506"]},"intvolume":"        27","type":"journal_article","publication":"IEEE Transactions on Visualization and Computer Graphics","isi":1,"doi":"10.1109/TVCG.2019.2957218","project":[{"call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"oa":1,"volume":27,"quality_controlled":"1","external_id":{"pmid":["31804937"],"isi":["000649620700009"]},"has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","day":"01","pmid":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"06","article_processing_charge":"No","year":"2021","language":[{"iso":"eng"}],"status":"public"},{"abstract":[{"lang":"eng","text":"Antibiotic concentrations vary dramatically in the body and the environment. Hence, understanding the dynamics of resistance evolution along antibiotic concentration gradients is critical for predicting and slowing the emergence and spread of resistance. While it has been shown that increasing the concentration of an antibiotic slows resistance evolution, how adaptation to one antibiotic concentration correlates with fitness at other points along the gradient has not received much attention. Here, we selected populations of Escherichia coli at several points along a concentration gradient for three different antibiotics, asking how rapidly resistance evolved and whether populations became specialized to the antibiotic concentration they were selected on. Populations selected at higher concentrations evolved resistance more slowly but exhibited equal or higher fitness across the whole gradient. Populations selected at lower concentrations evolved resistance rapidly, but overall fitness in the presence of antibiotics was lower. However, these populations readily adapted to higher concentrations upon subsequent selection. Our results indicate that resistance management strategies must account not only for the rates of resistance evolution but also for the fitness of evolved strains."}],"article_number":"20200913","date_updated":"2025-05-28T11:42:50Z","acknowledgement":"We would like to thank Martin Ackermann, Camilo Barbosa, Nick Barton, Jonathan Bollback, Sebastian Bonhoeffer, Nick Colegrave, Calin Guet, Alex Hall, Sally Otto, Tiago Paixao, Srdjan Sarikas, Hinrich Schulenburg, Marjon de Vos and Michael Whitlock for insightful support.","author":[{"full_name":"Lagator, Mato","first_name":"Mato","last_name":"Lagator","id":"345D25EC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Uecker","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9435-2813","full_name":"Uecker, Hildegard","first_name":"Hildegard"},{"first_name":"Paul","full_name":"Neve, Paul","last_name":"Neve"}],"issue":"5","file_date_updated":"2021-05-25T14:09:03Z","ddc":["570"],"publication_identifier":{"eissn":["1744957X"]},"type":"journal_article","intvolume":"        17","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","file_name":"2021_BiologyLetters_Lagator.pdf","date_created":"2021-05-25T14:09:03Z","creator":"kschuh","file_size":726759,"file_id":"9425","success":1,"checksum":"9c13c1f5af7609c97c741f11d293188a","date_updated":"2021-05-25T14:09:03Z","relation":"main_file","access_level":"open_access"}],"publisher":"Royal Society of London","department":[{"_id":"NiBa"}],"citation":{"ista":"Lagator M, Uecker H, Neve P. 2021. Adaptation at different points along antibiotic concentration gradients. Biology letters. 17(5), 20200913.","ama":"Lagator M, Uecker H, Neve P. Adaptation at different points along antibiotic concentration gradients. <i>Biology letters</i>. 2021;17(5). doi:<a href=\"https://doi.org/10.1098/rsbl.2020.0913\">10.1098/rsbl.2020.0913</a>","ieee":"M. Lagator, H. Uecker, and P. Neve, “Adaptation at different points along antibiotic concentration gradients,” <i>Biology letters</i>, vol. 17, no. 5. Royal Society of London, 2021.","apa":"Lagator, M., Uecker, H., &#38; Neve, P. (2021). Adaptation at different points along antibiotic concentration gradients. <i>Biology Letters</i>. Royal Society of London. <a href=\"https://doi.org/10.1098/rsbl.2020.0913\">https://doi.org/10.1098/rsbl.2020.0913</a>","mla":"Lagator, Mato, et al. “Adaptation at Different Points along Antibiotic Concentration Gradients.” <i>Biology Letters</i>, vol. 17, no. 5, 20200913, Royal Society of London, 2021, doi:<a href=\"https://doi.org/10.1098/rsbl.2020.0913\">10.1098/rsbl.2020.0913</a>.","chicago":"Lagator, Mato, Hildegard Uecker, and Paul Neve. “Adaptation at Different Points along Antibiotic Concentration Gradients.” <i>Biology Letters</i>. Royal Society of London, 2021. <a href=\"https://doi.org/10.1098/rsbl.2020.0913\">https://doi.org/10.1098/rsbl.2020.0913</a>.","short":"M. Lagator, H. Uecker, P. Neve, Biology Letters 17 (2021)."},"publication_status":"published","date_created":"2021-05-23T22:01:43Z","ec_funded":1,"title":"Adaptation at different points along antibiotic concentration gradients","date_published":"2021-05-12T00:00:00Z","_id":"9410","quality_controlled":"1","external_id":{"isi":["000651501400001"],"pmid":[" 33975485"]},"has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","day":"12","pmid":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"05","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","year":"2021","publication":"Biology letters","isi":1,"doi":"10.1098/rsbl.2020.0913","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152"}],"oa":1,"volume":17},{"_id":"9411","date_published":"2021-04-24T00:00:00Z","title":"Regimes of motion of magnetocapillary swimmers","date_created":"2021-05-23T22:01:44Z","publication_status":"published","citation":{"ista":"Sukhov A, Hubert M, Grosjean GM, Trosman O, Ziegler S, Collard Y, Vandewalle N, Smith AS, Harting J. 2021. Regimes of motion of magnetocapillary swimmers. European Physical Journal E. 44(4), 59.","apa":"Sukhov, A., Hubert, M., Grosjean, G. M., Trosman, O., Ziegler, S., Collard, Y., … Harting, J. (2021). Regimes of motion of magnetocapillary swimmers. <i>European Physical Journal E</i>. Springer. <a href=\"https://doi.org/10.1140/epje/s10189-021-00065-2\">https://doi.org/10.1140/epje/s10189-021-00065-2</a>","ieee":"A. Sukhov <i>et al.</i>, “Regimes of motion of magnetocapillary swimmers,” <i>European Physical Journal E</i>, vol. 44, no. 4. Springer, 2021.","ama":"Sukhov A, Hubert M, Grosjean GM, et al. Regimes of motion of magnetocapillary swimmers. <i>European Physical Journal E</i>. 2021;44(4). doi:<a href=\"https://doi.org/10.1140/epje/s10189-021-00065-2\">10.1140/epje/s10189-021-00065-2</a>","short":"A. Sukhov, M. Hubert, G.M. Grosjean, O. Trosman, S. Ziegler, Y. Collard, N. Vandewalle, A.S. Smith, J. Harting, European Physical Journal E 44 (2021).","chicago":"Sukhov, Alexander, Maxime Hubert, Galien M Grosjean, Oleg Trosman, Sebastian Ziegler, Ylona Collard, Nicolas Vandewalle, Ana Sunčana Smith, and Jens Harting. “Regimes of Motion of Magnetocapillary Swimmers.” <i>European Physical Journal E</i>. Springer, 2021. <a href=\"https://doi.org/10.1140/epje/s10189-021-00065-2\">https://doi.org/10.1140/epje/s10189-021-00065-2</a>.","mla":"Sukhov, Alexander, et al. “Regimes of Motion of Magnetocapillary Swimmers.” <i>European Physical Journal E</i>, vol. 44, no. 4, 59, Springer, 2021, doi:<a href=\"https://doi.org/10.1140/epje/s10189-021-00065-2\">10.1140/epje/s10189-021-00065-2</a>."},"department":[{"_id":"ScWa"}],"publisher":"Springer","file":[{"creator":"kschuh","file_id":"9422","file_size":2507870,"success":1,"checksum":"0ef342d011afbe3c5cb058fda9a3f395","date_updated":"2021-05-25T11:32:14Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2021_EPJE_Sukhov.pdf","date_created":"2021-05-25T11:32:14Z"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"        44","type":"journal_article","publication_identifier":{"issn":["12928941"],"eissn":["1292895X"]},"ddc":["530"],"file_date_updated":"2021-05-25T11:32:14Z","issue":"4","author":[{"first_name":"Alexander","full_name":"Sukhov, Alexander","last_name":"Sukhov"},{"last_name":"Hubert","first_name":"Maxime","full_name":"Hubert, Maxime"},{"first_name":"Galien M","full_name":"Grosjean, Galien M","orcid":"0000-0001-5154-417X","last_name":"Grosjean","id":"0C5FDA4A-9CF6-11E9-8939-FF05E6697425"},{"full_name":"Trosman, Oleg","first_name":"Oleg","last_name":"Trosman"},{"full_name":"Ziegler, Sebastian","first_name":"Sebastian","last_name":"Ziegler"},{"last_name":"Collard","first_name":"Ylona","full_name":"Collard, Ylona"},{"last_name":"Vandewalle","full_name":"Vandewalle, Nicolas","first_name":"Nicolas"},{"last_name":"Smith","full_name":"Smith, Ana Sunčana","first_name":"Ana Sunčana"},{"last_name":"Harting","first_name":"Jens","full_name":"Harting, Jens"}],"acknowledgement":"This work was financially supported by the DFG Priority Programme SPP 1726 “Microswimmers–From Single Particle Motion to Collective Behaviour” (HA 4382/5-1). We further acknowledge the Jülich Supercomputing Centre (JSC) and the High Performance Computing Centre Stuttgart (HLRS) for the allocation of computing time.","date_updated":"2023-08-08T13:36:28Z","article_number":"59","abstract":[{"text":"The dynamics of a triangular magnetocapillary swimmer is studied using the lattice Boltzmann method. We extend on our previous work, which deals with the self-assembly and a specific type of the swimmer motion characterized by the swimmer’s maximum velocity centred around the particle’s inverse viscous time. Here, we identify additional regimes of motion. First, modifying the ratio of surface tension and magnetic forces allows to study the swimmer propagation in the regime of significantly lower frequencies mainly defined by the strength of the magnetocapillary potential. Second, introducing a constant magnetic contribution in each of the particles in addition to their magnetic moment induced by external fields leads to another regime characterized by strong in-plane swimmer reorientations that resemble experimental observations.","lang":"eng"}],"volume":44,"oa":1,"doi":"10.1140/epje/s10189-021-00065-2","isi":1,"publication":"European Physical Journal E","status":"public","year":"2021","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"04","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"24","scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","external_id":{"isi":["000643251300001"]},"quality_controlled":"1"},{"intvolume":"        26","type":"journal_article","ddc":["510"],"publication_identifier":{"eissn":["10836489"]},"author":[{"last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","first_name":"Giorgio"},{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László"},{"first_name":"Dominik J","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2021-05-25T13:24:19Z","abstract":[{"text":"We extend our recent result [22] on the central limit theorem for the linear eigenvalue statistics of non-Hermitian matrices X with independent, identically distributed complex entries to the real symmetry class. We find that the expectation and variance substantially differ from their complex counterparts, reflecting (i) the special spectral symmetry of real matrices onto the real axis; and (ii) the fact that real i.i.d. matrices have many real eigenvalues. Our result generalizes the previously known special cases where either the test function is analytic [49] or the first four moments of the matrix elements match the real Gaussian [59, 44]. The key element of the proof is the analysis of several weakly dependent Dyson Brownian motions (DBMs). The conceptual novelty of the real case compared with [22] is that the correlation structure of the stochastic differentials in each individual DBM is non-trivial, potentially even jeopardising its well-posedness.","lang":"eng"}],"article_number":"24","date_updated":"2023-08-08T13:39:19Z","title":"Fluctuation around the circular law for random matrices with real entries","ec_funded":1,"date_published":"2021-03-23T00:00:00Z","_id":"9412","citation":{"short":"G. Cipolloni, L. Erdös, D.J. Schröder, Electronic Journal of Probability 26 (2021).","mla":"Cipolloni, Giorgio, et al. “Fluctuation around the Circular Law for Random Matrices with Real Entries.” <i>Electronic Journal of Probability</i>, vol. 26, 24, Institute of Mathematical Statistics, 2021, doi:<a href=\"https://doi.org/10.1214/21-EJP591\">10.1214/21-EJP591</a>.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Fluctuation around the Circular Law for Random Matrices with Real Entries.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2021. <a href=\"https://doi.org/10.1214/21-EJP591\">https://doi.org/10.1214/21-EJP591</a>.","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2021). Fluctuation around the circular law for random matrices with real entries. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/21-EJP591\">https://doi.org/10.1214/21-EJP591</a>","ama":"Cipolloni G, Erdös L, Schröder DJ. Fluctuation around the circular law for random matrices with real entries. <i>Electronic Journal of Probability</i>. 2021;26. doi:<a href=\"https://doi.org/10.1214/21-EJP591\">10.1214/21-EJP591</a>","ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Fluctuation around the circular law for random matrices with real entries,” <i>Electronic Journal of Probability</i>, vol. 26. Institute of Mathematical Statistics, 2021.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2021. Fluctuation around the circular law for random matrices with real entries. Electronic Journal of Probability. 26, 24."},"publication_status":"published","date_created":"2021-05-23T22:01:44Z","publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2021-05-25T13:24:19Z","file_name":"2021_EJP_Cipolloni.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"864ab003ad4cffea783f65aa8c2ba69f","date_updated":"2021-05-25T13:24:19Z","creator":"kschuh","success":1,"file_id":"9423","file_size":865148}],"month":"03","article_processing_charge":"No","year":"2021","status":"public","language":[{"iso":"eng"}],"day":"23","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["2002.02438"],"isi":["000641855600001"]},"has_accepted_license":"1","oa":1,"volume":26,"doi":"10.1214/21-EJP591","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"publication":"Electronic Journal of Probability","arxiv":1,"isi":1},{"quality_controlled":"1","external_id":{"isi":["000641574700005"]},"oa_version":"Published Version","scopus_import":"1","day":"19","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"04","article_processing_charge":"No","status":"public","year":"2021","language":[{"iso":"eng"}],"publication":"Molecular Biology of the Cell","isi":1,"doi":"10.1091/MBC.E20-11-0723","project":[{"call_identifier":"H2020","grant_number":"679239","_id":"2595697A-B435-11E9-9278-68D0E5697425","name":"Self-Organization of the Bacterial Cell"},{"name":"Reconstitution of Bacterial Cell Division Using Purified Components","_id":"260D98C8-B435-11E9-9278-68D0E5697425"}],"oa":1,"volume":32,"page":"869-879","abstract":[{"lang":"eng","text":"Microtubule plus-end depolymerization rate is a potentially important target of physiological regulation, but it has been challenging to measure, so its role in spatial organization is poorly understood. Here we apply a method for tracking plus ends based on time difference imaging to measure depolymerization rates in large interphase asters growing in Xenopus egg extract. We observed strong spatial regulation of depolymerization rates, which were higher in the aster interior compared with the periphery, and much less regulation of polymerization or catastrophe rates. We interpret these data in terms of a limiting component model, where aster growth results in lower levels of soluble tubulin and microtubule-associated proteins (MAPs) in the interior cytosol compared with that at the periphery. The steady-state polymer fraction of tubulin was ∼30%, so tubulin is not strongly depleted in the aster interior. We propose that the limiting component for microtubule assembly is a MAP that inhibits depolymerization, and that egg asters are tuned to low microtubule density."}],"article_type":"original","date_updated":"2023-08-08T13:36:02Z","acknowledgement":"The authors thank the members of Mitchison, Brugués, and Jay Gatlin groups (University of Wyoming) for discussions. We thank Heino Andreas (MPI-CBG) for frog maintenance. We thank Nikon for microscopy support at Marine Biological Laboratory (MBL). K.I. was supported by fellowships from the Honjo International Scholarship Foundation and Center of Systems Biology Dresden. F.D. was supported by the DIGGS-BB fellowship provided by the German Research Foundation (DFG). P.C. is supported by a Boehringer Ingelheim Fonds PhD fellowship. J.F.P. was supported by a fellowship from the Fannie and John Hertz Foundation. M.L.’s research is supported by European Research Council (ERC) Grant no. ERC-2015-StG-679239. J.B.’s research is supported by the Human Frontiers Science Program (CDA00074/2014). T.J.M.’s research is supported by National Institutes of Health Grant no. R35GM131753.","author":[{"last_name":"Ishihara","full_name":"Ishihara, Keisuke","first_name":"Keisuke"},{"full_name":"Decker, Franziska","first_name":"Franziska","last_name":"Decker"},{"orcid":"0000-0001-6730-4461","full_name":"Dos Santos Caldas, Paulo R","first_name":"Paulo R","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","last_name":"Dos Santos Caldas"},{"full_name":"Pelletier, James F.","first_name":"James F.","last_name":"Pelletier"},{"last_name":"Loose","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724","first_name":"Martin","full_name":"Loose, Martin"},{"last_name":"Brugués","first_name":"Jan","full_name":"Brugués, Jan"},{"full_name":"Mitchison, Timothy J.","first_name":"Timothy J.","last_name":"Mitchison"}],"main_file_link":[{"url":"https://www.molbiolcell.org/doi/10.1091/mbc.E20-11-0723","open_access":"1"}],"issue":"9","publication_identifier":{"eissn":["1939-4586"],"issn":["1059-1524"]},"intvolume":"        32","type":"journal_article","tmp":{"short":"CC BY-NC-SA (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/3.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)","image":"/images/cc_by_nc_sa.png"},"license":"https://creativecommons.org/licenses/by-nc-sa/3.0/","publisher":"American Society for Cell Biology","department":[{"_id":"MaLo"}],"citation":{"apa":"Ishihara, K., Decker, F., Dos Santos Caldas, P. R., Pelletier, J. F., Loose, M., Brugués, J., &#38; Mitchison, T. J. (2021). Spatial variation of microtubule depolymerization in large asters. <i>Molecular Biology of the Cell</i>. American Society for Cell Biology. <a href=\"https://doi.org/10.1091/MBC.E20-11-0723\">https://doi.org/10.1091/MBC.E20-11-0723</a>","ama":"Ishihara K, Decker F, Dos Santos Caldas PR, et al. Spatial variation of microtubule depolymerization in large asters. <i>Molecular Biology of the Cell</i>. 2021;32(9):869-879. doi:<a href=\"https://doi.org/10.1091/MBC.E20-11-0723\">10.1091/MBC.E20-11-0723</a>","ieee":"K. Ishihara <i>et al.</i>, “Spatial variation of microtubule depolymerization in large asters,” <i>Molecular Biology of the Cell</i>, vol. 32, no. 9. American Society for Cell Biology, pp. 869–879, 2021.","short":"K. Ishihara, F. Decker, P.R. Dos Santos Caldas, J.F. Pelletier, M. Loose, J. Brugués, T.J. Mitchison, Molecular Biology of the Cell 32 (2021) 869–879.","chicago":"Ishihara, Keisuke, Franziska Decker, Paulo R Dos Santos Caldas, James F. Pelletier, Martin Loose, Jan Brugués, and Timothy J. Mitchison. “Spatial Variation of Microtubule Depolymerization in Large Asters.” <i>Molecular Biology of the Cell</i>. American Society for Cell Biology, 2021. <a href=\"https://doi.org/10.1091/MBC.E20-11-0723\">https://doi.org/10.1091/MBC.E20-11-0723</a>.","mla":"Ishihara, Keisuke, et al. “Spatial Variation of Microtubule Depolymerization in Large Asters.” <i>Molecular Biology of the Cell</i>, vol. 32, no. 9, American Society for Cell Biology, 2021, pp. 869–79, doi:<a href=\"https://doi.org/10.1091/MBC.E20-11-0723\">10.1091/MBC.E20-11-0723</a>.","ista":"Ishihara K, Decker F, Dos Santos Caldas PR, Pelletier JF, Loose M, Brugués J, Mitchison TJ. 2021. Spatial variation of microtubule depolymerization in large asters. Molecular Biology of the Cell. 32(9), 869–879."},"publication_status":"published","date_created":"2021-05-23T22:01:45Z","title":"Spatial variation of microtubule depolymerization in large asters","ec_funded":1,"_id":"9414","date_published":"2021-04-19T00:00:00Z"},{"file_date_updated":"2021-05-24T11:15:57Z","related_material":{"record":[{"status":"public","id":"9418","relation":"dissertation_contains"}]},"scopus_import":"1","author":[{"last_name":"Bui Thi Mai","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong","first_name":"Phuong"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=krz7T0xU9Z_"}],"date_updated":"2023-09-07T13:29:50Z","has_accepted_license":"1","abstract":[{"text":"We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time  onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks.","lang":"eng"}],"quality_controlled":"1","conference":{"location":"Virtual","name":" ICLR: International Conference on Learning Representations","start_date":"2021-05-03","end_date":"2021-05-07"},"year":"2021","language":[{"iso":"eng"}],"status":"public","type":"conference","article_processing_charge":"No","month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"day":"01","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"file":[{"content_type":"application/pdf","file_name":"iclr2021_conference.pdf","date_created":"2021-05-24T11:15:57Z","creator":"bphuong","file_size":502356,"file_id":"9417","checksum":"f34ff17017527db5ba6927f817bdd125","date_updated":"2021-05-24T11:15:57Z","relation":"main_file","access_level":"open_access"}],"publication":"9th International Conference on Learning Representations","date_published":"2021-05-01T00:00:00Z","_id":"9416","title":"The inductive bias of ReLU networks on orthogonally separable data","oa":1,"date_created":"2021-05-24T11:16:46Z","publication_status":"published","citation":{"apa":"Phuong, M., &#38; Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In <i>9th International Conference on Learning Representations</i>. Virtual.","ieee":"M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in <i>9th International Conference on Learning Representations</i>, Virtual, 2021.","ama":"Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: <i>9th International Conference on Learning Representations</i>. ; 2021.","short":"M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021.","mla":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” <i>9th International Conference on Learning Representations</i>, 2021.","chicago":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In <i>9th International Conference on Learning Representations</i>, 2021.","ista":"Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations.  ICLR: International Conference on Learning Representations."}},{"article_processing_charge":"No","status":"public","year":"2021","language":[{"iso":"eng"}],"month":"05","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"day":"30","related_material":{"record":[{"relation":"part_of_dissertation","id":"7435","status":"deleted"},{"status":"public","id":"7481","relation":"part_of_dissertation"},{"id":"9416","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7479","status":"public"}]},"oa_version":"Published Version","has_accepted_license":"1","oa":1,"supervisor":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","first_name":"Christoph","full_name":"Lampert, Christoph"}],"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"doi":"10.15479/AT:ISTA:9418","type":"dissertation","publication_identifier":{"issn":["2663-337X"]},"ddc":["000"],"file_date_updated":"2021-05-24T11:56:02Z","author":[{"first_name":"Phuong","full_name":"Bui Thi Mai, Phuong","last_name":"Bui Thi Mai","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-08T11:11:12Z","page":"125","abstract":[{"lang":"eng","text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models."}],"date_published":"2021-05-30T00:00:00Z","_id":"9418","title":"Underspecification in deep learning","citation":{"ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","mla":"Phuong, Mary. <i>Underspecification in Deep Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>.","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>.","apa":"Phuong, M. (2021). <i>Underspecification in deep learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>","ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021.","ama":"Phuong M. Underspecification in deep learning. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>"},"publication_status":"published","date_created":"2021-05-24T13:06:23Z","degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"file":[{"date_updated":"2021-05-24T11:22:29Z","checksum":"4f0abe64114cfed264f9d36e8d1197e3","relation":"main_file","access_level":"open_access","creator":"bphuong","success":1,"file_size":2673905,"file_id":"9419","file_name":"mph-thesis-v519-pdfimages.pdf","date_created":"2021-05-24T11:22:29Z","content_type":"application/pdf"},{"content_type":"application/zip","date_created":"2021-05-24T11:56:02Z","file_name":"thesis.zip","creator":"bphuong","file_size":92995100,"file_id":"9420","relation":"source_file","access_level":"closed","checksum":"f5699e876bc770a9b0df8345a77720a2","date_updated":"2021-05-24T11:56:02Z"}]},{"project":[{"call_identifier":"H2020","grant_number":"850899","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"doi":"10.1038/s41567-021-01230-2","arxiv":1,"publication":"Nature Physics","isi":1,"volume":17,"oa":1,"oa_version":"Preprint","quality_controlled":"1","has_accepted_license":"1","external_id":{"isi":["000655563800002"],"arxiv":["2011.09486"]},"month":"06","status":"public","language":[{"iso":"eng"}],"year":"2021","article_processing_charge":"No","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MaSe"}],"publisher":"Nature Research","file":[{"date_updated":"2021-12-02T23:30:03Z","checksum":"316ed42ea1b42b0f1a3025bb476266fc","access_level":"open_access","relation":"main_file","embargo":"2021-12-01","file_size":10028836,"file_id":"10026","creator":"patrickd","file_name":"RevisedQMBSreview.pdf","date_created":"2021-09-20T09:27:43Z","content_type":"application/pdf"}],"title":"Quantum many-body scars and weak breaking of ergodicity","ec_funded":1,"_id":"9428","date_published":"2021-06-01T00:00:00Z","date_created":"2021-05-28T09:03:50Z","publication_status":"published","citation":{"ista":"Serbyn M, Abanin DA, Papić Z. 2021. Quantum many-body scars and weak breaking of ergodicity. Nature Physics. 17(6), 675–685.","ieee":"M. Serbyn, D. A. Abanin, and Z. Papić, “Quantum many-body scars and weak breaking of ergodicity,” <i>Nature Physics</i>, vol. 17, no. 6. Nature Research, pp. 675–685, 2021.","ama":"Serbyn M, Abanin DA, Papić Z. Quantum many-body scars and weak breaking of ergodicity. <i>Nature Physics</i>. 2021;17(6):675–685. doi:<a href=\"https://doi.org/10.1038/s41567-021-01230-2\">10.1038/s41567-021-01230-2</a>","apa":"Serbyn, M., Abanin, D. A., &#38; Papić, Z. (2021). Quantum many-body scars and weak breaking of ergodicity. <i>Nature Physics</i>. Nature Research. <a href=\"https://doi.org/10.1038/s41567-021-01230-2\">https://doi.org/10.1038/s41567-021-01230-2</a>","chicago":"Serbyn, Maksym, Dmitry A. Abanin, and Zlatko Papić. “Quantum Many-Body Scars and Weak Breaking of Ergodicity.” <i>Nature Physics</i>. Nature Research, 2021. <a href=\"https://doi.org/10.1038/s41567-021-01230-2\">https://doi.org/10.1038/s41567-021-01230-2</a>.","mla":"Serbyn, Maksym, et al. “Quantum Many-Body Scars and Weak Breaking of Ergodicity.” <i>Nature Physics</i>, vol. 17, no. 6, Nature Research, 2021, pp. 675–685, doi:<a href=\"https://doi.org/10.1038/s41567-021-01230-2\">10.1038/s41567-021-01230-2</a>.","short":"M. Serbyn, D.A. Abanin, Z. Papić, Nature Physics 17 (2021) 675–685."},"author":[{"id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","full_name":"Serbyn, Maksym","first_name":"Maksym","orcid":"0000-0002-2399-5827"},{"first_name":"Dmitry A.","full_name":"Abanin, Dmitry A.","last_name":"Abanin"},{"last_name":"Papić","first_name":"Zlatko","full_name":"Papić, Zlatko"}],"acknowledgement":"We thank our collaborators K. Bull, S. Choi, J.-Y. Desaules, W. W. Ho, A. Hudomal, M. Lukin, I. Martin, H. Pichler, N. Regnault, I. Vasić and in particular A. Michailidis and C. Turner, without whom this work would not have been possible. We also benefited from discussions with E. Altman, B. A. Bernevig, A. Chandran, P. Fendley, V. Khemani and L. Motrunich. M.S. was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 850899). D.A.A. was supported by the Swiss National Science Foundation and by the ERC under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 864597). Z.P. acknowledges support by the Leverhulme Trust Research Leadership Award RL-2019-015.","file_date_updated":"2021-12-02T23:30:03Z","issue":"6","article_type":"review","page":"675–685","abstract":[{"text":"Thermalization is the inevitable fate of many complex quantum systems, whose dynamics allow them to fully explore the vast configuration space regardless of the initial state---the behaviour known as quantum ergodicity. In a quest for experimental realizations of coherent long-time dynamics, efforts have focused on ergodicity-breaking mechanisms, such as integrability and localization. The recent discovery of persistent revivals in quantum simulators based on Rydberg atoms have pointed to the existence of a new type of behaviour where the system rapidly relaxes for most initial conditions, while certain initial states give rise to non-ergodic dynamics. This collective effect has been named ”quantum many-body scarring’by analogy with a related form of weak ergodicity breaking that occurs for a single particle inside a stadium billiard potential. In this Review, we provide a pedagogical introduction to quantum many-body scars and highlight the emerging connections with the semiclassical quantization of many-body systems. We discuss the relation between scars and more general routes towards weak violations of ergodicity due to embedded algebras and non-thermal eigenstates, and highlight possible applications of scars in quantum technology.","lang":"eng"}],"date_updated":"2023-10-18T08:20:59Z","type":"journal_article","intvolume":"        17","ddc":["539"],"publication_identifier":{"eissn":["1745-2481"]}},{"oa":1,"volume":12,"isi":1,"publication":"Nature Communications","acknowledged_ssus":[{"_id":"PreCl"}],"doi":"10.1038/s41467-021-23123-x","project":[{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"},{"call_identifier":"H2020","grant_number":"715508","_id":"25444568-B435-11E9-9278-68D0E5697425","name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models"},{"_id":"2548AE96-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets","call_identifier":"FWF","grant_number":"W1232-B24"},{"grant_number":"F07807","_id":"05A0D778-7A3F-11EA-A408-12923DDC885E","name":"Neural stem cells in autism and epilepsy"},{"name":"Optical control of synaptic function via adhesion molecules","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","grant_number":"I03600","call_identifier":"FWF"}],"keyword":["General Biochemistry","Genetics and Molecular Biology"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"24","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"year":"2021","month":"05","external_id":{"isi":["000658769900010"]},"has_accepted_license":"1","quality_controlled":"1","related_material":{"record":[{"id":"7800","status":"public","relation":"earlier_version"},{"status":"public","id":"12401","relation":"dissertation_contains"}],"link":[{"url":"https://ist.ac.at/en/news/defective-gene-slows-down-brain-cells/","relation":"press_release"}]},"oa_version":"Published Version","citation":{"short":"J. Morandell, L.A. Schwarz, B. Basilico, S. Tasciyan, G.A. Dimchev, A. Nicolas, C.M. Sommer, C. Kreuzinger, C. Dotter, L. Knaus, Z. Dobler, E. Cacci, F.K. Schur, J.G. Danzl, G. Novarino, Nature Communications 12 (2021).","chicago":"Morandell, Jasmin, Lena A Schwarz, Bernadette Basilico, Saren Tasciyan, Georgi A Dimchev, Armel Nicolas, Christoph M Sommer, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.” <i>Nature Communications</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41467-021-23123-x\">https://doi.org/10.1038/s41467-021-23123-x</a>.","mla":"Morandell, Jasmin, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.” <i>Nature Communications</i>, vol. 12, no. 1, 3058, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-23123-x\">10.1038/s41467-021-23123-x</a>.","apa":"Morandell, J., Schwarz, L. A., Basilico, B., Tasciyan, S., Dimchev, G. A., Nicolas, A., … Novarino, G. (2021). Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-021-23123-x\">https://doi.org/10.1038/s41467-021-23123-x</a>","ieee":"J. Morandell <i>et al.</i>, “Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development,” <i>Nature Communications</i>, vol. 12, no. 1. Springer Nature, 2021.","ama":"Morandell J, Schwarz LA, Basilico B, et al. Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-23123-x\">10.1038/s41467-021-23123-x</a>","ista":"Morandell J, Schwarz LA, Basilico B, Tasciyan S, Dimchev GA, Nicolas A, Sommer CM, Kreuzinger C, Dotter C, Knaus L, Dobler Z, Cacci E, Schur FK, Danzl JG, Novarino G. 2021. Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development. Nature Communications. 12(1), 3058."},"publication_status":"published","date_created":"2021-05-28T11:49:46Z","date_published":"2021-05-24T00:00:00Z","_id":"9429","ec_funded":1,"title":"Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development","file":[{"content_type":"application/pdf","file_name":"2021_NatureCommunications_Morandell.pdf","date_created":"2021-05-28T12:39:43Z","success":1,"file_size":9358599,"file_id":"9430","creator":"kschuh","checksum":"337e0f7959c35ec959984cacdcb472ba","date_updated":"2021-05-28T12:39:43Z","access_level":"open_access","relation":"main_file"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Springer Nature","department":[{"_id":"GaNo"},{"_id":"JoDa"},{"_id":"FlSc"},{"_id":"MiSi"},{"_id":"LifeSc"},{"_id":"Bio"}],"publication_identifier":{"eissn":["2041-1723"]},"ddc":["572"],"type":"journal_article","intvolume":"        12","date_updated":"2024-09-10T12:04:26Z","abstract":[{"text":"De novo loss of function mutations in the ubiquitin ligase-encoding gene Cullin3 lead to autism spectrum disorder (ASD). In mouse, constitutive haploinsufficiency leads to motor coordination deficits as well as ASD-relevant social and cognitive impairments. However, induction of Cul3 haploinsufficiency later in life does not lead to ASD-relevant behaviors, pointing to an important role of Cul3 during a critical developmental window. Here we show that Cul3 is essential to regulate neuronal migration and, therefore, constitutive Cul3 heterozygous mutant mice display cortical lamination abnormalities. At the molecular level, we found that Cul3 controls neuronal migration by tightly regulating the amount of Plastin3 (Pls3), a previously unrecognized player of neural migration. Furthermore, we found that Pls3 cell-autonomously regulates cell migration by regulating actin cytoskeleton organization, and its levels are inversely proportional to neural migration speed. Finally, we provide evidence that cellular phenotypes associated with autism-linked gene haploinsufficiency can be rescued by transcriptional activation of the intact allele in vitro, offering a proof of concept for a potential therapeutic approach for ASDs.","lang":"eng"}],"article_type":"original","article_number":"3058","issue":"1","file_date_updated":"2021-05-28T12:39:43Z","author":[{"full_name":"Morandell, Jasmin","first_name":"Jasmin","id":"4739D480-F248-11E8-B48F-1D18A9856A87","last_name":"Morandell"},{"first_name":"Lena A","full_name":"Schwarz, Lena A","id":"29A8453C-F248-11E8-B48F-1D18A9856A87","last_name":"Schwarz"},{"first_name":"Bernadette","full_name":"Basilico, Bernadette","orcid":"0000-0003-1843-3173","last_name":"Basilico","id":"36035796-5ACA-11E9-A75E-7AF2E5697425"},{"last_name":"Tasciyan","id":"4323B49C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1671-393X","first_name":"Saren","full_name":"Tasciyan, Saren"},{"orcid":"0000-0001-8370-6161","full_name":"Dimchev, Georgi A","first_name":"Georgi A","last_name":"Dimchev","id":"38C393BE-F248-11E8-B48F-1D18A9856A87"},{"id":"2A103192-F248-11E8-B48F-1D18A9856A87","last_name":"Nicolas","full_name":"Nicolas, Armel","first_name":"Armel"},{"orcid":"0000-0003-1216-9105","full_name":"Sommer, Christoph M","first_name":"Christoph M","last_name":"Sommer","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kreuzinger","id":"382077BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kreuzinger, Caroline","first_name":"Caroline"},{"last_name":"Dotter","id":"4C66542E-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Dotter, Christoph","orcid":"0000-0002-9033-9096"},{"id":"3B2ABCF4-F248-11E8-B48F-1D18A9856A87","last_name":"Knaus","full_name":"Knaus, Lisa","first_name":"Lisa"},{"id":"D23090A2-9057-11EA-883A-A8396FC7A38F","last_name":"Dobler","full_name":"Dobler, Zoe","first_name":"Zoe"},{"full_name":"Cacci, Emanuele","first_name":"Emanuele","last_name":"Cacci"},{"full_name":"Schur, Florian KM","first_name":"Florian KM","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur"},{"last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G","first_name":"Johann G"},{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","first_name":"Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"We thank A. Coll Manzano, F. Freeman, M. Ladron de Guevara, and A. Ç. Yahya for technical assistance, S. Deixler, A. Lepold, and A. Schlerka for the management of our animal colony, as well as M. Schunn and the Preclinical Facility team for technical assistance. We thank K. Heesom and her team at the University of Bristol Proteomics Facility for the proteomics sample preparation, data generation, and analysis support. We thank Y. B. Simon for kindly providing the plasmid for lentiviral labeling. Further, we thank M. Sixt for his advice regarding cell migration and the fruitful discussions. This work was supported by the ISTPlus postdoctoral fellowship (Grant Agreement No. 754411) to B.B., by the European Union’s Horizon 2020 research and innovation program (ERC) grant 715508 (REVERSEAUTISM), and by the Austrian Science Fund (FWF) to G.N. (DK W1232-B24 and SFB F7807-B) and to J.G.D (I3600-B27)."}]