[{"has_accepted_license":"1","corr_author":"1","year":"2021","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","alternative_title":["LIPIcs"],"file":[{"date_updated":"2022-01-17T10:49:03Z","creator":"cchlebak","content_type":"application/pdf","checksum":"d5a82ba893c3bc5da5914edbb3efb92b","access_level":"open_access","file_size":844224,"success":1,"file_id":"10634","file_name":"2021_LIPIcs_Arrighi.pdf","date_created":"2022-01-17T10:49:03Z","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7215-0"]},"article_number":"34","conference":{"end_date":"2021-12-17","location":"Virtual","start_date":"2021-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"department":[{"_id":"KrCh"}],"article_processing_charge":"No","oa":1,"ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2025-05-14T10:53:59Z","publication_status":"published","date_published":"2021-11-29T00:00:00Z","month":"11","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"_id":"10630","doi":"10.4230/LIPIcs.FSTTCS.2021.34","author":[{"last_name":"Arrighi","first_name":"Emmanuel","full_name":"Arrighi, Emmanuel"},{"last_name":"Fernau","first_name":"Henning","full_name":"Fernau, Henning"},{"last_name":"Hoffmann","first_name":"Stefan","full_name":"Hoffmann, Stefan"},{"last_name":"Holzer","first_name":"Markus","full_name":"Holzer, Markus"},{"last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R"},{"last_name":"De Oliveira Oliveira","first_name":"Mateus","full_name":"De Oliveira Oliveira, Mateus"},{"last_name":"Wolf","first_name":"Petra","full_name":"Wolf, Petra"}],"quality_controlled":"1","intvolume":"       213","arxiv":1,"external_id":{"arxiv":["2110.01279"]},"ddc":["000"],"citation":{"ista":"Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.","short":"E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","chicago":"Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>.","ieee":"E. Arrighi <i>et al.</i>, “On the complexity of intersection non-emptiness for star-free language classes,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","mla":"Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>.","ama":"Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>","apa":"Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &#38; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>"},"acknowledgement":"We like to thank Lukas Fleischer and Michael Wehar for our discussions. This work started at the Schloss Dagstuhl Event 20483 Moderne Aspekte der Komplexitätstheorie in der Automatentheorie https://www.dagstuhl.de/20483.\r\n","type":"conference","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","date_created":"2022-01-16T23:01:29Z","day":"29","abstract":[{"text":"In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the languages accepted by the automata in the list. We analyze the complexity of the Intersection Non-emptiness problem under the promise that all input automata accept a language in some level of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy. Automata accepting languages from the lowest levels of these hierarchies arise naturally in the context of model checking. We identify a dichotomy in the dot-depth hierarchy by showing that the problem is already NP-complete when all input automata accept languages of the levels B_0 or B_{1/2} and already PSPACE-hard when all automata accept a language from the level B_1. Conversely, we identify a tetrachotomy in the Straubing-Thérien hierarchy. More precisely, we show that the problem is in AC^0 when restricted to level L_0; complete for L or NL, depending on the input representation, when restricted to languages in the level L_{1/2}; NP-complete when the input is given as DFAs accepting a language in L_1 or L_{3/2}; and finally, PSPACE-complete when the input automata accept languages in level L_2 or higher. Moreover, we show that the proof technique used to show containment in NP for DFAs accepting languages in L_1 or L_{3/2} does not generalize to the context of NFAs. To prove this, we identify a family of languages that provide an exponential separation between the state complexity of general NFAs and that of partially ordered NFAs. To the best of our knowledge, this is the first superpolynomial separation between these two models of computation.","lang":"eng"}],"volume":213,"file_date_updated":"2022-01-17T10:49:03Z","language":[{"iso":"eng"}],"title":"On the complexity of intersection non-emptiness for star-free language classes","scopus_import":"1"},{"publisher":"American Physical Society","ec_funded":1,"date_published":"2021-12-30T00:00:00Z","article_type":"original","month":"12","date_updated":"2025-03-31T16:00:55Z","publication_status":"published","article_processing_charge":"No","article_number":"L061303","department":[{"_id":"MiLe"}],"oa":1,"oa_version":"Preprint","publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","corr_author":"1","issue":"6","year":"2021","status":"public","scopus_import":"1","isi":1,"abstract":[{"lang":"eng","text":"We combine experimental and theoretical approaches to explore excited rotational states of molecules embedded in helium nanodroplets using CS2 and I2 as examples. Laser-induced nonadiabatic molecular alignment is employed to measure spectral lines for rotational states extending beyond those initially populated at the 0.37 K droplet temperature. We construct a simple quantum-mechanical model, based on a linear rotor coupled to a single-mode bosonic bath, to determine the rotational energy structure in its entirety. The calculated and measured spectral lines are in good agreement. We show that the effect of the surrounding superfluid on molecular rotation can be rationalized by a single quantity, the angular momentum, transferred from the molecule to the droplet."}],"day":"30","date_created":"2022-01-16T23:01:29Z","title":"Excited rotational states of molecules in a superfluid","main_file_link":[{"url":"http://128.84.4.18/abs/2107.00468","open_access":"1"}],"language":[{"iso":"eng"}],"volume":104,"citation":{"ista":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Albrechtsen SH, Muñoz AV, Christiansen L, Stapelfeldt H, Lemeshko M. 2021. Excited rotational states of molecules in a superfluid. Physical Review A. 104(6), L061303.","chicago":"Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley, Simon H. Albrechtsen, Alberto Viñas Muñoz, Lars Christiansen, Henrik Stapelfeldt, and Mikhail Lemeshko. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>.","short":"I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, S.H. Albrechtsen, A.V. Muñoz, L. Christiansen, H. Stapelfeldt, M. Lemeshko, Physical Review A 104 (2021).","mla":"Cherepanov, Igor, et al. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>, vol. 104, no. 6, L061303, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>.","ieee":"I. Cherepanov <i>et al.</i>, “Excited rotational states of molecules in a superfluid,” <i>Physical Review A</i>, vol. 104, no. 6. American Physical Society, 2021.","apa":"Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Albrechtsen, S. H., Muñoz, A. V., … Lemeshko, M. (2021). Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>","ama":"Cherepanov I, Bighin G, Schouder CA, et al. Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. 2021;104(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>"},"acknowledgement":"I.C. acknowledges the support by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385. G.B. acknowledges support from the Austrian Science Fund (FWF), under project No. M2461-N27. M.L. acknowledges support by the Austrian Science Fund (FWF), under project No. P29902-N27, and by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). H.S acknowledges support from the European Research Council-AdG (Project No. 320459, DropletControl) and from The Villum Foundation through a Villum Investigator grant no. 25886.","external_id":{"arxiv":["2107.00468"],"isi":["000739618300001"]},"arxiv":1,"intvolume":"       104","type":"journal_article","publication":"Physical Review A","doi":"10.1103/PhysRevA.104.L061303","_id":"10631","project":[{"grant_number":"P29902","call_identifier":"FWF","name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425"},{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020"},{"_id":"26986C82-B435-11E9-9278-68D0E5697425","grant_number":"M02641","call_identifier":"FWF","name":"A path-integral approach to composite impurities"}],"quality_controlled":"1","author":[{"last_name":"Cherepanov","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","first_name":"Igor","full_name":"Cherepanov, Igor"},{"full_name":"Bighin, Giacomo","first_name":"Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777","last_name":"Bighin"},{"last_name":"Schouder","full_name":"Schouder, Constant A.","first_name":"Constant A."},{"full_name":"Chatterley, Adam S.","first_name":"Adam S.","last_name":"Chatterley"},{"full_name":"Albrechtsen, Simon H.","first_name":"Simon H.","last_name":"Albrechtsen"},{"last_name":"Muñoz","first_name":"Alberto Viñas","full_name":"Muñoz, Alberto Viñas"},{"full_name":"Christiansen, Lars","first_name":"Lars","last_name":"Christiansen"},{"last_name":"Stapelfeldt","full_name":"Stapelfeldt, Henrik","first_name":"Henrik"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","last_name":"Lemeshko"}]},{"scopus_import":"1","title":"Nonlinear computations in spiking neural networks through multiplicative synapses","language":[{"iso":"eng"}],"file_date_updated":"2022-01-17T11:15:26Z","volume":1,"abstract":[{"lang":"eng","text":"The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing."}],"day":"15","date_created":"2022-01-17T11:12:40Z","type":"journal_article","publication":"Peer Community Journal","acknowledgement":"A preprint version of this article has been peer-reviewed and recommended by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe thank Christian Machens and Nuno Calaim for useful discussions on the project. This report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers, and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported by European Union Horizon 2020 (665385).\r\n","citation":{"ieee":"M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations in spiking neural networks through multiplicative synapses,” <i>Peer Community Journal</i>, vol. 1. Peer Community In, 2021.","mla":"Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>, vol. 1, e68, Peer Community In, 2021, doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>.","apa":"Nardin, M., Phillips, J. W., Podlaski, W. F., &#38; Keemink, S. W. (2021). Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. Peer Community In. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>","ama":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. 2021;1. doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>","ista":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations in spiking neural networks through multiplicative synapses. Peer Community Journal. 1, e68.","chicago":"Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W. Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>. Peer Community In, 2021. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>.","short":"M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal 1 (2021)."},"ddc":["519"],"external_id":{"arxiv":["2009.03857"]},"arxiv":1,"intvolume":"         1","quality_controlled":"1","author":[{"last_name":"Nardin","orcid":"0000-0001-8849-6570","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","first_name":"Michele","full_name":"Nardin, Michele"},{"first_name":"James W.","full_name":"Phillips, James W.","last_name":"Phillips"},{"first_name":"William F.","full_name":"Podlaski, William F.","last_name":"Podlaski"},{"last_name":"Keemink","full_name":"Keemink, Sander W.","first_name":"Sander W."}],"doi":"10.24072/pcjournal.69","_id":"10635","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"month":"12","date_published":"2021-12-15T00:00:00Z","article_type":"original","publication_status":"published","date_updated":"2025-05-14T11:23:19Z","publisher":"Peer Community In","ec_funded":1,"oa":1,"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"article_number":"e68","publication_identifier":{"eissn":["2804-3871"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"success":1,"creator":"mnardin","content_type":"application/pdf","file_size":3311494,"access_level":"open_access","checksum":"cd9af6b331918608f2e3d1c7940cbf4f","date_updated":"2022-01-17T11:15:26Z","relation":"main_file","file_name":"10_24072_pcjournal_69.pdf","date_created":"2022-01-17T11:15:26Z","file_id":"10636"}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"status":"public","year":"2021","corr_author":"1","has_accepted_license":"1"},{"quality_controlled":"1","author":[{"last_name":"Lake","full_name":"Lake, Russell","first_name":"Russell"},{"last_name":"Simbierowicz","full_name":"Simbierowicz, Slawomir","first_name":"Slawomir"},{"first_name":"Philip","full_name":"Krantz, Philip","last_name":"Krantz"},{"id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","full_name":"Hassani, Farid","last_name":"Hassani","orcid":"0000-0001-6937-5773"},{"first_name":"Johannes M","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","last_name":"Fink"}],"status":"public","page":"9","year":"2021","_id":"10644","type":"other_academic_publication","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","place":"Helsinki, Finland","oa_version":"Published Version","ddc":["530"],"alternative_title":["Bluefors Blog"],"citation":{"ama":"Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy; 2021.","apa":"Lake, R., Simbierowicz, S., Krantz, P., Hassani, F., &#38; Fink, J. M. (2021). <i>The Bluefors dilution refrigerator as an integrated quantum measurement system</i>. Helsinki, Finland: Bluefors Oy.","mla":"Lake, Russell, et al. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Bluefors Oy, 2021.","ieee":"R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, and J. M. Fink, <i>The Bluefors dilution refrigerator as an integrated quantum measurement system</i>. Helsinki, Finland: Bluefors Oy, 2021.","short":"R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, J.M. Fink, The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021.","chicago":"Lake, Russell, Slawomir Simbierowicz, Philip Krantz, Farid Hassani, and Johannes M Fink. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy, 2021.","ista":"Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. 2021. The Bluefors dilution refrigerator as an integrated quantum measurement system, Helsinki, Finland: Bluefors Oy, 9p."},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://bluefors.com/blog/integrated-quantum-measurement-system/"}],"title":"The Bluefors dilution refrigerator as an integrated quantum measurement system","keyword":["Application note"],"date_created":"2022-01-19T08:29:57Z","article_processing_charge":"No","day":"20","abstract":[{"text":"The purpose of this application note is to demonstrate a working example of a superconducting qubit measurement in a Bluefors cryostat using the Keysight quantum control hardware. Our motivation is twofold. First, we provide pre-qualification data that the Bluefors cryostat, including filtering and wiring, can support long-lived qubits. Second, we demonstrate that the Keysight system (controlled using Labber) provides a straightforward solution to perform these characterization measurements. This document is intended as a brief guide for starting an experimental platform for testing superconducting qubits. The setup described here is an immediate jumping off point for a suite of applications including testing quantum logical gates, quantum optics with microwaves, or even using the qubit itself as a sensitive probe of local electromagnetic fields. Qubit measurements rely on high performance of both the physical sample environment and the measurement electronics. An overview of the cryogenic system is shown in Figure 1, and an overview of the integration between the electronics and cryostat (including wiring details) is shown in Figure 2.","lang":"eng"}],"department":[{"_id":"JoFi"}],"publication_status":"published","date_updated":"2026-06-18T08:45:11Z","date_published":"2021-04-20T00:00:00Z","month":"04","publisher":"Bluefors Oy"},{"date_created":"2022-01-19T08:41:14Z","day":"03","abstract":[{"lang":"eng","text":"Superconducting qubits have emerged as a highly versatile and useful platform for quantum technological applications [1]. Bluefors and Zurich Instruments have supported the growth of this field from the 2010s onwards by providing well-engineered and reliable measurement infrastructure [2]– [6]. Having a long and stable qubit lifetime is a critical system property. Therefore, considerable effort has already gone into measuring qubit energy-relaxation timescales and their fluctuations, see Refs. [7]–[10] among others. Accurately extracting the statistics of a quantum device requires users to perform time consuming measurements. One measurement challenge is that the detection of the state-dependent\r\nresponse of a superconducting resonator due to a dispersively-coupled qubit requires an inherently low signal level. Consequently, measurements must be performed using a microwave probe that contains only a few microwave photons. Improving the signal-to-noise ratio (SNR) by using near-quantum limited parametric amplifiers as well as the use of optimized signal processing enabled by efficient room temperature instrumentation help to reduce measurement time. An empirical observation for fixed frequency transmons from recent literature is that as the energy-relaxation time 𝑇𝑇1 increases, so do its natural temporal fluctuations [7], [10]. This necessitates many repeated measurements to understand the statistics (see for example, Ref. [10]). In addition, as state-of-the-art qubits increase in lifetime, longer\r\nmeasurement times are expected to obtain accurate statistics. As described below, the scaling of the widths of the qubit energy-relaxation distributions also reveal clues about the origin of the energy-relaxation."}],"article_processing_charge":"No","department":[{"_id":"JoFi"}],"main_file_link":[{"url":"https://bluefors.com/blog/application-note-qubit-energy-relaxation-statistics-bluefors-quantum-measurement-system/","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"title":"Qubit energy-relaxation statistics in the Bluefors quantum measurement system","keyword":["Application note"],"publisher":"Bluefors Oy","publication_status":"published","date_updated":"2026-06-18T08:46:15Z","date_published":"2021-06-03T00:00:00Z","month":"06","_id":"10645","quality_controlled":"1","author":[{"full_name":"Simbierowicz, Slawomir","first_name":"Slawomir","last_name":"Simbierowicz"},{"first_name":"Chunyan","full_name":"Shi, Chunyan","last_name":"Shi"},{"first_name":"Michele","full_name":"Collodo, Michele","last_name":"Collodo"},{"last_name":"Kirste","first_name":"Moritz","full_name":"Kirste, Moritz"},{"orcid":"0000-0001-6937-5773","last_name":"Hassani","full_name":"Hassani, Farid","first_name":"Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8112-028X","last_name":"Fink","full_name":"Fink, Johannes M","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bylander","first_name":"Jonas","full_name":"Bylander, Jonas"},{"full_name":"Perez Lozano, Daniel","first_name":"Daniel","last_name":"Perez Lozano"},{"full_name":"Lake, Russell","first_name":"Russell","last_name":"Lake"}],"status":"public","year":"2021","page":"8","ddc":["530"],"oa_version":"Published Version","alternative_title":["Bluefors Blog"],"citation":{"ama":"Simbierowicz S, Shi C, Collodo M, et al. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy; 2021.","apa":"Simbierowicz, S., Shi, C., Collodo, M., Kirste, M., Hassani, F., Fink, J. M., … Lake, R. (2021). <i>Qubit energy-relaxation statistics in the Bluefors quantum measurement system</i>. Helsinki, Finland: Bluefors Oy.","mla":"Simbierowicz, Slawomir, et al. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Bluefors Oy, 2021.","ieee":"S. Simbierowicz <i>et al.</i>, <i>Qubit energy-relaxation statistics in the Bluefors quantum measurement system</i>. Helsinki, Finland: Bluefors Oy, 2021.","short":"S. Simbierowicz, C. Shi, M. Collodo, M. Kirste, F. Hassani, J.M. Fink, J. Bylander, D. Perez Lozano, R. Lake, Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021.","chicago":"Simbierowicz, Slawomir, Chunyan Shi, Michele Collodo, Moritz Kirste, Farid Hassani, Johannes M Fink, Jonas Bylander, Daniel Perez Lozano, and Russell Lake. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy, 2021.","ista":"Simbierowicz S, Shi C, Collodo M, Kirste M, Hassani F, Fink JM, Bylander J, Perez Lozano D, Lake R. 2021. Qubit energy-relaxation statistics in the Bluefors quantum measurement system, Helsinki, Finland: Bluefors Oy, 8p."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","place":"Helsinki, Finland","type":"other_academic_publication"},{"month":"06","article_type":"original","date_published":"2021-06-24T00:00:00Z","date_updated":"2024-10-14T11:13:18Z","publication_status":"published","publisher":"American Physical Society","oa":1,"article_processing_charge":"No","article_number":"224526","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","issue":"22","year":"2021","status":"public","extern":"1","title":"Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.08956"}],"volume":103,"day":"24","abstract":[{"lang":"eng","text":"Harnessing the properties of vortices in superconductors is crucial for fundamental science and technological applications; thus, it has been an ongoing goal to locally probe and control vortices. Here, we use a scanning probe technique that enables studies of vortex dynamics in superconducting systems by leveraging the resonant behavior of a raster-scanned, magnetic-tipped cantilever. This experimental setup allows us to image and control vortices, as well as extract key energy scales of the vortex interactions. Applying this technique to lattices of superconductor island arrays on a metal, we obtain a variety of striking spatial patterns that encode information about the energy landscape for vortices in the system. We interpret these patterns in terms of local vortex dynamics and extract the relative strengths of the characteristic energy scales in the system, such as the vortex-magnetic field and vortex-vortex interaction strengths, as well as the vortex chemical potential. We also demonstrate that the relative strengths of the interactions can be tuned and show how these interactions shift with an applied bias. The high degree of tunability and local nature of such vortex imaging and control not only enable new understanding of vortex interactions, but also have potential applications in more complex systems such as those relevant to quantum computing."}],"date_created":"2022-01-20T09:39:40Z","publication":"Physical Review B","type":"journal_article","acknowledgement":"This work was supported by the Department of Energy (DOE) Basic Energy Sciences under Grant No. DE-SC0012649 and the National Science Foundation (NSF) under Grant No. DMR 17-10437. V.C. was supported by the Gordon and Betty Moore Foundation EPiQS Initiative through Grant No. GBMF4305. N.M. also acknowledges support from DOE-EFRC under Grant No. DE-SC0021238 for analysis/manuscript preparation. This research was carried out in part in the Materials Research Laboratory Central Research Facilities, University of Illinois.","citation":{"ista":"Naibert TR, Polshyn H, Garrido-Menacho R, Durkin M, Wolin B, Chua V, Mondragon-Shem I, Hughes T, Mason N, Budakian R. 2021. Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays. Physical Review B. 103(22), 224526.","short":"T.R. Naibert, H. Polshyn, R. Garrido-Menacho, M. Durkin, B. Wolin, V. Chua, I. Mondragon-Shem, T. Hughes, N. Mason, R. Budakian, Physical Review B 103 (2021).","chicago":"Naibert, Tyler R., Hryhoriy Polshyn, Rita Garrido-Menacho, Malcolm Durkin, Brian Wolin, Victor Chua, Ian Mondragon-Shem, Taylor Hughes, Nadya Mason, and Raffi Budakian. “Imaging and Controlling Vortex Dynamics in Mesoscopic Superconductor-Normal-Metal-Superconductor Arrays.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevb.103.224526\">https://doi.org/10.1103/physrevb.103.224526</a>.","ieee":"T. R. Naibert <i>et al.</i>, “Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays,” <i>Physical Review B</i>, vol. 103, no. 22. American Physical Society, 2021.","mla":"Naibert, Tyler R., et al. “Imaging and Controlling Vortex Dynamics in Mesoscopic Superconductor-Normal-Metal-Superconductor Arrays.” <i>Physical Review B</i>, vol. 103, no. 22, 224526, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevb.103.224526\">10.1103/physrevb.103.224526</a>.","ama":"Naibert TR, Polshyn H, Garrido-Menacho R, et al. Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays. <i>Physical Review B</i>. 2021;103(22). doi:<a href=\"https://doi.org/10.1103/physrevb.103.224526\">10.1103/physrevb.103.224526</a>","apa":"Naibert, T. R., Polshyn, H., Garrido-Menacho, R., Durkin, M., Wolin, B., Chua, V., … Budakian, R. (2021). Imaging and controlling vortex dynamics in mesoscopic superconductor-normal-metal-superconductor arrays. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.103.224526\">https://doi.org/10.1103/physrevb.103.224526</a>"},"external_id":{"arxiv":["1705.08956"]},"arxiv":1,"intvolume":"       103","quality_controlled":"1","author":[{"full_name":"Naibert, Tyler R.","first_name":"Tyler R.","last_name":"Naibert"},{"orcid":"0000-0001-8223-8896","last_name":"Polshyn","full_name":"Polshyn, Hryhoriy","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"first_name":"Rita","full_name":"Garrido-Menacho, Rita","last_name":"Garrido-Menacho"},{"last_name":"Durkin","full_name":"Durkin, Malcolm","first_name":"Malcolm"},{"last_name":"Wolin","full_name":"Wolin, Brian","first_name":"Brian"},{"last_name":"Chua","full_name":"Chua, Victor","first_name":"Victor"},{"full_name":"Mondragon-Shem, Ian","first_name":"Ian","last_name":"Mondragon-Shem"},{"full_name":"Hughes, Taylor","first_name":"Taylor","last_name":"Hughes"},{"full_name":"Mason, Nadya","first_name":"Nadya","last_name":"Mason"},{"last_name":"Budakian","full_name":"Budakian, Raffi","first_name":"Raffi"}],"doi":"10.1103/physrevb.103.224526","_id":"10649"},{"publisher":"American Physical Society","date_published":"2021-03-01T00:00:00Z","month":"03","date_updated":"2022-01-27T09:37:51Z","publication_status":"published","conference":{"start_date":"2021-03-15","name":"APS: American Physical Society","end_date":"2021-03-19","location":"Virtual, United States"},"article_number":"L42.00012","article_processing_charge":"No","oa":1,"alternative_title":["Bulletin of the American Physical Society"],"oa_version":"None","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"issn":["0003-0503"]},"issue":"1","status":"public","year":"2021","extern":"1","abstract":[{"text":"Electrons in the moiré flat bands of magic angle twisted bilayer graphene aligned to hexagonal boron nitride can break time reversal symmetry and open an interaction-driven, topological gap. The resulting magnetic order and associated quantized anomalous Hall effect have properties that diverge substantially from quantized anomalous Hall effects observed in other systems. I will present transport data and scanning probe magnetometry data acquired using a nanoSQUID-on-tip microscope. A quantitative analysis of the magnitude of the magnetization of the Chern magnet shows that the magnetic moment per moiré unit cell substantially exceeds 1 μB and grows rapidly in the topological gap, consistent with an orbital origin for the magnetic order. We find that the Barkhausen jumps observed in transport measurements can be mapped directly to microscopic motion of ferromagnetic domain walls. These domain walls are strongly pinned to disorder in the device and are reproducible across thermal cycles, suggesting coupling between the magnetic degrees of freedom and structural inhomogeneity.","lang":"eng"}],"day":"01","date_created":"2022-01-20T15:43:16Z","volume":66,"title":"Probing orbital Chern ferromagnet phase in twisted bilayer graphene","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR21/Session/L42.12"}],"intvolume":"        66","acknowledgement":"I acknowledge and appreciate support from the Hertz Foundation and from the National Science Foundation Graduate Research Fellowship Program under grant 1650114.","citation":{"ista":"Tschirhart C, Serlin M, Polshyn H, Shragai AG, Xia Z, Zhu J, Zhang Y, Watanabe K, Taniguchi T, Huber ME, Young A. 2021. Probing orbital Chern ferromagnet phase in twisted bilayer graphene. APS March Meeting 2021. APS: American Physical Society, Bulletin of the American Physical Society, vol. 66, L42.00012.","chicago":"Tschirhart, Charles, Marec Serlin, Hryhoriy Polshyn, Avi G. Shragai, Zhengchao Xia, Jiacheng Zhu, Yuxuan Zhang, et al. “Probing Orbital Chern Ferromagnet Phase in Twisted Bilayer Graphene.” In <i>APS March Meeting 2021</i>, Vol. 66. American Physical Society, 2021.","short":"C. Tschirhart, M. Serlin, H. Polshyn, A.G. Shragai, Z. Xia, J. Zhu, Y. Zhang, K. Watanabe, T. Taniguchi, M.E. Huber, A. Young, in:, APS March Meeting 2021, American Physical Society, 2021.","ieee":"C. Tschirhart <i>et al.</i>, “Probing orbital Chern ferromagnet phase in twisted bilayer graphene,” in <i>APS March Meeting 2021</i>, Virtual, United States, 2021, vol. 66, no. 1.","mla":"Tschirhart, Charles, et al. “Probing Orbital Chern Ferromagnet Phase in Twisted Bilayer Graphene.” <i>APS March Meeting 2021</i>, vol. 66, no. 1, L42.00012, American Physical Society, 2021.","apa":"Tschirhart, C., Serlin, M., Polshyn, H., Shragai, A. G., Xia, Z., Zhu, J., … Young, A. (2021). Probing orbital Chern ferromagnet phase in twisted bilayer graphene. In <i>APS March Meeting 2021</i> (Vol. 66). Virtual, United States: American Physical Society.","ama":"Tschirhart C, Serlin M, Polshyn H, et al. Probing orbital Chern ferromagnet phase in twisted bilayer graphene. In: <i>APS March Meeting 2021</i>. Vol 66. American Physical Society; 2021."},"type":"conference","publication":"APS March Meeting 2021","_id":"10651","author":[{"last_name":"Tschirhart","first_name":"Charles","full_name":"Tschirhart, Charles"},{"full_name":"Serlin, Marec","first_name":"Marec","last_name":"Serlin"},{"id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","full_name":"Polshyn, Hryhoriy","first_name":"Hryhoriy","last_name":"Polshyn","orcid":"0000-0001-8223-8896"},{"last_name":"Shragai","first_name":"Avi G.","full_name":"Shragai, Avi G."},{"last_name":"Xia","first_name":"Zhengchao","full_name":"Xia, Zhengchao"},{"last_name":"Zhu","first_name":"Jiacheng","full_name":"Zhu, Jiacheng"},{"last_name":"Zhang","first_name":"Yuxuan","full_name":"Zhang, Yuxuan"},{"full_name":"Watanabe, Kenji","first_name":"Kenji","last_name":"Watanabe"},{"full_name":"Taniguchi, Takashi","first_name":"Takashi","last_name":"Taniguchi"},{"last_name":"Huber","full_name":"Huber, Martin E.","first_name":"Martin E."},{"first_name":"Andrea","full_name":"Young, Andrea","last_name":"Young"}],"quality_controlled":"1"},{"doi":"10.1016/j.omtm.2021.09.006","_id":"10655","project":[{"name":"Microglia action towards neuronal circuit formation and function in health and disease","call_identifier":"H2020","grant_number":"715571","_id":"25D4A630-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","page":"210-224","author":[{"last_name":"Maes","orcid":"0000-0001-9642-1085","id":"3838F452-F248-11E8-B48F-1D18A9856A87","first_name":"Margaret E","full_name":"Maes, Margaret E"},{"first_name":"Gabriele M.","full_name":"Wögenstein, Gabriele M.","last_name":"Wögenstein"},{"full_name":"Colombo, Gloria","first_name":"Gloria","id":"3483CF6C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9434-8902","last_name":"Colombo"},{"last_name":"Casado Polanco","orcid":"0000-0001-8293-4568","id":"15240fc1-dbcd-11ea-9d1d-ac5a786425fd","full_name":"Casado Polanco, Raquel","first_name":"Raquel"},{"orcid":"0000-0001-8635-0877","last_name":"Siegert","full_name":"Siegert, Sandra","first_name":"Sandra","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87"}],"citation":{"chicago":"Maes, Margaret E, Gabriele M. Wögenstein, Gloria Colombo, Raquel Casado Polanco, and Sandra Siegert. “Optimizing AAV2/6 Microglial Targeting Identified Enhanced Efficiency in the Photoreceptor Degenerative Environment.” <i>Molecular Therapy - Methods and Clinical Development</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">https://doi.org/10.1016/j.omtm.2021.09.006</a>.","short":"M.E. Maes, G.M. Wögenstein, G. Colombo, R. Casado Polanco, S. Siegert, Molecular Therapy - Methods and Clinical Development 23 (2021) 210–224.","ista":"Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. 2021. Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. Molecular Therapy - Methods and Clinical Development. 23, 210–224.","apa":"Maes, M. E., Wögenstein, G. M., Colombo, G., Casado Polanco, R., &#38; Siegert, S. (2021). Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. <i>Molecular Therapy - Methods and Clinical Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">https://doi.org/10.1016/j.omtm.2021.09.006</a>","ama":"Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. <i>Molecular Therapy - Methods and Clinical Development</i>. 2021;23:210-224. doi:<a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">10.1016/j.omtm.2021.09.006</a>","mla":"Maes, Margaret E., et al. “Optimizing AAV2/6 Microglial Targeting Identified Enhanced Efficiency in the Photoreceptor Degenerative Environment.” <i>Molecular Therapy - Methods and Clinical Development</i>, vol. 23, Elsevier, 2021, pp. 210–24, doi:<a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">10.1016/j.omtm.2021.09.006</a>.","ieee":"M. E. Maes, G. M. Wögenstein, G. Colombo, R. Casado Polanco, and S. Siegert, “Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment,” <i>Molecular Therapy - Methods and Clinical Development</i>, vol. 23. Elsevier, pp. 210–224, 2021."},"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 715571). The research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by the Bioimaging Facility, the Life Science Facility, and the Pre-Clinical Facility, namely Sonja Haslinger and Michael Schunn for their animal colony management and support. We would also like to thank Chakrabarty Lab for sharing the plasmids for AAV2/6 production. Finally, we would like to thank the Siegert team members for discussion about the manuscript.","ddc":["570"],"external_id":{"isi":["000748748500019"]},"intvolume":"        23","publication":"Molecular Therapy - Methods and Clinical Development","type":"journal_article","abstract":[{"lang":"eng","text":"Adeno-associated viruses (AAVs) are widely used to deliver genetic material in vivo to distinct cell types such as neurons or glial cells, allowing for targeted manipulation. Transduction of microglia is mostly excluded from this strategy, likely due to the cells’ heterogeneous state upon environmental changes, which makes AAV design challenging. Here, we established the retina as a model system for microglial AAV validation and optimization. First, we show that AAV2/6 transduced microglia in both synaptic layers, where layer preference corresponds to the intravitreal or subretinal delivery method. Surprisingly, we observed significantly enhanced microglial transduction during photoreceptor degeneration. Thus, we modified the AAV6 capsid to reduce heparin binding by introducing four point mutations (K531E, R576Q, K493S, and K459S), resulting in increased microglial transduction in the outer plexiform layer. Finally, to improve microglial-specific transduction, we validated a Cre-dependent transgene delivery cassette for use in combination with the Cx3cr1CreERT2 mouse line. Together, our results provide a foundation for future studies optimizing AAV-mediated microglia transduction and highlight that environmental conditions influence microglial transduction efficiency.\r\n"}],"day":"10","date_created":"2022-01-23T23:01:28Z","title":"Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment","language":[{"iso":"eng"}],"file_date_updated":"2022-01-24T07:43:09Z","volume":23,"scopus_import":"1","isi":1,"corr_author":"1","has_accepted_license":"1","year":"2021","status":"public","file":[{"date_updated":"2022-01-24T07:43:09Z","content_type":"application/pdf","checksum":"77dc540e8011c5475031bdf6ccef20a6","access_level":"open_access","file_size":4794147,"creator":"cchlebak","success":1,"file_id":"10657","date_created":"2022-01-24T07:43:09Z","file_name":"2021_MolTherMethodsClinDev_Maes.pdf","relation":"main_file"}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_identifier":{"eissn":["2329-0501"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes","department":[{"_id":"SaSi"},{"_id":"SiHi"}],"oa":1,"publisher":"Elsevier","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"}],"ec_funded":1,"month":"12","article_type":"original","date_published":"2021-12-10T00:00:00Z","date_updated":"2025-04-14T07:41:46Z","publication_status":"published"},{"scopus_import":"1","date_created":"2022-01-25T15:15:02Z","abstract":[{"lang":"eng","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."}],"day":"28","volume":35,"file_date_updated":"2022-01-26T07:41:16Z","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"title":"Scalable verification of quantized neural networks","intvolume":"        35","arxiv":1,"external_id":{"arxiv":["2012.08185"]},"ddc":["000"],"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","citation":{"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.","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.","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.","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.","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.","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.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795."},"type":"conference","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","project":[{"grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"_id":"10665","author":[{"orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","full_name":"Zikelic, Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699"}],"page":"3787-3795","quality_controlled":"1","ec_funded":1,"publisher":"AAAI Press","publication_status":"published","date_updated":"2026-04-07T14:21:58Z","month":"05","date_published":"2021-05-28T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"conference":{"start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","location":"Virtual"},"article_processing_charge":"No","oa":1,"oa_version":"Published Version","file":[{"success":1,"checksum":"2bc8155b2526a70fba5b7301bc89dbd1","content_type":"application/pdf","access_level":"open_access","file_size":137235,"creator":"mlechner","date_updated":"2022-01-26T07:41:16Z","relation":"main_file","date_created":"2022-01-26T07:41:16Z","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","file_id":"10684"}],"alternative_title":["Technical Tracks"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"],"isbn":["978-1-57735-866-4"]},"has_accepted_license":"1","corr_author":"1","status":"public","year":"2021","issue":"5A"},{"has_accepted_license":"1","year":"2021","status":"public","oa_version":"Preprint","OA_type":"green","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"publication_identifier":{"isbn":["978-1-7281-9078-5"],"issn":["1050-4729"],"eisbn":["978-1-7281-9077-8"],"eissn":["2577-087X"]},"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","conference":{"location":"Xi'an, China","end_date":"2021-06-05","name":"ICRA: International Conference on Robotics and Automation","start_date":"2021-05-30"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"oa":1,"publication_status":"published","date_updated":"2026-04-07T14:21:58Z","date_published":"2021-06-01T00:00:00Z","month":"06","_id":"10666","doi":"10.1109/ICRA48506.2021.9561036","project":[{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","page":"4140-4147","author":[{"first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"external_id":{"arxiv":["2103.08187"],"isi":["000765738803040"]},"ddc":["000"],"citation":{"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.","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.","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.","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>.","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>","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>"},"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).","arxiv":1,"type":"conference","publication":"2021 IEEE International Conference on Robotics and Automation","date_created":"2022-01-25T15:44:54Z","abstract":[{"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.","lang":"eng"}],"day":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]},"language":[{"iso":"eng"}],"title":"Adversarial training is not ready for robot learning","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","series_title":"ICRA","scopus_import":"1","isi":1},{"status":"public","year":"2021","corr_author":"1","has_accepted_license":"1","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","alternative_title":[" Advances in Neural Information Processing Systems"],"file":[{"file_id":"10682","relation":"main_file","date_created":"2022-01-26T07:39:59Z","file_name":"infinite_time_horizon_safety_o.pdf","date_updated":"2022-01-26T07:39:59Z","success":1,"checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","access_level":"open_access","content_type":"application/pdf","file_size":452492,"creator":"mlechner"}],"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"oa":1,"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","location":"Virtual","end_date":"2021-12-10"},"month":"12","date_published":"2021-12-01T00:00:00Z","date_updated":"2026-04-07T14:21:58Z","publication_status":"published","ec_funded":1,"quality_controlled":"1","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"first_name":"Ðorđe","full_name":"Žikelić, Ðorđe","last_name":"Žikelić"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"doi":"10.48550/arXiv.2111.03165","_id":"10667","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"}],"type":"conference","publication":"35th Conference on Neural Information Processing Systems","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.","citation":{"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>","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>","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.","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>.","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>.","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","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, ."},"ddc":["000"],"external_id":{"arxiv":["2111.03165"]},"arxiv":1,"title":"Infinite time horizon safety of Bayesian neural networks","related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"file_date_updated":"2022-01-26T07:39:59Z","day":"01","abstract":[{"lang":"eng","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."}],"date_created":"2022-01-25T15:45:58Z"},{"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"file":[{"success":1,"checksum":"d30eae62561bb517d9f978437d7677db","file_size":4246561,"access_level":"open_access","content_type":"application/pdf","creator":"mlechner","date_updated":"2022-01-26T07:38:32Z","relation":"main_file","date_created":"2022-01-26T07:38:32Z","file_name":"babaiee21a.pdf","file_id":"10681"}],"alternative_title":["PMLR"],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2640-3498"]},"has_accepted_license":"1","status":"public","year":"2021","publisher":"ML Research Press","date_published":"2021-07-01T00:00:00Z","month":"07","publication_status":"published","date_updated":"2025-05-19T11:28:08Z","conference":{"location":"Virtual","end_date":"2021-07-24","name":"ML: Machine Learning","start_date":"2021-07-18"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"article_processing_charge":"No","oa":1,"arxiv":1,"intvolume":"       139","citation":{"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.","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.","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.","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.","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.","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.","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."},"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).","ddc":["000"],"external_id":{"arxiv":["2106.07091"]},"type":"conference","publication":"Proceedings of the 38th International Conference on Machine Learning","project":[{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"_id":"10668","page":"478-489","author":[{"last_name":"Babaiee","first_name":"Zahra","full_name":"Babaiee, Zahra"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"quality_controlled":"1","day":"01","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"}],"date_created":"2022-01-25T15:46:33Z","file_date_updated":"2022-01-26T07:38:32Z","volume":139,"title":"On-off center-surround receptive fields for accurate and robust image classification","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v139/babaiee21a"}]},{"author":[{"full_name":"Grunbacher, Sophie","first_name":"Sophie","last_name":"Grunbacher"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner"},{"last_name":"Cyranka","first_name":"Jacek","full_name":"Cyranka, Jacek"},{"last_name":"Smolka","full_name":"Smolka, Scott A","first_name":"Scott A"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"page":"11525-11535","quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"}],"_id":"10669","type":"conference","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","arxiv":1,"intvolume":"        35","citation":{"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.","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.","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.","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.","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.","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.","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."},"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","external_id":{"arxiv":["2012.08863"]},"ddc":["000"],"file_date_updated":"2022-01-26T07:38:08Z","volume":35,"title":"On the verification of neural ODEs with stochastic guarantees","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372"}],"day":"28","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."}],"date_created":"2022-01-25T15:47:20Z","year":"2021","status":"public","issue":"13","corr_author":"1","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"],"isbn":["978-1-57735-866-4"]},"alternative_title":["Technical Tracks"],"file":[{"relation":"main_file","date_created":"2022-01-26T07:38:08Z","file_name":"17372-Article Text-20866-1-2-20210518.pdf","file_id":"10680","success":1,"file_size":286906,"content_type":"application/pdf","access_level":"open_access","checksum":"468d07041e282a1d46ffdae92f709630","creator":"mlechner","date_updated":"2022-01-26T07:38:08Z"}],"oa_version":"Published Version","oa":1,"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"conference":{"location":"Virtual","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02"},"article_processing_charge":"No","month":"05","date_published":"2021-05-28T00:00:00Z","date_updated":"2025-04-15T06:25:56Z","publication_status":"published","publisher":"AAAI Press"},{"file_date_updated":"2022-01-26T07:37:24Z","title":"Causal navigation by continuous-time neural networks","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html"}],"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"}],"day":"01","date_created":"2022-01-25T15:47:50Z","type":"conference","publication":"35th Conference on Neural Information Processing Systems","arxiv":1,"citation":{"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.","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, .","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.","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.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <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."},"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","external_id":{"arxiv":["2106.08314"]},"ddc":["000"],"author":[{"first_name":"Charles J","full_name":"Vorbach, Charles J","last_name":"Vorbach"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Amini, Alexander","first_name":"Alexander","last_name":"Amini"},{"last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","first_name":"Mathias"},{"last_name":"Rus","full_name":"Rus, Daniela","first_name":"Daniela"}],"quality_controlled":"1","project":[{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"_id":"10670","month":"12","date_published":"2021-12-01T00:00:00Z","publication_status":"published","date_updated":"2025-04-15T06:25:56Z","oa":1,"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","location":"Virtual","end_date":"2021-12-10"},"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"alternative_title":[" Advances in Neural Information Processing Systems"],"file":[{"success":1,"creator":"mlechner","access_level":"open_access","file_size":6841228,"checksum":"be81f0ade174a8c9b2d4fe09590b2021","content_type":"application/pdf","date_updated":"2022-01-26T07:37:24Z","relation":"main_file","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","date_created":"2022-01-26T07:37:24Z","file_id":"10679"}],"oa_version":"Published Version","year":"2021","status":"public","has_accepted_license":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2159-5399"],"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"]},"file":[{"relation":"main_file","date_created":"2022-01-26T07:36:03Z","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","file_id":"10678","success":1,"file_size":4302669,"checksum":"0f06995fba06dbcfa7ed965fc66027ff","access_level":"open_access","content_type":"application/pdf","creator":"mlechner","date_updated":"2022-01-26T07:36:03Z"}],"alternative_title":["Technical Tracks"],"oa_version":"Published Version","status":"public","year":"2021","issue":"9","corr_author":"1","has_accepted_license":"1","date_published":"2021-05-28T00:00:00Z","month":"05","publication_status":"published","date_updated":"2025-04-15T06:25:56Z","publisher":"AAAI Press","oa":1,"conference":{"location":"Virtual","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"article_processing_charge":"No","type":"conference","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","arxiv":1,"intvolume":"        35","citation":{"chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:7657–66. AAAI Press, 2021.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","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.","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.","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."},"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"]},"ddc":["000"],"author":[{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"first_name":"Alexander","full_name":"Amini, Alexander","last_name":"Amini"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"page":"7657-7666","quality_controlled":"1","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"_id":"10671","file_date_updated":"2022-01-26T07:36:03Z","volume":35,"title":"Liquid time-constant networks","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936","open_access":"1"}],"abstract":[{"lang":"eng","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."}],"day":"28","date_created":"2022-01-25T15:48:36Z"},{"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."}],"day":"03","date_created":"2022-01-25T16:32:13Z","title":"Determinacy in discrete-bidding infinite-duration games","language":[{"iso":"eng"}],"file_date_updated":"2022-01-26T08:04:50Z","volume":17,"keyword":["computer science","computer science and game theory","logic in computer science"],"scopus_import":"1","isi":1,"doi":"10.23638/LMCS-17(1:10)2021","_id":"10674","project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","call_identifier":"FWF"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","page":"10:1-10:23","author":[{"full_name":"Aghajohari, Milad","first_name":"Milad","last_name":"Aghajohari"},{"first_name":"Guy","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","last_name":"Avni"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"}],"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","citation":{"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>","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.","mla":"Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1, International Federation for Computational Logic, 2021, p. 10:1-10:23, doi:<a href=\"https://doi.org/10.23638/LMCS-17(1:10)2021\">10.23638/LMCS-17(1:10)2021</a>.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23.","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>.","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."},"external_id":{"isi":["000658724600010"],"arxiv":["1905.03588"]},"ddc":["510"],"arxiv":1,"intvolume":"        17","publication":"Logical Methods in Computer Science","type":"journal_article","article_processing_charge":"No","department":[{"_id":"ToHe"}],"oa":1,"publisher":"International Federation for Computational Logic","date_published":"2021-02-03T00:00:00Z","month":"02","article_type":"original","publication_status":"published","date_updated":"2025-04-15T06:25:56Z","has_accepted_license":"1","corr_author":"1","status":"public","issue":"1","year":"2021","file":[{"date_updated":"2022-01-26T08:04:50Z","creator":"alisjak","file_size":819878,"content_type":"application/pdf","checksum":"b35586a50ed1ca8f44767de116d18d81","access_level":"open_access","success":1,"file_id":"10690","file_name":"2021_LMCS_AGHAJOHAR.pdf","date_created":"2022-01-26T08:04:50Z","relation":"main_file"}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_identifier":{"eissn":["1860-5974"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"corr_author":"1","has_accepted_license":"1","editor":[{"full_name":"Ruzica, Piskac","first_name":"Piskac","last_name":"Ruzica"},{"last_name":"Whalen","full_name":"Whalen, Michael W.","first_name":"Michael W."}],"year":"2021","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"file":[{"file_id":"10689","relation":"main_file","file_name":"2021_FCAD2021_Kragl.pdf","date_created":"2022-01-26T08:04:29Z","date_updated":"2022-01-26T08:04:29Z","success":1,"creator":"cchlebak","file_size":390555,"content_type":"application/pdf","access_level":"open_access","checksum":"35438ac9f9750340b7f8ae4ae3220d9f"}],"alternative_title":["Conference Series"],"oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"isbn":["978-3-85448-046-4"]},"conference":{"location":"Virtual","end_date":"2021-10-22","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2021-10-20"},"department":[{"_id":"ToHe"}],"article_processing_charge":"No","oa":1,"publisher":"TU Wien Academic Press","date_published":"2021-10-01T00:00:00Z","month":"10","publication_status":"published","date_updated":"2025-04-15T06:25:56Z","project":[{"name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"doi":"10.34727/2021/isbn.978-3-85448-046-4_23","_id":"10688","page":"143–152","author":[{"first_name":"Bernhard","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","last_name":"Kragl"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"quality_controlled":"1","intvolume":"         2","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).","citation":{"short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>.","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","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>."},"ddc":["000"],"publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","type":"conference","day":"01","abstract":[{"lang":"eng","text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier."}],"date_created":"2022-01-26T08:01:30Z","file_date_updated":"2022-01-26T08:04:29Z","volume":2,"title":"The Civl verifier","language":[{"iso":"eng"}],"scopus_import":"1"},{"month":"03","date_published":"2021-03-01T00:00:00Z","extern":"1","date_updated":"2022-01-27T10:46:23Z","publisher":"American Physical Society","title":"Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://meetings.aps.org/Meeting/MAR21/Session/E42.10","open_access":"1"}],"oa":1,"volume":66,"abstract":[{"text":"We experimentally investigate narrow and topologically nontrivial moiré minibands hosted by van der Waals heterostructures consisting of a graphene monolayer rotationally faulted with respect to a Bernal-stacked bilayer. At fillings ν= 1 and 3 electrons per moiré unit cell within these bands, we observe quantized anomalous Hall effects with Rxy≈h/2e2, indicative of spontaneous polarization of the system into a single valley-projected band with Chern number C= 2. Remarkably, we also observe the evidence of symmetry broken Chern insulator states at ν= 1.5 and 3.5. At ν= 3 we find that the sign of the quantum anomalous Hall effect can be reversed via field-effect control of the chemical potential. This curious effect arises from the magnetization contribution due to topological edge states, which drive a reversal of the total magnetization and thus a switch of the favored magnetic state. Remarkably, we find that this switch is hysteretic, which we use to demonstrate non-volatile electric-field-induced reversal of the magnetic state. Voltage control of magnetic states can be used to electrically pattern nonvolatile magnetic domain structures hosting chiral edge states, with applications ranging from reconfigurable microwave circuit elements to ultra-low-power magnetic memory.","lang":"eng"}],"article_processing_charge":"No","day":"01","date_created":"2022-01-27T09:49:48Z","article_number":"E42.00010","conference":{"name":"APS: American Physical Society","start_date":"2021-03-15","location":"Virtual","end_date":"2021-03-19"},"publication_identifier":{"issn":["0003-0503"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"conference","publication":"APS March Meeting 2021","citation":{"mla":"Polshyn, Hryhoriy, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic Order.” <i>APS March Meeting 2021</i>, vol. 66, no. 1, E42.00010, American Physical Society, 2021.","ieee":"H. Polshyn <i>et al.</i>, “Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order,” in <i>APS March Meeting 2021</i>, Virtual, 2021, vol. 66, no. 1.","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.","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.","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.","short":"H. Polshyn, J. Zhu, M. Kumar, Y. Zhang, F. Yang, C. Tschirhart, M. Serlin, K. Watanabe, T. Tanaguchi, A. MacDonald, A. Young, in:, APS March Meeting 2021, American Physical Society, 2021.","chicago":"Polshyn, Hryhoriy, Jihang Zhu, Manish Kumar, Yuxuan Zhang, Fangyuan Yang, Charles Tschirhart, Marec Serlin, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic Order.” In <i>APS March Meeting 2021</i>, Vol. 66. American Physical Society, 2021."},"alternative_title":["Bulletin of the American Physical Society"],"oa_version":"Published Version","intvolume":"        66","quality_controlled":"1","year":"2021","issue":"1","status":"public","author":[{"full_name":"Polshyn, Hryhoriy","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","orcid":"0000-0001-8223-8896","last_name":"Polshyn"},{"full_name":"Zhu, Jihang","first_name":"Jihang","last_name":"Zhu"},{"full_name":"Kumar, Manish","first_name":"Manish","last_name":"Kumar"},{"full_name":"Zhang, Yuxuan","first_name":"Yuxuan","last_name":"Zhang"},{"first_name":"Fangyuan","full_name":"Yang, Fangyuan","last_name":"Yang"},{"first_name":"Charles","full_name":"Tschirhart, Charles","last_name":"Tschirhart"},{"last_name":"Serlin","first_name":"Marec","full_name":"Serlin, Marec"},{"full_name":"Watanabe, Kenji","first_name":"Kenji","last_name":"Watanabe"},{"last_name":"Tanaguchi","full_name":"Tanaguchi, Takashi","first_name":"Takashi"},{"full_name":"MacDonald, Allan","first_name":"Allan","last_name":"MacDonald"},{"full_name":"Young, Andrea","first_name":"Andrea","last_name":"Young"}],"_id":"10692"},{"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2005.06636","open_access":"1"}],"title":"Infinite-duration all-pay bidding games","date_created":"2022-01-27T12:11:23Z","day":"01","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"}],"scopus_import":"1","quality_controlled":"1","page":"617-636","author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","full_name":"Avni, Guy"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R","last_name":"Jecker"},{"last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","first_name":"Dorde"}],"_id":"10694","doi":"10.1137/1.9781611976465.38","project":[{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"type":"conference","publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","external_id":{"arxiv":["2005.06636"]},"citation":{"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>.","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.","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.","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>","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>","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>.","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."},"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.","arxiv":1,"oa":1,"article_processing_charge":"No","conference":{"location":"Virtual","end_date":"2021-01-13","name":"SODA: Symposium on Discrete Algorithms","start_date":"2021-01-10"},"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published","date_updated":"2025-04-15T06:26:15Z","date_published":"2021-01-01T00:00:00Z","month":"01","publisher":"Society for Industrial and Applied Mathematics","ec_funded":1,"status":"public","year":"2021","editor":[{"last_name":"Marx","first_name":"Dániel","full_name":"Marx, Dániel"}],"corr_author":"1","publication_identifier":{"isbn":["978-1-61197-646-5"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Preprint"},{"quality_controlled":"1","page":"1610-1651","author":[{"last_name":"Autissier","first_name":"Pascal","full_name":"Autissier, Pascal"},{"first_name":"Dante","full_name":"Bonolis, Dante","id":"6A459894-5FDD-11E9-AF35-BB24E6697425","last_name":"Bonolis"},{"full_name":"Lamzouri, Youness","first_name":"Youness","last_name":"Lamzouri"}],"_id":"10711","doi":"10.1112/s0010437x21007351","type":"journal_article","publication":"Compositio Mathematica","external_id":{"isi":["000667289300001"],"arxiv":["1909.03266"]},"acknowledgement":"We would like to thank the anonymous referees for carefully reading the paper and for their remarks and suggestions.","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.","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>.","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>","apa":"Autissier, P., Bonolis, D., &#38; Lamzouri, Y. (2021). The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/s0010437x21007351\">https://doi.org/10.1112/s0010437x21007351</a>","ista":"Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica. 157(7), 1610–1651.","short":"P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021) 1610–1651.","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>."},"intvolume":"       157","arxiv":1,"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.03266"}],"title":"The distribution of the maximum of partial sums of Kloosterman sums and other trace functions","volume":157,"keyword":["Algebra and Number Theory"],"date_created":"2022-02-01T08:10:43Z","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."}],"day":"28","scopus_import":"1","isi":1,"year":"2021","status":"public","issue":"7","corr_author":"1","publication_identifier":{"eissn":["1570-5846"],"issn":["0010-437X"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","oa":1,"article_processing_charge":"No","department":[{"_id":"TiBr"}],"publication_status":"published","date_updated":"2024-10-21T06:02:06Z","month":"06","date_published":"2021-06-28T00:00:00Z","article_type":"original","publisher":"Cambridge University Press"}]