[{"external_id":{"isi":["000683960800003"],"arxiv":["2103.07975"]},"arxiv":1,"type":"journal_article","month":"08","file_date_updated":"2021-10-27T12:57:06Z","abstract":[{"lang":"eng","text":"Extending on ideas of Lewin, Lieb, and Seiringer [Phys. Rev. B 100, 035127 (2019)], we present a modified “floating crystal” trial state for jellium (also known as the classical homogeneous electron gas) with density equal to a characteristic function. This allows us to show that three definitions of the jellium energy coincide in dimensions d ≥ 2, thus extending the result of Cotar and Petrache [“Equality of the Jellium and uniform electron gas next-order asymptotic terms for Coulomb and Riesz potentials,” arXiv: 1707.07664 (2019)] and Lewin, Lieb, and Seiringer [Phys. Rev. B 100, 035127 (2019)] that the three definitions coincide in dimension d ≥ 3. We show that the jellium energy is also equivalent to a “renormalized energy” studied in a series of papers by Serfaty and others, and thus, by the work of Bétermin and Sandier [Constr. Approximation 47, 39–74 (2018)], we relate the jellium energy to the order n term in the logarithmic energy of n points on the unit 2-sphere. We improve upon known lower bounds for this renormalized energy. Additionally, we derive formulas for the jellium energy of periodic configurations."}],"acknowledgement":"The author would like to thank Robert Seiringer for guidance and many helpful comments on this project. The author would also like to thank Mathieu Lewin for his comments on the manuscript and Lorenzo Portinale for providing his lecture notes for the course “Mathematics of quantum many-body systems” in spring 2020, taught by Robert Seiringer. The Proof of Theorem III.1 is inspired by these lecture notes.","corr_author":"1","publication_identifier":{"eissn":["1089-7658"],"issn":["0022-2488"]},"department":[{"_id":"GradSch"},{"_id":"RoSe"}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.1063/5.0053494","date_created":"2021-08-12T07:08:36Z","article_processing_charge":"No","title":"Floating Wigner crystal and periodic jellium configurations","language":[{"iso":"eng"}],"intvolume":"        62","publication_status":"published","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"isi":1,"_id":"9891","date_published":"2021-08-01T00:00:00Z","oa":1,"article_type":"original","quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","issue":"8","volume":62,"publisher":"AIP Publishing","file":[{"relation":"main_file","file_id":"10188","creator":"cziletti","file_name":"2021_JMathPhy_Lauritsen.pdf","file_size":4352640,"content_type":"application/pdf","checksum":"d035be2b894c4d50d90ac5ce252e27cd","success":1,"date_created":"2021-10-27T12:57:06Z","access_level":"open_access","date_updated":"2021-10-27T12:57:06Z"}],"has_accepted_license":"1","scopus_import":"1","ddc":["530"],"citation":{"mla":"Lauritsen, Asbjørn Bækgaard. “Floating Wigner Crystal and Periodic Jellium Configurations.” <i>Journal of Mathematical Physics</i>, vol. 62, no. 8, 083305, AIP Publishing, 2021, doi:<a href=\"https://doi.org/10.1063/5.0053494\">10.1063/5.0053494</a>.","ieee":"A. B. Lauritsen, “Floating Wigner crystal and periodic jellium configurations,” <i>Journal of Mathematical Physics</i>, vol. 62, no. 8. AIP Publishing, 2021.","apa":"Lauritsen, A. B. (2021). Floating Wigner crystal and periodic jellium configurations. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0053494\">https://doi.org/10.1063/5.0053494</a>","ama":"Lauritsen AB. Floating Wigner crystal and periodic jellium configurations. <i>Journal of Mathematical Physics</i>. 2021;62(8). doi:<a href=\"https://doi.org/10.1063/5.0053494\">10.1063/5.0053494</a>","ista":"Lauritsen AB. 2021. Floating Wigner crystal and periodic jellium configurations. Journal of Mathematical Physics. 62(8), 083305.","chicago":"Lauritsen, Asbjørn Bækgaard. “Floating Wigner Crystal and Periodic Jellium Configurations.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2021. <a href=\"https://doi.org/10.1063/5.0053494\">https://doi.org/10.1063/5.0053494</a>.","short":"A.B. Lauritsen, Journal of Mathematical Physics 62 (2021)."},"article_number":"083305","publication":"Journal of Mathematical Physics","status":"public","author":[{"full_name":"Lauritsen, Asbjørn Bækgaard","last_name":"Lauritsen","first_name":"Asbjørn Bækgaard","orcid":"0000-0003-4476-2288","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1"}],"year":"2021","date_updated":"2024-10-09T21:00:48Z"},{"oa":1,"quality_controlled":"1","article_type":"letter_note","issue":"24","volume":126,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"18","article_number":"244502","citation":{"apa":"Yalniz, G., Hof, B., &#38; Budanur, N. B. (2021). Coarse graining the state space of a turbulent flow using periodic orbits. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">https://doi.org/10.1103/PhysRevLett.126.244502</a>","mla":"Yalniz, Gökhan, et al. “Coarse Graining the State Space of a Turbulent Flow Using Periodic Orbits.” <i>Physical Review Letters</i>, vol. 126, no. 24, 244502, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">10.1103/PhysRevLett.126.244502</a>.","ama":"Yalniz G, Hof B, Budanur NB. Coarse graining the state space of a turbulent flow using periodic orbits. <i>Physical Review Letters</i>. 2021;126(24). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">10.1103/PhysRevLett.126.244502</a>","ieee":"G. Yalniz, B. Hof, and N. B. Budanur, “Coarse graining the state space of a turbulent flow using periodic orbits,” <i>Physical Review Letters</i>, vol. 126, no. 24. American Physical Society, 2021.","chicago":"Yalniz, Gökhan, Björn Hof, and Nazmi B Budanur. “Coarse Graining the State Space of a Turbulent Flow Using Periodic Orbits.” <i>Physical Review Letters</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">https://doi.org/10.1103/PhysRevLett.126.244502</a>.","ista":"Yalniz G, Hof B, Budanur NB. 2021. Coarse graining the state space of a turbulent flow using periodic orbits. Physical Review Letters. 126(24), 244502.","short":"G. Yalniz, B. Hof, N.B. Budanur, Physical Review Letters 126 (2021)."},"status":"public","publication":"Physical Review Letters","scopus_import":"1","publisher":"American Physical Society","acknowledged_ssus":[{"_id":"ScienComp"}],"date_updated":"2026-04-07T11:47:05Z","year":"2021","author":[{"orcid":"0000-0002-8490-9312","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","first_name":"Gökhan","last_name":"Yalniz","full_name":"Yalniz, Gökhan"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn"},{"id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0423-5010","full_name":"Budanur, Nazmi B","last_name":"Budanur","first_name":"Nazmi B"}],"corr_author":"1","acknowledgement":"We thank the referees for improving this Letter with their comments. We acknowledge stimulating discussions with\r\nH. Edelsbrunner. This work was supported by Grant No. 662960 from the Simons Foundation (B. H.). The numerical calculations were performed at TUBITAK ULAKBIM High Performance and Grid Computing Center (TRUBA resources) and IST Austria High Performance Computing cluster.","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"project":[{"grant_number":"662960","name":"Revisiting the Turbulence Problem Using Statistical Mechanics","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"}],"external_id":{"isi":["000663310100008"],"arxiv":["2007.02584"]},"abstract":[{"lang":"eng","text":"We show that turbulent dynamics that arise in simulations of the three-dimensional Navier--Stokes equations in a triply-periodic domain under sinusoidal forcing can be described as transient visits to the neighborhoods of unstable time-periodic solutions. Based on this description, we reduce the original system with more than 10^5 degrees of freedom to a 17-node Markov chain where each node corresponds to the neighborhood of a periodic orbit. The model accurately reproduces long-term averages of the system's observables as weighted sums over the periodic orbits.\r\n"}],"arxiv":1,"month":"06","type":"journal_article","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/2007.02584","open_access":"1"}],"date_created":"2021-06-16T15:45:36Z","doi":"10.1103/PhysRevLett.126.244502","oa_version":"Preprint","title":"Coarse graining the state space of a turbulent flow using periodic orbits","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"publication_status":"published","intvolume":"       126","language":[{"iso":"eng"}],"date_published":"2021-06-18T00:00:00Z","_id":"9558","related_material":{"record":[{"status":"returned","relation":"popular_science","id":"19591"},{"id":"19684","relation":"dissertation_contains","status":"public"}],"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/turbulent-flow-simplified/"}]},"isi":1},{"language":[{"iso":"eng"}],"intvolume":"       127","publication_status":"published","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19393"}]},"_id":"9903","isi":1,"date_published":"2021-08-06T00:00:00Z","type":"journal_article","arxiv":1,"file_date_updated":"2021-08-13T09:28:08Z","month":"08","abstract":[{"lang":"eng","text":"Eigenstate thermalization in quantum many-body systems implies that eigenstates at high energy are similar to random vectors. Identifying systems where at least some eigenstates are nonthermal is an outstanding question. In this Letter we show that interacting quantum models that have a nullspace—a degenerate subspace of eigenstates at zero energy (zero modes), which corresponds to infinite temperature, provide a route to nonthermal eigenstates. We analytically show the existence of a zero mode which can be represented as a matrix product state for a certain class of local Hamiltonians. In the more general case we use a subspace disentangling algorithm to generate an orthogonal basis of zero modes characterized by increasing entanglement entropy. We show evidence for an area-law entanglement scaling of the least-entangled zero mode in the broad parameter regime, leading to a conjecture that all local Hamiltonians with the nullspace feature zero modes with area-law entanglement scaling and, as such, break the strong thermalization hypothesis. Finally, we find zero modes in constrained models and propose a setup for observing their experimental signatures."}],"external_id":{"isi":["000684276000002"],"arxiv":["2102.13633"]},"project":[{"grant_number":"850899","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020"}],"publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"acknowledgement":"We acknowledge useful discussions with V. Gritsev and A. Garkun and suggestions on implementation of the\r\nPPXPP model by D. Bluvstein. A. M. and M. S. were supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899)","department":[{"_id":"MaSe"},{"_id":"GradSch"},{"_id":"MiLe"}],"title":"Area-law entangled eigenstates from nullspaces of local Hamiltonians","doi":"10.1103/physrevlett.127.060602","oa_version":"Published Version","date_created":"2021-08-13T09:27:39Z","article_processing_charge":"Yes (in subscription journal)","publisher":"American Physical Society","file":[{"date_created":"2021-08-13T09:28:08Z","success":1,"access_level":"open_access","date_updated":"2021-08-13T09:28:08Z","checksum":"51218f302dcef99d90d1209809fcc874","file_size":5064231,"content_type":"application/pdf","relation":"main_file","file_id":"9904","creator":"mserbyn","file_name":"PhysRevLett.127.060602_SOM.pdf"}],"ec_funded":1,"scopus_import":"1","has_accepted_license":"1","publication":"Physical Review Letters","status":"public","citation":{"mla":"Karle, Volker, et al. “Area-Law Entangled Eigenstates from Nullspaces of Local Hamiltonians.” <i>Physical Review Letters</i>, vol. 127, no. 6, 060602, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevlett.127.060602\">10.1103/physrevlett.127.060602</a>.","apa":"Karle, V., Serbyn, M., &#38; Michailidis, A. (2021). Area-law entangled eigenstates from nullspaces of local Hamiltonians. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.127.060602\">https://doi.org/10.1103/physrevlett.127.060602</a>","ieee":"V. Karle, M. Serbyn, and A. Michailidis, “Area-law entangled eigenstates from nullspaces of local Hamiltonians,” <i>Physical Review Letters</i>, vol. 127, no. 6. American Physical Society, 2021.","ama":"Karle V, Serbyn M, Michailidis A. Area-law entangled eigenstates from nullspaces of local Hamiltonians. <i>Physical Review Letters</i>. 2021;127(6). doi:<a href=\"https://doi.org/10.1103/physrevlett.127.060602\">10.1103/physrevlett.127.060602</a>","short":"V. Karle, M. Serbyn, A. Michailidis, Physical Review Letters 127 (2021).","chicago":"Karle, Volker, Maksym Serbyn, and Alexios Michailidis. “Area-Law Entangled Eigenstates from Nullspaces of Local Hamiltonians.” <i>Physical Review Letters</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevlett.127.060602\">https://doi.org/10.1103/physrevlett.127.060602</a>.","ista":"Karle V, Serbyn M, Michailidis A. 2021. Area-law entangled eigenstates from nullspaces of local Hamiltonians. Physical Review Letters. 127(6), 060602."},"ddc":["539"],"article_number":"060602","author":[{"last_name":"Karle","first_name":"Volker","full_name":"Karle, Volker","id":"D7C012AE-D7ED-11E9-95E8-1EC5E5697425","orcid":"0000-0002-6963-0129"},{"orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","first_name":"Maksym","full_name":"Serbyn, Maksym"},{"orcid":"0000-0002-8443-1064","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","full_name":"Michailidis, Alexios","last_name":"Michailidis","first_name":"Alexios"}],"year":"2021","date_updated":"2026-04-07T11:48:53Z","article_type":"letter_note","quality_controlled":"1","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"06","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":127,"issue":"6"},{"oa":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"29","publisher":"Institute of Electrical and Electronics Engineers","conference":{"start_date":"2021-06-29","end_date":"2021-07-02","name":"LICS: Logic in Computer Science","location":"Online"},"file":[{"file_id":"9557","relation":"main_file","file_name":"qam.pdf","creator":"esarac","success":1,"date_created":"2021-06-16T08:23:54Z","access_level":"open_access","date_updated":"2021-06-16T08:23:54Z","file_size":641990,"checksum":"6e4cba3f72775f479c5b1b75d1a4a0c4","content_type":"application/pdf"}],"has_accepted_license":"1","scopus_import":"1","citation":{"chicago":"Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>.","short":"T.A. Henzinger, N.E. Sarac, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021.","ista":"Henzinger TA, Sarac NE. 2021. Quantitative and approximate monitoring. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 9470547.","apa":"Henzinger, T. A., &#38; Sarac, N. E. (2021). Quantitative and approximate monitoring. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Online: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">https://doi.org/10.1109/LICS52264.2021.9470547</a>","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 9470547, Institute of Electrical and Electronics Engineers, 2021, doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>.","ama":"Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Institute of Electrical and Electronics Engineers; 2021. doi:<a href=\"https://doi.org/10.1109/LICS52264.2021.9470547\">10.1109/LICS52264.2021.9470547</a>","ieee":"T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,” in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Online, 2021."},"article_number":"9470547","ddc":["000"],"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","status":"public","author":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","first_name":"Naci E","full_name":"Sarac, Naci E"}],"year":"2021","date_updated":"2026-04-07T12:02:57Z","external_id":{"arxiv":["2105.08353"],"isi":["000947350400021"]},"project":[{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"type":"conference","arxiv":1,"month":"06","file_date_updated":"2021-06-16T08:23:54Z","abstract":[{"text":"In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.","lang":"eng"}],"acknowledgement":"We thank the anonymous reviewers for their helpful comments. This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_created":"2021-04-30T17:30:47Z","doi":"10.1109/LICS52264.2021.9470547","oa_version":"Published Version","article_processing_charge":"No","title":"Quantitative and approximate monitoring","language":[{"iso":"eng"}],"publication_status":"published","_id":"9356","related_material":{"record":[{"relation":"dissertation_contains","id":"20147","status":"public"}]},"isi":1,"date_published":"2021-06-29T00:00:00Z"},{"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"title":"AC/DC: Alternating Compressed/DeCompressed training of deep neural networks","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/48000647b315f6f00f913caa757a70b3-Paper.pdf"}],"oa_version":"Published Version","date_created":"2022-06-20T12:11:53Z","abstract":[{"text":"The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.","lang":"eng"}],"type":"conference","arxiv":1,"month":"12","project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"external_id":{"arxiv":["2106.12379"]},"publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]},"corr_author":"1","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), and a CNRS PEPS grant. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). We would also like to thank Christoph Lampert for his feedback on an earlier version of this work, as well as for providing hardware for the Transformer-XL experiments.","_id":"11458","related_material":{"record":[{"id":"13074","relation":"dissertation_contains","status":"public"}]},"date_published":"2021-12-06T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","intvolume":"        34","alternative_title":["Advances in Neural Information Processing Systems"],"day":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":34,"quality_controlled":"1","oa":1,"year":"2021","author":[{"id":"32D78294-F248-11E8-B48F-1D18A9856A87","full_name":"Peste, Elena-Alexandra","first_name":"Elena-Alexandra","last_name":"Peste"},{"orcid":"0000-0002-7778-3221","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","full_name":"Iofinova, Eugenia B","last_name":"Iofinova","first_name":"Eugenia B"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"}],"date_updated":"2026-04-07T13:30:19Z","acknowledged_ssus":[{"_id":"ScienComp"}],"scopus_import":"1","ec_funded":1,"conference":{"end_date":"2021-12-14","start_date":"2021-12-06","name":"NeurIPS: Neural Information Processing Systems","location":"Virtual, Online"},"publisher":"Neural Information Processing Systems Foundation","status":"public","publication":"35th Conference on Neural Information Processing Systems","citation":{"short":"A. Krumes, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 8557–8570.","ista":"Krumes A, Iofinova EB, Vladu A, Alistarh D-A. 2021. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 34, 8557–8570.","chicago":"Krumes, Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 34:8557–70. Neural Information Processing Systems Foundation, 2021.","ama":"Krumes A, Iofinova EB, Vladu A, Alistarh D-A. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 34. Neural Information Processing Systems Foundation; 2021:8557-8570.","ieee":"A. Krumes, E. B. Iofinova, A. Vladu, and D.-A. Alistarh, “AC/DC: Alternating Compressed/DeCompressed training of deep neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 34, pp. 8557–8570.","apa":"Krumes, A., Iofinova, E. B., Vladu, A., &#38; Alistarh, D.-A. (2021). AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 34, pp. 8557–8570). Virtual, Online: Neural Information Processing Systems Foundation.","mla":"Krumes, Alexandra, et al. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 34, Neural Information Processing Systems Foundation, 2021, pp. 8557–70."},"page":"8557-8570"},{"date_updated":"2026-04-07T14:21:58Z","year":"2021","author":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699"}],"status":"public","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","citation":{"short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 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.","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.","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.","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."},"page":"3787-3795","ddc":["000"],"ec_funded":1,"has_accepted_license":"1","scopus_import":"1","publisher":"AAAI Press","file":[{"date_created":"2022-01-26T07:41:16Z","success":1,"date_updated":"2022-01-26T07:41:16Z","access_level":"open_access","content_type":"application/pdf","checksum":"2bc8155b2526a70fba5b7301bc89dbd1","file_size":137235,"file_id":"10684","relation":"main_file","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","creator":"mlechner"}],"conference":{"location":"Virtual","name":"AAAI: Association for the Advancement of Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02"},"volume":35,"issue":"5A","alternative_title":["Technical Tracks"],"day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","oa":1,"date_published":"2021-05-28T00:00:00Z","_id":"10665","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"publication_status":"published","intvolume":"        35","language":[{"iso":"eng"}],"title":"Scalable verification of quantized neural networks","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"date_created":"2022-01-25T15:15:02Z","oa_version":"Published Version","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_identifier":{"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"],"issn":["2159-5399"]},"corr_author":"1","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","abstract":[{"text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.","lang":"eng"}],"file_date_updated":"2022-01-26T07:41:16Z","month":"05","arxiv":1,"type":"conference","project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"external_id":{"arxiv":["2012.08185"]}},{"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"quality_controlled":"1","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","alternative_title":[" Advances in Neural Information Processing Systems"],"day":"01","citation":{"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, .","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021.","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>","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>.","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>"},"ddc":["000"],"status":"public","publication":"35th Conference on Neural Information Processing Systems","has_accepted_license":"1","ec_funded":1,"conference":{"name":"NeurIPS: Neural Information Processing Systems","end_date":"2021-12-10","start_date":"2021-12-06","location":"Virtual"},"file":[{"creator":"mlechner","file_name":"infinite_time_horizon_safety_o.pdf","relation":"main_file","file_id":"10682","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","file_size":452492,"content_type":"application/pdf","access_level":"open_access","date_updated":"2022-01-26T07:39:59Z","date_created":"2022-01-26T07:39:59Z","success":1}],"date_updated":"2026-04-07T14:21:58Z","year":"2021","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"first_name":"Ðorđe","last_name":"Žikelić","full_name":"Žikelić, Ðorđe"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"}],"corr_author":"1","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"external_id":{"arxiv":["2111.03165"]},"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."}],"month":"12","arxiv":1,"type":"conference","file_date_updated":"2022-01-26T07:39:59Z","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html"}],"doi":"10.48550/arXiv.2111.03165","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","oa_version":"Published Version","date_created":"2022-01-25T15:45:58Z","title":"Infinite time horizon safety of Bayesian neural networks","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","language":[{"iso":"eng"}],"date_published":"2021-12-01T00:00:00Z","_id":"10667","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]}},{"ddc":["000"],"OA_type":"green","citation":{"apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","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>.","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.","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>.","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."},"page":"4140-4147","status":"public","publication":"2021 IEEE International Conference on Robotics and Automation","conference":{"name":"ICRA: International Conference on Robotics and Automation","start_date":"2021-05-30","end_date":"2021-06-05","location":"Xi'an, China"},"scopus_import":"1","has_accepted_license":"1","date_updated":"2026-04-07T14:21:58Z","author":[{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"}],"year":"2021","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","day":"01","series_title":"ICRA","publication_status":"published","language":[{"iso":"eng"}],"date_published":"2021-06-01T00:00:00Z","related_material":{"record":[{"status":"public","id":"11362","relation":"dissertation_contains"}]},"_id":"10666","isi":1,"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).","publication_identifier":{"eisbn":["978-1-7281-9077-8"],"isbn":["978-1-7281-9078-5"],"issn":["1050-4729"],"eissn":["2577-087X"]},"external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"arxiv":1,"type":"conference","month":"06","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"}],"doi":"10.1109/ICRA48506.2021.9561036","date_created":"2022-01-25T15:44:54Z","oa_version":"Preprint","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"title":"Adversarial training is not ready for robot learning","department":[{"_id":"GradSch"},{"_id":"ToHe"}]},{"publication_status":"published","language":[{"iso":"eng"}],"date_published":"2021-01-25T00:00:00Z","_id":"9022","publication_identifier":{"issn":["2663-337X"]},"corr_author":"1","acknowledgement":"I gratefully acknowledge the financial support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804.","abstract":[{"lang":"eng","text":"In the first part of the thesis we consider Hermitian random matrices. Firstly, we consider sample covariance matrices XX∗ with X having independent identically distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences of linear statistics of XX∗ and its minor after removing the first column of X. Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics near cusp singularities of the limiting density of states are universal and that they form a Pearcey process. Since the limiting eigenvalue distribution admits only square root (edge) and cubic root (cusp) singularities, this concludes the third and last remaining case of the Wigner-Dyson-Mehta universality conjecture. The main technical ingredients are an optimal local law at the cusp, and the proof of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp regime.\r\nIn the second part we consider non-Hermitian matrices X with centred i.i.d. entries. We normalise the entries of X to have variance N −1. It is well known that the empirical eigenvalue density converges to the uniform distribution on the unit disk (circular law). In the first project, we prove universality of the local eigenvalue statistics close to the edge of the spectrum. This is the non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck flow for very long time\r\n(up to t = +∞). In the second project, we consider linear statistics of eigenvalues for macroscopic test functions f in the Sobolev space H2+ϵ and prove their convergence to the projection of the Gaussian Free Field on the unit disk. We prove this result for non-Hermitian matrices with real or complex entries. The main technical ingredients are: (i) local law for products of two resolvents at different spectral parameters, (ii) analysis of correlated Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically rigorous application of supersymmetric techniques (SUSY ) to give a lower tail estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we use superbosonisation formula to give an integral representation of the resolvent of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex and real case, respectively. The rigorous analysis of these integrals is quite challenging since simple saddle point analysis cannot be applied (the main contribution comes from a non-trivial manifold). Our result\r\nimproves classical smoothing inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality for i.i.d. non-Hermitian matrices."}],"type":"dissertation","month":"01","file_date_updated":"2021-01-25T14:19:10Z","project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"title":"Fluctuations in the spectrum of random matrices","article_processing_charge":"No","date_created":"2021-01-21T18:16:54Z","oa_version":"Published Version","doi":"10.15479/AT:ISTA:9022","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"degree_awarded":"PhD","status":"public","page":"380","ddc":["510"],"citation":{"short":"G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021.","chicago":"Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9022\">https://doi.org/10.15479/AT:ISTA:9022</a>.","ista":"Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria.","ama":"Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9022\">10.15479/AT:ISTA:9022</a>","apa":"Cipolloni, G. (2021). <i>Fluctuations in the spectrum of random matrices</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9022\">https://doi.org/10.15479/AT:ISTA:9022</a>","mla":"Cipolloni, Giorgio. <i>Fluctuations in the Spectrum of Random Matrices</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9022\">10.15479/AT:ISTA:9022</a>.","ieee":"G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute of Science and Technology Austria, 2021."},"has_accepted_license":"1","ec_funded":1,"file":[{"relation":"main_file","file_id":"9043","creator":"gcipollo","file_name":"thesis.pdf","date_created":"2021-01-25T14:19:03Z","success":1,"access_level":"open_access","date_updated":"2021-01-25T14:19:03Z","checksum":"5a93658a5f19478372523ee232887e2b","content_type":"application/pdf","file_size":4127796},{"file_size":12775206,"checksum":"e8270eddfe6a988e92a53c88d1d19b8c","content_type":"application/zip","date_updated":"2021-01-25T14:19:10Z","access_level":"closed","date_created":"2021-01-25T14:19:10Z","file_name":"Thesis_files.zip","creator":"gcipollo","file_id":"9044","relation":"source_file"}],"publisher":"Institute of Science and Technology Austria","date_updated":"2026-04-08T06:59:33Z","year":"2021","author":[{"orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio","first_name":"Giorgio","last_name":"Cipolloni"}],"oa":1,"supervisor":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László","last_name":"Erdös"}],"alternative_title":["ISTA Thesis"],"day":"25","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"corr_author":"1","publication_identifier":{"issn":["2791-4585"]},"abstract":[{"text":"Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems.","lang":"eng"}],"file_date_updated":"2022-03-10T12:10:25Z","month":"12","type":"dissertation","article_processing_charge":"No","oa_version":"Published Version","doi":"10.15479/at:ista:10422","date_created":"2021-12-07T10:48:06Z","title":"Towards designer materials using customizable particle shape","department":[{"_id":"GradSch"},{"_id":"CaGo"}],"degree_awarded":"MS","publication_status":"published","language":[{"iso":"eng"}],"date_published":"2021-12-07T00:00:00Z","_id":"10422","oa":1,"supervisor":[{"orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","full_name":"Goodrich, Carl Peter","last_name":"Goodrich","first_name":"Carl Peter"}],"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Master's Thesis"],"day":"07","citation":{"ama":"Piankov A. Towards designer materials using customizable particle shape. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10422\">10.15479/at:ista:10422</a>","apa":"Piankov, A. (2021). <i>Towards designer materials using customizable particle shape</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10422\">https://doi.org/10.15479/at:ista:10422</a>","mla":"Piankov, Anton. <i>Towards Designer Materials Using Customizable Particle Shape</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10422\">10.15479/at:ista:10422</a>.","ieee":"A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021.","chicago":"Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10422\">https://doi.org/10.15479/at:ista:10422</a>.","short":"A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021.","ista":"Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria."},"ddc":["530"],"status":"public","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","file":[{"file_size":394018,"checksum":"114e8f4b2c002c6c352416c12de2c695","content_type":"application/x-zip-compressed","date_created":"2021-12-07T11:13:52Z","access_level":"closed","date_updated":"2022-03-10T12:10:25Z","file_id":"10424","relation":"source_file","file_name":"Thesis.zip","creator":"cchlebak"},{"file_name":"Preliminary_pages_Piankov.docx","creator":"cchlebak","file_id":"10425","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":47638,"checksum":"cd15ae991ced352a9959815f794e657c","access_level":"closed","date_updated":"2022-03-10T12:10:25Z","date_created":"2021-12-07T11:14:01Z"},{"relation":"main_file","file_id":"10426","creator":"cchlebak","file_name":"2021_Piankov_combined.pdf","success":1,"date_created":"2021-12-07T11:20:35Z","access_level":"open_access","date_updated":"2021-12-07T11:20:35Z","file_size":484965,"content_type":"application/pdf","checksum":"e6899c798b75ba42fab9822bce309050"}],"date_updated":"2026-04-08T06:58:55Z","year":"2021","author":[{"id":"865E3C26-AA8C-11E9-A409-C4C4E5697425","last_name":"Piankov","first_name":"Anton","full_name":"Piankov, Anton"}]},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"supervisor":[{"full_name":"Maas, Jan","last_name":"Maas","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338"}],"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"22","alternative_title":["ISTA Thesis"],"ddc":["515"],"citation":{"ieee":"L. Portinale, “Discrete-to-continuum limits of transport problems and gradient flows in the space of measures,” Institute of Science and Technology Austria, 2021.","mla":"Portinale, Lorenzo. <i>Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10030\">10.15479/at:ista:10030</a>.","apa":"Portinale, L. (2021). <i>Discrete-to-continuum limits of transport problems and gradient flows in the space of measures</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10030\">https://doi.org/10.15479/at:ista:10030</a>","ama":"Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10030\">10.15479/at:ista:10030</a>","ista":"Portinale L. 2021. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria.","short":"L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.","chicago":"Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10030\">https://doi.org/10.15479/at:ista:10030</a>."},"status":"public","publisher":"Institute of Science and Technology Austria","file":[{"date_created":"2021-09-21T09:17:34Z","date_updated":"2022-03-10T12:14:42Z","access_level":"closed","file_size":3876668,"checksum":"8cd60dcb8762e8f21867e21e8001e183","content_type":"application/x-zip-compressed","file_id":"10032","relation":"source_file","file_name":"tex_and_pictures.zip","creator":"cchlebak"},{"file_id":"10047","relation":"main_file","file_name":"thesis_portinale_Final (1).pdf","creator":"cchlebak","file_size":2532673,"checksum":"9789e9d967c853c1503ec7f307170279","content_type":"application/pdf","date_created":"2021-09-27T11:14:31Z","access_level":"open_access","date_updated":"2021-09-27T11:14:31Z"}],"has_accepted_license":"1","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"date_updated":"2026-04-08T07:00:04Z","author":[{"first_name":"Lorenzo","last_name":"Portinale","full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"}],"year":"2021","acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245.","corr_author":"1","publication_identifier":{"issn":["2663-337X"]},"project":[{"_id":"260788DE-B435-11E9-9278-68D0E5697425","grant_number":"W1245","name":"Dissipation and dispersion in nonlinear partial differential equations","call_identifier":"FWF"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"file_date_updated":"2022-03-10T12:14:42Z","type":"dissertation","month":"09","abstract":[{"lang":"eng","text":"This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces."}],"date_created":"2021-09-21T09:14:15Z","doi":"10.15479/at:ista:10030","oa_version":"Published Version","article_processing_charge":"No","title":"Discrete-to-continuum limits of transport problems and gradient flows in the space of measures","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"publication_status":"published","language":[{"iso":"eng"}],"date_published":"2021-09-22T00:00:00Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9792"},{"status":"public","id":"10022","relation":"part_of_dissertation"},{"status":"public","id":"7573","relation":"part_of_dissertation"}]},"_id":"10030"},{"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9787"},{"status":"public","id":"9792","relation":"part_of_dissertation"},{"id":"9791","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9781"},{"status":"public","id":"9225","relation":"part_of_dissertation"}]},"_id":"9733","date_published":"2021-08-20T00:00:00Z","abstract":[{"text":"This thesis is the result of the research carried out by the author during his PhD at IST Austria between 2017 and 2021. It mainly focuses on the Fröhlich polaron model, specifically to its regime of strong coupling. This model, which is rigorously introduced and discussed in the introduction, has been of great interest in condensed matter physics and field theory for more than eighty years. It is used to describe an electron interacting with the atoms of a solid material (the strength of this interaction is modeled by the presence of a coupling constant α in the Hamiltonian of the system). The particular regime examined here, which is mathematically described by considering the limit α →∞, displays many interesting features related to the emergence of classical behavior, which allows for a simplified effective description of the system under analysis. The properties, the range of validity and a quantitative analysis of the precision of such classical approximations are the main object of the present work. We specify our investigation to the study of the ground state energy of the system, its dynamics and its effective mass. For each of these problems, we provide in the introduction an overview of the previously known results and a detailed account of the original contributions by the author.","lang":"eng"}],"type":"dissertation","month":"08","file_date_updated":"2022-03-10T12:13:57Z","project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227","call_identifier":"H2020"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"publication_identifier":{"issn":["2663-337X"]},"corr_author":"1","department":[{"_id":"GradSch"},{"_id":"RoSe"},{"_id":"JaMa"}],"degree_awarded":"PhD","title":"The polaron at strong coupling","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_created":"2021-07-27T15:48:30Z","doi":"10.15479/at:ista:9733","oa_version":"Published Version","has_accepted_license":"1","ec_funded":1,"publisher":"Institute of Science and Technology Austria","file":[{"date_updated":"2021-09-06T09:28:56Z","access_level":"open_access","date_created":"2021-08-19T14:03:48Z","content_type":"application/pdf","file_size":1958710,"checksum":"e88bb8ca43948abe060eb2d2fa719881","file_name":"Thesis_FeliciangeliA.pdf","creator":"dfelicia","file_id":"9944","relation":"main_file"},{"relation":"source_file","file_id":"9945","creator":"dfelicia","file_name":"thesis.7z","date_created":"2021-08-19T14:06:35Z","date_updated":"2022-03-10T12:13:57Z","access_level":"closed","file_size":3771669,"checksum":"72810843abee83705853505b3f8348aa","content_type":"application/octet-stream"}],"status":"public","page":"180","citation":{"chicago":"Feliciangeli, Dario. “The Polaron at Strong Coupling.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>.","short":"D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.","ista":"Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science and Technology Austria.","mla":"Feliciangeli, Dario. <i>The Polaron at Strong Coupling</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>.","ama":"Feliciangeli D. The polaron at strong coupling. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>","ieee":"D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and Technology Austria, 2021.","apa":"Feliciangeli, D. (2021). <i>The polaron at strong coupling</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>"},"ddc":["515","519","539"],"year":"2021","author":[{"full_name":"Feliciangeli, Dario","first_name":"Dario","last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530"}],"date_updated":"2026-04-08T06:59:50Z","oa":1,"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)"},"alternative_title":["ISTA Thesis"],"day":"20","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","supervisor":[{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert"},{"full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338"}]},{"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"day":"31","supervisor":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"year":"2021","author":[{"first_name":"Viktor","last_name":"Toman","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87"}],"acknowledged_ssus":[{"_id":"SSU"}],"date_updated":"2026-04-08T07:00:31Z","has_accepted_license":"1","ec_funded":1,"file":[{"file_size":2915234,"checksum":"4f412a1ee60952221b499a4b1268df35","content_type":"application/pdf","access_level":"open_access","date_updated":"2021-11-08T14:12:22Z","date_created":"2021-11-08T14:12:22Z","file_name":"toman_th_final.pdf","creator":"vtoman","file_id":"10225","relation":"main_file"},{"date_created":"2021-11-08T14:12:46Z","access_level":"closed","date_updated":"2021-11-09T09:00:50Z","checksum":"9584943f99127be2dd2963f6784c37d4","file_size":8616056,"content_type":"application/zip","file_id":"10226","relation":"source_file","file_name":"toman_thesis.zip","creator":"vtoman"}],"publisher":"Institute of Science and Technology Austria","citation":{"ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>","mla":"Toman, Viktor. <i>Improved Verification Techniques for Concurrent Systems</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10199\">10.15479/at:ista:10199</a>.","apa":"Toman, V. (2021). <i>Improved verification techniques for concurrent systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10199\">https://doi.org/10.15479/at:ista:10199</a>.","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria."},"page":"166","ddc":["000"],"status":"public","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"degree_awarded":"PhD","article_processing_charge":"No","oa_version":"Published Version","doi":"10.15479/at:ista:10199","date_created":"2021-10-29T20:09:01Z","title":"Improved verification techniques for concurrent systems","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"abstract":[{"text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness.","lang":"eng"}],"file_date_updated":"2021-11-09T09:00:50Z","month":"10","type":"dissertation","corr_author":"1","publication_identifier":{"issn":["2663-337X"]},"keyword":["concurrency","verification","model checking"],"related_material":{"record":[{"status":"public","id":"9987","relation":"part_of_dissertation"},{"status":"public","id":"10191","relation":"part_of_dissertation"},{"status":"public","id":"141","relation":"part_of_dissertation"},{"id":"10190","relation":"part_of_dissertation","status":"public"}]},"_id":"10199","date_published":"2021-10-31T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published"},{"acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003.","publication_identifier":{"eissn":["2475-1421"]},"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["2011.11763"]},"abstract":[{"text":"In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n","lang":"eng"}],"type":"journal_article","file_date_updated":"2021-11-04T07:24:48Z","arxiv":1,"month":"10","article_processing_charge":"No","oa_version":"Published Version","doi":"10.1145/3485541","date_created":"2021-10-27T15:05:34Z","title":"The reads-from equivalence for the TSO and PSO memory models","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published","intvolume":"         5","language":[{"iso":"eng"}],"date_published":"2021-10-15T00:00:00Z","keyword":["safety","risk","reliability and quality","software"],"related_material":{"record":[{"id":"10199","relation":"dissertation_contains","status":"public"}]},"_id":"10191","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"quality_controlled":"1","article_type":"original","issue":"OOPSLA","volume":5,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"15","article_number":"164","ddc":["000"],"citation":{"ieee":"T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.","apa":"Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., &#38; Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>","mla":"Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>.","ama":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. <i>Proceedings of the ACM on Programming Languages</i>. 2021;5(OOPSLA). doi:<a href=\"https://doi.org/10.1145/3485541\">10.1145/3485541</a>","short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","chicago":"Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3485541\">https://doi.org/10.1145/3485541</a>.","ista":"Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164."},"status":"public","publication":"Proceedings of the ACM on Programming Languages","ec_funded":1,"has_accepted_license":"1","scopus_import":"1","publisher":"Association for Computing Machinery","file":[{"file_size":2903485,"checksum":"9d6dce7b611853c529bb7b1915ac579e","content_type":"application/pdf","success":1,"date_created":"2021-11-04T07:24:48Z","access_level":"open_access","date_updated":"2021-11-04T07:24:48Z","file_id":"10215","relation":"main_file","file_name":"2021_ProcACMPL_Bui.pdf","creator":"cchlebak"}],"date_updated":"2026-04-08T07:00:31Z","year":"2021","author":[{"full_name":"Bui, Truc Lam","last_name":"Bui","first_name":"Truc Lam"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Tushar","last_name":"Gautam","full_name":"Gautam, Tushar"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","first_name":"Viktor","last_name":"Toman"}]},{"publication_status":"published","language":[{"iso":"eng"}],"date_published":"2021-09-14T00:00:00Z","_id":"10007","related_material":{"record":[{"relation":"part_of_dissertation","id":"10012","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10013"},{"relation":"part_of_dissertation","id":"7489","status":"public"}]},"publication_identifier":{"issn":["2663-337X"]},"corr_author":"1","month":"09","file_date_updated":"2021-09-15T14:37:30Z","type":"dissertation","abstract":[{"lang":"eng","text":"The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis."}],"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"948819","name":"Bridging Scales in Random Materials","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"title":"Curvature driven interface evolution: Uniqueness properties of weak solution concepts","oa_version":"Published Version","date_created":"2021-09-13T11:12:34Z","doi":"10.15479/at:ista:10007","article_processing_charge":"No","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"JuFi"}],"status":"public","citation":{"mla":"Hensel, Sebastian. <i>Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10007\">10.15479/at:ista:10007</a>.","ama":"Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10007\">10.15479/at:ista:10007</a>","apa":"Hensel, S. (2021). <i>Curvature driven interface evolution: Uniqueness properties of weak solution concepts</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10007\">https://doi.org/10.15479/at:ista:10007</a>","ieee":"S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.","chicago":"Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10007\">https://doi.org/10.15479/at:ista:10007</a>.","short":"S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.","ista":"Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria."},"page":"300","ddc":["515"],"publisher":"Institute of Science and Technology Austria","file":[{"creator":"shensel","file_name":"thesis_final_Hensel.zip","relation":"source_file","file_id":"10008","access_level":"closed","date_updated":"2021-09-15T14:37:30Z","date_created":"2021-09-13T11:03:24Z","checksum":"c8475faaf0b680b4971f638f1db16347","content_type":"application/x-zip-compressed","file_size":15022154},{"file_name":"thesis_final_Hensel.pdf","creator":"shensel","file_id":"10014","relation":"main_file","access_level":"open_access","date_updated":"2021-09-14T09:52:47Z","date_created":"2021-09-13T14:18:56Z","content_type":"application/pdf","checksum":"1a609937aa5275452822f45f2da17f07","file_size":6583638}],"has_accepted_license":"1","ec_funded":1,"date_updated":"2026-04-08T07:01:01Z","author":[{"full_name":"Hensel, Sebastian","first_name":"Sebastian","last_name":"Hensel","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072"}],"year":"2021","oa":1,"supervisor":[{"full_name":"Fischer, Julian L","first_name":"Julian L","last_name":"Fischer","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"}],"day":"14","alternative_title":["ISTA Thesis"],"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"oa":1,"supervisor":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"09","alternative_title":["ISTA Thesis"],"page":"132","ddc":["000"],"citation":{"ama":"Nadiradze G. On achieving scalability through relaxation. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>","ieee":"G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021.","apa":"Nadiradze, G. (2021). <i>On achieving scalability through relaxation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>","mla":"Nadiradze, Giorgi. <i>On Achieving Scalability through Relaxation</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:10429\">10.15479/at:ista:10429</a>.","ista":"Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.","short":"G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.","chicago":"Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:10429\">https://doi.org/10.15479/at:ista:10429</a>."},"status":"public","file":[{"access_level":"open_access","date_updated":"2021-12-09T17:47:49Z","date_created":"2021-12-09T17:47:49Z","success":1,"checksum":"6bf14e9a523387328f016c0689f5e10e","content_type":"application/pdf","file_size":2370859,"creator":"gnadirad","file_name":"Thesis_Final_09_12_2021.pdf","relation":"main_file","file_id":"10436"},{"file_id":"10437","relation":"source_file","file_name":"Thesis_Final_09_12_2021.zip","creator":"gnadirad","file_size":2596924,"content_type":"application/zip","checksum":"914d6c5ca86bd0add471971a8f4c4341","date_created":"2021-12-09T17:47:49Z","access_level":"closed","date_updated":"2022-03-28T12:55:12Z"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"has_accepted_license":"1","date_updated":"2026-04-08T07:00:46Z","author":[{"full_name":"Nadiradze, Giorgi","first_name":"Giorgi","last_name":"Nadiradze","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5634-0731"}],"year":"2021","corr_author":"1","publication_identifier":{"issn":["2663-337X"]},"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"file_date_updated":"2022-03-28T12:55:12Z","type":"dissertation","month":"12","abstract":[{"text":"The scalability of concurrent data structures and distributed algorithms strongly depends on\r\nreducing the contention for shared resources and the costs of synchronization and communication. We show how such cost reductions can be attained by relaxing the strict consistency conditions required by sequential implementations. In the first part of the thesis, we consider relaxation in the context of concurrent data structures. Specifically, in data structures \r\nsuch as priority queues, imposing strong semantics renders scalability impossible, since a correct implementation of the remove operation should return only the element with highest priority. Intuitively, attempting to invoke remove operations concurrently  creates a race condition. This bottleneck  can be circumvented by relaxing semantics of the affected data structure, thus allowing removal of the elements which are no longer required to have the highest priority. We prove that the randomized implementations of relaxed data structures provide provable guarantees on the priority of the removed elements even under concurrency. Additionally, we show that in some cases the relaxed data structures can be used to scale the classical algorithms which are usually implemented with the exact ones. In the second part, we study parallel variants of the  stochastic gradient descent (SGD) algorithm, which distribute computation  among the multiple processors, thus reducing the running time. Unfortunately, in order for standard parallel SGD to succeed, each processor has to maintain a local copy of the necessary model parameter, which is identical to the local copies of other processors; the overheads from this perfect consistency in terms of communication and synchronization can negate the speedup gained by distributing the computation. We show that the consistency conditions required by SGD can be  relaxed, allowing the algorithm to be more flexible in terms of tolerating quantized communication, asynchrony, or even crash faults, while its convergence remains asymptotically the same.","lang":"eng"}],"oa_version":"Published Version","doi":"10.15479/at:ista:10429","date_created":"2021-12-08T21:52:28Z","article_processing_charge":"No","title":"On achieving scalability through relaxation","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"publication_status":"published","language":[{"iso":"eng"}],"date_published":"2021-12-09T00:00:00Z","related_material":{"record":[{"status":"public","id":"10435","relation":"part_of_dissertation"},{"status":"public","id":"10432","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"6673"},{"id":"5965","relation":"part_of_dissertation","status":"public"}]},"_id":"10429"},{"author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","first_name":"Phuong","last_name":"Bui Thi Mai","full_name":"Bui Thi Mai, Phuong"}],"year":"2021","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"date_updated":"2026-04-08T07:01:17Z","publisher":"Institute of Science and Technology Austria","file":[{"creator":"bphuong","file_name":"mph-thesis-v519-pdfimages.pdf","relation":"main_file","file_id":"9419","date_updated":"2021-05-24T11:22:29Z","access_level":"open_access","success":1,"date_created":"2021-05-24T11:22:29Z","content_type":"application/pdf","checksum":"4f0abe64114cfed264f9d36e8d1197e3","file_size":2673905},{"relation":"source_file","file_id":"9420","creator":"bphuong","file_name":"thesis.zip","date_created":"2021-05-24T11:56:02Z","date_updated":"2021-05-24T11:56:02Z","access_level":"closed","content_type":"application/zip","file_size":92995100,"checksum":"f5699e876bc770a9b0df8345a77720a2"}],"has_accepted_license":"1","ddc":["000"],"page":"125","citation":{"short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>.","ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021.","mla":"Phuong, Mary. <i>Underspecification in Deep Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>.","ama":"Phuong M. Underspecification in deep learning. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>","apa":"Phuong, M. (2021). <i>Underspecification in deep learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>"},"status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","day":"30","alternative_title":["ISTA Thesis"],"supervisor":[{"first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"oa":1,"related_material":{"record":[{"status":"deleted","id":"7435","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"7481","status":"public"},{"relation":"part_of_dissertation","id":"9416","status":"public"},{"id":"7479","relation":"part_of_dissertation","status":"public"}]},"_id":"9418","date_published":"2021-05-30T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"oa_version":"Published Version","date_created":"2021-05-24T13:06:23Z","doi":"10.15479/AT:ISTA:9418","article_processing_charge":"No","title":"Underspecification in deep learning","type":"dissertation","file_date_updated":"2021-05-24T11:56:02Z","month":"05","abstract":[{"lang":"eng","text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models."}],"corr_author":"1","publication_identifier":{"issn":["2663-337X"]}},{"related_material":{"record":[{"relation":"part_of_dissertation","id":"187","status":"public"},{"status":"public","id":"8703","relation":"part_of_dissertation"}]},"_id":"9056","date_published":"2021-02-01T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"degree_awarded":"PhD","title":"Multi-cover persistence and Delaunay mosaics","article_processing_charge":"No","doi":"10.15479/AT:ISTA:9056","date_created":"2021-02-02T14:11:06Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,\r\nand thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration\r\nfunction on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets."}],"month":"02","type":"dissertation","file_date_updated":"2021-02-03T10:37:28Z","place":"Klosterneuburg","publication_identifier":{"issn":["2663-337X"]},"corr_author":"1","year":"2021","author":[{"full_name":"Osang, Georg F","first_name":"Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8882-5116"}],"date_updated":"2026-04-08T07:01:30Z","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","file":[{"file_id":"9063","relation":"source_file","file_name":"thesis_source.zip","creator":"patrickd","date_created":"2021-02-02T14:09:25Z","date_updated":"2021-02-03T10:37:28Z","access_level":"closed","file_size":13446994,"content_type":"application/zip","checksum":"bcf27986147cab0533b6abadd74e7629"},{"success":1,"date_created":"2021-02-02T14:09:18Z","date_updated":"2021-02-02T14:09:18Z","access_level":"open_access","checksum":"9cc8af266579a464385bbe2aff6af606","content_type":"application/pdf","file_size":5210329,"file_id":"9064","relation":"main_file","file_name":"thesis_pdfA2b.pdf","creator":"patrickd"}],"status":"public","ddc":["006","514","516"],"citation":{"ieee":"G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021.","apa":"Osang, G. F. (2021). <i>Multi-cover persistence and Delaunay mosaics</i>. Institute of Science and Technology Austria, Klosterneuburg. <a href=\"https://doi.org/10.15479/AT:ISTA:9056\">https://doi.org/10.15479/AT:ISTA:9056</a>","mla":"Osang, Georg F. <i>Multi-Cover Persistence and Delaunay Mosaics</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9056\">10.15479/AT:ISTA:9056</a>.","ama":"Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9056\">10.15479/AT:ISTA:9056</a>","ista":"Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria.","chicago":"Osang, Georg F. “Multi-Cover Persistence and Delaunay Mosaics.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9056\">https://doi.org/10.15479/AT:ISTA:9056</a>.","short":"G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021."},"page":"134","alternative_title":["ISTA Thesis"],"day":"01","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","supervisor":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"scopus_import":"1","has_accepted_license":"1","file":[{"file_id":"9417","relation":"main_file","file_name":"iclr2021_conference.pdf","creator":"bphuong","checksum":"f34ff17017527db5ba6927f817bdd125","file_size":502356,"content_type":"application/pdf","date_created":"2021-05-24T11:15:57Z","date_updated":"2021-05-24T11:15:57Z","access_level":"open_access"}],"conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2021-05-03","end_date":"2021-05-07","location":"Virtual"},"citation":{"ama":"Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: <i>9th International Conference on Learning Representations</i>. ; 2021.","ieee":"M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in <i>9th International Conference on Learning Representations</i>, Virtual, 2021.","apa":"Phuong, M., &#38; Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In <i>9th International Conference on Learning Representations</i>. Virtual.","mla":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” <i>9th International Conference on Learning Representations</i>, 2021.","ista":"Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","chicago":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In <i>9th International Conference on Learning Representations</i>, 2021.","short":"M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021."},"ddc":["000"],"status":"public","publication":"9th International Conference on Learning Representations","year":"2021","author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong","last_name":"Bui Thi Mai","first_name":"Phuong"},{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"date_updated":"2026-04-08T07:01:16Z","oa":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"status":"public","id":"9418","relation":"dissertation_contains"}]},"_id":"9416","date_published":"2021-05-01T00:00:00Z","abstract":[{"lang":"eng","text":"We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time  onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks."}],"month":"05","file_date_updated":"2021-05-24T11:15:57Z","type":"conference","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=krz7T0xU9Z_"}],"oa_version":"Published Version","date_created":"2021-05-24T11:16:46Z","title":"The inductive bias of ReLU networks on orthogonally separable data"},{"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"date_updated":"2026-04-15T06:43:02Z","year":"2021","author":[{"orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","full_name":"Peruzzo, Matilda","first_name":"Matilda","last_name":"Peruzzo"}],"citation":{"ista":"Peruzzo M. 2021. Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria.","chicago":"Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9920\">https://doi.org/10.15479/at:ista:9920</a>.","short":"M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics, Institute of Science and Technology Austria, 2021.","ama":"Peruzzo M. Geometric superinductors and their applications in circuit quantum electrodynamics. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9920\">10.15479/at:ista:9920</a>","ieee":"M. Peruzzo, “Geometric superinductors and their applications in circuit quantum electrodynamics,” Institute of Science and Technology Austria, 2021.","apa":"Peruzzo, M. (2021). <i>Geometric superinductors and their applications in circuit quantum electrodynamics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9920\">https://doi.org/10.15479/at:ista:9920</a>","mla":"Peruzzo, Matilda. <i>Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9920\">10.15479/at:ista:9920</a>."},"ddc":["539"],"page":"149","status":"public","has_accepted_license":"1","file":[{"creator":"mperuzzo","file_name":"GeometricSuperinductorsForCQED.zip","relation":"source_file","file_id":"9924","date_updated":"2021-09-06T08:39:47Z","access_level":"closed","date_created":"2021-08-16T09:33:21Z","content_type":"application/x-zip-compressed","file_size":151387283,"checksum":"3cd1986efde5121d7581f6fcf9090da8"},{"creator":"mperuzzo","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf","relation":"main_file","file_id":"9939","content_type":"application/pdf","file_size":17596344,"checksum":"50928c621cdf0775d7a5906b9dc8602c","date_updated":"2021-09-06T08:39:47Z","access_level":"open_access","date_created":"2021-08-18T14:20:06Z"},{"relation":"other","file_id":"9940","creator":"mperuzzo","file_name":"GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf","date_created":"2021-08-18T14:20:09Z","access_level":"closed","date_updated":"2021-09-06T08:39:47Z","description":"Extra copy of the thesis as PDF/A-2b","file_size":17592425,"content_type":"application/pdf","checksum":"37f486aa1b622fe44af00d627ec13f6c"}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"full_name":"Fink, Johannes M","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X"}],"OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"day":"19","oa":1,"date_published":"2021-08-19T00:00:00Z","keyword":["quantum computing","superinductor","quantum metrology"],"related_material":{"record":[{"status":"public","id":"9928","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"8755","status":"public"}]},"_id":"9920","publication_status":"published","language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2021-08-16T09:44:09Z","doi":"10.15479/at:ista:9920","oa_version":"Published Version","title":"Geometric superinductors and their applications in circuit quantum electrodynamics","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"degree_awarded":"PhD","corr_author":"1","publication_identifier":{"isbn":["978-3-99078-013-8"],"issn":["2663-337X"]},"abstract":[{"lang":"eng","text":"This work is concerned with two fascinating circuit quantum electrodynamics components, the Josephson junction and the geometric superinductor, and the interesting experiments that can be done by combining the two. The Josephson junction has revolutionized the field of superconducting circuits as a non-linear dissipation-less circuit element and is used in almost all superconducting qubit implementations since the 90s. On the other hand, the superinductor is a relatively new circuit element introduced as a key component of the fluxonium qubit in 2009. This is an inductor with characteristic impedance larger than the resistance quantum and self-resonance frequency in the GHz regime. The combination of these two elements can occur in two fundamental ways: in parallel and in series. When connected in parallel the two create the fluxonium qubit, a loop with large inductance and a rich energy spectrum reliant on quantum tunneling. On the other hand placing the two elements in series aids with the measurement of the IV curve of a single Josephson junction in a high impedance environment. In this limit theory predicts that the junction will behave as its dual element: the phase-slip junction. While the Josephson junction acts as a non-linear inductor the phase-slip junction has the behavior of a non-linear capacitance and can be used to measure new Josephson junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch oscillations. The latter experiment allows for a direct link between frequency and current which is an elusive connection in quantum metrology. This work introduces the geometric superinductor, a superconducting circuit element where the high inductance is due to the geometry rather than the material properties of the superconductor, realized from a highly miniaturized superconducting planar coil. These structures will be described and characterized as resonators and qubit inductors and progress towards the measurement of phase-locked Bloch oscillations will be presented."}],"type":"dissertation","file_date_updated":"2021-09-06T08:39:47Z","month":"08"}]