[{"alternative_title":["Technical Tracks"],"language":[{"iso":"eng"}],"ddc":["000"],"status":"public","month":"05","publisher":"AAAI Press","external_id":{"arxiv":["2012.08863"]},"date_published":"2021-05-28T00:00:00Z","type":"conference","has_accepted_license":"1","project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"issue":"13","day":"28","page":"11525-11535","quality_controlled":"1","intvolume":"        35","arxiv":1,"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","date_updated":"2022-05-24T06:33:14Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Grunbacher, Sophie","first_name":"Sophie","last_name":"Grunbacher"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Cyranka, Jacek","first_name":"Jacek","last_name":"Cyranka"},{"full_name":"Smolka, Scott A","last_name":"Smolka","first_name":"Scott A"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"oa":1,"volume":35,"abstract":[{"lang":"eng","text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR."}],"year":"2021","citation":{"ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:11525-11535.","ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.","ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535.","short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &#38; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 11525–11535). Virtual: AAAI Press.","chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:11525–35. AAAI Press, 2021.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35."},"_id":"10669","file":[{"file_name":"17372-Article Text-20866-1-2-20210518.pdf","success":1,"access_level":"open_access","file_size":286906,"relation":"main_file","date_updated":"2022-01-26T07:38:08Z","date_created":"2022-01-26T07:38:08Z","file_id":"10680","creator":"mlechner","content_type":"application/pdf","checksum":"468d07041e282a1d46ffdae92f709630"}],"date_created":"2022-01-25T15:47:20Z","conference":{"start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","location":"Virtual"},"acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","publication_identifier":{"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"],"issn":["2159-5399"]},"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372"}],"file_date_updated":"2022-01-26T07:38:08Z","oa_version":"Published Version","article_processing_charge":"No","publication_status":"published","title":"On the verification of neural ODEs with stochastic guarantees"},{"language":[{"iso":"eng"}],"ddc":["000"],"alternative_title":[" Advances in Neural Information Processing Systems"],"month":"12","status":"public","date_published":"2021-12-01T00:00:00Z","external_id":{"arxiv":["2106.08314"]},"type":"conference","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"has_accepted_license":"1","project":[{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"day":"01","quality_controlled":"1","arxiv":1,"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication":"35th Conference on Neural Information Processing Systems","date_updated":"2022-01-26T14:33:31Z","author":[{"first_name":"Charles J","last_name":"Vorbach","full_name":"Vorbach, Charles J"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"year":"2021","citation":{"apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual.","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, 2021.","chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021.","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021.","ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021."},"abstract":[{"lang":"eng","text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning."}],"conference":{"start_date":"2021-12-06","location":"Virtual","name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-10"},"_id":"10670","file":[{"access_level":"open_access","success":1,"file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","date_updated":"2022-01-26T07:37:24Z","file_size":6841228,"date_created":"2022-01-26T07:37:24Z","relation":"main_file","content_type":"application/pdf","file_id":"10679","creator":"mlechner","checksum":"be81f0ade174a8c9b2d4fe09590b2021"}],"date_created":"2022-01-25T15:47:50Z","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html","open_access":"1"}],"acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","title":"Causal navigation by continuous-time neural networks","publication_status":"published","file_date_updated":"2022-01-26T07:37:24Z","article_processing_charge":"No","oa_version":"Published Version"},{"publisher":"AAAI Press","type":"conference","date_published":"2021-05-28T00:00:00Z","external_id":{"arxiv":["2006.04439"]},"alternative_title":["Technical Tracks"],"ddc":["000"],"language":[{"iso":"eng"}],"status":"public","month":"05","day":"28","page":"7657-7666","quality_controlled":"1","has_accepted_license":"1","project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"issue":"9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"volume":35,"oa":1,"intvolume":"        35","arxiv":1,"date_updated":"2022-05-24T06:36:54Z","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_identifier":{"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"],"issn":["2159-5399"]},"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"}],"oa_version":"Published Version","article_processing_charge":"No","file_date_updated":"2022-01-26T07:36:03Z","title":"Liquid time-constant networks","publication_status":"published","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"}],"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.","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.","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.","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.","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.","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."},"year":"2021","file":[{"success":1,"access_level":"open_access","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","relation":"main_file","file_size":4302669,"date_created":"2022-01-26T07:36:03Z","date_updated":"2022-01-26T07:36:03Z","creator":"mlechner","file_id":"10678","content_type":"application/pdf","checksum":"0f06995fba06dbcfa7ed965fc66027ff"}],"date_created":"2022-01-25T15:48:36Z","_id":"10671","conference":{"start_date":"2021-02-02","end_date":"2021-02-09","location":"Virtual","name":"AAAI: Association for the Advancement of Artificial Intelligence"}},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","project":[{"name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369"},{"name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"issue":"1","day":"03","page":"10:1-10:23","quality_controlled":"1","keyword":["computer science","computer science and game theory","logic in computer science"],"ddc":["510"],"language":[{"iso":"eng"}],"status":"public","isi":1,"month":"02","publisher":"International Federation for Computational Logic","type":"journal_article","external_id":{"isi":["000658724600010"],"arxiv":["1905.03588"]},"date_published":"2021-02-03T00:00:00Z","abstract":[{"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.","lang":"eng"}],"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.","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.","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>","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>.","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>","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","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>."},"year":"2021","date_created":"2022-01-25T16:32:13Z","file":[{"content_type":"application/pdf","creator":"alisjak","file_id":"10690","checksum":"b35586a50ed1ca8f44767de116d18d81","file_name":"2021_LMCS_AGHAJOHAR.pdf","access_level":"open_access","success":1,"relation":"main_file","file_size":819878,"date_updated":"2022-01-26T08:04:50Z","date_created":"2022-01-26T08:04:50Z"}],"_id":"10674","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","publication_identifier":{"eissn":["1860-5974"]},"article_type":"original","scopus_import":"1","doi":"10.23638/LMCS-17(1:10)2021","article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2022-01-26T08:04:50Z","title":"Determinacy in discrete-bidding infinite-duration games","publication_status":"published","intvolume":"        17","arxiv":1,"date_updated":"2023-08-17T06:56:42Z","publication":"Logical Methods in Computer Science","department":[{"_id":"ToHe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Aghajohari","first_name":"Milad","full_name":"Aghajohari, Milad"},{"last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"volume":17,"oa":1},{"status":"public","month":"10","alternative_title":["Conference Series"],"language":[{"iso":"eng"}],"ddc":["000"],"date_published":"2021-10-01T00:00:00Z","type":"conference","publisher":"TU Wien Academic Press","project":[{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","quality_controlled":"1","day":"01","page":"143–152","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","date_updated":"2022-01-26T08:20:41Z","department":[{"_id":"ToHe"}],"intvolume":"         2","oa":1,"volume":2,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","first_name":"Bernhard"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"_id":"10688","file":[{"content_type":"application/pdf","file_id":"10689","creator":"cchlebak","checksum":"35438ac9f9750340b7f8ae4ae3220d9f","file_name":"2021_FCAD2021_Kragl.pdf","success":1,"access_level":"open_access","relation":"main_file","file_size":390555,"date_updated":"2022-01-26T08:04:29Z","date_created":"2022-01-26T08:04:29Z"}],"date_created":"2022-01-26T08:01:30Z","editor":[{"last_name":"Ruzica","first_name":"Piskac","full_name":"Ruzica, Piskac"},{"first_name":"Michael W.","last_name":"Whalen","full_name":"Whalen, Michael W."}],"conference":{"end_date":"2021-10-22","location":"Virtual","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2021-10-20"},"abstract":[{"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.","lang":"eng"}],"year":"2021","citation":{"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>.","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>.","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>","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.","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.","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>"},"file_date_updated":"2022-01-26T08:04:29Z","article_processing_charge":"No","oa_version":"Published Version","title":"The Civl verifier","publication_status":"published","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).","publication_identifier":{"isbn":["978-3-85448-046-4"]},"doi":"10.34727/2021/isbn.978-3-85448-046-4_23"},{"language":[{"iso":"eng"}],"intvolume":"        66","alternative_title":["Bulletin of the American Physical Society"],"extern":"1","month":"03","status":"public","publication":"APS March Meeting 2021","date_updated":"2022-01-27T10:46:23Z","publisher":"American Physical Society","author":[{"id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","first_name":"Hryhoriy","last_name":"Polshyn"},{"full_name":"Zhu, Jihang","last_name":"Zhu","first_name":"Jihang"},{"first_name":"Manish","last_name":"Kumar","full_name":"Kumar, Manish"},{"full_name":"Zhang, Yuxuan","first_name":"Yuxuan","last_name":"Zhang"},{"full_name":"Yang, Fangyuan","last_name":"Yang","first_name":"Fangyuan"},{"full_name":"Tschirhart, Charles","first_name":"Charles","last_name":"Tschirhart"},{"full_name":"Serlin, Marec","last_name":"Serlin","first_name":"Marec"},{"last_name":"Watanabe","first_name":"Kenji","full_name":"Watanabe, Kenji"},{"last_name":"Tanaguchi","first_name":"Takashi","full_name":"Tanaguchi, Takashi"},{"first_name":"Allan","last_name":"MacDonald","full_name":"MacDonald, Allan"},{"last_name":"Young","first_name":"Andrea","full_name":"Young, Andrea"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2021-03-01T00:00:00Z","type":"conference","oa":1,"volume":66,"article_number":"E42.00010","year":"2021","citation":{"apa":"Polshyn, H., Zhu, J., Kumar, M., Zhang, Y., Yang, F., Tschirhart, C., … Young, A. (2021). Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. In <i>APS March Meeting 2021</i> (Vol. 66). Virtual: American Physical Society.","short":"H. Polshyn, J. Zhu, M. Kumar, Y. Zhang, F. Yang, C. Tschirhart, M. Serlin, K. Watanabe, T. Tanaguchi, A. MacDonald, A. Young, in:, APS March Meeting 2021, American Physical Society, 2021.","chicago":"Polshyn, Hryhoriy, Jihang Zhu, Manish Kumar, Yuxuan Zhang, Fangyuan Yang, Charles Tschirhart, Marec Serlin, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic Order.” In <i>APS March Meeting 2021</i>, Vol. 66. American Physical Society, 2021.","mla":"Polshyn, Hryhoriy, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic Order.” <i>APS March Meeting 2021</i>, vol. 66, no. 1, E42.00010, American Physical Society, 2021.","ieee":"H. Polshyn <i>et al.</i>, “Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order,” in <i>APS March Meeting 2021</i>, Virtual, 2021, vol. 66, no. 1.","ista":"Polshyn H, Zhu J, Kumar M, Zhang Y, Yang F, Tschirhart C, Serlin M, Watanabe K, Tanaguchi T, MacDonald A, Young A. 2021. Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. APS March Meeting 2021. APS: American Physical Society, Bulletin of the American Physical Society, vol. 66, E42.00010.","ama":"Polshyn H, Zhu J, Kumar M, et al. Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. In: <i>APS March Meeting 2021</i>. Vol 66. American Physical Society; 2021."},"abstract":[{"text":"We experimentally investigate narrow and topologically nontrivial moiré minibands hosted by van der Waals heterostructures consisting of a graphene monolayer rotationally faulted with respect to a Bernal-stacked bilayer. At fillings ν= 1 and 3 electrons per moiré unit cell within these bands, we observe quantized anomalous Hall effects with Rxy≈h/2e2, indicative of spontaneous polarization of the system into a single valley-projected band with Chern number C= 2. Remarkably, we also observe the evidence of symmetry broken Chern insulator states at ν= 1.5 and 3.5. At ν= 3 we find that the sign of the quantum anomalous Hall effect can be reversed via field-effect control of the chemical potential. This curious effect arises from the magnetization contribution due to topological edge states, which drive a reversal of the total magnetization and thus a switch of the favored magnetic state. Remarkably, we find that this switch is hysteretic, which we use to demonstrate non-volatile electric-field-induced reversal of the magnetic state. Voltage control of magnetic states can be used to electrically pattern nonvolatile magnetic domain structures hosting chiral edge states, with applications ranging from reconfigurable microwave circuit elements to ultra-low-power magnetic memory.","lang":"eng"}],"issue":"1","conference":{"location":"Virtual","name":"APS: American Physical Society","end_date":"2021-03-19","start_date":"2021-03-15"},"_id":"10692","date_created":"2022-01-27T09:49:48Z","main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR21/Session/E42.10"}],"day":"01","publication_identifier":{"issn":["0003-0503"]},"quality_controlled":"1","title":"Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order","article_processing_charge":"No","oa_version":"Published Version"},{"publisher":"Society for Industrial and Applied Mathematics","external_id":{"arxiv":["2005.06636"]},"date_published":"2021-01-01T00:00:00Z","type":"conference","language":[{"iso":"eng"}],"status":"public","month":"01","day":"01","page":"617-636","quality_controlled":"1","project":[{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni"},{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","first_name":"Ismael R"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","last_name":"Zikelic","first_name":"Dorde"}],"oa":1,"arxiv":1,"publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","date_updated":"2025-07-14T09:10:12Z","ec_funded":1,"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"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.","publication_identifier":{"isbn":["978-1-61197-646-5"]},"doi":"10.1137/1.9781611976465.38","main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"scopus_import":"1","article_processing_charge":"No","oa_version":"Preprint","title":"Infinite-duration all-pay bidding games","publication_status":"published","abstract":[{"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.","lang":"eng"}],"year":"2021","citation":{"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.","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>.","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>","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>.","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>","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.","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."},"_id":"10694","date_created":"2022-01-27T12:11:23Z","editor":[{"full_name":"Marx, Dániel","last_name":"Marx","first_name":"Dániel"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Virtual","end_date":"2021-01-13","start_date":"2021-01-10"}},{"article_type":"original","acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions.","publication_identifier":{"eissn":["1570-5846"],"issn":["0010-437X"]},"doi":"10.1112/s0010437x21007351","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.03266"}],"oa_version":"Preprint","article_processing_charge":"No","title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","publication_status":"published","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."}],"year":"2021","citation":{"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>","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.","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.","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.","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>","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>."},"_id":"10711","date_created":"2022-02-01T08:10:43Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Autissier, Pascal","last_name":"Autissier","first_name":"Pascal"},{"full_name":"Bonolis, Dante","id":"6A459894-5FDD-11E9-AF35-BB24E6697425","last_name":"Bonolis","first_name":"Dante"},{"first_name":"Youness","last_name":"Lamzouri","full_name":"Lamzouri, Youness"}],"oa":1,"volume":157,"intvolume":"       157","arxiv":1,"publication":"Compositio Mathematica","date_updated":"2023-08-17T06:59:16Z","department":[{"_id":"TiBr"}],"day":"28","page":"1610-1651","quality_controlled":"1","issue":"7","publisher":"Cambridge University Press","external_id":{"arxiv":["1909.03266"],"isi":["000667289300001"]},"date_published":"2021-06-28T00:00:00Z","type":"journal_article","keyword":["Algebra and Number Theory"],"language":[{"iso":"eng"}],"status":"public","month":"06","isi":1},{"author":[{"full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","last_name":"Leopold","first_name":"Nikolai K"},{"first_name":"Simone Anna Elvira","last_name":"Rademacher","id":"856966FE-A408-11E9-977E-802DE6697425","orcid":"0000-0001-5059-4466","full_name":"Rademacher, Simone Anna Elvira"},{"full_name":"Schlein, Benjamin","last_name":"Schlein","first_name":"Benjamin"},{"first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":14,"oa":1,"arxiv":1,"intvolume":"        14","department":[{"_id":"RoSe"}],"ec_funded":1,"date_updated":"2023-10-17T11:26:45Z","publication":"Analysis and PDE","scopus_import":"1","doi":"10.2140/APDE.2021.14.2079","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.12532"}],"publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]},"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","article_type":"original","title":" The Landau–Pekar equations: Adiabatic theorem and accuracy","publication_status":"published","oa_version":"Preprint","article_processing_charge":"No","citation":{"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.","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>","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>.","short":"N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE 14 (2021) 2079–2100.","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>","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>."},"year":"2021","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"}],"date_created":"2022-02-06T23:01:33Z","_id":"10738","publisher":"Mathematical Sciences Publishers","type":"journal_article","external_id":{"arxiv":["1904.12532"],"isi":["000733976600004"]},"date_published":"2021-11-10T00:00:00Z","language":[{"iso":"eng"}],"isi":1,"month":"11","status":"public","page":"2079-2100","day":"10","quality_controlled":"1","issue":"7","project":[{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227"}]},{"project":[{"grant_number":"801770","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"date_created":"2022-02-17T11:18:57Z","_id":"10762","abstract":[{"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.","lang":"eng"}],"citation":{"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>","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).","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>.","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>.","ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. .","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>.","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>"},"year":"2021","article_processing_charge":"No","oa_version":"Preprint","title":"Artificial neural network states for non-additive systems","publication_status":"submitted","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.","day":"31","main_file_link":[{"url":"https://arxiv.org/abs/2105.15193","open_access":"1"}],"doi":"10.48550/arXiv.2105.15193","page":"2105.15193","ec_funded":1,"date_updated":"2023-09-07T13:44:16Z","status":"public","publication":"arXiv","department":[{"_id":"MiLe"}],"month":"05","language":[{"iso":"eng"}],"arxiv":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10759"}]},"oa":1,"type":"preprint","external_id":{"arxiv":["2105.15193"]},"date_published":"2021-05-31T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Wojciech","last_name":"Rzadkowski","id":"48C55298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech"},{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail"},{"full_name":"Mentink, Johan H.","last_name":"Mentink","first_name":"Johan H."}]},{"title":"Fairness through regularization for learning to rank","publication_status":"submitted","oa_version":"Preprint","article_processing_charge":"No","doi":"10.48550/arXiv.2102.05996","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.05996"}],"day":"07","date_created":"2022-02-28T14:13:59Z","_id":"10803","citation":{"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>.","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>","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>.","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. .","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>"},"article_number":"2102.05996","year":"2021","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"}],"type":"preprint","date_published":"2021-06-07T00:00:00Z","external_id":{"arxiv":["2102.05996"]},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10799"}]},"oa":1,"author":[{"first_name":"Nikola H","last_name":"Konstantinov","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","full_name":"Konstantinov, Nikola H"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Lampert, Christoph"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"month":"06","date_updated":"2023-09-07T13:42:08Z","status":"public","publication":"arXiv","arxiv":1,"language":[{"iso":"eng"}]},{"publisher":"American Chemical Society","type":"journal_article","date_published":"2021-11-22T00:00:00Z","ddc":["540"],"language":[{"iso":"eng"}],"keyword":["general medicine"],"month":"11","status":"public","page":"1898-1903","day":"22","quality_controlled":"1","issue":"11","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"},{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"has_accepted_license":"1","author":[{"last_name":"Calcabrini","first_name":"Mariano","full_name":"Calcabrini, Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Van den Eynden, Dietger","last_name":"Van den Eynden","first_name":"Dietger"},{"first_name":"Sergi","last_name":"Sanchez Ribot","id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a","full_name":"Sanchez Ribot, Sergi"},{"full_name":"Pokratath, Rohan","first_name":"Rohan","last_name":"Pokratath"},{"full_name":"Llorca, Jordi","last_name":"Llorca","first_name":"Jordi"},{"full_name":"De Roo, Jonathan","first_name":"Jonathan","last_name":"De Roo"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","first_name":"Maria"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":1,"oa":1,"related_material":{"record":[{"id":"12885","relation":"dissertation_contains","status":"public"}],"link":[{"relation":"earlier_version","url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr"}]},"intvolume":"         1","department":[{"_id":"MaIb"}],"ec_funded":1,"date_updated":"2023-05-05T08:45:36Z","publication":"JACS Au","doi":"10.1021/jacsau.1c00349","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.","publication_identifier":{"issn":["2691-3704"],"eissn":["2691-3704"]},"article_type":"original","title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","publication_status":"published","article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","file_date_updated":"2022-03-02T15:33:18Z","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.","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.","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>","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.","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>","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>.","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>."},"year":"2021","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"}],"file":[{"relation":"main_file","file_size":1257973,"date_created":"2022-03-02T15:33:18Z","date_updated":"2022-03-02T15:33:18Z","success":1,"access_level":"open_access","file_name":"2021_JACSAu_Calcabrini.pdf","checksum":"1c66a35369e911312a359111420318a9","content_type":"application/pdf","creator":"cchlebak","file_id":"10807"}],"date_created":"2022-03-02T15:24:16Z","_id":"10806"},{"publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"article_type":"letter_note","scopus_import":"1","doi":"10.1126/science.abg0886","oa_version":"None","article_processing_charge":"No","publication_status":"published","title":"Tidying up the mess","abstract":[{"lang":"eng","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."}],"citation":{"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>.","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>.","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.","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.","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>"},"year":"2021","date_created":"2022-03-03T09:51:48Z","_id":"10809","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Liu, Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7313-6740","last_name":"Liu","first_name":"Yu"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"}],"volume":371,"intvolume":"       371","date_updated":"2023-08-17T07:00:35Z","publication":"Science","department":[{"_id":"MaIb"}],"day":"12","page":"678-679","quality_controlled":"1","issue":"6530","pmid":1,"publisher":"American Association for the Advancement of Science","type":"journal_article","external_id":{"pmid":["33574201"],"isi":["000617551600027"]},"date_published":"2021-02-12T00:00:00Z","keyword":["multidisciplinary"],"language":[{"iso":"eng"}],"status":"public","isi":1,"month":"02"},{"status":"public","month":"12","keyword":["general medicine"],"language":[{"iso":"eng"}],"ddc":["610"],"date_published":"2021-12-16T00:00:00Z","type":"journal_article","publisher":"Springer Nature","project":[{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020","grant_number":"692692"},{"name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","call_identifier":"FWF"}],"has_accepted_license":"1","issue":"12","quality_controlled":"1","day":"16","page":"830-842","publication":"Nature Computational Science","ec_funded":1,"date_updated":"2023-08-10T22:30:10Z","department":[{"_id":"PeJo"}],"intvolume":"         1","related_material":{"record":[{"relation":"software","status":"public","id":"10110"}],"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/spot-the-difference/"}]},"oa":1,"volume":1,"acknowledged_ssus":[{"_id":"SSU"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Guzmán","first_name":"José","full_name":"Guzmán, José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2209-5242"},{"orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois","first_name":"Alois","last_name":"Schlögl"},{"orcid":"0000-0003-4710-2082","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","full_name":"Espinoza Martinez, Claudia ","first_name":"Claudia ","last_name":"Espinoza Martinez"},{"full_name":"Zhang, Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87","last_name":"Zhang","first_name":"Xiaomin"},{"last_name":"Suter","first_name":"Benjamin","full_name":"Suter, Benjamin","orcid":"0000-0002-9885-6936","id":"4952F31E-F248-11E8-B48F-1D18A9856A87"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas"}],"_id":"10816","date_created":"2022-03-04T08:32:36Z","file":[{"date_created":"2022-06-02T12:51:07Z","relation":"main_file","file_size":1699466,"date_updated":"2022-06-18T22:30:03Z","embargo":"2022-06-17","access_level":"open_access","file_name":"Guzmanetal2021.pdf","checksum":"9fec5b667909ef52be96d502e4f8c2ae","file_id":"11430","creator":"patrickd","content_type":"application/pdf"},{"checksum":"52a005b13a114e3c3a28fa6bbe8b1a8d","title":"Supplementary Material","creator":"patrickd","file_id":"11431","content_type":"application/pdf","file_size":3005651,"relation":"supplementary_material","date_created":"2022-06-02T12:53:47Z","date_updated":"2022-06-18T22:30:03Z","embargo":"2022-06-17","access_level":"open_access","file_name":"Guzmanetal2021Suppl.pdf"}],"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"}],"year":"2021","citation":{"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>","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.","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.","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>","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, Nature Computational Science 1 (2021) 830–842.","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>.","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>."},"file_date_updated":"2022-06-18T22:30:03Z","oa_version":"Submitted Version","article_processing_charge":"No","title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network","publication_status":"published","article_type":"original","publication_identifier":{"issn":["2662-8457"]},"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.).","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/647800"}],"doi":"10.1038/s43588-021-00157-1","scopus_import":"1"},{"status":"public","month":"06","isi":1,"language":[{"iso":"eng"}],"ddc":["000"],"date_published":"2021-06-01T00:00:00Z","external_id":{"pmid":["31804937"],"isi":["000649620700009"]},"type":"journal_article","publisher":"IEEE","pmid":1,"has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767"}],"issue":"6","quality_controlled":"1","day":"01","publication":"IEEE Transactions on Visualization and Computer Graphics","ec_funded":1,"date_updated":"2023-08-08T13:45:46Z","department":[{"_id":"BeBi"}],"intvolume":"        27","oa":1,"volume":27,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Feng, Xudong","first_name":"Xudong","last_name":"Feng"},{"first_name":"Jiafeng","last_name":"Liu","full_name":"Liu, Jiafeng"},{"first_name":"Huamin","last_name":"Wang","full_name":"Wang, Huamin"},{"full_name":"Yang, Yin","last_name":"Yang","first_name":"Yin"},{"last_name":"Bao","first_name":"Hujun","full_name":"Bao, Hujun"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel"},{"first_name":"Weiwei","last_name":"Xu","full_name":"Xu, Weiwei"}],"_id":"9408","date_created":"2021-05-23T22:01:42Z","file":[{"file_name":"2021_TVCG_Feng.pdf","access_level":"open_access","success":1,"relation":"main_file","date_created":"2021-05-25T15:08:49Z","date_updated":"2021-05-25T15:08:49Z","file_size":6183002,"file_id":"9427","creator":"kschuh","content_type":"application/pdf","checksum":"a78e6ac94e33ade4ffaea66943d5f7dc"}],"abstract":[{"lang":"eng","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."}],"year":"2021","article_number":"2881-2895","citation":{"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.","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.","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>","short":"X. Feng, J. Liu, H. Wang, Y. Yang, H. Bao, B. Bickel, W. Xu, IEEE Transactions on Visualization and Computer Graphics 27 (2021).","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>.","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>."},"file_date_updated":"2021-05-25T15:08:49Z","article_processing_charge":"No","oa_version":"Published Version","publication_status":"published","title":"Computational design of skinned Quad-Robots","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).","publication_identifier":{"issn":["19410506"],"eissn":["10772626"]},"doi":"10.1109/TVCG.2019.2957218","scopus_import":"1"},{"type":"journal_article","date_published":"2021-05-12T00:00:00Z","external_id":{"isi":["000651501400001"],"pmid":[" 33975485"]},"pmid":1,"publisher":"Royal Society of London","status":"public","isi":1,"month":"05","ddc":["570"],"language":[{"iso":"eng"}],"quality_controlled":"1","day":"12","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","project":[{"name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"250152"}],"issue":"5","volume":17,"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"345D25EC-F248-11E8-B48F-1D18A9856A87","full_name":"Lagator, Mato","first_name":"Mato","last_name":"Lagator"},{"first_name":"Hildegard","last_name":"Uecker","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9435-2813","full_name":"Uecker, Hildegard"},{"full_name":"Neve, Paul","first_name":"Paul","last_name":"Neve"}],"ec_funded":1,"date_updated":"2025-05-28T11:42:50Z","publication":"Biology letters","department":[{"_id":"NiBa"}],"intvolume":"        17","oa_version":"Published Version","article_processing_charge":"No","file_date_updated":"2021-05-25T14:09:03Z","title":"Adaptation at different points along antibiotic concentration gradients","publication_status":"published","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.","publication_identifier":{"eissn":["1744957X"]},"scopus_import":"1","doi":"10.1098/rsbl.2020.0913","file":[{"content_type":"application/pdf","creator":"kschuh","file_id":"9425","checksum":"9c13c1f5af7609c97c741f11d293188a","access_level":"open_access","success":1,"file_name":"2021_BiologyLetters_Lagator.pdf","relation":"main_file","date_created":"2021-05-25T14:09:03Z","file_size":726759,"date_updated":"2021-05-25T14:09:03Z"}],"date_created":"2021-05-23T22:01:43Z","_id":"9410","abstract":[{"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.","lang":"eng"}],"citation":{"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.","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>","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>.","short":"M. Lagator, H. Uecker, P. Neve, Biology Letters 17 (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>","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>."},"article_number":"20200913","year":"2021"},{"external_id":{"isi":["000643251300001"]},"date_published":"2021-04-24T00:00:00Z","type":"journal_article","publisher":"Springer","status":"public","month":"04","isi":1,"language":[{"iso":"eng"}],"ddc":["530"],"quality_controlled":"1","day":"24","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"issue":"4","oa":1,"volume":44,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Sukhov","first_name":"Alexander","full_name":"Sukhov, Alexander"},{"full_name":"Hubert, Maxime","first_name":"Maxime","last_name":"Hubert"},{"last_name":"Grosjean","first_name":"Galien M","full_name":"Grosjean, Galien M","id":"0C5FDA4A-9CF6-11E9-8939-FF05E6697425","orcid":"0000-0001-5154-417X"},{"full_name":"Trosman, Oleg","first_name":"Oleg","last_name":"Trosman"},{"first_name":"Sebastian","last_name":"Ziegler","full_name":"Ziegler, Sebastian"},{"last_name":"Collard","first_name":"Ylona","full_name":"Collard, Ylona"},{"full_name":"Vandewalle, Nicolas","last_name":"Vandewalle","first_name":"Nicolas"},{"full_name":"Smith, Ana Sunčana","first_name":"Ana Sunčana","last_name":"Smith"},{"first_name":"Jens","last_name":"Harting","full_name":"Harting, Jens"}],"publication":"European Physical Journal E","date_updated":"2023-08-08T13:36:28Z","department":[{"_id":"ScWa"}],"intvolume":"        44","file_date_updated":"2021-05-25T11:32:14Z","article_processing_charge":"No","oa_version":"Published Version","title":"Regimes of motion of magnetocapillary swimmers","publication_status":"published","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.","publication_identifier":{"eissn":["1292895X"],"issn":["12928941"]},"doi":"10.1140/epje/s10189-021-00065-2","scopus_import":"1","_id":"9411","file":[{"checksum":"0ef342d011afbe3c5cb058fda9a3f395","content_type":"application/pdf","creator":"kschuh","file_id":"9422","date_updated":"2021-05-25T11:32:14Z","relation":"main_file","file_size":2507870,"date_created":"2021-05-25T11:32:14Z","file_name":"2021_EPJE_Sukhov.pdf","success":1,"access_level":"open_access"}],"date_created":"2021-05-23T22:01:44Z","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"}],"article_number":"59","year":"2021","citation":{"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>","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.","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.","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>.","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>.","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>","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)."}},{"publisher":"Institute of Mathematical Statistics","date_published":"2021-03-23T00:00:00Z","external_id":{"isi":["000641855600001"],"arxiv":["2002.02438"]},"type":"journal_article","language":[{"iso":"eng"}],"ddc":["510"],"month":"03","isi":1,"status":"public","day":"23","quality_controlled":"1","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","author":[{"first_name":"Giorgio","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio"},{"last_name":"Erdös","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dominik J","last_name":"Schröder","orcid":"0000-0002-2904-1856","id":"408ED176-F248-11E8-B48F-1D18A9856A87","full_name":"Schröder, Dominik J"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"volume":26,"arxiv":1,"intvolume":"        26","department":[{"_id":"LaEr"}],"publication":"Electronic Journal of Probability","date_updated":"2023-08-08T13:39:19Z","ec_funded":1,"doi":"10.1214/21-EJP591","scopus_import":"1","publication_identifier":{"eissn":["10836489"]},"publication_status":"published","title":"Fluctuation around the circular law for random matrices with real entries","file_date_updated":"2021-05-25T13:24:19Z","article_processing_charge":"No","oa_version":"Published Version","article_number":"24","year":"2021","citation":{"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.","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>","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>.","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>","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>.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Electronic Journal of Probability 26 (2021)."},"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"}],"_id":"9412","file":[{"checksum":"864ab003ad4cffea783f65aa8c2ba69f","content_type":"application/pdf","file_id":"9423","creator":"kschuh","date_updated":"2021-05-25T13:24:19Z","file_size":865148,"date_created":"2021-05-25T13:24:19Z","relation":"main_file","access_level":"open_access","success":1,"file_name":"2021_EJP_Cipolloni.pdf"}],"date_created":"2021-05-23T22:01:44Z"},{"department":[{"_id":"MaLo"}],"publication":"Molecular Biology of the Cell","date_updated":"2023-08-08T13:36:02Z","ec_funded":1,"intvolume":"        32","oa":1,"volume":32,"author":[{"full_name":"Ishihara, Keisuke","last_name":"Ishihara","first_name":"Keisuke"},{"first_name":"Franziska","last_name":"Decker","full_name":"Decker, Franziska"},{"full_name":"Dos Santos Caldas, Paulo R","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6730-4461","last_name":"Dos Santos Caldas","first_name":"Paulo R"},{"last_name":"Pelletier","first_name":"James F.","full_name":"Pelletier, James F."},{"last_name":"Loose","first_name":"Martin","full_name":"Loose, Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724"},{"full_name":"Brugués, Jan","last_name":"Brugués","first_name":"Jan"},{"full_name":"Mitchison, Timothy J.","last_name":"Mitchison","first_name":"Timothy J."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9414","date_created":"2021-05-23T22:01:45Z","year":"2021","citation":{"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>.","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>.","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.","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>","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.","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.","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>"},"abstract":[{"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.","lang":"eng"}],"publication_status":"published","title":"Spatial variation of microtubule depolymerization in large asters","oa_version":"Published Version","article_processing_charge":"No","doi":"10.1091/MBC.E20-11-0723","main_file_link":[{"url":"https://www.molbiolcell.org/doi/10.1091/mbc.E20-11-0723","open_access":"1"}],"scopus_import":"1","article_type":"original","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.","publication_identifier":{"eissn":["1939-4586"],"issn":["1059-1524"]},"month":"04","isi":1,"status":"public","language":[{"iso":"eng"}],"external_id":{"isi":["000641574700005"]},"date_published":"2021-04-19T00:00:00Z","type":"journal_article","publisher":"American Society for Cell Biology","issue":"9","license":"https://creativecommons.org/licenses/by-nc-sa/3.0/","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/3.0/legalcode","short":"CC BY-NC-SA (3.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)"},"project":[{"grant_number":"679239","call_identifier":"H2020","_id":"2595697A-B435-11E9-9278-68D0E5697425","name":"Self-Organization of the Bacterial Cell"},{"_id":"260D98C8-B435-11E9-9278-68D0E5697425","name":"Reconstitution of Bacterial Cell Division Using Purified Components"}],"quality_controlled":"1","page":"869-879","day":"19"},{"day":"01","scopus_import":"1","main_file_link":[{"url":"https://openreview.net/pdf?id=krz7T0xU9Z_","open_access":"1"}],"article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2021-05-24T11:15:57Z","quality_controlled":"1","publication_status":"published","title":"The inductive bias of ReLU networks on orthogonally separable data","abstract":[{"lang":"eng","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."}],"citation":{"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.","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.","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.","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.","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.","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."},"year":"2021","date_created":"2021-05-24T11:16:46Z","file":[{"checksum":"f34ff17017527db5ba6927f817bdd125","content_type":"application/pdf","creator":"bphuong","file_id":"9417","relation":"main_file","file_size":502356,"date_created":"2021-05-24T11:15:57Z","date_updated":"2021-05-24T11:15:57Z","access_level":"open_access","file_name":"iclr2021_conference.pdf"}],"has_accepted_license":"1","_id":"9416","conference":{"location":"Virtual","name":" ICLR: International Conference on Learning Representations","end_date":"2021-05-07","start_date":"2021-05-03"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong","first_name":"Phuong","last_name":"Bui Thi Mai"},{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"related_material":{"record":[{"id":"9418","status":"public","relation":"dissertation_contains"}]},"oa":1,"type":"conference","date_published":"2021-05-01T00:00:00Z","ddc":["000"],"language":[{"iso":"eng"}],"date_updated":"2023-09-07T13:29:50Z","status":"public","publication":"9th International Conference on Learning Representations","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"month":"05"}]