--- OA_place: publisher _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." 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. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Giorgio full_name: Cipolloni, Giorgio id: 42198EFA-F248-11E8-B48F-1D18A9856A87 last_name: Cipolloni orcid: 0000-0002-4901-7992 citation: ama: Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:10.15479/AT:ISTA:9022 apa: Cipolloni, G. (2021). Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9022 chicago: Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9022. ieee: G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute of Science and Technology Austria, 2021. ista: Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria. mla: Cipolloni, Giorgio. Fluctuations in the Spectrum of Random Matrices. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9022. short: G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-01-21T18:16:54Z date_published: 2021-01-25T00:00:00Z date_updated: 2026-04-08T06:59:33Z day: '25' ddc: - '510' degree_awarded: PhD department: - _id: GradSch - _id: LaEr doi: 10.15479/AT:ISTA:9022 ec_funded: 1 file: - access_level: open_access checksum: 5a93658a5f19478372523ee232887e2b content_type: application/pdf creator: gcipollo date_created: 2021-01-25T14:19:03Z date_updated: 2021-01-25T14:19:03Z file_id: '9043' file_name: thesis.pdf file_size: 4127796 relation: main_file success: 1 - access_level: closed checksum: e8270eddfe6a988e92a53c88d1d19b8c content_type: application/zip creator: gcipollo date_created: 2021-01-25T14:19:10Z date_updated: 2021-01-25T14:19:10Z file_id: '9044' file_name: Thesis_files.zip file_size: 12775206 relation: source_file file_date_updated: 2021-01-25T14:19:10Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '380' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 title: Fluctuations in the spectrum of random matrices type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- OA_place: publisher _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. alternative_title: - ISTA Master's Thesis article_processing_charge: No author: - first_name: Anton full_name: Piankov, Anton id: 865E3C26-AA8C-11E9-A409-C4C4E5697425 last_name: Piankov citation: ama: Piankov A. Towards designer materials using customizable particle shape. 2021. doi:10.15479/at:ista:10422 apa: Piankov, A. (2021). Towards designer materials using customizable particle shape. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10422 chicago: Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10422. ieee: A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021. ista: Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria. mla: Piankov, Anton. Towards Designer Materials Using Customizable Particle Shape. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10422. short: A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-12-07T10:48:06Z date_published: 2021-12-07T00:00:00Z date_updated: 2026-04-08T06:58:55Z day: '07' ddc: - '530' degree_awarded: MS department: - _id: GradSch - _id: CaGo doi: 10.15479/at:ista:10422 file: - access_level: closed checksum: 114e8f4b2c002c6c352416c12de2c695 content_type: application/x-zip-compressed creator: cchlebak date_created: 2021-12-07T11:13:52Z date_updated: 2022-03-10T12:10:25Z file_id: '10424' file_name: Thesis.zip file_size: 394018 relation: source_file - access_level: closed checksum: cd15ae991ced352a9959815f794e657c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cchlebak date_created: 2021-12-07T11:14:01Z date_updated: 2022-03-10T12:10:25Z file_id: '10425' file_name: Preliminary_pages_Piankov.docx file_size: 47638 relation: source_file - access_level: open_access checksum: e6899c798b75ba42fab9822bce309050 content_type: application/pdf creator: cchlebak date_created: 2021-12-07T11:20:35Z date_updated: 2021-12-07T11:20:35Z file_id: '10426' file_name: 2021_Piankov_combined.pdf file_size: 484965 relation: main_file success: 1 file_date_updated: 2022-03-10T12:10:25Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Carl Peter full_name: Goodrich, Carl Peter id: EB352CD2-F68A-11E9-89C5-A432E6697425 last_name: Goodrich orcid: 0000-0002-1307-5074 title: Towards designer materials using customizable particle shape type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- OA_place: publisher _id: '10030' abstract: - lang: eng text: "This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces." acknowledged_ssus: - _id: M-Shop - _id: NanoFab acknowledgement: The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Lorenzo full_name: Portinale, Lorenzo id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87 last_name: Portinale citation: ama: Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:10.15479/at:ista:10030 apa: Portinale, L. (2021). Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10030 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. https://doi.org/10.15479/at:ista:10030. 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. 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. mla: Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10030. 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. corr_author: '1' date_created: 2021-09-21T09:14:15Z date_published: 2021-09-22T00:00:00Z date_updated: 2026-04-08T07:00:04Z day: '22' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: JaMa doi: 10.15479/at:ista:10030 file: - access_level: closed checksum: 8cd60dcb8762e8f21867e21e8001e183 content_type: application/x-zip-compressed creator: cchlebak date_created: 2021-09-21T09:17:34Z date_updated: 2022-03-10T12:14:42Z file_id: '10032' file_name: tex_and_pictures.zip file_size: 3876668 relation: source_file - access_level: open_access checksum: 9789e9d967c853c1503ec7f307170279 content_type: application/pdf creator: cchlebak date_created: 2021-09-27T11:14:31Z date_updated: 2021-09-27T11:14:31Z file_id: '10047' file_name: thesis_portinale_Final (1).pdf file_size: 2532673 relation: main_file file_date_updated: 2022-03-10T12:14:42Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 260788DE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: W1245 name: Dissipation and dispersion in nonlinear partial differential equations - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9792' relation: part_of_dissertation status: public - id: '10022' relation: part_of_dissertation status: public - id: '7573' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 title: Discrete-to-continuum limits of transport problems and gradient flows in the space of measures tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- OA_place: publisher _id: '9733' abstract: - lang: eng 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. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Dario full_name: Feliciangeli, Dario id: 41A639AA-F248-11E8-B48F-1D18A9856A87 last_name: Feliciangeli orcid: 0000-0003-0754-8530 citation: ama: Feliciangeli D. The polaron at strong coupling. 2021. doi:10.15479/at:ista:9733 apa: Feliciangeli, D. (2021). The polaron at strong coupling. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9733 chicago: Feliciangeli, Dario. “The Polaron at Strong Coupling.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9733. ieee: D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and Technology Austria, 2021. ista: Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science and Technology Austria. mla: Feliciangeli, Dario. The Polaron at Strong Coupling. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9733. short: D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-07-27T15:48:30Z date_published: 2021-08-20T00:00:00Z date_updated: 2026-04-08T06:59:50Z day: '20' ddc: - '515' - '519' - '539' degree_awarded: PhD department: - _id: GradSch - _id: RoSe - _id: JaMa doi: 10.15479/at:ista:9733 ec_funded: 1 file: - access_level: open_access checksum: e88bb8ca43948abe060eb2d2fa719881 content_type: application/pdf creator: dfelicia date_created: 2021-08-19T14:03:48Z date_updated: 2021-09-06T09:28:56Z file_id: '9944' file_name: Thesis_FeliciangeliA.pdf file_size: 1958710 relation: main_file - access_level: closed checksum: 72810843abee83705853505b3f8348aa content_type: application/octet-stream creator: dfelicia date_created: 2021-08-19T14:06:35Z date_updated: 2022-03-10T12:13:57Z file_id: '9945' file_name: thesis.7z file_size: 3771669 relation: source_file file_date_updated: 2022-03-10T12:13:57Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nd/4.0/ month: '08' oa: 1 oa_version: Published Version page: '180' project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9787' relation: part_of_dissertation status: public - id: '9792' relation: part_of_dissertation status: public - id: '9791' relation: part_of_dissertation status: public - id: '9781' relation: part_of_dissertation status: public - id: '9225' relation: part_of_dissertation status: public status: public supervisor: - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 title: The polaron at strong coupling tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- _id: '9225' abstract: - lang: eng 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." 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) article_number: '19' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Dario full_name: Feliciangeli, Dario id: 41A639AA-F248-11E8-B48F-1D18A9856A87 last_name: Feliciangeli orcid: 0000-0003-0754-8530 - first_name: Simone Anna Elvira full_name: Rademacher, Simone Anna Elvira id: 856966FE-A408-11E9-977E-802DE6697425 last_name: Rademacher orcid: 0000-0001-5059-4466 - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Feliciangeli D, Rademacher SAE, Seiringer R. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 2021;111. doi:10.1007/s11005-020-01350-5 apa: Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (2021). Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-020-01350-5 chicago: Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in Mathematical Physics. Springer Nature, 2021. https://doi.org/10.1007/s11005-020-01350-5. ieee: D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “Persistence of the spectral gap for the Landau–Pekar equations,” Letters in Mathematical Physics, vol. 111. Springer Nature, 2021. ista: Feliciangeli D, Rademacher SAE, Seiringer R. 2021. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 111, 19. mla: Feliciangeli, Dario, et al. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in Mathematical Physics, vol. 111, 19, Springer Nature, 2021, doi:10.1007/s11005-020-01350-5. short: D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, Letters in Mathematical Physics 111 (2021). date_created: 2021-03-07T23:01:25Z date_published: 2021-02-11T00:00:00Z date_updated: 2026-04-08T06:59:49Z day: '11' ddc: - '510' department: - _id: RoSe doi: 10.1007/s11005-020-01350-5 ec_funded: 1 external_id: isi: - '000617195700001' file: - access_level: open_access checksum: ffbfe1aad623bce7ff529c207e343b53 content_type: application/pdf creator: dernst date_created: 2021-03-09T11:44:34Z date_updated: 2021-03-09T11:44:34Z file_id: '9232' file_name: 2021_LettersMathPhysics_Feliciangeli.pdf file_size: 391205 relation: main_file success: 1 file_date_updated: 2021-03-09T11:44:34Z has_accepted_license: '1' intvolume: ' 111' isi: 1 language: - iso: eng month: '02' oa: 1 oa_version: Published Version project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Letters in Mathematical Physics publication_identifier: eissn: - 1573-0530 issn: - 0377-9017 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '9733' relation: dissertation_contains status: public scopus_import: '1' status: public title: Persistence of the spectral gap for the Landau–Pekar equations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd volume: 111 year: '2021' ... --- _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.' 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].' article_number: '2106.11217' article_processing_charge: No arxiv: 1 author: - first_name: Dario full_name: Feliciangeli, Dario id: 41A639AA-F248-11E8-B48F-1D18A9856A87 last_name: Feliciangeli orcid: 0000-0003-0754-8530 - first_name: Augusto full_name: Gerolin, Augusto last_name: Gerolin - first_name: Lorenzo full_name: Portinale, Lorenzo id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87 last_name: Portinale citation: ama: Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. arXiv. doi:10.48550/arXiv.2106.11217 apa: Feliciangeli, D., Gerolin, A., & Portinale, L. (n.d.). A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. arXiv. https://doi.org/10.48550/arXiv.2106.11217 chicago: Feliciangeli, Dario, Augusto Gerolin, and Lorenzo Portinale. “A Non-Commutative Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2106.11217. ieee: D. Feliciangeli, A. Gerolin, and L. Portinale, “A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature,” arXiv. . ista: Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. arXiv, 2106.11217. mla: Feliciangeli, Dario, et al. “A Non-Commutative Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.” ArXiv, 2106.11217, doi:10.48550/arXiv.2106.11217. short: D. Feliciangeli, A. Gerolin, L. Portinale, ArXiv (n.d.). date_created: 2021-08-06T09:07:12Z date_published: 2021-07-21T00:00:00Z date_updated: 2026-04-08T07:00:03Z day: '21' ddc: - '510' department: - _id: RoSe - _id: JaMa doi: 10.48550/arXiv.2106.11217 ec_funded: 1 external_id: arxiv: - '2106.11217' has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2106.11217 month: '07' oa: 1 oa_version: Preprint project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems publication: arXiv publication_status: draft related_material: record: - id: '12911' relation: later_version status: public - id: '9733' relation: dissertation_contains status: public - id: '10030' relation: dissertation_contains status: public status: public title: A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- _id: '9787' abstract: - lang: eng 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. 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" article_number: '2101.12566' article_processing_charge: No arxiv: 1 author: - first_name: Dario full_name: Feliciangeli, Dario id: 41A639AA-F248-11E8-B48F-1D18A9856A87 last_name: Feliciangeli orcid: 0000-0003-0754-8530 - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: 'Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv. doi:10.48550/arXiv.2101.12566' apa: 'Feliciangeli, D., & Seiringer, R. (n.d.). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv. https://doi.org/10.48550/arXiv.2101.12566' chicago: 'Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2101.12566.' ieee: 'D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” arXiv. .' ista: 'Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv, 2101.12566.' mla: 'Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, 2101.12566, doi:10.48550/arXiv.2101.12566.' short: D. Feliciangeli, R. Seiringer, ArXiv (n.d.). corr_author: '1' date_created: 2021-08-06T08:25:57Z date_published: 2021-02-01T00:00:00Z date_updated: 2026-04-08T06:59:49Z day: '01' ddc: - '510' department: - _id: RoSe doi: 10.48550/arXiv.2101.12566 ec_funded: 1 external_id: arxiv: - '2101.12566' has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2101.12566 month: '02' oa: 1 oa_version: Preprint project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: arXiv publication_status: draft related_material: record: - id: '10224' relation: later_version status: public - id: '9733' relation: dissertation_contains status: public status: public title: 'The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- OA_place: repository _id: '9791' abstract: - lang: eng 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. 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.. article_number: '2107.03720 ' article_processing_charge: No arxiv: 1 author: - first_name: Dario full_name: Feliciangeli, Dario id: 41A639AA-F248-11E8-B48F-1D18A9856A87 last_name: Feliciangeli orcid: 0000-0003-0754-8530 - first_name: Simone Anna Elvira full_name: Rademacher, Simone Anna Elvira id: 856966FE-A408-11E9-977E-802DE6697425 last_name: Rademacher orcid: 0000-0001-5059-4466 - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv. doi:10.48550/arXiv.2107.03720 apa: Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (n.d.). The effective mass problem for the Landau-Pekar equations. arXiv. https://doi.org/10.48550/arXiv.2107.03720 chicago: Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “The Effective Mass Problem for the Landau-Pekar Equations.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2107.03720. ieee: D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “The effective mass problem for the Landau-Pekar equations,” arXiv. . ista: Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv, 2107.03720. mla: Feliciangeli, Dario, et al. “The Effective Mass Problem for the Landau-Pekar Equations.” ArXiv, 2107.03720, doi:10.48550/arXiv.2107.03720. short: D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.). corr_author: '1' date_created: 2021-08-06T08:49:45Z date_published: 2021-07-08T00:00:00Z date_updated: 2026-04-08T06:59:49Z day: '08' ddc: - '510' department: - _id: RoSe doi: 10.48550/arXiv.2107.03720 ec_funded: 1 external_id: arxiv: - '2107.03720' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2107.03720 month: '07' oa: 1 oa_version: Preprint project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: arXiv publication_status: draft related_material: record: - id: '10755' relation: later_version status: public - id: '9733' relation: dissertation_contains status: public status: public title: The effective mass problem for the Landau-Pekar equations type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- _id: '9987' abstract: - lang: eng 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.' 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. alternative_title: - LNCS article_processing_charge: Yes arxiv: 1 author: - first_name: Pratyush full_name: Agarwal, Pratyush last_name: Agarwal - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Shreya full_name: Pathak, Shreya last_name: Pathak - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: 33rd International Conference on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366. doi:10.1007/978-3-030-81685-8_16' apa: 'Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16' chicago: Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16. ieee: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366. 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.' mla: Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” 33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16. 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. conference: end_date: 2021-07-23 location: Virtual name: 'CAV: Computer Aided Verification ' start_date: 2021-07-20 corr_author: '1' date_created: 2021-09-05T22:01:24Z date_published: 2021-07-15T00:00:00Z date_updated: 2026-04-08T07:00:30Z day: '15' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-030-81685-8_16 ec_funded: 1 external_id: arxiv: - '2105.06424' isi: - '000698732400016' file: - access_level: open_access checksum: 4b346e5fbaa8b9bdf107819c7b2aadee content_type: application/pdf creator: dernst date_created: 2022-05-13T07:00:20Z date_updated: 2022-05-13T07:00:20Z file_id: '11368' file_name: 2021_LNCS_Agarwal.pdf file_size: 1516756 relation: main_file success: 1 file_date_updated: 2022-05-13T07:00:20Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 341-366 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: '33rd International Conference on Computer-Aided Verification ' publication_identifier: eisbn: - 978-3-030-81685-8 eissn: - 1611-3349 isbn: - 978-3-030-81684-1 issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public scopus_import: '1' status: public title: Stateless model checking under a reads-value-from equivalence tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: '12759 ' year: '2021' ... --- OA_place: publisher _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. acknowledged_ssus: - _id: SSU alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199 apa: Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199 chicago: Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199. ieee: V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021. ista: Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. mla: Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199. short: V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-10-29T20:09:01Z date_published: 2021-10-31T00:00:00Z date_updated: 2026-04-08T07:00:31Z day: '31' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: KrCh doi: 10.15479/at:ista:10199 ec_funded: 1 file: - access_level: open_access checksum: 4f412a1ee60952221b499a4b1268df35 content_type: application/pdf creator: vtoman date_created: 2021-11-08T14:12:22Z date_updated: 2021-11-08T14:12:22Z file_id: '10225' file_name: toman_th_final.pdf file_size: 2915234 relation: main_file - access_level: closed checksum: 9584943f99127be2dd2963f6784c37d4 content_type: application/zip creator: vtoman date_created: 2021-11-08T14:12:46Z date_updated: 2021-11-09T09:00:50Z file_id: '10226' file_name: toman_thesis.zip file_size: 8616056 relation: source_file file_date_updated: 2021-11-09T09:00:50Z has_accepted_license: '1' keyword: - concurrency - verification - model checking language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '166' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9987' relation: part_of_dissertation status: public - id: '10191' relation: part_of_dissertation status: public - id: '141' relation: part_of_dissertation status: public - id: '10190' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X title: Improved verification techniques for concurrent systems type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- _id: '10191' abstract: - lang: eng 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" 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." article_number: '164' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Truc Lam full_name: Bui, Truc Lam last_name: Bui - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Tushar full_name: Gautam, Tushar last_name: Gautam - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 2021;5(OOPSLA). doi:10.1145/3485541 apa: Bui, T. L., 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. Association for Computing Machinery. https://doi.org/10.1145/3485541 chicago: Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541. ieee: T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021. 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. mla: Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541. short: T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021). date_created: 2021-10-27T15:05:34Z date_published: 2021-10-15T00:00:00Z date_updated: 2026-04-08T07:00:31Z day: '15' ddc: - '000' department: - _id: GradSch - _id: KrCh doi: 10.1145/3485541 ec_funded: 1 external_id: arxiv: - '2011.11763' file: - access_level: open_access checksum: 9d6dce7b611853c529bb7b1915ac579e content_type: application/pdf creator: cchlebak date_created: 2021-11-04T07:24:48Z date_updated: 2021-11-04T07:24:48Z file_id: '10215' file_name: 2021_ProcACMPL_Bui.pdf file_size: 2903485 relation: main_file success: 1 file_date_updated: 2021-11-04T07:24:48Z has_accepted_license: '1' intvolume: ' 5' issue: OOPSLA keyword: - safety - risk - reliability and quality - software language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Proceedings of the ACM on Programming Languages publication_identifier: eissn: - 2475-1421 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public scopus_import: '1' status: public title: The reads-from equivalence for the TSO and PSO memory models tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 5 year: '2021' ... --- OA_place: publisher _id: '10007' 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. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 citation: ama: 'Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:10.15479/at:ista:10007' apa: 'Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007' chicago: 'Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10007.' ieee: 'S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.' ista: 'Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.' mla: 'Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10007.' short: 'S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.' corr_author: '1' date_created: 2021-09-13T11:12:34Z date_published: 2021-09-14T00:00:00Z date_updated: 2026-04-08T07:01:01Z day: '14' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: JuFi doi: 10.15479/at:ista:10007 ec_funded: 1 file: - access_level: closed checksum: c8475faaf0b680b4971f638f1db16347 content_type: application/x-zip-compressed creator: shensel date_created: 2021-09-13T11:03:24Z date_updated: 2021-09-15T14:37:30Z file_id: '10008' file_name: thesis_final_Hensel.zip file_size: 15022154 relation: source_file - access_level: open_access checksum: 1a609937aa5275452822f45f2da17f07 content_type: application/pdf creator: shensel date_created: 2021-09-13T14:18:56Z date_updated: 2021-09-14T09:52:47Z file_id: '10014' file_name: thesis_final_Hensel.pdf file_size: 6583638 relation: main_file file_date_updated: 2021-09-15T14:37:30Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '300' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10012' relation: part_of_dissertation status: public - id: '10013' relation: part_of_dissertation status: public - id: '7489' relation: part_of_dissertation status: public status: public supervisor: - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X title: 'Curvature driven interface evolution: Uniqueness properties of weak solution concepts' type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- OA_place: publisher _id: '10429' abstract: - lang: eng 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Giorgi full_name: Nadiradze, Giorgi id: 3279A00C-F248-11E8-B48F-1D18A9856A87 last_name: Nadiradze orcid: 0000-0001-5634-0731 citation: ama: Nadiradze G. On achieving scalability through relaxation. 2021. doi:10.15479/at:ista:10429 apa: Nadiradze, G. (2021). On achieving scalability through relaxation. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10429 chicago: Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10429. ieee: G. Nadiradze, “On achieving scalability through relaxation,” Institute of Science and Technology Austria, 2021. ista: Nadiradze G. 2021. On achieving scalability through relaxation. Institute of Science and Technology Austria. mla: Nadiradze, Giorgi. On Achieving Scalability through Relaxation. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10429. short: G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-12-08T21:52:28Z date_published: 2021-12-09T00:00:00Z date_updated: 2026-04-08T07:00:46Z day: '09' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: DaAl doi: 10.15479/at:ista:10429 ec_funded: 1 file: - access_level: open_access checksum: 6bf14e9a523387328f016c0689f5e10e content_type: application/pdf creator: gnadirad date_created: 2021-12-09T17:47:49Z date_updated: 2021-12-09T17:47:49Z file_id: '10436' file_name: Thesis_Final_09_12_2021.pdf file_size: 2370859 relation: main_file success: 1 - access_level: closed checksum: 914d6c5ca86bd0add471971a8f4c4341 content_type: application/zip creator: gnadirad date_created: 2021-12-09T17:47:49Z date_updated: 2022-03-28T12:55:12Z file_id: '10437' file_name: Thesis_Final_09_12_2021.zip file_size: 2596924 relation: source_file file_date_updated: 2022-03-28T12:55:12Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: '132' project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10435' relation: part_of_dissertation status: public - id: '10432' relation: part_of_dissertation status: public - id: '6673' relation: part_of_dissertation status: public - id: '5965' relation: part_of_dissertation status: public status: public supervisor: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X title: On achieving scalability through relaxation type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- _id: '10435' abstract: - lang: eng 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. 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" article_processing_charge: No arxiv: 1 author: - first_name: Giorgi full_name: Nadiradze, Giorgi id: 3279A00C-F248-11E8-B48F-1D18A9856A87 last_name: Nadiradze orcid: 0000-0001-5634-0731 - first_name: Amirmojtaba full_name: Sabour, Amirmojtaba id: bcc145fd-e77f-11ea-ae8b-80d661dbff67 last_name: Sabour - first_name: Peter full_name: Davies, Peter id: 11396234-BB50-11E9-B24C-90FCE5697425 last_name: Davies orcid: 0000-0002-5646-9524 - first_name: Shigang full_name: Li, Shigang last_name: Li - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. Asynchronous decentralized SGD with quantized and local updates. In: 35th Conference on Neural Information Processing Systems. Neural Information Processing Systems Foundation; 2021.' apa: 'Nadiradze, G., Sabour, A., Davies, P., Li, S., & Alistarh, D.-A. (2021). Asynchronous decentralized SGD with quantized and local updates. In 35th Conference on Neural Information Processing Systems. 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 35th Conference on Neural Information Processing Systems. 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 35th Conference on Neural Information Processing Systems, Sydney, Australia, 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.' mla: Nadiradze, Giorgi, et al. “Asynchronous Decentralized SGD with Quantized and Local Updates.” 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 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. conference: end_date: 2021-12-14 location: Sydney, Australia name: 'NeurIPS: Neural Information Processing Systems' start_date: 2021-12-06 date_created: 2021-12-09T10:59:12Z date_published: 2021-12-01T00:00:00Z date_updated: 2026-04-08T07:00:45Z day: '01' department: - _id: DaAl ec_funded: 1 external_id: arxiv: - '1910.12308' language: - iso: eng main_file_link: - open_access: '1' url: https://papers.nips.cc/paper/2021/hash/362c99307cdc3f2d8b410652386a9dd1-Abstract.html month: '12' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: 35th Conference on Neural Information Processing Systems publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' related_material: record: - id: '10429' relation: dissertation_contains status: public status: public title: Asynchronous decentralized SGD with quantized and local updates type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- _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. 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)." article_processing_charge: No arxiv: 1 author: - first_name: Giorgi full_name: Nadiradze, Giorgi id: 3279A00C-F248-11E8-B48F-1D18A9856A87 last_name: Nadiradze orcid: 0000-0001-5634-0731 - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Bapi full_name: Chatterjee, Bapi id: 3C41A08A-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-2742-4028 - first_name: 'Vyacheslav ' full_name: 'Kungurtsev, Vyacheslav ' last_name: Kungurtsev - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.' apa: 'Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 9037–9045). Virtual.' 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 Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.' 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 Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.' 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.' mla: 'Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.' 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. conference: end_date: 2021-02-09 location: Virtual name: 'AAAI: Association for the Advancement of Artificial Intelligence' start_date: 2021-02-02 date_created: 2021-12-09T09:21:35Z date_published: 2021-05-18T00:00:00Z date_updated: 2026-04-08T07:00:45Z day: '18' department: - _id: DaAl ec_funded: 1 external_id: arxiv: - '2001.05918' intvolume: ' 35' issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://ojs.aaai.org/index.php/AAAI/article/view/17092 month: '05' oa: 1 oa_version: Published Version page: 9037-9045 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Proceedings of the AAAI Conference on Artificial Intelligence publication_status: published quality_controlled: '1' related_material: record: - id: '10429' relation: dissertation_contains status: public status: public title: 'Elastic consistency: A practical consistency model for distributed stochastic gradient descent' type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 35 year: '2021' ... --- _id: '10013' 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. 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. article_number: '2108.01733' article_processing_charge: No arxiv: 1 author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 - first_name: Tim full_name: Laux, Tim last_name: Laux citation: ama: Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. doi:10.48550/arXiv.2108.01733 apa: Hensel, S., & Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. https://doi.org/10.48550/arXiv.2108.01733 chicago: Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2108.01733. ieee: S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow of double bubbles,” arXiv. . ista: Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv, 2108.01733. mla: Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, 2108.01733, doi:10.48550/arXiv.2108.01733. short: S. Hensel, T. Laux, ArXiv (n.d.). corr_author: '1' date_created: 2021-09-13T12:17:11Z date_published: 2021-08-03T00:00:00Z date_updated: 2026-04-08T07:01:01Z day: '03' department: - _id: JuFi doi: 10.48550/arXiv.2108.01733 ec_funded: 1 external_id: arxiv: - '2108.01733' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2108.01733 month: '08' oa: 1 oa_version: Preprint project: - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication: arXiv publication_status: draft related_material: record: - id: '13043' relation: later_version status: public - id: '10007' relation: dissertation_contains status: public status: public title: Weak-strong uniqueness for the mean curvature flow of double bubbles type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- OA_place: publisher _id: '9418' abstract: - lang: eng text: "Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models." acknowledged_ssus: - _id: ScienComp - _id: CampIT - _id: E-Lib alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Phuong full_name: Bui Thi Mai, Phuong id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87 last_name: Bui Thi Mai citation: ama: Phuong M. Underspecification in deep learning. 2021. doi:10.15479/AT:ISTA:9418 apa: Phuong, M. (2021). Underspecification in deep learning. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9418 chicago: Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9418. ieee: M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021. ista: Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria. mla: Phuong, Mary. Underspecification in Deep Learning. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9418. short: M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-05-24T13:06:23Z date_published: 2021-05-30T00:00:00Z date_updated: 2026-04-08T07:01:17Z day: '30' ddc: - '000' degree_awarded: PhD department: - _id: GradSch - _id: ChLa doi: 10.15479/AT:ISTA:9418 file: - access_level: open_access checksum: 4f0abe64114cfed264f9d36e8d1197e3 content_type: application/pdf creator: bphuong date_created: 2021-05-24T11:22:29Z date_updated: 2021-05-24T11:22:29Z file_id: '9419' file_name: mph-thesis-v519-pdfimages.pdf file_size: 2673905 relation: main_file success: 1 - access_level: closed checksum: f5699e876bc770a9b0df8345a77720a2 content_type: application/zip creator: bphuong date_created: 2021-05-24T11:56:02Z date_updated: 2021-05-24T11:56:02Z file_id: '9420' file_name: thesis.zip file_size: 92995100 relation: source_file file_date_updated: 2021-05-24T11:56:02Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '125' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '7435' relation: part_of_dissertation status: deleted - id: '7481' relation: part_of_dissertation status: public - id: '9416' relation: part_of_dissertation status: public - id: '7479' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 title: Underspecification in deep learning type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- OA_place: publisher _id: '9056' abstract: - lang: eng text: "In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,\r\nand thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration\r\nfunction on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Georg F full_name: Osang, Georg F id: 464B40D6-F248-11E8-B48F-1D18A9856A87 last_name: Osang orcid: 0000-0002-8882-5116 citation: ama: Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:10.15479/AT:ISTA:9056 apa: Osang, G. F. (2021). Multi-cover persistence and Delaunay mosaics. Institute of Science and Technology Austria, Klosterneuburg. https://doi.org/10.15479/AT:ISTA:9056 chicago: Osang, Georg F. “Multi-Cover Persistence and Delaunay Mosaics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9056. ieee: G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021. ista: 'Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria.' mla: Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056. short: G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-02-02T14:11:06Z date_published: 2021-02-01T00:00:00Z date_updated: 2026-04-08T07:01:30Z day: '01' ddc: - '006' - '514' - '516' degree_awarded: PhD department: - _id: HeEd - _id: GradSch doi: 10.15479/AT:ISTA:9056 file: - access_level: closed checksum: bcf27986147cab0533b6abadd74e7629 content_type: application/zip creator: patrickd date_created: 2021-02-02T14:09:25Z date_updated: 2021-02-03T10:37:28Z file_id: '9063' file_name: thesis_source.zip file_size: 13446994 relation: source_file - access_level: open_access checksum: 9cc8af266579a464385bbe2aff6af606 content_type: application/pdf creator: patrickd date_created: 2021-02-02T14:09:18Z date_updated: 2021-02-02T14:09:18Z file_id: '9064' file_name: thesis_pdfA2b.pdf file_size: 5210329 relation: main_file success: 1 file_date_updated: 2021-02-03T10:37:28Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '134' place: Klosterneuburg publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '187' relation: part_of_dissertation status: public - id: '8703' relation: part_of_dissertation status: public status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 title: Multi-cover persistence and Delaunay mosaics tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ... --- _id: '9416' abstract: - lang: eng text: 'We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable'') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks.' article_processing_charge: No author: - first_name: Phuong full_name: Bui Thi Mai, Phuong id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87 last_name: Bui Thi Mai - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: 9th International Conference on Learning Representations. ; 2021.' apa: Phuong, M., & Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In 9th International Conference on Learning Representations. Virtual. chicago: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In 9th International Conference on Learning Representations, 2021. ieee: M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in 9th International Conference on Learning Representations, Virtual, 2021. ista: 'Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.' mla: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” 9th International Conference on Learning Representations, 2021. short: M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021. conference: end_date: 2021-05-07 location: Virtual name: 'ICLR: International Conference on Learning Representations' start_date: 2021-05-03 corr_author: '1' date_created: 2021-05-24T11:16:46Z date_published: 2021-05-01T00:00:00Z date_updated: 2026-04-08T07:01:16Z day: '01' ddc: - '000' department: - _id: GradSch - _id: ChLa file: - access_level: open_access checksum: f34ff17017527db5ba6927f817bdd125 content_type: application/pdf creator: bphuong date_created: 2021-05-24T11:15:57Z date_updated: 2021-05-24T11:15:57Z file_id: '9417' file_name: iclr2021_conference.pdf file_size: 502356 relation: main_file file_date_updated: 2021-05-24T11:15:57Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://openreview.net/pdf?id=krz7T0xU9Z_ month: '05' oa: 1 oa_version: Published Version publication: 9th International Conference on Learning Representations publication_status: published quality_controlled: '1' related_material: record: - id: '9418' relation: dissertation_contains status: public scopus_import: '1' status: public title: The inductive bias of ReLU networks on orthogonally separable data type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- OA_place: publisher _id: '10035' abstract: - lang: eng text: 'Many security definitions come in two flavors: a stronger “adaptive” flavor, where the adversary can arbitrarily make various choices during the course of the attack, and a weaker “selective” flavor where the adversary must commit to some or all of their choices a-priori. For example, in the context of identity-based encryption, selective security requires the adversary to decide on the identity of the attacked party at the very beginning of the game whereas adaptive security allows the attacker to first see the master public key and some secret keys before making this choice. Often, it appears to be much easier to achieve selective security than it is to achieve adaptive security. A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework (published at Crypto ’17 [JKK+17a]) that connects all of these works and allows us to present them in a unified and simplified fashion. Having the framework in place, we show how to achieve adaptive security for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the first adaptive security proofs for continuous group key agreement protocols (published at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that currently used proof techniques cannot lead to significantly better security guarantees for "graph-building" games (published at TCC ’21 [KKPW21a]). These games cover generalized selective decryption, as well as the security of prominent constructions for constrained PRFs, continuous group key agreement, and proxy re-encryption. Finally, we revisit the adaptive security of Yao’s garbled circuits and extend the analysis of Jafargholi and Wichs in two directions: While they prove adaptive security only for a modified construction with increased online complexity, we provide the first positive results for the original construction by Yao (published at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi and Wichs are essentially optimal by showing that no black-box reduction can provide a significantly better security bound (published at Crypto ’21 [KKPW21c]).' acknowledgement: "I want to acknowledge the funding by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Karen full_name: Klein, Karen id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87 last_name: Klein citation: ama: Klein K. On the adaptive security of graph-based games. 2021. doi:10.15479/at:ista:10035 apa: Klein, K. (2021). On the adaptive security of graph-based games. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10035 chicago: Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10035. ieee: K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021. ista: Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria. mla: Klein, Karen. On the Adaptive Security of Graph-Based Games. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10035. short: K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021. corr_author: '1' date_created: 2021-09-23T07:31:44Z date_published: 2021-09-23T00:00:00Z date_updated: 2026-04-08T07:01:44Z day: '23' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: KrPi doi: 10.15479/at:ista:10035 ec_funded: 1 file: - access_level: open_access checksum: 73a44345c683e81f3e765efbf86fdcc5 content_type: application/pdf creator: cchlebak date_created: 2021-10-04T12:22:33Z date_updated: 2021-10-04T12:22:33Z file_id: '10082' file_name: thesis_pdfa.pdf file_size: 2104726 relation: main_file success: 1 - access_level: closed checksum: 7b80df30a0e686c3ef6a56d4e1c59e29 content_type: application/x-zip-compressed creator: cchlebak date_created: 2021-10-05T07:04:37Z date_updated: 2022-03-10T12:15:18Z file_id: '10085' file_name: thesis_final (1).zip file_size: 9538359 relation: source_file file_date_updated: 2022-03-10T12:15:18Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '276' project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10044' relation: part_of_dissertation status: public - id: '10048' relation: part_of_dissertation status: public - id: '10041' relation: part_of_dissertation status: public - id: '10049' relation: part_of_dissertation status: public - id: '6430' relation: part_of_dissertation status: public - id: '637' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: On the adaptive security of graph-based games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2021' ...