[{"date_created":"2022-01-25T15:44:54Z","year":"2021","quality_controlled":"1","oa":1,"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>","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>.","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147.","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>.","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."},"title":"Adversarial training is not ready for robot learning","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication_status":"published","_id":"10666","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"}],"status":"public","main_file_link":[{"url":"https://arxiv.org/abs/2103.08187","open_access":"1"}],"publication":"2021 IEEE International Conference on Robotics and Automation","OA_type":"green","article_processing_charge":"No","series_title":"ICRA","type":"conference","day":"01","page":"4140-4147","doi":"10.1109/ICRA48506.2021.9561036","publication_identifier":{"eissn":["2577-087X"],"isbn":["978-1-7281-9078-5"],"eisbn":["978-1-7281-9077-8"],"issn":["1050-4729"]},"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).","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","isi":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png"},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_published":"2021-06-01T00:00:00Z","ddc":["000"],"author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"OA_place":"repository","date_updated":"2026-04-07T14:21:58Z","project":[{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"}],"language":[{"iso":"eng"}],"conference":{"name":"ICRA: International Conference on Robotics and Automation","location":"Xi'an, China","start_date":"2021-05-30","end_date":"2021-06-05"},"external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"month":"06","scopus_import":"1","oa_version":"Preprint","has_accepted_license":"1"},{"OA_place":"publisher","degree_awarded":"PhD","date_updated":"2026-04-08T06:59:33Z","project":[{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"}],"date_published":"2021-01-25T00:00:00Z","alternative_title":["ISTA Thesis"],"ddc":["510"],"author":[{"first_name":"Giorgio","orcid":"0000-0002-4901-7992","last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio"}],"month":"01","oa_version":"Published Version","has_accepted_license":"1","language":[{"iso":"eng"}],"supervisor":[{"orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László"}],"publication_identifier":{"issn":["2663-337X"]},"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.","doi":"10.15479/AT:ISTA:9022","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"_id":"9022","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."}],"status":"public","publication_status":"published","file":[{"checksum":"5a93658a5f19478372523ee232887e2b","file_size":4127796,"access_level":"open_access","file_id":"9043","date_created":"2021-01-25T14:19:03Z","file_name":"thesis.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2021-01-25T14:19:03Z","creator":"gcipollo","success":1},{"date_created":"2021-01-25T14:19:10Z","file_name":"Thesis_files.zip","relation":"source_file","content_type":"application/zip","date_updated":"2021-01-25T14:19:10Z","creator":"gcipollo","checksum":"e8270eddfe6a988e92a53c88d1d19b8c","file_size":12775206,"access_level":"closed","file_id":"9044"}],"type":"dissertation","page":"380","day":"25","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","oa":1,"citation":{"short":"G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021.","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.","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>","ista":"Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria.","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>","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>."},"date_created":"2021-01-21T18:16:54Z","year":"2021","corr_author":"1","file_date_updated":"2021-01-25T14:19:10Z","title":"Fluctuations in the spectrum of random matrices","ec_funded":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"day":"07","type":"dissertation","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","status":"public","_id":"10422","abstract":[{"lang":"eng","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."}],"file":[{"date_updated":"2022-03-10T12:10:25Z","creator":"cchlebak","file_name":"Thesis.zip","date_created":"2021-12-07T11:13:52Z","relation":"source_file","content_type":"application/x-zip-compressed","access_level":"closed","file_id":"10424","file_size":394018,"checksum":"114e8f4b2c002c6c352416c12de2c695"},{"file_id":"10425","access_level":"closed","checksum":"cd15ae991ced352a9959815f794e657c","file_size":47638,"creator":"cchlebak","date_updated":"2022-03-10T12:10:25Z","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"Preliminary_pages_Piankov.docx","date_created":"2021-12-07T11:14:01Z"},{"file_id":"10426","access_level":"open_access","file_size":484965,"checksum":"e6899c798b75ba42fab9822bce309050","creator":"cchlebak","success":1,"date_updated":"2021-12-07T11:20:35Z","content_type":"application/pdf","relation":"main_file","date_created":"2021-12-07T11:20:35Z","file_name":"2021_Piankov_combined.pdf"}],"publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Towards designer materials using customizable particle shape","file_date_updated":"2022-03-10T12:10:25Z","citation":{"ista":"Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria.","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>","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>.","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.","short":"A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021."},"oa":1,"corr_author":"1","year":"2021","date_created":"2021-12-07T10:48:06Z","has_accepted_license":"1","oa_version":"Published Version","month":"12","language":[{"iso":"eng"}],"date_updated":"2026-04-08T06:58:55Z","degree_awarded":"MS","OA_place":"publisher","author":[{"full_name":"Piankov, Anton","id":"865E3C26-AA8C-11E9-A409-C4C4E5697425","last_name":"Piankov","first_name":"Anton"}],"ddc":["530"],"alternative_title":["ISTA Master's Thesis"],"date_published":"2021-12-07T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"CaGo"}],"publication_identifier":{"issn":["2791-4585"]},"supervisor":[{"full_name":"Goodrich, Carl Peter","last_name":"Goodrich","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter"}],"doi":"10.15479/at:ista:10422"},{"ddc":["515"],"alternative_title":["ISTA Thesis"],"date_published":"2021-09-22T00:00:00Z","author":[{"id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","full_name":"Portinale, Lorenzo","first_name":"Lorenzo"}],"project":[{"call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425","name":"Dissipation and dispersion in nonlinear partial differential equations","grant_number":"W1245"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504"}],"date_updated":"2026-04-08T07:00:04Z","OA_place":"publisher","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"language":[{"iso":"eng"}],"month":"09","has_accepted_license":"1","oa_version":"Published Version","doi":"10.15479/at:ista:10030","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"orcid":"0000-0002-0845-1338","first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"license":"https://creativecommons.org/licenses/by/4.0/","acknowledgement":"The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245.","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"file":[{"file_id":"10032","access_level":"closed","file_size":3876668,"checksum":"8cd60dcb8762e8f21867e21e8001e183","creator":"cchlebak","date_updated":"2022-03-10T12:14:42Z","content_type":"application/x-zip-compressed","relation":"source_file","file_name":"tex_and_pictures.zip","date_created":"2021-09-21T09:17:34Z"},{"checksum":"9789e9d967c853c1503ec7f307170279","file_size":2532673,"access_level":"open_access","file_id":"10047","date_created":"2021-09-27T11:14:31Z","file_name":"thesis_portinale_Final (1).pdf","content_type":"application/pdf","relation":"main_file","date_updated":"2021-09-27T11:14:31Z","creator":"cchlebak"}],"publication_status":"published","status":"public","_id":"10030","abstract":[{"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.","lang":"eng"}],"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","day":"22","year":"2021","date_created":"2021-09-21T09:14:15Z","corr_author":"1","oa":1,"citation":{"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>.","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.","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.","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.","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>","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>."},"title":"Discrete-to-continuum limits of transport problems and gradient flows in the space of measures","file_date_updated":"2022-03-10T12:14:42Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"status":"public","id":"9792","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10022"},{"status":"public","id":"7573","relation":"part_of_dissertation"}]}},{"department":[{"_id":"GradSch"},{"_id":"RoSe"},{"_id":"JaMa"}],"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png"},"doi":"10.15479/at:ista:9733","license":"https://creativecommons.org/licenses/by-nd/4.0/","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","last_name":"Seiringer"},{"orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","oa_version":"Published Version","month":"08","author":[{"orcid":"0000-0003-0754-8530","first_name":"Dario","last_name":"Feliciangeli","full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87"}],"ddc":["515","519","539"],"alternative_title":["ISTA Thesis"],"date_published":"2021-08-20T00:00:00Z","date_updated":"2026-04-08T06:59:50Z","project":[{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"grant_number":"694227","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"degree_awarded":"PhD","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"id":"9787","relation":"part_of_dissertation","status":"public"},{"id":"9792","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"9791","relation":"part_of_dissertation"},{"status":"public","id":"9781","relation":"part_of_dissertation"},{"status":"public","id":"9225","relation":"part_of_dissertation"}]},"ec_funded":1,"title":"The polaron at strong coupling","file_date_updated":"2022-03-10T12:13:57Z","corr_author":"1","year":"2021","date_created":"2021-07-27T15:48:30Z","citation":{"ista":"Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science and Technology Austria.","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>","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>.","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>","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>.","short":"D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.","ieee":"D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and Technology Austria, 2021."},"oa":1,"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","day":"20","page":"180","type":"dissertation","file":[{"date_updated":"2021-09-06T09:28:56Z","creator":"dfelicia","date_created":"2021-08-19T14:03:48Z","file_name":"Thesis_FeliciangeliA.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"9944","checksum":"e88bb8ca43948abe060eb2d2fa719881","file_size":1958710},{"creator":"dfelicia","date_updated":"2022-03-10T12:13:57Z","content_type":"application/octet-stream","relation":"source_file","date_created":"2021-08-19T14:06:35Z","file_name":"thesis.7z","file_id":"9945","access_level":"closed","checksum":"72810843abee83705853505b3f8348aa","file_size":3771669}],"publication_status":"published","status":"public","_id":"9733","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"}]},{"doi":"10.1007/s11005-020-01350-5","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged. Open Access funding provided by Institute of Science and Technology (IST Austria)","publication_identifier":{"eissn":["1573-0530"],"issn":["0377-9017"]},"article_number":"19","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"RoSe"}],"author":[{"orcid":"0000-0003-0754-8530","first_name":"Dario","last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","full_name":"Feliciangeli, Dario"},{"last_name":"Rademacher","id":"856966FE-A408-11E9-977E-802DE6697425","full_name":"Rademacher, Simone Anna Elvira","first_name":"Simone Anna Elvira","orcid":"0000-0001-5059-4466"},{"orcid":"0000-0002-6781-0521","first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"}],"ddc":["510"],"date_published":"2021-02-11T00:00:00Z","date_updated":"2026-04-08T06:59:49Z","project":[{"name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"external_id":{"isi":["000617195700001"]},"language":[{"iso":"eng"}],"has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","month":"02","article_type":"original","quality_controlled":"1","year":"2021","date_created":"2021-03-07T23:01:25Z","citation":{"apa":"Feliciangeli, D., Rademacher, S. A. E., &#38; Seiringer, R. (2021). Persistence of the spectral gap for the Landau–Pekar equations. <i>Letters in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11005-020-01350-5\">https://doi.org/10.1007/s11005-020-01350-5</a>","chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” <i>Letters in Mathematical Physics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11005-020-01350-5\">https://doi.org/10.1007/s11005-020-01350-5</a>.","ama":"Feliciangeli D, Rademacher SAE, Seiringer R. Persistence of the spectral gap for the Landau–Pekar equations. <i>Letters in Mathematical Physics</i>. 2021;111. doi:<a href=\"https://doi.org/10.1007/s11005-020-01350-5\">10.1007/s11005-020-01350-5</a>","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. 2021. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 111, 19.","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “Persistence of the spectral gap for the Landau–Pekar equations,” <i>Letters in Mathematical Physics</i>, vol. 111. Springer Nature, 2021.","mla":"Feliciangeli, Dario, et al. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” <i>Letters in Mathematical Physics</i>, vol. 111, 19, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s11005-020-01350-5\">10.1007/s11005-020-01350-5</a>.","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, Letters in Mathematical Physics 111 (2021)."},"oa":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"id":"9733","relation":"dissertation_contains","status":"public"}]},"ec_funded":1,"title":"Persistence of the spectral gap for the Landau–Pekar equations","file_date_updated":"2021-03-09T11:44:34Z","file":[{"file_id":"9232","access_level":"open_access","file_size":391205,"checksum":"ffbfe1aad623bce7ff529c207e343b53","creator":"dernst","success":1,"date_updated":"2021-03-09T11:44:34Z","content_type":"application/pdf","relation":"main_file","file_name":"2021_LettersMathPhysics_Feliciangeli.pdf","date_created":"2021-03-09T11:44:34Z"}],"publication_status":"published","status":"public","intvolume":"       111","_id":"9225","abstract":[{"text":"The Landau–Pekar equations describe the dynamics of a strongly coupled polaron.\r\nHere, we provide a class of initial data for which the associated effective Hamiltonian\r\nhas a uniform spectral gap for all times. For such initial data, this allows us to extend the\r\nresults on the adiabatic theorem for the Landau–Pekar equations and their derivation\r\nfrom the Fröhlich model obtained in previous works to larger times.","lang":"eng"}],"article_processing_charge":"Yes (via OA deal)","publisher":"Springer Nature","publication":"Letters in Mathematical Physics","day":"11","volume":111,"type":"journal_article"},{"acknowledgement":"This work started when A.G. was visiting the Erwin Schrödinger Institute and then continued when D.F. and L.P visited the Theoretical Chemistry Department of the Vrije Universiteit Amsterdam. The authors thanks the hospitality of both places and, especially, P. Gori-Giorgi and K. Giesbertz for fruitful discussions and literature suggestions in the early state of the project. Finally, the authors also thanks J. Maas and R. Seiringer for their feedback and useful comments to a first draft of the article.  L.P. acknowledges support by the Austrian Science Fund (FWF), grants No W1245 and NoF65. D.F acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 716117 and No 694227). A.G. acknowledges funding by the European Research Council under H2020/MSCA-IF “OTmeetsDFT” [grant ID: 795942].","doi":"10.48550/arXiv.2106.11217","department":[{"_id":"RoSe"},{"_id":"JaMa"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"article_number":"2106.11217","date_updated":"2026-04-08T07:00:03Z","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"},{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"date_published":"2021-07-21T00:00:00Z","ddc":["510"],"author":[{"last_name":"Feliciangeli","full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","first_name":"Dario","orcid":"0000-0003-0754-8530"},{"full_name":"Gerolin, Augusto","last_name":"Gerolin","first_name":"Augusto"},{"full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","first_name":"Lorenzo"}],"month":"07","oa_version":"Preprint","has_accepted_license":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2106.11217"]},"oa":1,"citation":{"mla":"Feliciangeli, Dario, et al. “A Non-Commutative Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.” <i>ArXiv</i>, 2106.11217, doi:<a href=\"https://doi.org/10.48550/arXiv.2106.11217\">10.48550/arXiv.2106.11217</a>.","ieee":"D. Feliciangeli, A. Gerolin, and L. Portinale, “A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature,” <i>arXiv</i>. .","short":"D. Feliciangeli, A. Gerolin, L. Portinale, ArXiv (n.d.).","chicago":"Feliciangeli, Dario, Augusto Gerolin, and Lorenzo Portinale. “A Non-Commutative Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2106.11217\">https://doi.org/10.48550/arXiv.2106.11217</a>.","apa":"Feliciangeli, D., Gerolin, A., &#38; Portinale, L. (n.d.). A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2106.11217\">https://doi.org/10.48550/arXiv.2106.11217</a>","ista":"Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. arXiv, 2106.11217.","ama":"Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2106.11217\">10.48550/arXiv.2106.11217</a>"},"date_created":"2021-08-06T09:07:12Z","year":"2021","ec_funded":1,"title":"A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature","related_material":{"record":[{"id":"12911","relation":"later_version","status":"public"},{"id":"9733","relation":"dissertation_contains","status":"public"},{"relation":"dissertation_contains","id":"10030","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9792","abstract":[{"lang":"eng","text":"This paper establishes new connections between many-body quantum systems, One-body Reduced Density Matrices Functional Theory (1RDMFT) and Optimal Transport (OT), by interpreting the problem of computing the ground-state energy of a finite dimensional composite quantum system at positive temperature as a non-commutative entropy regularized Optimal Transport problem. We develop a new approach to fully characterize the dual-primal solutions in such non-commutative setting. The mathematical formalism is particularly relevant in quantum chemistry: numerical realizations of the many-electron ground state energy can be computed via a non-commutative version of Sinkhorn algorithm. Our approach allows to prove convergence and robustness of this algorithm, which, to our best knowledge, were unknown even in the two marginal case. Our methods are based on careful a priori estimates in the dual problem, which we believe to be of independent interest. Finally, the above results are extended in 1RDMFT setting, where bosonic or fermionic symmetry conditions are enforced on the problem."}],"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2106.11217"}],"arxiv":1,"publication_status":"draft","type":"preprint","day":"21","publication":"arXiv","article_processing_charge":"No"},{"main_file_link":[{"url":"https://arxiv.org/abs/2101.12566","open_access":"1"}],"abstract":[{"text":"We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging.","lang":"eng"}],"_id":"9787","status":"public","publication_status":"draft","arxiv":1,"day":"01","type":"preprint","article_processing_charge":"No","publication":"arXiv","citation":{"chicago":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2101.12566\">https://doi.org/10.48550/arXiv.2101.12566</a>.","apa":"Feliciangeli, D., &#38; Seiringer, R. (n.d.). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2101.12566\">https://doi.org/10.48550/arXiv.2101.12566</a>","ista":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv, 2101.12566.","ama":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2101.12566\">10.48550/arXiv.2101.12566</a>","short":"D. Feliciangeli, R. Seiringer, ArXiv (n.d.).","mla":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>ArXiv</i>, 2101.12566, doi:<a href=\"https://doi.org/10.48550/arXiv.2101.12566\">10.48550/arXiv.2101.12566</a>.","ieee":"D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” <i>arXiv</i>. ."},"oa":1,"corr_author":"1","date_created":"2021-08-06T08:25:57Z","year":"2021","related_material":{"record":[{"id":"10224","relation":"later_version","status":"public"},{"status":"public","id":"9733","relation":"dissertation_contains"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics","ec_funded":1,"project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"date_updated":"2026-04-08T06:59:49Z","author":[{"last_name":"Feliciangeli","full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530","first_name":"Dario"},{"orcid":"0000-0002-6781-0521","first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"}],"date_published":"2021-02-01T00:00:00Z","ddc":["510"],"oa_version":"Preprint","has_accepted_license":"1","month":"02","external_id":{"arxiv":["2101.12566"]},"language":[{"iso":"eng"}],"acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged. We would also like to thank Rupert Frank for many helpful discussions, especially related to the Gross coordinate transformation defined in Def. 4.1.\r\n","doi":"10.48550/arXiv.2101.12566","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"RoSe"}],"article_number":"2101.12566"},{"language":[{"iso":"eng"}],"external_id":{"arxiv":["2107.03720"]},"month":"07","oa_version":"Preprint","date_published":"2021-07-08T00:00:00Z","ddc":["510"],"author":[{"last_name":"Feliciangeli","full_name":"Feliciangeli, Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530","first_name":"Dario"},{"first_name":"Simone Anna Elvira","orcid":"0000-0001-5059-4466","full_name":"Rademacher, Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"OA_place":"repository","date_updated":"2026-04-08T06:59:49Z","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"article_number":"2107.03720 ","department":[{"_id":"RoSe"}],"doi":"10.48550/arXiv.2107.03720","acknowledgement":"We thank Herbert Spohn for helpful comments. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No. 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged..","publication":"arXiv","article_processing_charge":"No","type":"preprint","day":"08","arxiv":1,"publication_status":"draft","abstract":[{"text":"We provide a definition of the effective mass for the classical polaron described by the Landau-Pekar equations. It is based on a novel variational principle, minimizing the energy functional over states with given (initial) velocity. The resulting formula for the polaron's effective mass agrees with the prediction by Landau and Pekar.","lang":"eng"}],"_id":"9791","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/2107.03720","open_access":"1"}],"ec_funded":1,"title":"The effective mass problem for the Landau-Pekar equations","related_material":{"record":[{"relation":"later_version","id":"10755","status":"public"},{"relation":"dissertation_contains","id":"9733","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2021-08-06T08:49:45Z","year":"2021","corr_author":"1","oa":1,"citation":{"ama":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03720\">10.48550/arXiv.2107.03720</a>","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv, 2107.03720.","apa":"Feliciangeli, D., Rademacher, S. A. E., &#38; Seiringer, R. (n.d.). The effective mass problem for the Landau-Pekar equations. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2107.03720\">https://doi.org/10.48550/arXiv.2107.03720</a>","chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “The Effective Mass Problem for the Landau-Pekar Equations.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2107.03720\">https://doi.org/10.48550/arXiv.2107.03720</a>.","mla":"Feliciangeli, Dario, et al. “The Effective Mass Problem for the Landau-Pekar Equations.” <i>ArXiv</i>, 2107.03720, doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03720\">10.48550/arXiv.2107.03720</a>.","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “The effective mass problem for the Landau-Pekar equations,” <i>arXiv</i>. .","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.)."}},{"doi":"10.1007/978-3-030-81685-8_16","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-030-81685-8"],"isbn":["978-3-030-81684-1"],"eissn":["1611-3349"]},"acknowledgement":"The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) through project ICT15-003.","department":[{"_id":"KrCh"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"isi":1,"date_published":"2021-07-15T00:00:00Z","alternative_title":["LNCS"],"ddc":["000"],"author":[{"last_name":"Agarwal","full_name":"Agarwal, Pratyush","first_name":"Pratyush"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Pathak, Shreya","last_name":"Pathak","first_name":"Shreya"},{"orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"},{"last_name":"Toman","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X","first_name":"Viktor"}],"date_updated":"2026-04-08T07:00:30Z","project":[{"_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","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2021-07-23","start_date":"2021-07-20","location":"Virtual","name":"CAV: Computer Aided Verification "},"external_id":{"isi":["000698732400016"],"arxiv":["2105.06424"]},"month":"07","oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","date_created":"2021-09-05T22:01:24Z","year":"2021","quality_controlled":"1","corr_author":"1","oa":1,"citation":{"ieee":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in <i>33rd International Conference on Computer-Aided Verification </i>, Virtual, 2021, vol. 12759, pp. 341–366.","short":"P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.","mla":"Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” <i>33rd International Conference on Computer-Aided Verification </i>, vol. 12759, Springer Nature, 2021, pp. 341–66, doi:<a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">10.1007/978-3-030-81685-8_16</a>.","ista":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless model checking under a reads-value-from equivalence. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366.","ama":"Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: <i>33rd International Conference on Computer-Aided Verification </i>. Vol 12759. Springer Nature; 2021:341-366. doi:<a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">10.1007/978-3-030-81685-8_16</a>","chicago":"Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In <i>33rd International Conference on Computer-Aided Verification </i>, 12759:341–66. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">https://doi.org/10.1007/978-3-030-81685-8_16</a>.","apa":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., &#38; Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In <i>33rd International Conference on Computer-Aided Verification </i> (Vol. 12759, pp. 341–366). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-81685-8_16\">https://doi.org/10.1007/978-3-030-81685-8_16</a>"},"file_date_updated":"2022-05-13T07:00:20Z","title":"Stateless model checking under a reads-value-from equivalence","ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"10199","status":"public"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","arxiv":1,"publication_status":"published","file":[{"access_level":"open_access","file_id":"11368","file_size":1516756,"checksum":"4b346e5fbaa8b9bdf107819c7b2aadee","date_updated":"2022-05-13T07:00:20Z","success":1,"creator":"dernst","date_created":"2022-05-13T07:00:20Z","file_name":"2021_LNCS_Agarwal.pdf","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"text":"Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a) the coarseness of the partitioning, and (b) the time to generate representatives in each class. For this reason, the search for coarse partitionings that are efficiently explorable is an active research challenge. In this work we present   RVF-SMC , a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are deemed equivalent if they agree on the value obtained in each read event, and read events induce consistent causal orderings between them. The RVF partitioning is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover,   RVF-SMC  generates representatives very efficiently, as the reduction in the partitioning is often met with significant speed-ups in the model checking task.","lang":"eng"}],"_id":"9987","status":"public","publication":"33rd International Conference on Computer-Aided Verification ","publisher":"Springer Nature","article_processing_charge":"Yes","type":"conference","volume":"12759 ","day":"15","page":"341-366"},{"date_published":"2021-10-31T00:00:00Z","alternative_title":["ISTA Thesis"],"ddc":["000"],"author":[{"first_name":"Viktor","orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman"}],"degree_awarded":"PhD","OA_place":"publisher","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"date_updated":"2026-04-08T07:00:31Z","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"month":"10","oa_version":"Published Version","has_accepted_license":"1","doi":"10.15479/at:ista:10199","supervisor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"}],"publication_identifier":{"issn":["2663-337X"]},"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publication_status":"published","file":[{"access_level":"open_access","file_id":"10225","checksum":"4f412a1ee60952221b499a4b1268df35","file_size":2915234,"date_updated":"2021-11-08T14:12:22Z","creator":"vtoman","date_created":"2021-11-08T14:12:22Z","file_name":"toman_th_final.pdf","relation":"main_file","content_type":"application/pdf"},{"creator":"vtoman","date_updated":"2021-11-09T09:00:50Z","content_type":"application/zip","relation":"source_file","date_created":"2021-11-08T14:12:46Z","file_name":"toman_thesis.zip","file_id":"10226","access_level":"closed","file_size":8616056,"checksum":"9584943f99127be2dd2963f6784c37d4"}],"_id":"10199","abstract":[{"lang":"eng","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."}],"status":"public","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","page":"166","day":"31","keyword":["concurrency","verification","model checking"],"date_created":"2021-10-29T20:09:01Z","year":"2021","corr_author":"1","oa":1,"citation":{"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>.","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","short":"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>.","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>","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","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>"},"file_date_updated":"2021-11-09T09:00:50Z","ec_funded":1,"title":"Improved verification techniques for concurrent systems","related_material":{"record":[{"status":"public","id":"9987","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10191"},{"status":"public","id":"141","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10190"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"article_number":"164","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"doi":"10.1145/3485541","publication_identifier":{"eissn":["2475-1421"]},"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.","language":[{"iso":"eng"}],"external_id":{"arxiv":["2011.11763"]},"month":"10","scopus_import":"1","oa_version":"Published Version","has_accepted_license":"1","date_published":"2021-10-15T00:00:00Z","ddc":["000"],"author":[{"first_name":"Truc Lam","full_name":"Bui, Truc Lam","last_name":"Bui"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Tushar","last_name":"Gautam","full_name":"Gautam, Tushar"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas"},{"full_name":"Toman, Viktor","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman","orcid":"0000-0001-9036-063X","first_name":"Viktor"}],"project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"date_updated":"2026-04-08T07:00:31Z","file_date_updated":"2021-11-04T07:24:48Z","title":"The reads-from equivalence for the TSO and PSO memory models","ec_funded":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10199"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2021-10-27T15:05:34Z","year":"2021","quality_controlled":"1","article_type":"original","oa":1,"citation":{"short":"T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).","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.","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>.","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>","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>.","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>","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."},"issue":"OOPSLA","publication":"Proceedings of the ACM on Programming Languages","publisher":"Association for Computing Machinery","article_processing_charge":"No","type":"journal_article","volume":5,"day":"15","keyword":["safety","risk","reliability and quality","software"],"arxiv":1,"publication_status":"published","file":[{"date_updated":"2021-11-04T07:24:48Z","creator":"cchlebak","success":1,"date_created":"2021-11-04T07:24:48Z","file_name":"2021_ProcACMPL_Bui.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"10215","checksum":"9d6dce7b611853c529bb7b1915ac579e","file_size":2903485}],"_id":"10191","intvolume":"         5","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"}],"status":"public"},{"language":[{"iso":"eng"}],"month":"09","has_accepted_license":"1","oa_version":"Published Version","alternative_title":["ISTA Thesis"],"ddc":["515"],"date_published":"2021-09-14T00:00:00Z","author":[{"full_name":"Hensel, Sebastian","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel","first_name":"Sebastian","orcid":"0000-0001-7252-8072"}],"project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"grant_number":"948819","call_identifier":"H2020","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","name":"Bridging Scales in Random Materials"}],"date_updated":"2026-04-08T07:01:01Z","degree_awarded":"PhD","OA_place":"publisher","department":[{"_id":"GradSch"},{"_id":"JuFi"}],"doi":"10.15479/at:ista:10007","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"first_name":"Julian L","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Fischer, Julian L","last_name":"Fischer"}],"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","type":"dissertation","page":"300","day":"14","file":[{"checksum":"c8475faaf0b680b4971f638f1db16347","file_size":15022154,"access_level":"closed","file_id":"10008","file_name":"thesis_final_Hensel.zip","date_created":"2021-09-13T11:03:24Z","relation":"source_file","content_type":"application/x-zip-compressed","date_updated":"2021-09-15T14:37:30Z","creator":"shensel"},{"access_level":"open_access","file_id":"10014","file_size":6583638,"checksum":"1a609937aa5275452822f45f2da17f07","date_updated":"2021-09-14T09:52:47Z","creator":"shensel","date_created":"2021-09-13T14:18:56Z","file_name":"thesis_final_Hensel.pdf","content_type":"application/pdf","relation":"main_file"}],"publication_status":"published","status":"public","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."}],"_id":"10007","title":"Curvature driven interface evolution: Uniqueness properties of weak solution concepts","ec_funded":1,"file_date_updated":"2021-09-15T14:37:30Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10012"},{"status":"public","relation":"part_of_dissertation","id":"10013"},{"status":"public","relation":"part_of_dissertation","id":"7489"}]},"year":"2021","date_created":"2021-09-13T11:12:34Z","corr_author":"1","oa":1,"citation":{"short":"S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.","ieee":"S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.","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>.","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>.","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>","ista":"Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.","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>"}},{"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"}],"_id":"10429","status":"public","publication_status":"published","file":[{"date_updated":"2021-12-09T17:47:49Z","success":1,"creator":"gnadirad","date_created":"2021-12-09T17:47:49Z","file_name":"Thesis_Final_09_12_2021.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"10436","file_size":2370859,"checksum":"6bf14e9a523387328f016c0689f5e10e"},{"checksum":"914d6c5ca86bd0add471971a8f4c4341","file_size":2596924,"file_id":"10437","access_level":"closed","relation":"source_file","content_type":"application/zip","date_created":"2021-12-09T17:47:49Z","file_name":"Thesis_Final_09_12_2021.zip","creator":"gnadirad","date_updated":"2022-03-28T12:55:12Z"}],"type":"dissertation","day":"09","page":"132","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","oa":1,"citation":{"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>.","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>","ista":"Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria.","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.","short":"G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.","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>."},"date_created":"2021-12-08T21:52:28Z","year":"2021","corr_author":"1","file_date_updated":"2022-03-28T12:55:12Z","ec_funded":1,"title":"On achieving scalability through relaxation","related_material":{"record":[{"status":"public","id":"10435","relation":"part_of_dissertation"},{"status":"public","id":"10432","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"6673","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"5965"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","degree_awarded":"PhD","project":[{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223"}],"date_updated":"2026-04-08T07:00:46Z","date_published":"2021-12-09T00:00:00Z","ddc":["000"],"alternative_title":["ISTA Thesis"],"author":[{"last_name":"Nadiradze","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","first_name":"Giorgi"}],"month":"12","oa_version":"Published Version","has_accepted_license":"1","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/at:ista:10429","department":[{"_id":"GradSch"},{"_id":"DaAl"}]},{"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10429"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Asynchronous decentralized SGD with quantized and local updates","ec_funded":1,"citation":{"mla":"Nadiradze, Giorgi, et al. “Asynchronous Decentralized SGD with Quantized and Local Updates.” <i>35th Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2021.","ieee":"G. Nadiradze, A. Sabour, P. Davies, S. Li, and D.-A. Alistarh, “Asynchronous decentralized SGD with quantized and local updates,” in <i>35th Conference on Neural Information Processing Systems</i>, Sydney, Australia, 2021.","short":"G. Nadiradze, A. Sabour, P. Davies, S. Li, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","apa":"Nadiradze, G., Sabour, A., Davies, P., Li, S., &#38; Alistarh, D.-A. (2021). Asynchronous decentralized SGD with quantized and local updates. In <i>35th Conference on Neural Information Processing Systems</i>. Sydney, Australia: Neural Information Processing Systems Foundation.","chicago":"Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian Alistarh. “Asynchronous Decentralized SGD with Quantized and Local Updates.” In <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation, 2021.","ama":"Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. Asynchronous decentralized SGD with quantized and local updates. In: <i>35th Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2021.","ista":"Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. 2021. Asynchronous decentralized SGD with quantized and local updates. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems."},"oa":1,"quality_controlled":"1","date_created":"2021-12-09T10:59:12Z","year":"2021","day":"01","type":"conference","article_processing_charge":"No","publication":"35th Conference on Neural Information Processing Systems","publisher":"Neural Information Processing Systems Foundation","main_file_link":[{"url":"https://papers.nips.cc/paper/2021/hash/362c99307cdc3f2d8b410652386a9dd1-Abstract.html","open_access":"1"}],"abstract":[{"text":"Decentralized optimization is emerging as a viable alternative for scalable distributed machine learning, but also introduces new challenges in terms of synchronization costs. To this end, several communication-reduction techniques, such as non-blocking communication, quantization, and local steps, have been explored in the decentralized setting. Due to the complexity of analyzing optimization in such a relaxed setting, this line of work often assumes \\emph{global} communication rounds, which require additional synchronization. In this paper, we consider decentralized optimization in the simpler, but harder to analyze, \\emph{asynchronous gossip} model, in which communication occurs in discrete, randomly chosen pairings among nodes. Perhaps surprisingly, we show that a variant of SGD called \\emph{SwarmSGD} still converges in this setting, even if \\emph{non-blocking communication}, \\emph{quantization}, and \\emph{local steps} are all applied \\emph{in conjunction}, and even if the node data distributions and underlying graph topology are both \\emph{heterogenous}. Our analysis is based on a new connection with multi-dimensional load-balancing processes. We implement this algorithm and deploy it in a super-computing environment, showing that it can outperform previous decentralized methods in terms of end-to-end training time, and that it can even rival carefully-tuned large-batch SGD for certain tasks.","lang":"eng"}],"_id":"10435","status":"public","publication_status":"published","arxiv":1,"department":[{"_id":"DaAl"}],"acknowledgement":"We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). PD partly conducted this work while at IST Austria and was supported by the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie grant agreement No. 754411. SL was funded in part by European Research Council (ERC) under the European Union’s Horizon 2020 programme (grant agreement DAPP, No. 678880, and EPiGRAM-HS, No. 801039).\r\n","oa_version":"Published Version","month":"12","external_id":{"arxiv":["1910.12308"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2021-12-14","start_date":"2021-12-06","location":"Sydney, Australia","name":"NeurIPS: Neural Information Processing Systems"},"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"date_updated":"2026-04-08T07:00:45Z","author":[{"orcid":"0000-0001-5634-0731","first_name":"Giorgi","last_name":"Nadiradze","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi"},{"full_name":"Sabour, Amirmojtaba","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","last_name":"Sabour","first_name":"Amirmojtaba"},{"full_name":"Davies, Peter","id":"11396234-BB50-11E9-B24C-90FCE5697425","last_name":"Davies","orcid":"0000-0002-5646-9524","first_name":"Peter"},{"first_name":"Shigang","last_name":"Li","full_name":"Li, Shigang"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2021-12-01T00:00:00Z"},{"department":[{"_id":"DaAl"}],"acknowledgement":"We would like to thank Christopher De Sa for his feedback on an earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful comments. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus).","conference":{"start_date":"2021-02-02","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","location":"Virtual"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2001.05918"]},"month":"05","oa_version":"Published Version","date_published":"2021-05-18T00:00:00Z","author":[{"id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731","first_name":"Giorgi"},{"first_name":"Ilia","last_name":"Markov","full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"first_name":"Bapi","orcid":"0000-0002-2742-4028","full_name":"Chatterjee, Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Kungurtsev","full_name":"Kungurtsev, Vyacheslav ","first_name":"Vyacheslav "},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"date_updated":"2026-04-08T07:00:45Z","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"}],"ec_funded":1,"title":"Elastic consistency: A practical consistency model for distributed stochastic gradient descent","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10429"}]},"year":"2021","date_created":"2021-12-09T09:21:35Z","quality_controlled":"1","oa":1,"citation":{"chicago":"Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav  Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:9037–45, 2021.","apa":"Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., &#38; Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 9037–9045). Virtual.","ista":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.","ama":"Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. ; 2021:9037-9045.","ieee":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.","short":"G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.","mla":"Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 10, 2021, pp. 9037–45."},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","issue":"10","article_processing_charge":"No","type":"conference","page":"9037-9045","day":"18","volume":35,"arxiv":1,"publication_status":"published","status":"public","intvolume":"        35","_id":"10432","abstract":[{"lang":"eng","text":"One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization, but most methods involve some type of consistency relaxation relative to sequential SGD, to mitigate its large communication or synchronization costs at scale. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. As a direct application, we propose and analyze a new synchronization-avoiding scheduling scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification."}],"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/17092"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"13043","relation":"later_version"},{"id":"10007","relation":"dissertation_contains","status":"public"}]},"title":"Weak-strong uniqueness for the mean curvature flow of double bubbles","ec_funded":1,"corr_author":"1","year":"2021","date_created":"2021-09-13T12:17:11Z","citation":{"ieee":"S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow of double bubbles,” <i>arXiv</i>. .","mla":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” <i>ArXiv</i>, 2108.01733, doi:<a href=\"https://doi.org/10.48550/arXiv.2108.01733\">10.48550/arXiv.2108.01733</a>.","short":"S. Hensel, T. Laux, ArXiv (n.d.).","ista":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv, 2108.01733.","ama":"Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2108.01733\">10.48550/arXiv.2108.01733</a>","chicago":"Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2108.01733\">https://doi.org/10.48550/arXiv.2108.01733</a>.","apa":"Hensel, S., &#38; Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature flow of double bubbles. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2108.01733\">https://doi.org/10.48550/arXiv.2108.01733</a>"},"oa":1,"article_processing_charge":"No","publication":"arXiv","day":"03","type":"preprint","publication_status":"draft","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2108.01733","open_access":"1"}],"status":"public","abstract":[{"lang":"eng","text":"We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions."}],"_id":"10013","article_number":"2108.01733","department":[{"_id":"JuFi"}],"doi":"10.48550/arXiv.2108.01733","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 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","external_id":{"arxiv":["2108.01733"]},"language":[{"iso":"eng"}],"oa_version":"Preprint","month":"08","author":[{"id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel","full_name":"Hensel, Sebastian","first_name":"Sebastian","orcid":"0000-0001-7252-8072"},{"last_name":"Laux","full_name":"Laux, Tim","first_name":"Tim"}],"date_published":"2021-08-03T00:00:00Z","project":[{"grant_number":"948819","call_identifier":"H2020","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","name":"Bridging Scales in Random Materials"}],"date_updated":"2026-04-08T07:01:01Z"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"status":"deleted","relation":"part_of_dissertation","id":"7435"},{"status":"public","id":"7481","relation":"part_of_dissertation"},{"id":"9416","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"7479"}]},"title":"Underspecification in deep learning","file_date_updated":"2021-05-24T11:56:02Z","citation":{"ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021.","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","mla":"Phuong, Mary. <i>Underspecification in Deep Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9418\">10.15479/AT:ISTA:9418</a>.","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>.","apa":"Phuong, M. (2021). <i>Underspecification in deep learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9418\">https://doi.org/10.15479/AT:ISTA:9418</a>","ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","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>"},"oa":1,"corr_author":"1","year":"2021","date_created":"2021-05-24T13:06:23Z","page":"125","day":"30","type":"dissertation","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","status":"public","abstract":[{"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.","lang":"eng"}],"_id":"9418","file":[{"access_level":"open_access","file_id":"9419","checksum":"4f0abe64114cfed264f9d36e8d1197e3","file_size":2673905,"date_updated":"2021-05-24T11:22:29Z","success":1,"creator":"bphuong","file_name":"mph-thesis-v519-pdfimages.pdf","date_created":"2021-05-24T11:22:29Z","relation":"main_file","content_type":"application/pdf"},{"file_size":92995100,"checksum":"f5699e876bc770a9b0df8345a77720a2","file_id":"9420","access_level":"closed","content_type":"application/zip","relation":"source_file","file_name":"thesis.zip","date_created":"2021-05-24T11:56:02Z","creator":"bphuong","date_updated":"2021-05-24T11:56:02Z"}],"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","first_name":"Christoph"}],"doi":"10.15479/AT:ISTA:9418","has_accepted_license":"1","oa_version":"Published Version","month":"05","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"language":[{"iso":"eng"}],"date_updated":"2026-04-08T07:01:17Z","OA_place":"publisher","degree_awarded":"PhD","author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong","last_name":"Bui Thi Mai","first_name":"Phuong"}],"alternative_title":["ISTA Thesis"],"ddc":["000"],"date_published":"2021-05-30T00:00:00Z"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"department":[{"_id":"HeEd"},{"_id":"GradSch"}],"doi":"10.15479/AT:ISTA:9056","supervisor":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"oa_version":"Published Version","has_accepted_license":"1","month":"02","place":"Klosterneuburg","author":[{"first_name":"Georg F","orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang"}],"date_published":"2021-02-01T00:00:00Z","ddc":["006","514","516"],"alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","OA_place":"publisher","date_updated":"2026-04-08T07:01:30Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"187","status":"public"},{"relation":"part_of_dissertation","id":"8703","status":"public"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file_date_updated":"2021-02-03T10:37:28Z","title":"Multi-cover persistence and Delaunay mosaics","corr_author":"1","date_created":"2021-02-02T14:11:06Z","year":"2021","citation":{"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>.","ieee":"G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021.","short":"G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021.","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>.","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>","ista":"Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria.","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>"},"oa":1,"article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","page":"134","day":"01","type":"dissertation","publication_status":"published","file":[{"file_size":13446994,"checksum":"bcf27986147cab0533b6abadd74e7629","access_level":"closed","file_id":"9063","file_name":"thesis_source.zip","date_created":"2021-02-02T14:09:25Z","content_type":"application/zip","relation":"source_file","date_updated":"2021-02-03T10:37:28Z","creator":"patrickd"},{"date_updated":"2021-02-02T14:09:18Z","creator":"patrickd","success":1,"file_name":"thesis_pdfA2b.pdf","date_created":"2021-02-02T14:09:18Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"9064","checksum":"9cc8af266579a464385bbe2aff6af606","file_size":5210329}],"abstract":[{"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.","lang":"eng"}],"_id":"9056","status":"public"},{"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"date_updated":"2026-04-08T07:01:16Z","ddc":["000"],"date_published":"2021-05-01T00:00:00Z","author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong","last_name":"Bui Thi Mai","first_name":"Phuong"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert"}],"month":"05","has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","conference":{"name":"ICLR: International Conference on Learning Representations","location":"Virtual","start_date":"2021-05-03","end_date":"2021-05-07"},"language":[{"iso":"eng"}],"oa":1,"citation":{"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.","short":"M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021.","mla":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” <i>9th International Conference on Learning Representations</i>, 2021.","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.","ista":"Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","apa":"Phuong, M., &#38; Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In <i>9th International Conference on Learning Representations</i>. Virtual.","chicago":"Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In <i>9th International Conference on Learning Representations</i>, 2021."},"year":"2021","date_created":"2021-05-24T11:16:46Z","quality_controlled":"1","corr_author":"1","title":"The inductive bias of ReLU networks on orthogonally separable data","file_date_updated":"2021-05-24T11:15:57Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","id":"9418","status":"public"}]},"status":"public","_id":"9416","abstract":[{"text":"We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time  onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks.","lang":"eng"}],"main_file_link":[{"url":"https://openreview.net/pdf?id=krz7T0xU9Z_","open_access":"1"}],"file":[{"file_id":"9417","access_level":"open_access","checksum":"f34ff17017527db5ba6927f817bdd125","file_size":502356,"creator":"bphuong","date_updated":"2021-05-24T11:15:57Z","relation":"main_file","content_type":"application/pdf","file_name":"iclr2021_conference.pdf","date_created":"2021-05-24T11:15:57Z"}],"publication_status":"published","type":"conference","day":"01","publication":"9th International Conference on Learning Representations","article_processing_charge":"No"}]