[{"day":"28","ddc":["000"],"project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"language":[{"iso":"eng"}],"month":"05","publication_status":"published","file":[{"access_level":"open_access","creator":"mlechner","relation":"main_file","date_created":"2022-01-26T07:41:16Z","success":1,"content_type":"application/pdf","file_id":"10684","date_updated":"2022-01-26T07:41:16Z","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","file_size":137235}],"main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496","open_access":"1"}],"intvolume":"        35","date_updated":"2025-07-14T09:10:11Z","alternative_title":["Technical Tracks"],"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"article_processing_charge":"No","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"date_published":"2021-05-28T00:00:00Z","quality_controlled":"1","scopus_import":"1","file_date_updated":"2022-01-26T07:41:16Z","conference":{"name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","location":"Virtual","start_date":"2021-02-02"},"external_id":{"arxiv":["2012.08185"]},"issue":"5A","status":"public","oa":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","publication_identifier":{"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"],"issn":["2159-5399"]},"citation":{"short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795."},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"3787-3795","volume":35,"year":"2021","has_accepted_license":"1","_id":"10665","arxiv":1,"abstract":[{"text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.","lang":"eng"}],"publisher":"AAAI Press","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"title":"Scalable verification of quantized neural networks","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","oa_version":"Published Version","date_created":"2022-01-25T15:15:02Z","ec_funded":1},{"external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"status":"public","acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","oa":1,"publication_identifier":{"isbn":["978-1-7281-9078-5"],"issn":["1050-4729"],"eisbn":["978-1-7281-9077-8"],"eissn":["2577-087X"]},"citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. ICRA, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147.","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147."},"type":"conference","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"4140-4147","year":"2021","has_accepted_license":"1","_id":"10666","arxiv":1,"series_title":"ICRA","abstract":[{"lang":"eng","text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning."}],"title":"Adversarial training is not ready for robot learning","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication":"2021 IEEE International Conference on Robotics and Automation","oa_version":"None","date_created":"2022-01-25T15:44:54Z","ddc":["000"],"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"isi":1,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"doi":"10.1109/ICRA48506.2021.9561036","date_updated":"2023-08-17T06:58:38Z","article_processing_charge":"No","author":[{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"date_published":"2021-01-01T00:00:00Z","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)"},"conference":{"end_date":"2021-06-05","name":"ICRA: International Conference on Robotics and Automation","start_date":"2021-05-30","location":"Xi'an, China"}},{"citation":{"ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>"},"external_id":{"arxiv":["2111.03165"]},"oa":1,"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 the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","status":"public","year":"2021","has_accepted_license":"1","_id":"10667","type":"conference","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.","lang":"eng"}],"arxiv":1,"oa_version":"Published Version","date_created":"2022-01-25T15:45:58Z","ec_funded":1,"title":"Infinite time horizon safety of Bayesian neural networks","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"publication":"35th Conference on Neural Information Processing Systems","project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"month":"12","day":"01","ddc":["000"],"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","creator":"mlechner","content_type":"application/pdf","success":1,"date_created":"2022-01-26T07:39:59Z","date_updated":"2022-01-26T07:39:59Z","file_id":"10682","file_size":452492,"file_name":"infinite_time_horizon_safety_o.pdf","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4"}],"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"quality_controlled":"1","related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"alternative_title":[" Advances in Neural Information Processing Systems"],"doi":"10.48550/arXiv.2111.03165","date_updated":"2025-07-14T09:10:12Z","article_processing_charge":"No","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Žikelić","first_name":"Ðorđe","full_name":"Žikelić, Ðorđe"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"date_published":"2021-12-01T00:00:00Z","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)"},"conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-10","location":"Virtual","start_date":"2021-12-06"},"file_date_updated":"2022-01-26T07:39:59Z"},{"has_accepted_license":"1","year":"2021","_id":"10668","type":"conference","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","page":"478-489","volume":139,"publication_identifier":{"issn":["2640-3498"]},"citation":{"apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &#38; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 478–489). Virtual: ML Research Press.","chicago":"Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, 139:478–89. ML Research Press, 2021.","ieee":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround receptive fields for accurate and robust image classification,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 478–489.","mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, vol. 139, ML Research Press, 2021, pp. 478–89.","ista":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround receptive fields for accurate and robust image classification. Proceedings of the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR, vol. 139, 478–489.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:478-489."},"acknowledgement":"Z.B. is supported by the Doctoral College Resilient Embedded Systems, which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad, and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","status":"public","oa":1,"oa_version":"Published Version","date_created":"2022-01-25T15:46:33Z","publisher":"ML Research Press","title":"On-off center-surround receptive fields for accurate and robust image classification","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication":"Proceedings of the 38th International Conference on Machine Learning","abstract":[{"text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines.","lang":"eng"}],"publication_status":"published","file":[{"content_type":"application/pdf","success":1,"date_created":"2022-01-26T07:38:32Z","relation":"main_file","creator":"mlechner","access_level":"open_access","file_size":4246561,"file_name":"babaiee21a.pdf","checksum":"d30eae62561bb517d9f978437d7677db","file_id":"10681","date_updated":"2022-01-26T07:38:32Z"}],"intvolume":"       139","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v139/babaiee21a"}],"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"month":"07","day":"01","ddc":["000"],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)"},"conference":{"end_date":"2021-07-24","name":"ML: Machine Learning","start_date":"2021-07-18","location":"Virtual"},"file_date_updated":"2022-01-26T07:38:32Z","quality_controlled":"1","date_updated":"2022-05-04T15:02:27Z","alternative_title":["PMLR"],"article_processing_charge":"No","author":[{"full_name":"Babaiee, Zahra","last_name":"Babaiee","first_name":"Zahra"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"date_published":"2021-07-01T00:00:00Z"},{"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."}],"arxiv":1,"date_created":"2022-01-25T15:47:20Z","oa_version":"Published Version","publisher":"AAAI Press","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","title":"On the verification of neural ODEs with stochastic guarantees","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_identifier":{"isbn":["978-1-57735-866-4"],"issn":["2159-5399"],"eissn":["2374-3468"]},"citation":{"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.","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.","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.","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.","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.","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."},"issue":"13","external_id":{"arxiv":["2012.08863"]},"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","status":"public","oa":1,"year":"2021","has_accepted_license":"1","_id":"10669","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":35,"page":"11525-11535","quality_controlled":"1","article_processing_charge":"No","alternative_title":["Technical Tracks"],"date_updated":"2022-05-24T06:33:14Z","author":[{"full_name":"Grunbacher, Sophie","first_name":"Sophie","last_name":"Grunbacher"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Cyranka, Jacek","last_name":"Cyranka","first_name":"Jacek"},{"first_name":"Scott A","last_name":"Smolka","full_name":"Smolka, Scott A"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"date_published":"2021-05-28T00:00:00Z","conference":{"location":"Virtual","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09"},"file_date_updated":"2022-01-26T07:38:08Z","month":"05","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"ddc":["000"],"day":"28","file":[{"file_id":"10680","date_updated":"2022-01-26T07:38:08Z","file_size":286906,"checksum":"468d07041e282a1d46ffdae92f709630","file_name":"17372-Article Text-20866-1-2-20210518.pdf","relation":"main_file","creator":"mlechner","access_level":"open_access","content_type":"application/pdf","date_created":"2022-01-26T07:38:08Z","success":1}],"publication_status":"published","intvolume":"        35","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372","open_access":"1"}]},{"has_accepted_license":"1","year":"2021","_id":"10670","type":"conference","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","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.","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.","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.","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, 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, .","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."},"external_id":{"arxiv":["2106.08314"]},"status":"public","oa":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","oa_version":"Published Version","date_created":"2022-01-25T15:47:50Z","title":"Causal navigation by continuous-time neural networks","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication":"35th Conference on Neural Information Processing Systems","abstract":[{"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.","lang":"eng"}],"arxiv":1,"publication_status":"published","file":[{"file_size":6841228,"checksum":"be81f0ade174a8c9b2d4fe09590b2021","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","date_updated":"2022-01-26T07:37:24Z","file_id":"10679","content_type":"application/pdf","date_created":"2022-01-26T07:37:24Z","success":1,"relation":"main_file","access_level":"open_access","creator":"mlechner"}],"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html","open_access":"1"}],"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"month":"12","day":"01","ddc":["000"],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)"},"conference":{"start_date":"2021-12-06","location":"Virtual","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems"},"file_date_updated":"2022-01-26T07:37:24Z","quality_controlled":"1","date_updated":"2022-01-26T14:33:31Z","alternative_title":[" Advances in Neural Information Processing Systems"],"article_processing_charge":"No","date_published":"2021-12-01T00:00:00Z","author":[{"full_name":"Vorbach, Charles J","first_name":"Charles J","last_name":"Vorbach"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"}]},{"main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936","open_access":"1"}],"intvolume":"        35","publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","creator":"mlechner","content_type":"application/pdf","success":1,"date_created":"2022-01-26T07:36:03Z","date_updated":"2022-01-26T07:36:03Z","file_id":"10678","file_size":4302669,"file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","checksum":"0f06995fba06dbcfa7ed965fc66027ff"}],"day":"28","ddc":["000"],"project":[{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"month":"05","file_date_updated":"2022-01-26T07:36:03Z","conference":{"end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02","location":"Virtual"},"date_published":"2021-05-28T00:00:00Z","author":[{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"alternative_title":["Technical Tracks"],"date_updated":"2022-05-24T06:36:54Z","article_processing_charge":"No","quality_controlled":"1","page":"7657-7666","volume":35,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10671","year":"2021","has_accepted_license":"1","oa":1,"status":"public","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.","external_id":{"arxiv":["2006.04439"]},"issue":"9","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.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","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.","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.","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.","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."},"publication_identifier":{"issn":["2159-5399"],"eissn":["2374-3468"],"isbn":["978-1-57735-866-4"]},"title":"Liquid time-constant networks","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","publisher":"AAAI Press","oa_version":"Published Version","date_created":"2022-01-25T15:48:36Z","arxiv":1,"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"}]},{"article_processing_charge":"No","date_updated":"2023-08-17T06:56:42Z","doi":"10.23638/LMCS-17(1:10)2021","author":[{"full_name":"Aghajohari, Milad","last_name":"Aghajohari","first_name":"Milad"},{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"date_published":"2021-02-03T00:00:00Z","quality_controlled":"1","keyword":["computer science","computer science and game theory","logic in computer science"],"scopus_import":"1","file_date_updated":"2022-01-26T08:04:50Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["510"],"day":"03","isi":1,"month":"02","language":[{"iso":"eng"}],"project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"file":[{"file_id":"10690","date_updated":"2022-01-26T08:04:50Z","file_size":819878,"checksum":"b35586a50ed1ca8f44767de116d18d81","file_name":"2021_LMCS_AGHAJOHAR.pdf","relation":"main_file","access_level":"open_access","creator":"alisjak","content_type":"application/pdf","date_created":"2022-01-26T08:04:50Z","success":1}],"publication_status":"published","intvolume":"        17","arxiv":1,"abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets."}],"publisher":"International Federation for Computational Logic","publication":"Logical Methods in Computer Science","department":[{"_id":"ToHe"}],"title":"Determinacy in discrete-bidding infinite-duration games","date_created":"2022-01-25T16:32:13Z","oa_version":"Published Version","issue":"1","external_id":{"isi":["000658724600010"],"arxiv":["1905.03588"]},"article_type":"original","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","oa":1,"status":"public","publication_identifier":{"eissn":["1860-5974"]},"citation":{"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.","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>.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. 2021;17(1):10:1-10:23. doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>","apa":"Aghajohari, M., Avni, G., &#38; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2021. <a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">https://doi.org/10.23638/LMCS-17(1:10)2021</a>.","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."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","volume":17,"page":"10:1-10:23","has_accepted_license":"1","year":"2021","_id":"10674"},{"date_created":"2022-01-26T08:01:30Z","oa_version":"Published Version","publisher":"TU Wien Academic Press","publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","title":"The Civl verifier","department":[{"_id":"ToHe"}],"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"}],"has_accepted_license":"1","year":"2021","_id":"10688","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"conference","volume":2,"page":"143–152","publication_identifier":{"isbn":["978-3-85448-046-4"]},"citation":{"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>","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.","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.","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>.","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.","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>"},"oa":1,"status":"public","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).","conference":{"start_date":"2021-10-20","location":"Virtual","end_date":"2021-10-22","name":"FMCAD: Formal Methods in Computer-Aided Design"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2022-01-26T08:04:29Z","quality_controlled":"1","article_processing_charge":"No","alternative_title":["Conference Series"],"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","date_updated":"2022-01-26T08:20:41Z","date_published":"2021-10-01T00:00:00Z","author":[{"first_name":"Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"editor":[{"full_name":"Ruzica, Piskac","first_name":"Piskac","last_name":"Ruzica"},{"full_name":"Whalen, Michael W.","first_name":"Michael W.","last_name":"Whalen"}],"file":[{"relation":"main_file","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","date_created":"2022-01-26T08:04:29Z","success":1,"file_id":"10689","date_updated":"2022-01-26T08:04:29Z","file_size":390555,"checksum":"35438ac9f9750340b7f8ae4ae3220d9f","file_name":"2021_FCAD2021_Kragl.pdf"}],"publication_status":"published","intvolume":"         2","month":"10","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"ddc":["000"],"day":"01"},{"_id":"10692","main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR21/Session/E42.10"}],"intvolume":"        66","year":"2021","volume":66,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"conference","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.","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.","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.","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.","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.","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."},"month":"03","publication_identifier":{"issn":["0003-0503"]},"language":[{"iso":"eng"}],"oa":1,"status":"public","issue":"1","day":"01","date_created":"2022-01-27T09:49:48Z","conference":{"end_date":"2021-03-19","name":"APS: American Physical Society","start_date":"2021-03-15","location":"Virtual"},"oa_version":"Published Version","publication":"APS March Meeting 2021","title":"Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order","article_number":"E42.00010","publisher":"American Physical Society","abstract":[{"lang":"eng","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."}],"quality_controlled":"1","extern":"1","author":[{"first_name":"Hryhoriy","last_name":"Polshyn","orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"full_name":"Zhu, Jihang","last_name":"Zhu","first_name":"Jihang"},{"last_name":"Kumar","first_name":"Manish","full_name":"Kumar, Manish"},{"full_name":"Zhang, Yuxuan","first_name":"Yuxuan","last_name":"Zhang"},{"full_name":"Yang, Fangyuan","first_name":"Fangyuan","last_name":"Yang"},{"full_name":"Tschirhart, Charles","last_name":"Tschirhart","first_name":"Charles"},{"first_name":"Marec","last_name":"Serlin","full_name":"Serlin, Marec"},{"last_name":"Watanabe","first_name":"Kenji","full_name":"Watanabe, Kenji"},{"full_name":"Tanaguchi, Takashi","first_name":"Takashi","last_name":"Tanaguchi"},{"last_name":"MacDonald","first_name":"Allan","full_name":"MacDonald, Allan"},{"full_name":"Young, Andrea","first_name":"Andrea","last_name":"Young"}],"date_published":"2021-03-01T00:00:00Z","article_processing_charge":"No","date_updated":"2022-01-27T10:46:23Z","alternative_title":["Bulletin of the American Physical Society"]},{"conference":{"start_date":"2021-01-10","location":"Virtual","end_date":"2021-01-13","name":"SODA: Symposium on Discrete Algorithms"},"scopus_import":"1","quality_controlled":"1","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","first_name":"Guy"},{"last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","first_name":"Dorde"}],"date_published":"2021-01-01T00:00:00Z","editor":[{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"}],"article_processing_charge":"No","date_updated":"2025-07-14T09:10:12Z","doi":"10.1137/1.9781611976465.38","main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"publication_status":"published","month":"01","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"language":[{"iso":"eng"}],"day":"01","ec_funded":1,"date_created":"2022-01-27T12:11:23Z","oa_version":"Preprint","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"title":"Infinite-duration all-pay bidding games","publisher":"Society for Industrial and Applied Mathematics","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"}],"arxiv":1,"_id":"10694","year":"2021","page":"617-636","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"conference","citation":{"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>","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.","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>.","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.","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.","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>"},"publication_identifier":{"isbn":["978-1-61197-646-5"]},"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.","status":"public","oa":1,"external_id":{"arxiv":["2005.06636"]}},{"quality_controlled":"1","keyword":["Algebra and Number Theory"],"doi":"10.1112/s0010437x21007351","date_updated":"2023-08-17T06:59:16Z","article_processing_charge":"No","date_published":"2021-06-28T00:00:00Z","author":[{"first_name":"Pascal","last_name":"Autissier","full_name":"Autissier, Pascal"},{"id":"6A459894-5FDD-11E9-AF35-BB24E6697425","full_name":"Bonolis, Dante","last_name":"Bonolis","first_name":"Dante"},{"full_name":"Lamzouri, Youness","first_name":"Youness","last_name":"Lamzouri"}],"publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1909.03266","open_access":"1"}],"intvolume":"       157","language":[{"iso":"eng"}],"month":"06","isi":1,"day":"28","oa_version":"Preprint","date_created":"2022-02-01T08:10:43Z","publisher":"Cambridge University Press","title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","department":[{"_id":"TiBr"}],"publication":"Compositio Mathematica","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."}],"arxiv":1,"year":"2021","_id":"10711","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"1610-1651","volume":157,"publication_identifier":{"eissn":["1570-5846"],"issn":["0010-437X"]},"citation":{"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>.","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>","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.","short":"P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021) 1610–1651.","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>."},"external_id":{"arxiv":["1909.03266"],"isi":["000667289300001"]},"article_type":"original","issue":"7","oa":1,"status":"public","acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions."},{"doi":"10.2140/APDE.2021.14.2079","date_updated":"2023-10-17T11:26:45Z","article_processing_charge":"No","date_published":"2021-11-10T00:00:00Z","author":[{"orcid":"0000-0002-0495-6822","last_name":"Leopold","first_name":"Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K"},{"id":"856966FE-A408-11E9-977E-802DE6697425","full_name":"Rademacher, Simone Anna Elvira","orcid":"0000-0001-5059-4466","last_name":"Rademacher","first_name":"Simone Anna Elvira"},{"first_name":"Benjamin","last_name":"Schlein","full_name":"Schlein, Benjamin"},{"first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","scopus_import":"1","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.12532"}],"intvolume":"        14","day":"10","language":[{"iso":"eng"}],"project":[{"grant_number":"694227","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"isi":1,"month":"11","publisher":"Mathematical Sciences Publishers","department":[{"_id":"RoSe"}],"title":" The Landau–Pekar equations: Adiabatic theorem and accuracy","publication":"Analysis and PDE","oa_version":"Preprint","ec_funded":1,"date_created":"2022-02-06T23:01:33Z","arxiv":1,"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"}],"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"2079-2100","volume":14,"year":"2021","_id":"10738","article_type":"original","external_id":{"isi":["000733976600004"],"arxiv":["1904.12532"]},"issue":"7","oa":1,"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","status":"public","publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]},"citation":{"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>","short":"N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE 14 (2021) 2079–2100.","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.","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>.","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.","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>.","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>"}},{"title":"Artificial neural network states for non-additive systems","department":[{"_id":"MiLe"}],"publication":"arXiv","oa_version":"Preprint","date_created":"2022-02-17T11:18:57Z","ec_funded":1,"arxiv":1,"author":[{"first_name":"Wojciech","last_name":"Rzadkowski","orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech","id":"48C55298-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail"},{"full_name":"Mentink, Johan H.","first_name":"Johan H.","last_name":"Mentink"}],"date_published":"2021-05-31T00:00:00Z","date_updated":"2023-09-07T13:44:16Z","doi":"10.48550/arXiv.2105.15193","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10759"}]},"article_processing_charge":"No","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"}],"page":"2105.15193","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10762","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2105.15193"}],"publication_status":"submitted","year":"2021","oa":1,"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.","status":"public","day":"31","external_id":{"arxiv":["2105.15193"]},"citation":{"ieee":"W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network states for non-additive systems,” <i>arXiv</i>. .","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>.","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>","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>","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>.","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>.","short":"W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.)."},"project":[{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"language":[{"iso":"eng"}],"month":"05"},{"article_number":"2102.05996","publication":"arXiv","department":[{"_id":"ChLa"}],"title":"Fairness through regularization for learning to rank","date_created":"2022-02-28T14:13:59Z","oa_version":"Preprint","article_processing_charge":"No","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10799"}]},"doi":"10.48550/arXiv.2102.05996","date_updated":"2023-09-07T13:42:08Z","date_published":"2021-06-07T00:00:00Z","author":[{"first_name":"Nikola H","last_name":"Konstantinov","full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0002-4561-241X","last_name":"Lampert","first_name":"Christoph"}],"arxiv":1,"abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","year":"2021","publication_status":"submitted","main_file_link":[{"url":"https://arxiv.org/abs/2102.05996","open_access":"1"}],"_id":"10803","external_id":{"arxiv":["2102.05996"]},"day":"07","oa":1,"status":"public","month":"06","language":[{"iso":"eng"}],"citation":{"ieee":"N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” <i>arXiv</i>. .","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>.","apa":"Konstantinov, N. H., &#38; Lampert, C. (n.d.). Fairness through regularization for learning to rank. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2102.05996\">https://doi.org/10.48550/arXiv.2102.05996</a>","ama":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2102.05996\">10.48550/arXiv.2102.05996</a>","short":"N.H. Konstantinov, C. Lampert, ArXiv (n.d.).","ista":"Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996.","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>."}},{"page":"1898-1903","volume":1,"type":"journal_article","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10806","year":"2021","has_accepted_license":"1","oa":1,"status":"public","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.","article_type":"original","issue":"11","citation":{"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>.","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.","apa":"Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca, J., De Roo, J., &#38; Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacsau.1c00349\">https://doi.org/10.1021/jacsau.1c00349</a>","ama":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. <i>JACS Au</i>. 2021;1(11):1898-1903. doi:<a href=\"https://doi.org/10.1021/jacsau.1c00349\">10.1021/jacsau.1c00349</a>","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.","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.","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>."},"publication_identifier":{"issn":["2691-3704"],"eissn":["2691-3704"]},"department":[{"_id":"MaIb"}],"title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","publication":"JACS Au","publisher":"American Chemical Society","oa_version":"Published Version","date_created":"2022-03-02T15:24:16Z","ec_funded":1,"abstract":[{"lang":"eng","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."}],"intvolume":"         1","publication_status":"published","file":[{"date_created":"2022-03-02T15:33:18Z","success":1,"content_type":"application/pdf","creator":"cchlebak","access_level":"open_access","relation":"main_file","checksum":"1c66a35369e911312a359111420318a9","file_name":"2021_JACSAu_Calcabrini.pdf","file_size":1257973,"file_id":"10807","date_updated":"2022-03-02T15:33:18Z"}],"day":"22","ddc":["540"],"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"month":"11","file_date_updated":"2022-03-02T15:33:18Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"last_name":"Calcabrini","first_name":"Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","full_name":"Calcabrini, Mariano"},{"first_name":"Dietger","last_name":"Van den Eynden","full_name":"Van den Eynden, Dietger"},{"first_name":"Sergi","last_name":"Sanchez Ribot","full_name":"Sanchez Ribot, Sergi","id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a"},{"last_name":"Pokratath","first_name":"Rohan","full_name":"Pokratath, Rohan"},{"first_name":"Jordi","last_name":"Llorca","full_name":"Llorca, Jordi"},{"full_name":"De Roo, Jonathan","first_name":"Jonathan","last_name":"De Roo"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843"}],"date_published":"2021-11-22T00:00:00Z","related_material":{"record":[{"id":"12885","relation":"dissertation_contains","status":"public"}],"link":[{"url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr","relation":"earlier_version"}]},"date_updated":"2023-05-05T08:45:36Z","doi":"10.1021/jacsau.1c00349","article_processing_charge":"Yes (via OA deal)","keyword":["general medicine"],"quality_controlled":"1"},{"article_processing_charge":"No","doi":"10.1126/science.abg0886","date_updated":"2023-08-17T07:00:35Z","date_published":"2021-02-12T00:00:00Z","author":[{"id":"2A70014E-F248-11E8-B48F-1D18A9856A87","full_name":"Liu, Yu","last_name":"Liu","orcid":"0000-0001-7313-6740","first_name":"Yu"},{"first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","keyword":["multidisciplinary"],"scopus_import":"1","publication_status":"published","intvolume":"       371","day":"12","pmid":1,"isi":1,"month":"02","language":[{"iso":"eng"}],"publisher":"American Association for the Advancement of Science","publication":"Science","title":"Tidying up the mess","department":[{"_id":"MaIb"}],"date_created":"2022-03-03T09:51:48Z","oa_version":"None","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."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","volume":371,"page":"678-679","year":"2021","_id":"10809","issue":"6530","external_id":{"pmid":["33574201"],"isi":["000617551600027"]},"article_type":"letter_note","status":"public","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"citation":{"short":"Y. Liu, M. Ibáñez, Science 371 (2021) 678–679.","ista":"Liu Y, Ibáñez M. 2021. Tidying up the mess. Science. 371(6530), 678–679.","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>.","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>","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>","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>.","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."}},{"publication_status":"published","file":[{"content_type":"application/pdf","date_created":"2022-06-02T12:51:07Z","relation":"main_file","access_level":"open_access","creator":"patrickd","file_size":1699466,"checksum":"9fec5b667909ef52be96d502e4f8c2ae","file_name":"Guzmanetal2021.pdf","embargo":"2022-06-17","file_id":"11430","date_updated":"2022-06-18T22:30:03Z"},{"date_updated":"2022-06-18T22:30:03Z","embargo":"2022-06-17","file_id":"11431","file_name":"Guzmanetal2021Suppl.pdf","checksum":"52a005b13a114e3c3a28fa6bbe8b1a8d","file_size":3005651,"title":"Supplementary Material","access_level":"open_access","creator":"patrickd","relation":"supplementary_material","date_created":"2022-06-02T12:53:47Z","content_type":"application/pdf"}],"intvolume":"         1","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/647800"}],"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glumatergic synapse"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z00312","call_identifier":"FWF"}],"month":"12","day":"16","ddc":["610"],"acknowledged_ssus":[{"_id":"SSU"}],"file_date_updated":"2022-06-18T22:30:03Z","quality_controlled":"1","scopus_import":"1","keyword":["general medicine"],"doi":"10.1038/s43588-021-00157-1","date_updated":"2023-08-10T22:30:10Z","related_material":{"record":[{"id":"10110","relation":"software","status":"public"}],"link":[{"url":"https://ista.ac.at/en/news/spot-the-difference/","relation":"press_release"}]},"article_processing_charge":"No","date_published":"2021-12-16T00:00:00Z","author":[{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","full_name":"Guzmán, José","orcid":"0000-0003-2209-5242","last_name":"Guzmán","first_name":"José"},{"first_name":"Alois","last_name":"Schlögl","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Espinoza Martinez, Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia ","orcid":"0000-0003-4710-2082","last_name":"Espinoza Martinez"},{"first_name":"Xiaomin","last_name":"Zhang","full_name":"Zhang, Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87"},{"id":"4952F31E-F248-11E8-B48F-1D18A9856A87","full_name":"Suter, Benjamin","last_name":"Suter","orcid":"0000-0002-9885-6936","first_name":"Benjamin"},{"first_name":"Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"has_accepted_license":"1","year":"2021","_id":"10816","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"830-842","volume":1,"publication_identifier":{"issn":["2662-8457"]},"citation":{"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>.","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.","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>","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>","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>.","short":"J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas, Nature Computational Science 1 (2021) 830–842.","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."},"article_type":"original","issue":"12","status":"public","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.).","oa":1,"oa_version":"Submitted Version","ec_funded":1,"date_created":"2022-03-04T08:32:36Z","publisher":"Springer Nature","title":"How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network","department":[{"_id":"PeJo"}],"publication":"Nature Computational Science","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"}]},{"date_published":"2021-05-24T00:00:00Z","author":[{"full_name":"Stahnke, Stephanie","last_name":"Stahnke","first_name":"Stephanie"},{"first_name":"Hermann","last_name":"Döring","full_name":"Döring, Hermann"},{"full_name":"Kusch, Charly","last_name":"Kusch","first_name":"Charly"},{"full_name":"de Gorter, David J.J.","first_name":"David J.J.","last_name":"de Gorter"},{"last_name":"Dütting","first_name":"Sebastian","full_name":"Dütting, Sebastian"},{"full_name":"Guledani, Aleks","first_name":"Aleks","last_name":"Guledani"},{"last_name":"Pleines","first_name":"Irina","full_name":"Pleines, Irina"},{"full_name":"Schnoor, Michael","last_name":"Schnoor","first_name":"Michael"},{"last_name":"Sixt","orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"last_name":"Geffers","first_name":"Robert","full_name":"Geffers, Robert"},{"last_name":"Rohde","first_name":"Manfred","full_name":"Rohde, Manfred"},{"first_name":"Mathias","last_name":"Müsken","full_name":"Müsken, Mathias"},{"first_name":"Frieda","last_name":"Kage","full_name":"Kage, Frieda"},{"full_name":"Steffen, Anika","first_name":"Anika","last_name":"Steffen"},{"first_name":"Jan","last_name":"Faix","full_name":"Faix, Jan"},{"full_name":"Nieswandt, Bernhard","last_name":"Nieswandt","first_name":"Bernhard"},{"last_name":"Rottner","first_name":"Klemens","full_name":"Rottner, Klemens"},{"full_name":"Stradal, Theresia E.B.","last_name":"Stradal","first_name":"Theresia E.B."}],"article_processing_charge":"No","doi":"10.1016/j.cub.2021.02.043","date_updated":"2023-08-17T07:01:14Z","keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"scopus_import":"1","quality_controlled":"1","pmid":1,"day":"24","month":"05","isi":1,"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1101/2020.03.24.005835","open_access":"1"}],"intvolume":"        31","publication_status":"published","abstract":[{"lang":"eng","text":"Hematopoietic-specific protein 1 (Hem1) is an essential subunit of the WAVE regulatory complex (WRC) in immune cells. WRC is crucial for Arp2/3 complex activation and the protrusion of branched actin filament networks. Moreover, Hem1 loss of function in immune cells causes autoimmune diseases in humans. Here, we show that genetic removal of Hem1 in macrophages diminishes frequency and efficacy of phagocytosis as well as phagocytic cup formation in addition to defects in lamellipodial protrusion and migration. Moreover, Hem1-null macrophages displayed strong defects in cell adhesion despite unaltered podosome formation and concomitant extracellular matrix degradation. Specifically, dynamics of both adhesion and de-adhesion as well as concomitant phosphorylation of paxillin and focal adhesion kinase (FAK) were significantly compromised. Accordingly, disruption of WRC function in non-hematopoietic cells coincided with both defects in adhesion turnover and altered FAK and paxillin phosphorylation. Consistently, platelets exhibited reduced adhesion and diminished integrin αIIbβ3 activation upon WRC removal. Interestingly, adhesion phenotypes, but not lamellipodia formation, were partially rescued by small molecule activation of FAK. A full rescue of the phenotype, including lamellipodia formation, required not only the presence of WRCs but also their binding to and activation by Rac. Collectively, our results uncover that WRC impacts on integrin-dependent processes in a FAK-dependent manner, controlling formation and dismantling of adhesions, relevant for properly grabbing onto extracellular surfaces and particles during cell edge expansion, like in migration or phagocytosis."}],"publication":"Current Biology","department":[{"_id":"MiSi"}],"title":"Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion","publisher":"Elsevier","date_created":"2022-03-08T07:51:04Z","oa_version":"Preprint","acknowledgement":"We are grateful to Silvia Prettin, Ina Schleicher, and Petra Hagendorff for expert technical assistance; David Dettbarn for animal keeping and breeding; and Lothar Gröbe and Maria Höxter for cell sorting. We also thank Werner Tegge for peptides and Giorgio Scita for antibodies. This work was supported, in part, by the Deutsche Forschungsgemeinschaft (DFG), Priority Programm SPP1150 (to T.E.B.S., K.R., and M. Sixt), and by DFG grant GRK2223/1 (to K.R.). T.E.B.S. acknowledges support by the Helmholtz Society through HGF impulse fund W2/W3-066 and M. Schnoor by the Mexican Council for Science and Technology (CONACyT, 284292 ), Fund SEP-Cinvestav ( 108 ), and the Royal Society, UK (Newton Advanced Fellowship, NAF/R1/180017 ).","oa":1,"status":"public","issue":"10","external_id":{"isi":["000654652200002"],"pmid":["33711252"]},"article_type":"original","citation":{"apa":"Stahnke, S., Döring, H., Kusch, C., de Gorter, D. J. J., Dütting, S., Guledani, A., … Stradal, T. E. B. (2021). Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>","chicago":"Stahnke, Stephanie, Hermann Döring, Charly Kusch, David J.J. de Gorter, Sebastian Dütting, Aleks Guledani, Irina Pleines, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>.","ieee":"S. Stahnke <i>et al.</i>, “Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion,” <i>Current Biology</i>, vol. 31, no. 10. Elsevier, p. 2051–2064.e8, 2021.","short":"S. Stahnke, H. Döring, C. Kusch, D.J.J. de Gorter, S. Dütting, A. Guledani, I. Pleines, M. Schnoor, M.K. Sixt, R. Geffers, M. Rohde, M. Müsken, F. Kage, A. Steffen, J. Faix, B. Nieswandt, K. Rottner, T.E.B. Stradal, Current Biology 31 (2021) 2051–2064.e8.","ista":"Stahnke S, Döring H, Kusch C, de Gorter DJJ, Dütting S, Guledani A, Pleines I, Schnoor M, Sixt MK, Geffers R, Rohde M, Müsken M, Kage F, Steffen A, Faix J, Nieswandt B, Rottner K, Stradal TEB. 2021. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. Current Biology. 31(10), 2051–2064.e8.","mla":"Stahnke, Stephanie, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>, vol. 31, no. 10, Elsevier, 2021, p. 2051–2064.e8, doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>.","ama":"Stahnke S, Döring H, Kusch C, et al. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. 2021;31(10):2051-2064.e8. doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>"},"publication_identifier":{"issn":["0960-9822"]},"volume":31,"page":"2051-2064.e8","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","_id":"10834","year":"2021"},{"doi":"10.1111/all.14604","date_updated":"2023-09-05T15:58:53Z","article_processing_charge":"No","author":[{"full_name":"Pranger, Christina L.","last_name":"Pranger","first_name":"Christina L."},{"first_name":"Judit","orcid":"0000-0002-8777-3502","last_name":"Fazekas-Singer","full_name":"Fazekas-Singer, Judit","id":"36432834-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Köhler, Verena K.","last_name":"Köhler","first_name":"Verena K."},{"full_name":"Pali‐Schöll, Isabella","last_name":"Pali‐Schöll","first_name":"Isabella"},{"first_name":"Alessandro","last_name":"Fiocchi","full_name":"Fiocchi, Alessandro"},{"first_name":"Sophia N.","last_name":"Karagiannis","full_name":"Karagiannis, Sophia N."},{"full_name":"Zenarruzabeitia, Olatz","last_name":"Zenarruzabeitia","first_name":"Olatz"},{"first_name":"Francisco","last_name":"Borrego","full_name":"Borrego, Francisco"},{"full_name":"Jensen‐Jarolim, Erika","first_name":"Erika","last_name":"Jensen‐Jarolim"}],"date_published":"2021-05-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","keyword":["Immunology","Immunology and Allergy"],"file_date_updated":"2022-03-08T11:23:16Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","ddc":["570"],"pmid":1,"language":[{"iso":"eng"}],"isi":1,"month":"05","publication_status":"published","file":[{"content_type":"application/pdf","success":1,"date_created":"2022-03-08T11:23:16Z","relation":"main_file","creator":"dernst","access_level":"open_access","file_size":626081,"file_name":"2021_Allergy_Pranger.pdf","checksum":"9526f9554112fc027c9f7fa540c488cd","date_updated":"2022-03-08T11:23:16Z","file_id":"10837"}],"intvolume":"        76","publisher":"Wiley","department":[{"_id":"Bio"}],"title":"PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow's milk allergy and tolerance","publication":"Allergy","oa_version":"Published Version","date_created":"2022-03-08T11:19:05Z","external_id":{"pmid":["32990982"],"isi":["000577708800001"]},"article_type":"letter_note","issue":"5","acknowledgement":"This  work  was  supported  by  the  Austrian  Science  Fund  (FWF)  grants  MCCA  W1248-B30  and  SFB  F4606-B28  to  EJJ.  CP  received  a  short-term research fellowship of the European Federation of Immunological Societies  (EFIS-IL)  for  a  research  visit  at  Biocruces  Bizkaia  Health  Research  Institute,  Barakaldo,  Spain.  VKK  received  an  EFIS-IL  short-term  research  fellowship  for  a  research  visit  at  King’s  College  London.  The research was funded by the National Institute for Health Research (NIHR) Biomedical Research Centre (BRC) based at Guy's and St Thomas' NHS Foundation Trust and King's College London (IS-BRC-1215-20006) (SNK).  The  authors  acknowledge  support  by  the  Medical  Research  Council (MR/L023091/1) (SNK); Breast Cancer Now (147; KCL-BCN-Q3)(SNK); Cancer Research UK (C30122/A11527; C30122/A15774) (SNK); Cancer  Research  UK  King's  Health  Partners  Centre  at  King's  College  London   (C604/A25135)   (SNK);   CRUK/NIHR   in   England/DoH   for   Scotland,  Wales  and  Northern  Ireland  Experimental  Cancer  Medicine  Centre  (C10355/A15587)  (SNK).  The  views  expressed  are  those  of  the  author(s)  and  not  necessarily  those  of  the  NHS,  the  NIHR  or  the  Department  of  Health.  Additionally,  this  work  was  funded  by  Instituto  de  Salud  Carlos  III  through  the  project  \"PI16/01223\"  (Co-funded  by  European Regional Development Fund; “A way to make Europe”) to FB and  by  the  Department  of  Health,  Basque  Government  through  the  project “2019111031” to OZ. OZ is recipient of a Sara Borrell 2017 post-doctoral contract “CD17/00128” funded by Instituto de Salud Carlos III (Co-funded by European Social Fund; “Investing in your future”).","oa":1,"status":"public","publication_identifier":{"issn":["0105-4538"],"eissn":["1398-9995"]},"citation":{"ama":"Pranger CL, Singer J, Köhler VK, et al. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. 2021;76(5):1553-1556. doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>","short":"C.L. Pranger, J. Singer, V.K. Köhler, I. Pali‐Schöll, A. Fiocchi, S.N. Karagiannis, O. Zenarruzabeitia, F. Borrego, E. Jensen‐Jarolim, Allergy 76 (2021) 1553–1556.","ista":"Pranger CL, Singer J, Köhler VK, Pali‐Schöll I, Fiocchi A, Karagiannis SN, Zenarruzabeitia O, Borrego F, Jensen‐Jarolim E. 2021. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. Allergy. 76(5), 1553–1556.","mla":"Pranger, Christina L., et al. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>, vol. 76, no. 5, Wiley, 2021, pp. 1553–56, doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>.","ieee":"C. L. Pranger <i>et al.</i>, “PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance,” <i>Allergy</i>, vol. 76, no. 5. Wiley, pp. 1553–1556, 2021.","chicago":"Pranger, Christina L., Judit Singer, Verena K. Köhler, Isabella Pali‐Schöll, Alessandro Fiocchi, Sophia N. Karagiannis, Olatz Zenarruzabeitia, Francisco Borrego, and Erika Jensen‐Jarolim. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>.","apa":"Pranger, C. L., Singer, J., Köhler, V. K., Pali‐Schöll, I., Fiocchi, A., Karagiannis, S. N., … Jensen‐Jarolim, E. (2021). PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. Wiley. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>"},"type":"journal_article","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"1553-1556","volume":76,"has_accepted_license":"1","year":"2021","_id":"10836"}]