[{"title":"Identifiable object-centric representation learning via probabilistic slot attention","_id":"19007","supplementarymaterial":"no","publisher":"Neural Information Processing Systems Foundation","volume":37,"month":"12","oa":1,"OA_place":"publisher","date_published":"2024-12-01T00:00:00Z","das_tickbox":"0","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"38th Conference on Neural Information Processing Systems","intvolume":" 37","citation":{"ama":"Kori A, Locatello F, Santhirasekaram A, Toni F, Glocker B, De Sousa Ribeiro F. Identifiable object-centric representation learning via probabilistic slot attention. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-2960","short":"A. Kori, F. Locatello, A. Santhirasekaram, F. Toni, B. Glocker, F. De Sousa Ribeiro, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","chicago":"Kori, Avinash, Francesco Locatello, Ainkaran Santhirasekaram, Francesca Toni, Ben Glocker, and Fabio De Sousa Ribeiro. “Identifiable Object-Centric Representation Learning via Probabilistic Slot Attention.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-2960.","ista":"Kori A, Locatello F, Santhirasekaram A, Toni F, Glocker B, De Sousa Ribeiro F. 2024. Identifiable object-centric representation learning via probabilistic slot attention. 38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","ieee":"A. Kori, F. Locatello, A. Santhirasekaram, F. Toni, B. Glocker, and F. De Sousa Ribeiro, “Identifiable object-centric representation learning via probabilistic slot attention,” in 38th Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","mla":"Kori, Avinash, et al. “Identifiable Object-Centric Representation Learning via Probabilistic Slot Attention.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-2960.","apa":"Kori, A., Locatello, F., Santhirasekaram, A., Toni, F., Glocker, B., & De Sousa Ribeiro, F. (2024). Identifiable object-centric representation learning via probabilistic slot attention. In 38th Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-2960"},"oa_version":"Published Version","article_processing_charge":"No","publication_status":"published","date_created":"2025-02-05T08:36:22Z","doi":"10.52202/079017-2960","external_id":{"arxiv":["2406.07141"]},"author":[{"last_name":"Kori","first_name":"Avinash","full_name":"Kori, Avinash"},{"last_name":"Locatello","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","full_name":"Locatello, Francesco"},{"first_name":"Ainkaran","full_name":"Santhirasekaram, Ainkaran","last_name":"Santhirasekaram"},{"last_name":"Toni","full_name":"Toni, Francesca","first_name":"Francesca"},{"last_name":"Glocker","full_name":"Glocker, Ben","first_name":"Ben"},{"full_name":"De Sousa Ribeiro, Fabio","first_name":"Fabio","last_name":"De Sousa Ribeiro"}],"abstract":[{"text":"Learning modular object-centric representations is crucial for systematic generalization. Existing methods show promising object-binding capabilities empirically,\r\nbut theoretical identifiability guarantees remain relatively underdeveloped. Understanding when object-centric representations can theoretically be identified is\r\ncrucial for scaling slot-based methods to high-dimensional images with correctness\r\nguarantees. To that end, we propose a probabilistic slot-attention algorithm that\r\nimposes an aggregate mixture prior over object-centric slot representations, thereby\r\nproviding slot identifiability guarantees without supervision, up to an equivalence\r\nrelation. We provide empirical verification of our theoretical identifiability result\r\nusing both simple 2-dimensional data and high-resolution imaging datasets.\r\n","lang":"eng"}],"file_date_updated":"2025-02-05T08:34:25Z","scopus_import":"1","ddc":["000"],"day":"01","date_updated":"2026-10-15T09:48:32Z","fulldoi":"https://doi.org/10.52202/079017-2960","alternative_title":["Advances in Neural Information Processing Systems"],"type":"conference","status":"public","has_accepted_license":"1","year":"2024","file":[{"date_updated":"2025-02-05T08:34:25Z","creator":"dernst","file_name":"2024_NeurIPS_Kori.pdf","relation":"main_file","content_type":"application/pdf","success":1,"checksum":"d27b3c7102adc28e798fe41001f0b919","access_level":"open_access","file_id":"19008","date_created":"2025-02-05T08:34:25Z","file_size":6943800}],"department":[{"_id":"FrLo"}],"arxiv":1,"quality_controlled":"1","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-16","location":"Vancouver, Canada","end_date":"2024-12-16"},"researchdata_availability":"no","OA_type":"hybrid","acknowledgement":"A. Kori is supported by UKRI (grant number EP/S023356/1), as part of the UKRI Centre for Doctoral Training in Safe and Trusted AI. B. Glocker and F.D.S. Ribeiro acknowledge the support of the UKRI AI programme, and the Engineering and Physical Sciences Research Council, for CHAI - EPSRC Causality in Healthcare AI Hub (grant number EP/Y028856/1)."},{"ddc":["510"],"scopus_import":"1","date_updated":"2026-10-15T09:48:57Z","day":"01","fulldoi":"https://doi.org/10.1007/s00208-024-02812-0","pmid":1,"project":[{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819","name":"Bridging Scales in Random Materials","call_identifier":"H2020"}],"ec_funded":1,"page":"2727-2766","status":"public","has_accepted_license":"1","type":"journal_article","dataavailabilitystatement":"Data sharing not applicable to this article as no data sets were generated or analyzed during the current study.","department":[{"_id":"JuFi"}],"year":"2024","file":[{"success":1,"file_size":661557,"file_id":"18790","date_created":"2025-01-09T08:23:36Z","access_level":"open_access","checksum":"d55cac8bddea09a97f06612825c4f229","date_updated":"2025-01-09T08:23:36Z","content_type":"application/pdf","relation":"main_file","file_name":"2024_MathAnnalen_Agresti.pdf","creator":"dernst"}],"arxiv":1,"quality_controlled":"1","OA_type":"hybrid","researchdata_availability":"not applicable","acknowledgement":"The authors thank Professor Franco Flandoli for useful discussions and valuable insight into the subject. In particular, A.A. would like to thank professor Franco Flandoli for hosting and financially contributing to his research visit at Scuola Normale di Pisa in January 2023, where this work started. E.L. would like to express sincere gratitude to Professor Marco Fuhrman for igniting his interest in this particular field of research. E.L. want to thank Professor Matthias Hieber and Dr. Martin Saal for useful discussions. Finally, the authors thank the anonymous referee for helpful comments which improved the paper from its initial version.Open access funding provided by Scuola Normale Superiore within the CRUI-CARE Agreement. A. Agresti has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 948819).","title":"Global well-posedness and interior regularity of 2D Navier-Stokes equations with stochastic boundary conditions","article_type":"original","publisher":"Springer Nature","_id":"15098","supplementarymaterial":"no","oa":1,"date_published":"2024-10-01T00:00:00Z","OA_place":"publisher","das_tickbox":"1","month":"10","volume":390,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"language":[{"iso":"eng"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Mathematische Annalen","intvolume":" 390","citation":{"apa":"Agresti, A., & Luongo, E. (2024). Global well-posedness and interior regularity of 2D Navier-Stokes equations with stochastic boundary conditions. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-024-02812-0","mla":"Agresti, Antonio, and Eliseo Luongo. “Global Well-Posedness and Interior Regularity of 2D Navier-Stokes Equations with Stochastic Boundary Conditions.” Mathematische Annalen, vol. 390, Springer Nature, 2024, pp. 2727–66, doi:10.1007/s00208-024-02812-0.","short":"A. Agresti, E. Luongo, Mathematische Annalen 390 (2024) 2727–2766.","ama":"Agresti A, Luongo E. Global well-posedness and interior regularity of 2D Navier-Stokes equations with stochastic boundary conditions. Mathematische Annalen. 2024;390:2727-2766. doi:10.1007/s00208-024-02812-0","ieee":"A. Agresti and E. Luongo, “Global well-posedness and interior regularity of 2D Navier-Stokes equations with stochastic boundary conditions,” Mathematische Annalen, vol. 390. Springer Nature, pp. 2727–2766, 2024.","chicago":"Agresti, Antonio, and Eliseo Luongo. “Global Well-Posedness and Interior Regularity of 2D Navier-Stokes Equations with Stochastic Boundary Conditions.” Mathematische Annalen. Springer Nature, 2024. https://doi.org/10.1007/s00208-024-02812-0.","ista":"Agresti A, Luongo E. 2024. Global well-posedness and interior regularity of 2D Navier-Stokes equations with stochastic boundary conditions. Mathematische Annalen. 390, 2727–2766."},"date_created":"2024-03-10T23:00:54Z","article_processing_charge":"Yes (via OA deal)","publication_status":"published","doi":"10.1007/s00208-024-02812-0","publication_identifier":{"issn":["0025-5831"],"eissn":["1432-1807"]},"oa_version":"Published Version","file_date_updated":"2025-01-09T08:23:36Z","external_id":{"pmid":["39351582"],"arxiv":["2306.11081"],"isi":["001172711400002"]},"author":[{"last_name":"Agresti","orcid":"0000-0002-9573-2962","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","full_name":"Agresti, Antonio","first_name":"Antonio"},{"full_name":"Luongo, Eliseo","first_name":"Eliseo","last_name":"Luongo"}],"abstract":[{"lang":"eng","text":"The paper is devoted to the analysis of the global well-posedness and the interior regularity of the 2D Navier–Stokes equations with inhomogeneous stochastic boundary conditions. The noise, white in time and coloured in space, can be interpreted as the physical law describing the driving mechanism on the atmosphere–ocean interface, i.e. as a balance of the shear stress of the ocean and the horizontal wind force."}]},{"publication":"Multiscale Modeling and Simulation","intvolume":" 22","citation":{"mla":"Clozeau, Nicolas, and Lihan Wang. “Artificial Boundary Conditions for Random Elliptic Systems with Correlated Coefficient Field.” Multiscale Modeling and Simulation, vol. 22, no. 3, Society for Industrial and Applied Mathematics, 2024, pp. 973–1029, doi:10.1137/23M1603819.","apa":"Clozeau, N., & Wang, L. (2024). Artificial boundary conditions for random elliptic systems with correlated coefficient field. Multiscale Modeling and Simulation. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/23M1603819","chicago":"Clozeau, Nicolas, and Lihan Wang. “Artificial Boundary Conditions for Random Elliptic Systems with Correlated Coefficient Field.” Multiscale Modeling and Simulation. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/23M1603819.","ista":"Clozeau N, Wang L. 2024. Artificial boundary conditions for random elliptic systems with correlated coefficient field. Multiscale Modeling and Simulation. 22(3), 973–1029.","ieee":"N. Clozeau and L. Wang, “Artificial boundary conditions for random elliptic systems with correlated coefficient field,” Multiscale Modeling and Simulation, vol. 22, no. 3. Society for Industrial and Applied Mathematics, pp. 973–1029, 2024.","short":"N. Clozeau, L. Wang, Multiscale Modeling and Simulation 22 (2024) 973–1029.","ama":"Clozeau N, Wang L. Artificial boundary conditions for random elliptic systems with correlated coefficient field. Multiscale Modeling and Simulation. 2024;22(3):973-1029. doi:10.1137/23M1603819"},"isi":1,"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"external_id":{"arxiv":["2309.06798"],"isi":["001285416500001"]},"author":[{"id":"fea1b376-906f-11eb-847d-b2c0cf46455b","full_name":"Clozeau, Nicolas","first_name":"Nicolas","last_name":"Clozeau"},{"first_name":"Lihan","full_name":"Wang, Lihan","last_name":"Wang"}],"abstract":[{"text":"We are interested in numerical algorithms for computing the electrical field generated by a charge distribution localized on scale l in an infinite heterogeneous correlated random medium, in a situation where the medium is only known in a box of diameter L >>l around the support of the charge. We show that the algorithm in [J. Lu, F. Otto, and L. Wang, Optimal Artificial Boundary Conditions Based on Second-Order Correctors for Three Dimensional Random Ellilptic Media, preprint, arXiv:2109.01616, 2021], suggesting optimal Dirichlet boundary conditions motivated by the multipole expansion [P. Bella, A. Giunti, and F. Otto, Comm. Partial Differential Equations, 45 (2020), pp. 561–640], still performs well in correlated media. With overwhelming probability, we obtain a convergence rate in terms of l, L, and the size of the correlations for which optimality is supported with numerical simulations. These estimates are provided for ensembles which satisfy a multiscale logarithmic Sobolev inequality, where our main tool is an extension of the semigroup estimates in [N. Clozeau, Stoch. Partial Differ. Equ. Anal. Comput., 11 (2023), pp. 1254–1378]. As part of our strategy, we construct sublinear second-order correctors in this correlated setting, which is of independent interest.","lang":"eng"}],"publication_identifier":{"eissn":["1540-3467"],"issn":["1540-3459"]},"oa_version":"Preprint","publication_status":"published","article_processing_charge":"No","doi":"10.1137/23M1603819","date_created":"2024-08-25T22:01:08Z","supplementarymaterial":"no","_id":"17462","publisher":"Society for Industrial and Applied Mathematics","article_type":"original","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2309.06798","open_access":"1"}],"title":"Artificial boundary conditions for random elliptic systems with correlated coefficient field","volume":22,"month":"09","oa":1,"das_tickbox":"0","date_published":"2024-09-01T00:00:00Z","OA_place":"repository","arxiv":1,"year":"2024","department":[{"_id":"JuFi"}],"acknowledgement":"We would like to thank our affiliations, Institute of Science and Technology Austria and Max Planck Institute for Mathematics in the Sciences, for supporting the authors’ visits to each other, which greatly facilitated this work. We would like to thank Marc Josien and Quinn Winters for assistance in numerical implementation.","quality_controlled":"1","researchdata_availability":"no","OA_type":"green","date_updated":"2026-10-15T09:49:19Z","day":"01","fulldoi":"https://doi.org/10.1137/23M1603819","scopus_import":"1","type":"journal_article","status":"public","project":[{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","name":"Bridging Scales in Random Materials","grant_number":"948819"}],"page":"973-1029","ec_funded":1,"issue":"3"},{"acknowledgement":"The first author has been partially supported by the Nachwuchsring – Network for the promotion of young scientists – at TU Kaiserslautern. The second author is supported by the VIDI subsidy 639.032.427 of the Netherlands Organisation for Scientific Research (NWO). The authors thank the anonymous referees and Max Sauerbrey for careful reading and helpful suggestions.","researchdata_availability":"no","quality_controlled":"1","arxiv":1,"year":"2024","department":[{"_id":"JuFi"}],"type":"journal_article","status":"public","page":"413-430","issue":"1","fulldoi":"https://doi.org/10.1214/22-AIHP1333","date_updated":"2026-10-15T09:46:19Z","day":"01","scopus_import":"1","author":[{"last_name":"Agresti","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","orcid":"0000-0002-9573-2962","first_name":"Antonio","full_name":"Agresti, Antonio"},{"first_name":"Mark","full_name":"Veraar, Mark","last_name":"Veraar"}],"abstract":[{"lang":"eng","text":"In this paper we consider an SPDE where the leading term is a second order operator with periodic boundary conditions, coefficients which are measurable in (t,ω) , and Hölder continuous in space. Assuming stochastic parabolicity conditions, we prove Lp((0,T)×Ω,tκdt;Hσ,q(Td)) -estimates. The main novelty is that we do not require p=q . Moreover, we allow arbitrary σ∈R and weights in time. Such mixed regularity estimates play a crucial role in applications to nonlinear SPDEs which is clear from our previous work. To prove our main results we develop a general perturbation theory for SPDEs. Moreover, we prove a new result on pointwise multiplication in spaces with fractional smoothness."}],"external_id":{"arxiv":["2106.01274"]},"publication_identifier":{"issn":["0246-0203"]},"oa_version":"Preprint","doi":"10.1214/22-AIHP1333","date_created":"2024-03-17T23:00:58Z","article_processing_charge":"No","publication_status":"published","citation":{"mla":"Agresti, Antonio, and Mark Veraar. “Stochastic Maximal Lp(Lq)-Regularity for Second Order Systems with Periodic Boundary Conditions.” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, vol. 60, no. 1, Institute of Mathematical Statistics, 2024, pp. 413–30, doi:10.1214/22-AIHP1333.","apa":"Agresti, A., & Veraar, M. (2024). Stochastic maximal Lp(Lq)-regularity for second order systems with periodic boundary conditions. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. Institute of Mathematical Statistics. https://doi.org/10.1214/22-AIHP1333","chicago":"Agresti, Antonio, and Mark Veraar. “Stochastic Maximal Lp(Lq)-Regularity for Second Order Systems with Periodic Boundary Conditions.” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. Institute of Mathematical Statistics, 2024. https://doi.org/10.1214/22-AIHP1333.","ista":"Agresti A, Veraar M. 2024. Stochastic maximal Lp(Lq)-regularity for second order systems with periodic boundary conditions. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 60(1), 413–430.","ieee":"A. Agresti and M. Veraar, “Stochastic maximal Lp(Lq)-regularity for second order systems with periodic boundary conditions,” Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, vol. 60, no. 1. Institute of Mathematical Statistics, pp. 413–430, 2024.","ama":"Agresti A, Veraar M. Stochastic maximal Lp(Lq)-regularity for second order systems with periodic boundary conditions. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 2024;60(1):413-430. doi:10.1214/22-AIHP1333","short":"A. Agresti, M. Veraar, Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 60 (2024) 413–430."},"intvolume":" 60","publication":"Annales de l'Institut Henri Poincaré, Probabilités et Statistiques","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","language":[{"iso":"eng"}],"month":"02","volume":60,"date_published":"2024-02-01T00:00:00Z","das_tickbox":"0","oa":1,"_id":"15119","supplementarymaterial":"no","publisher":"Institute of Mathematical Statistics","article_type":"original","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2106.01274","open_access":"1"}],"title":"Stochastic maximal Lp(Lq)-regularity for second order systems with periodic boundary conditions"},{"month":"01","volume":41,"das_tickbox":"0","date_published":"2024-01-24T00:00:00Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_type":"original","title":"Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow","_id":"17481","supplementarymaterial":"no","publisher":"EMS Press","publication_identifier":{"issn":["0294-1449"],"eissn":["1873-1430"]},"oa_version":"Published Version","publication_status":"published","article_processing_charge":"Yes","date_created":"2024-09-01T22:01:09Z","doi":"10.4171/AIHPC/109","author":[{"last_name":"Fischer","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","full_name":"Fischer, Julian L"},{"id":"25647992-AA84-11E9-9D75-8427E6697425","first_name":"Alice","full_name":"Marveggio, Alice","last_name":"Marveggio"}],"abstract":[{"lang":"eng","text":"Phase-field models such as the Allen–Cahn equation may give rise to the formation and evolution of geometric shapes, a phenomenon that may be analyzed rigorously in suitable scaling regimes. In its sharp-interface limit, the vectorial Allen–Cahn equation with a potential with N≥3 distinct minima has been conjectured to describe the evolution of branched interfaces by multiphase mean curvature flow. In the present work, we give a rigorous proof for this statement in two and three ambient dimensions and for a suitable class of potentials: as long as a strong solution to multiphase mean curvature flow exists, solutions to the vectorial Allen–Cahn equation with well-prepared initial data converge towards multiphase mean curvature flow in the limit of vanishing interface width parameter ε↘0. We even establish the rate of convergence O(ε \r\n1/2\r\n ). Our approach is based on the gradient-flow structure of the Allen–Cahn equation and its limiting motion: building on the recent concept of “gradient-flow calibrations” for multiphase mean curvature flow, we introduce a notion of relative entropy for the vectorial Allen–Cahn equation with multi-well potential. This enables us to overcome the limitations of other approaches, e.g. avoiding the need for a stability analysis of the Allen–Cahn operator or additional convergence hypotheses for the energy at positive times."}],"external_id":{"isi":["001293853900003"]},"file_date_updated":"2024-09-09T07:46:42Z","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"related_material":{"record":[{"relation":"earlier_version","id":"14597","status":"public"}]},"language":[{"iso":"eng"}],"intvolume":" 41","citation":{"ista":"Fischer JL, Marveggio A. 2024. Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow. Annales de l’Institut Henri Poincaré C. 41(5), 1117–1178.","chicago":"Fischer, Julian L, and Alice Marveggio. “Quantitative Convergence of the Vectorial Allen–Cahn Equation towards Multiphase Mean Curvature Flow.” Annales de l’Institut Henri Poincaré C. EMS Press, 2024. https://doi.org/10.4171/AIHPC/109.","ieee":"J. L. Fischer and A. Marveggio, “Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow,” Annales de l’Institut Henri Poincaré C, vol. 41, no. 5. EMS Press, pp. 1117–1178, 2024.","short":"J.L. Fischer, A. Marveggio, Annales de l’Institut Henri Poincaré C 41 (2024) 1117–1178.","ama":"Fischer JL, Marveggio A. Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow. Annales de l’Institut Henri Poincaré C. 2024;41(5):1117-1178. doi:10.4171/AIHPC/109","apa":"Fischer, J. L., & Marveggio, A. (2024). Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase mean curvature flow. Annales de l’Institut Henri Poincaré C. EMS Press. https://doi.org/10.4171/AIHPC/109","mla":"Fischer, Julian L., and Alice Marveggio. “Quantitative Convergence of the Vectorial Allen–Cahn Equation towards Multiphase Mean Curvature Flow.” Annales de l’Institut Henri Poincaré C, vol. 41, no. 5, EMS Press, 2024, pp. 1117–78, doi:10.4171/AIHPC/109."},"publication":"Annales de l'Institut Henri Poincaré C","ec_funded":1,"issue":"5","page":"1117-1178","project":[{"_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","call_identifier":"H2020","name":"Bridging Scales in Random Materials","grant_number":"948819"}],"type":"journal_article","has_accepted_license":"1","status":"public","scopus_import":"1","ddc":["510"],"fulldoi":"https://doi.org/10.4171/AIHPC/109","date_updated":"2026-10-15T09:49:35Z","day":"24","researchdata_availability":"no","quality_controlled":"1","acknowledgement":"The authors thank Sebastian Hensel for useful and helpful commentson the first draft of this work.\r\nThis project has received funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (grant\r\nagreement no. 948819.","file":[{"relation":"main_file","file_name":"2024_AnnInstHPoincare_Fischer.pdf","content_type":"application/pdf","creator":"dernst","date_updated":"2024-09-09T07:46:42Z","file_size":1348896,"checksum":"b5ad02d9abd5b4701269cd1ad0a1cc8f","date_created":"2024-09-09T07:46:42Z","file_id":"17923","access_level":"open_access","success":1}],"year":"2024","department":[{"_id":"JuFi"}]},{"scopus_import":"1","date_updated":"2026-10-15T09:51:23Z","day":"08","fulldoi":"https://doi.org/10.1145/3661814.3662080","project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"ec_funded":1,"status":"public","type":"conference","department":[{"_id":"KrCh"}],"year":"2024","arxiv":1,"quality_controlled":"1","conference":{"end_date":"2024-07-11","location":"Tallinn, Estonia","name":"LICS: Logic in Computer Science","start_date":"2024-07-08"},"researchdata_availability":"no","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.\r\n","title":"Deterministic sub-exponential algorithm for discounted-sum games with unary weights","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.02479"}],"publisher":"Association for Computing Machinery","_id":"17098","supplementarymaterial":"no","oa":1,"das_tickbox":"0","date_published":"2024-07-08T00:00:00Z","month":"07","language":[{"iso":"eng"}],"isi":1,"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"39th Annual ACM/IEEE Symposium on Logic in Computer Science","citation":{"apa":"Asadi, A., Chatterjee, K., Svoboda, J., & Saona Urmeneta, R. J. (2024). Deterministic sub-exponential algorithm for discounted-sum games with unary weights. In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Tallinn, Estonia: Association for Computing Machinery. https://doi.org/10.1145/3661814.3662080","mla":"Asadi, Ali, et al. “Deterministic Sub-Exponential Algorithm for Discounted-Sum Games with Unary Weights.” 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 6, Association for Computing Machinery, 2024, doi:10.1145/3661814.3662080.","ieee":"A. Asadi, K. Chatterjee, J. Svoboda, and R. J. Saona Urmeneta, “Deterministic sub-exponential algorithm for discounted-sum games with unary weights,” in 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Tallinn, Estonia, 2024.","ista":"Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. 2024. Deterministic sub-exponential algorithm for discounted-sum games with unary weights. 39th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Jakub Svoboda, and Raimundo J Saona Urmeneta. “Deterministic Sub-Exponential Algorithm for Discounted-Sum Games with Unary Weights.” In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery, 2024. https://doi.org/10.1145/3661814.3662080.","ama":"Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. Deterministic sub-exponential algorithm for discounted-sum games with unary weights. In: 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery; 2024. doi:10.1145/3661814.3662080","short":"A. Asadi, K. Chatterjee, J. Svoboda, R.J. Saona Urmeneta, in:, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Association for Computing Machinery, 2024."},"publication_status":"published","doi":"10.1145/3661814.3662080","date_created":"2024-06-03T07:43:15Z","article_processing_charge":"No","publication_identifier":{"isbn":["9798400706608"],"eissn":["1043-6871"]},"oa_version":"Preprint","article_number":"6","external_id":{"isi":["001275042100006"],"arxiv":["2405.02479"]},"abstract":[{"text":"Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided by a player that owns the current vertex. Each edge is assigned an integer weight and the payoff of a play is the discounted-sum of the weights of the play. The goal of player 1 is to maximize the discounted-sum payoff against the adversarial player 2. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class and the existence of a polynomial-time algorithm is a major open question. Since breaking the general exponential barrier has been a challenging problem, faster parameterized algorithms have been considered. If the discount factor is expressed in unary, then discounted-sum games can be solved in polynomial time. However, if the discount factor is arbitrary (or expressed in binary), but the weights are in unary, none of the existing approaches yield a sub-exponential bound. Our main result is a new analysis technique for a classical algorithm (namely, the strategy iteration algorithm) that present a new runtime bound which is [EQUATION] for game graphs with n vertices and absolute weights of at most W. In particular, our result yields a deterministic sub-exponential bound for games with weights that are constant or represented in unary.","lang":"eng"}],"author":[{"full_name":"Asadi, Ali","first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Jakub","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","last_name":"Svoboda"},{"last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J"}]},{"acknowledged_ssus":[{"_id":"CampIT"}],"date_published":"2024-12-20T00:00:00Z","OA_place":"repository","oa":1,"month":"12","volume":37,"publisher":"Neural Information Processing Systems Foundation","_id":"19510","title":"MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.15593","open_access":"1"}],"author":[{"last_name":"Modoranu","full_name":"Modoranu, Ionut-Vlad","first_name":"Ionut-Vlad","id":"449f7a18-f128-11eb-9611-9b430c0c6333"},{"last_name":"Safaryan","id":"dd546b39-0804-11ed-9c55-ef075c39778d","first_name":"Mher","full_name":"Safaryan, Mher"},{"last_name":"Malinovsky","first_name":"Grigory","full_name":"Malinovsky, Grigory"},{"last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar","full_name":"Kurtic, Eldar"},{"id":"de632733-1457-11f0-ae22-b5914b8c1c41","full_name":"Robert, Thomas","first_name":"Thomas","last_name":"Robert"},{"first_name":"Peter","full_name":"Richtárik, Peter","last_name":"Richtárik"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"abstract":[{"text":"We propose a new variant of the Adam optimizer [Kingma and Ba, 2014] called\r\nMICROADAM that specifically minimizes memory overheads, while maintaining\r\ntheoretical convergence guarantees. We achieve this by compressing the gradient\r\ninformation before it is fed into the optimizer state, thereby reducing its memory\r\nfootprint significantly. We control the resulting compression error via a novel\r\ninstance of the classical error feedback mechanism from distributed optimization [Seide et al., 2014, Alistarh et al., 2018, Karimireddy et al., 2019] in which\r\nthe error correction information is itself compressed to allow for practical memory\r\ngains. We prove that the resulting approach maintains theoretical convergence\r\nguarantees competitive to those of AMSGrad, while providing good practical performance. Specifically, we show that MICROADAM can be implemented efficiently\r\non GPUs: on both million-scale (BERT) and billion-scale (LLaMA) models, MICROADAM provides practical convergence competitive to that of the uncompressed\r\nAdam baseline, with lower memory usage and similar running time. Our code is\r\navailable at https://github.com/IST-DASLab/MicroAdam.","lang":"eng"}],"external_id":{"arxiv":["2405.15593"]},"date_created":"2025-04-06T22:01:32Z","doi":"10.52202/079017-0001","publication_status":"published","article_processing_charge":"No","oa_version":"Preprint","publication_identifier":{"issn":["1049-5258"]},"intvolume":" 37","citation":{"ista":"Modoranu I-V, Safaryan M, Malinovsky G, Kurtic E, Robert T, Richtárik P, Alistarh D-A. 2024. MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence. 38th Conference on Neural Information Processing Systems. , Advances in Neural Information Processing Systems, vol. 37.","chicago":"Modoranu, Ionut-Vlad, Mher Safaryan, Grigory Malinovsky, Eldar Kurtic, Thomas Robert, Peter Richtárik, and Dan-Adrian Alistarh. “MICROADAM: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-0001.","ieee":"I.-V. Modoranu et al., “MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence,” in 38th Conference on Neural Information Processing Systems, 2024, vol. 37.","ama":"Modoranu I-V, Safaryan M, Malinovsky G, et al. MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-0001","short":"I.-V. Modoranu, M. Safaryan, G. Malinovsky, E. Kurtic, T. Robert, P. Richtárik, D.-A. Alistarh, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","mla":"Modoranu, Ionut-Vlad, et al. “MICROADAM: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-0001.","apa":"Modoranu, I.-V., Safaryan, M., Malinovsky, G., Kurtic, E., Robert, T., Richtárik, P., & Alistarh, D.-A. (2024). MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence. In 38th Conference on Neural Information Processing Systems (Vol. 37). Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-0001"},"publication":"38th Conference on Neural Information Processing Systems","related_material":{"link":[{"relation":"software","url":"https://github.com/IST-DASLab/MicroAdam"}]},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","status":"public","type":"conference","ec_funded":1,"project":[{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"alternative_title":["Advances in Neural Information Processing Systems"],"fulldoi":"https://doi.org/10.52202/079017-0001","date_updated":"2026-10-15T09:49:27Z","day":"20","scopus_import":"1","acknowledgement":"The authors thank Razvan Pascanu, Mahdi Nikdan and Soroush Tabesh for their valuable feedback, the IT department from Institute of Science and Technology Austria for the hardware support and Weights and Biases for the infrastructure to track all our experiments. Mher Safaryan has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No 101034413.","OA_type":"green","quality_controlled":"1","arxiv":1,"department":[{"_id":"DaAl"}],"year":"2024"},{"article_number":"L201114","abstract":[{"text":"We compute the rotational anisotropy of the free energy of 𝛼−RuCl3 in an external magnetic field. This quantity, known as the magnetotropic susceptibility, 𝑘, relates to the second derivative of the free energy with respect to the angle of rotation. We have used approximation-free, auxiliary-field quantum Monte Carlo simulations for a realistic model of 𝛼−RuCl3 and optimized the path integral to alleviate the negative sign problem. This allows us to reach temperatures down to 30K—an energy scale below the dominant Kitaev coupling. We demonstrate that the magnetotropic spin susceptibility in this model of 𝛼−RuCl3 displays scaling behavior 𝑘=𝑇𝑓(𝐵/𝑇) at high temperatures. Once the uniform susceptibility departs from the Curie law (i.e., at the energy scale of the exchange interactions), it appears to transition to an emergent scalinglike behavior, characterized by a different function 𝑓 at lower temperatures, stemming from the locality of torque fluctuations. We observe a remarkable numerical match between experiment and simulations and we also find qualitative agreement with the pure Kitaev model. In comparison, for the XXZ Heisenberg Hamiltonian, the scaling 𝑘=𝑇𝑓(𝐵/𝑇) breaks down at a temperature scale where the uniform spin susceptibility deviates from the Curie law and never reemerges at low temperatures.","lang":"eng"}],"author":[{"last_name":"Sato","first_name":"Toshihiro","full_name":"Sato, Toshihiro"},{"last_name":"Ramshaw","full_name":"Ramshaw, B. J.","first_name":"B. J."},{"last_name":"Modic","first_name":"Kimberly A","full_name":"Modic, Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147"},{"last_name":"Assaad","full_name":"Assaad, Fakher F.","first_name":"Fakher F."}],"external_id":{"arxiv":["2312.03080"],"isi":["001447562900001"]},"doi":"10.1103/PhysRevB.110.L201114","date_created":"2024-12-15T23:01:50Z","publication_status":"published","article_processing_charge":"No","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"oa_version":"Preprint","intvolume":" 110","citation":{"ista":"Sato T, Ramshaw BJ, Modic KA, Assaad FF. 2024. Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. 110(20), L201114.","chicago":"Sato, Toshihiro, B. J. Ramshaw, Kimberly A Modic, and Fakher F. Assaad. “Scale-Invariant Magnetic Anisotropy in α-RuCl3: A Quantum Monte Carlo Study.” Physical Review B. American Physical Society, 2024. https://doi.org/10.1103/PhysRevB.110.L201114.","ieee":"T. Sato, B. J. Ramshaw, K. A. Modic, and F. F. Assaad, “Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study,” Physical Review B, vol. 110, no. 20. American Physical Society, 2024.","ama":"Sato T, Ramshaw BJ, Modic KA, Assaad FF. Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. 2024;110(20). doi:10.1103/PhysRevB.110.L201114","short":"T. Sato, B.J. Ramshaw, K.A. Modic, F.F. Assaad, Physical Review B 110 (2024).","mla":"Sato, Toshihiro, et al. “Scale-Invariant Magnetic Anisotropy in α-RuCl3: A Quantum Monte Carlo Study.” Physical Review B, vol. 110, no. 20, L201114, American Physical Society, 2024, doi:10.1103/PhysRevB.110.L201114.","apa":"Sato, T., Ramshaw, B. J., Modic, K. A., & Assaad, F. F. (2024). Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.110.L201114"},"publication":"Physical Review B","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"das_tickbox":"0","OA_place":"repository","date_published":"2024-11-15T00:00:00Z","oa":1,"month":"11","volume":110,"publisher":"American Physical Society","_id":"18654","supplementarymaterial":"yes","title":"Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study","article_type":"letter_note","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2312.03080"}],"acknowledgement":"We gratefully acknowledge the Gauss Centre for Supercomputing e.V. for funding this project by providing computing time on the GCS Supercomputer SUPERMUC-NG at the Leibniz Supercomputing Centre (Project No. pn73xu) as well as the scientific support and HPC resources provided by the Erlangen National High Performance Computing Center (NHR@FAU) of the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) under the NHR Project b133ae. NHR funding is provided by federal and Bavarian state authorities. NHR@FAU hardware is partially funded by the German Research Foundation (DFG) – 440719683. T.S. thanks funding from the Deutsche Forschungsgemeinschaft under Grant No. SA 3986/1-1 as well as the Würzburg-Dresden Cluster of Excellence on Complexity and Topology in Quantum Matter ct.qmat (EXC 2147, Project ID 390858490). F.F.A. acknowledges financial support from the German Research Foundation (DFG) under the Grant AS 120/16-1 (Project No. 493886309) that is part of the collaborative research project SFB Q-M&S funded by the Austrian Science Fund (FWF) F 86. K.A.M. thanks financial support from the Austrian Science Fund, SFB F 86, Q-M&S.","researchdata_availability":"no","OA_type":"green","quality_controlled":"1","arxiv":1,"department":[{"_id":"KiMo"}],"year":"2024","status":"public","type":"journal_article","issue":"20","project":[{"_id":"34ac8b51-11ca-11ed-8bc3-86c15daa9f8f","grant_number":"F8607","name":"Center for Correlated Quantum Materials and Solid State Quantum Systems: Scale- invariance in entangled quantum spin systems"}],"fulldoi":"https://doi.org/10.1103/PhysRevB.110.L201114","date_updated":"2026-10-15T09:50:59Z","day":"15","scopus_import":"1"},{"publisher":"Neural Information Processing Systems Foundation","_id":"19511","title":"QuaRot: Outlier-free 4-bit inference in rotated LLMs","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2404.00456"}],"oa":1,"date_published":"2024-12-20T00:00:00Z","OA_place":"repository","volume":37,"month":"12","publication":"38th Conference on Neural Information Processing Systems","citation":{"mla":"Ashkboos, Saleh, et al. “QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-3180.","apa":"Ashkboos, S., Mohtashami, A., Croci, M. L., Li, B., Cameron, P., Jaggi, M., … Hensman, J. (2024). QuaRot: Outlier-free 4-bit inference in rotated LLMs. In 38th Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-3180","ama":"Ashkboos S, Mohtashami A, Croci ML, et al. QuaRot: Outlier-free 4-bit inference in rotated LLMs. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-3180","short":"S. Ashkboos, A. Mohtashami, M.L. Croci, B. Li, P. Cameron, M. Jaggi, D.-A. Alistarh, T. Hoefler, J. Hensman, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ista":"Ashkboos S, Mohtashami A, Croci ML, Li B, Cameron P, Jaggi M, Alistarh D-A, Hoefler T, Hensman J. 2024. QuaRot: Outlier-free 4-bit inference in rotated LLMs. 38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","chicago":"Ashkboos, Saleh, Amirkeivan Mohtashami, Maximilian L. Croci, Bo Li, Pashmina Cameron, Martin Jaggi, Dan-Adrian Alistarh, Torsten Hoefler, and James Hensman. “QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-3180.","ieee":"S. Ashkboos et al., “QuaRot: Outlier-free 4-bit inference in rotated LLMs,” in 38th Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37."},"intvolume":" 37","language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"software","url":"https://github.com/spcl/QuaRot"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2404.00456"]},"abstract":[{"text":"We introduce QuaRot, a new Quantization scheme based on Rotations, which is able to quantize LLMs end-to-end, including all weights, activations, and KV cache in 4 bits. QuaRot rotates LLMs in a way that removes outliers from the hidden state without changing the output, making quantization easier. This computational invariance is applied to the hidden state (residual) of the LLM, as well as to the activations of the feed-forward components, aspects of the attention mechanism, and to the KV cache. The result is a quantized model where all matrix multiplications are performed in 4 bits, without any channels identified for retention in higher precision. Our 4-bit quantized LLAMA2-70B model has losses of at most 0.47 WikiText-2 perplexity and retains 99% of the zero-shot performance. We also show that QuaRot can provide lossless 6 and 8 bit LLAMA-2 models without any calibration data using round-to-nearest quantization. Code is available at github.com/spcl/QuaRot.","lang":"eng"}],"author":[{"last_name":"Ashkboos","full_name":"Ashkboos, Saleh","first_name":"Saleh"},{"full_name":"Mohtashami, Amirkeivan","first_name":"Amirkeivan","last_name":"Mohtashami"},{"first_name":"Maximilian L.","full_name":"Croci, Maximilian L.","last_name":"Croci"},{"full_name":"Li, Bo","first_name":"Bo","last_name":"Li"},{"last_name":"Cameron","first_name":"Pashmina","full_name":"Cameron, Pashmina"},{"last_name":"Jaggi","full_name":"Jaggi, Martin","first_name":"Martin"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hoefler, Torsten","first_name":"Torsten","last_name":"Hoefler"},{"last_name":"Hensman","first_name":"James","full_name":"Hensman, James"}],"publication_status":"published","doi":"10.52202/079017-3180","article_processing_charge":"No","date_created":"2025-04-06T22:01:32Z","oa_version":"Preprint","publication_identifier":{"issn":["1049-5258"]},"date_updated":"2026-10-15T09:50:27Z","day":"20","fulldoi":"https://doi.org/10.52202/079017-3180","scopus_import":"1","status":"public","type":"conference","alternative_title":["Advances in Neural Information Processing Systems"],"arxiv":1,"department":[{"_id":"DaAl"}],"year":"2024","quality_controlled":"1","OA_type":"green","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-09","location":"Vancouver, Canada","end_date":"2024-12-15"}},{"das_tickbox":"0","date_published":"2024-02-01T00:00:00Z","volume":109,"month":"02","title":"Frustrated magnetism in octahedra-based Ce6 Ni6 P17","article_type":"original","publisher":"American Physical Society","_id":"15003","supplementarymaterial":"yes","date_created":"2024-02-18T23:01:01Z","doi":"10.1103/PhysRevB.109.054405","article_processing_charge":"No","publication_status":"published","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"oa_version":"None","article_number":"054405","external_id":{"isi":["001198571800008"]},"author":[{"full_name":"Franco, D. G.","first_name":"D. G.","last_name":"Franco"},{"full_name":"Avalos, R.","first_name":"R.","last_name":"Avalos"},{"first_name":"D.","full_name":"Hafner, D.","last_name":"Hafner"},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A","first_name":"Kimberly A","last_name":"Modic"},{"last_name":"Prots","full_name":"Prots, Yu","first_name":"Yu"},{"first_name":"O.","full_name":"Stockert, O.","last_name":"Stockert"},{"full_name":"Hoser, A.","first_name":"A.","last_name":"Hoser"},{"last_name":"Moll","first_name":"P. J.W.","full_name":"Moll, P. J.W."},{"last_name":"Brando","first_name":"M.","full_name":"Brando, M."},{"full_name":"Aligia, A. A.","first_name":"A. A.","last_name":"Aligia"},{"last_name":"Geibel","full_name":"Geibel, C.","first_name":"C."}],"abstract":[{"lang":"eng","text":"Magnetic frustration allows to access novel and intriguing properties of magnetic systems and has been explored mainly in planar triangular-like arrays of magnetic ions. In this work, we describe the phosphide Ce6Ni6P17, where the Ce+3 ions accommodate in a body-centered cubic lattice of Ce6 regular octahedra. From measurements of magnetization, specific heat, and resistivity, we determine a rich phase diagram as a function of temperature and magnetic field in which different magnetic phases are found. Besides clear evidence of magnetic frustration is obtained from entropy analysis. At zero field, a second-order antiferromagnetic transition occurs at TN1≈1 K followed by a first-order transition at TN2≈0.45 K. With magnetic field new magnetic phases appear, including a weakly first-order transition which ends in a classical critical point and a third magnetic phase. We also study the exact solution of the spin-1/2 Heisenberg model in an octahedron which allows us a qualitative understanding of the phase diagram and compare with the experimental results."}],"language":[{"iso":"eng"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Physical Review B","citation":{"short":"D.G. Franco, R. Avalos, D. Hafner, K.A. Modic, Y. Prots, O. Stockert, A. Hoser, P.J.W. Moll, M. Brando, A.A. Aligia, C. Geibel, Physical Review B 109 (2024).","ama":"Franco DG, Avalos R, Hafner D, et al. Frustrated magnetism in octahedra-based Ce6 Ni6 P17. Physical Review B. 2024;109(5). doi:10.1103/PhysRevB.109.054405","ieee":"D. G. Franco et al., “Frustrated magnetism in octahedra-based Ce6 Ni6 P17,” Physical Review B, vol. 109, no. 5. American Physical Society, 2024.","chicago":"Franco, D. G., R. Avalos, D. Hafner, Kimberly A Modic, Yu Prots, O. Stockert, A. Hoser, et al. “Frustrated Magnetism in Octahedra-Based Ce6 Ni6 P17.” Physical Review B. American Physical Society, 2024. https://doi.org/10.1103/PhysRevB.109.054405.","ista":"Franco DG, Avalos R, Hafner D, Modic KA, Prots Y, Stockert O, Hoser A, Moll PJW, Brando M, Aligia AA, Geibel C. 2024. Frustrated magnetism in octahedra-based Ce6 Ni6 P17. Physical Review B. 109(5), 054405.","apa":"Franco, D. G., Avalos, R., Hafner, D., Modic, K. A., Prots, Y., Stockert, O., … Geibel, C. (2024). Frustrated magnetism in octahedra-based Ce6 Ni6 P17. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.109.054405","mla":"Franco, D. G., et al. “Frustrated Magnetism in Octahedra-Based Ce6 Ni6 P17.” Physical Review B, vol. 109, no. 5, 054405, American Physical Society, 2024, doi:10.1103/PhysRevB.109.054405."},"intvolume":" 109","issue":"5","status":"public","type":"journal_article","scopus_import":"1","day":"01","date_updated":"2026-10-15T09:50:31Z","fulldoi":"https://doi.org/10.1103/PhysRevB.109.054405","quality_controlled":"1","researchdata_availability":"no","acknowledgement":"The authors thank Bernardo Pentke for the SEM micrographs (Departamento Fisicoquímica de Materiales CABCNEA). We are indebted to Julián Sereni for useful discussions. D. G. F. acknowledges financial support provided by Agencia I+D+i, Argentina, Grant No. PICT-2021-I-INVI00852 and Universidad Nacional de Cuyo (SIIP) Grant No. 06/C018-T1. A. A. A. acknowledges financial support provided by PICT 2018-01546 and PICT 2020A-03661 of the\r\nAgencia I+D+i. ","department":[{"_id":"KiMo"}],"year":"2024"},{"researchdata_availability":"unclear","OA_type":"green","quality_controlled":"1","year":"2024","department":[{"_id":"JuFi"}],"arxiv":1,"issue":"1","page":"111-148","type":"journal_article","status":"public","scopus_import":"1","fulldoi":"https://doi.org/10.1512/iumj.2024.73.9701","day":"01","date_updated":"2026-10-15T09:49:54Z","publication_identifier":{"issn":["0022-2518"]},"oa_version":"Preprint","doi":"10.1512/iumj.2024.73.9701","article_processing_charge":"No","date_created":"2025-01-27T15:20:19Z","publication_status":"published","abstract":[{"text":"We study weak solutions to mean curvature flow satisfying Young’s angle condition for general contact angles α ∈ (0, π). First, we construct BV solutions by using the Allen-Cahn approximation with boundary contact energy as proposed by Owen and Sternberg. Second, we prove the weak-strong uniqueness and stability for this solution concept. The main ingredient for both results is a relative energy, which can also be interpreted as a tilt excess. ","lang":"eng"}],"author":[{"id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072","first_name":"Sebastian","full_name":"Hensel, Sebastian","last_name":"Hensel"},{"full_name":"Laux, Tim","first_name":"Tim","last_name":"Laux"}],"external_id":{"arxiv":["2112.11150"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","language":[{"iso":"eng"}],"intvolume":" 73","citation":{"mla":"Hensel, Sebastian, and Tim Laux. “BV Solutions for Mean Curvature Flow with Constant Angle: Allen-Cahn Approximation and Weak-Strong Uniqueness.” Indiana University Mathematics Journal, vol. 73, no. 1, Indiana University Mathematics Journal, 2024, pp. 111–48, doi:10.1512/iumj.2024.73.9701.","apa":"Hensel, S., & Laux, T. (2024). BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness. Indiana University Mathematics Journal. Indiana University Mathematics Journal. https://doi.org/10.1512/iumj.2024.73.9701","chicago":"Hensel, Sebastian, and Tim Laux. “BV Solutions for Mean Curvature Flow with Constant Angle: Allen-Cahn Approximation and Weak-Strong Uniqueness.” Indiana University Mathematics Journal. Indiana University Mathematics Journal, 2024. https://doi.org/10.1512/iumj.2024.73.9701.","ista":"Hensel S, Laux T. 2024. BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness. Indiana University Mathematics Journal. 73(1), 111–148.","ieee":"S. Hensel and T. Laux, “BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness,” Indiana University Mathematics Journal, vol. 73, no. 1. Indiana University Mathematics Journal, pp. 111–148, 2024.","ama":"Hensel S, Laux T. BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness. Indiana University Mathematics Journal. 2024;73(1):111-148. doi:10.1512/iumj.2024.73.9701","short":"S. Hensel, T. Laux, Indiana University Mathematics Journal 73 (2024) 111–148."},"publication":"Indiana University Mathematics Journal","volume":73,"month":"01","OA_place":"repository","date_published":"2024-01-01T00:00:00Z","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2112.11150"}],"article_type":"original","title":"BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness","supplementarymaterial":"unclear","_id":"18926","publisher":"Indiana University Mathematics Journal"},{"type":"preprint","status":"public","date_updated":"2026-10-15T09:51:45Z","day":"29","fulldoi":"https://doi.org/10.48550/arXiv.2401.16252","acknowledgement":"This work was supported by the French Agence Nationale de la Recherche (ANR) under references ANR-21-CE40-0020 (CONVERGENCE project) and ANR-20-CE40-0002 (GrHyDy), and by Fondecyt grant 1220174. This collaboration was mainly conducted during a 1-year visit of Bruno Ziliotto to the Center for Mathematical Modeling (CMM) at University of Chile in 2023,\r\nunder the IRL program of CNRS.","researchdata_availability":"no","arxiv":1,"year":"2024","department":[{"_id":"KrCh"}],"month":"01","oa":1,"das_tickbox":"0","date_published":"2024-01-29T00:00:00Z","_id":"17101","supplementarymaterial":"no","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2401.16252"}],"title":"Zero-sum random games on directed graphs","external_id":{"arxiv":["2401.16252"]},"author":[{"last_name":"Attia","full_name":"Attia, Luc","first_name":"Luc"},{"last_name":"Lichev","first_name":"Lyuben","full_name":"Lichev, Lyuben"},{"first_name":"Dieter","full_name":"Mitsche, Dieter","last_name":"Mitsche"},{"last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","first_name":"Raimundo J"},{"full_name":"Ziliotto, Bruno","first_name":"Bruno","last_name":"Ziliotto"}],"abstract":[{"lang":"eng","text":"This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players.\r\nStarting from a fixed vertex, players take turns to move a token along the edges of the graph.\r\nOn the one hand, for acyclic directed graphs of bounded degree and sub-exponential expansion, we show that the value of the game converges almost surely to a constant at an exponential rate dominated in terms of the expansion.\r\nOn the other hand, for the infinite d-ary tree that does not fall into the previous class of graphs, we show convergence at a double-exponential rate in terms of the expansion."}],"article_number":"2401.16252","oa_version":"Preprint","date_created":"2024-06-03T07:45:22Z","publication_status":"submitted","article_processing_charge":"No","doi":"10.48550/arXiv.2401.16252","publication":"arXiv","citation":{"apa":"Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., & Ziliotto, B. (n.d.). Zero-sum random games on directed graphs. arXiv. https://doi.org/10.48550/arXiv.2401.16252","mla":"Attia, Luc, et al. “Zero-Sum Random Games on Directed Graphs.” ArXiv, 2401.16252, doi:10.48550/arXiv.2401.16252.","ista":"Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Zero-sum random games on directed graphs. arXiv, 2401.16252.","ieee":"L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Zero-sum random games on directed graphs,” arXiv. .","chicago":"Attia, Luc, Lyuben Lichev, Dieter Mitsche, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Zero-Sum Random Games on Directed Graphs.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2401.16252.","ama":"Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Zero-sum random games on directed graphs. arXiv. doi:10.48550/arXiv.2401.16252","short":"L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, ArXiv (n.d.)."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","isi":1,"citation":{"chicago":"Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11.","ieee":"J. Hirvonen, L. Schmid, K. Chatterjee, and S. Schmid, “On the convergence time in graphical games: A locality-sensitive approach,” in 27th International Conference on Principles of Distributed Systems, Tokyo, Japan, 2024, vol. 286.","ista":"Hirvonen J, Schmid L, Chatterjee K, Schmid S. 2024. On the convergence time in graphical games: A locality-sensitive approach. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 11.","ama":"Hirvonen J, Schmid L, Chatterjee K, Schmid S. On the convergence time in graphical games: A locality-sensitive approach. In: 27th International Conference on Principles of Distributed Systems. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.OPODIS.2023.11","short":"J. Hirvonen, L. Schmid, K. Chatterjee, S. Schmid, in:, 27th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","apa":"Hirvonen, J., Schmid, L., Chatterjee, K., & Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11","mla":"Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” 27th International Conference on Principles of Distributed Systems, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.OPODIS.2023.11."},"intvolume":" 286","publication":"27th International Conference on Principles of Distributed Systems","article_processing_charge":"No","doi":"10.4230/LIPIcs.OPODIS.2023.11","date_created":"2024-02-18T23:01:01Z","publication_status":"published","oa_version":"Published Version","publication_identifier":{"isbn":["9783959773089"],"issn":["1868-8969"]},"article_number":"11","file_date_updated":"2024-02-26T09:04:58Z","author":[{"last_name":"Hirvonen","first_name":"Juho","full_name":"Hirvonen, Juho"},{"last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329","first_name":"Laura","full_name":"Schmid, Laura"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"abstract":[{"text":"Graphical games are a useful framework for modeling the interactions of (selfish) agents who are connected via an underlying topology and whose behaviors influence each other. They have wide applications ranging from computer science to economics and biology. Yet, even though an agent’s payoff only depends on the actions of their direct neighbors in graphical games, computing the Nash equilibria and making statements about the convergence time of \"natural\" local dynamics in particular can be highly challenging. In this work, we present a novel approach for classifying complexity of Nash equilibria in graphical games by establishing a connection to local graph algorithms, a subfield of distributed computing. In particular, we make the observation that the equilibria of graphical games are equivalent to locally verifiable labelings (LVL) in graphs; vertex labelings which are verifiable with constant-round local algorithms. This connection allows us to derive novel lower bounds on the convergence time to equilibrium of best-response dynamics in graphical games. Since we establish that distributed convergence can sometimes be provably slow, we also introduce and give bounds on an intuitive notion of \"time-constrained\" inefficiency of best responses. We exemplify how our results can be used in the implementation of mechanisms that ensure convergence of best responses to a Nash equilibrium. Our results thus also give insight into the convergence of strategy-proof algorithms for graphical games, which is still not well understood.","lang":"eng"}],"external_id":{"isi":["001585185800011"],"arxiv":["2102.13457"]},"title":"On the convergence time in graphical games: A locality-sensitive approach","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","supplementarymaterial":"no","_id":"15006","date_published":"2024-01-18T00:00:00Z","das_tickbox":"0","oa":1,"month":"01","volume":286,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"KrCh"}],"file":[{"date_updated":"2024-02-26T09:04:58Z","creator":"dernst","content_type":"application/pdf","file_name":"2024_LIPICs_Hirvonen.pdf","relation":"main_file","success":1,"date_created":"2024-02-26T09:04:58Z","file_id":"15028","access_level":"open_access","checksum":"4fc7eea6e4ba140b904781fc7df868ec","file_size":867363}],"year":"2024","arxiv":1,"researchdata_availability":"no","conference":{"name":"OPODIS: Conference on Principles of Distributed Systems","start_date":"2023-12-06","end_date":"2023-12-08","location":"Tokyo, Japan"},"quality_controlled":"1","acknowledgement":"This work was partially funded by the Academy of Finland, grant 314888, the European Research Council CoG 863818 (ForM-SMArt), and the Austrian Science Fund (FWF) project I 4800-N (ADVISE). LS was supported by the Stochastic Analysis and Application Research Center (SAARC) under National Research Foundation of Korea grant NRF-2019R1A5A1028324.","ddc":["000"],"scopus_import":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11","date_updated":"2026-10-15T10:07:37Z","day":"18","ec_funded":1,"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"alternative_title":["LIPIcs"],"has_accepted_license":"1","status":"public","type":"conference"},{"month":"07","volume":14683,"oa":1,"das_tickbox":"1","date_published":"2024-07-01T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Playing games with your PET: Extending the Partial Exploration Tool to stochastic games","supplementarymaterial":"no","_id":"17402","publisher":"Springer Nature","oa_version":"Published Version","publication_identifier":{"isbn":["9783031656323"],"eisbn":["9783031656330"],"eissn":["1611-3349"],"issn":["0302-9743"]},"doi":"10.1007/978-3-031-65633-0_16","article_processing_charge":"Yes (in subscription journal)","date_created":"2024-08-09T11:24:54Z","publication_status":"published","external_id":{"isi":["001307897000016"],"arxiv":["2405.03885"]},"author":[{"last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","full_name":"Meggendorfer, Tobias"},{"first_name":"Maximilian","full_name":"Weininger, Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881","orcid":"0000-0002-0163-2152","last_name":"Weininger"}],"abstract":[{"lang":"eng","text":"We present version 2.0 of the Partial Exploration Tool (PET), a tool for verification of probabilistic systems. We extend the previous version by adding support for stochastic games, based on a recent unified framework for sound value iteration algorithms. Thereby, PET2 is the first tool implementing a sound and efficient approach for solving stochastic games with objectives of the type reachability/safety and mean payoff. We complement this approach by developing and implementing a partial-exploration based variant for all three objectives. Our experimental evaluation shows that PET2 offers the most efficient partial-exploration based algorithm and is the most viable tool on SGs, even outperforming unsound tools."}],"file_date_updated":"2024-08-12T08:39:12Z","isi":1,"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"publication":"36th International Conference on Computer Aided Verification","citation":{"chicago":"Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games.” In 36th International Conference on Computer Aided Verification, 14683:359–72. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-65633-0_16.","ista":"Meggendorfer T, Weininger M. 2024. Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. 36th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 14683, 359–372.","ieee":"T. Meggendorfer and M. Weininger, “Playing games with your PET: Extending the Partial Exploration Tool to stochastic games,” in 36th International Conference on Computer Aided Verification, Montreal, Canada, 2024, vol. 14683, pp. 359–372.","ama":"Meggendorfer T, Weininger M. Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In: 36th International Conference on Computer Aided Verification. Vol 14683. Springer Nature; 2024:359-372. doi:10.1007/978-3-031-65633-0_16","short":"T. Meggendorfer, M. Weininger, in:, 36th International Conference on Computer Aided Verification, Springer Nature, 2024, pp. 359–372.","apa":"Meggendorfer, T., & Weininger, M. (2024). Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In 36th International Conference on Computer Aided Verification (Vol. 14683, pp. 359–372). Montreal, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-65633-0_16","mla":"Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games.” 36th International Conference on Computer Aided Verification, vol. 14683, Springer Nature, 2024, pp. 359–72, doi:10.1007/978-3-031-65633-0_16."},"intvolume":" 14683","alternative_title":["LNCS"],"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"ec_funded":1,"page":"359-372","type":"conference","status":"public","has_accepted_license":"1","scopus_import":"1","ddc":["000"],"day":"01","date_updated":"2026-10-15T10:06:48Z","fulldoi":"https://doi.org/10.1007/978-3-031-65633-0_16","quality_controlled":"1","conference":{"name":"CAV: Computer Aided Verification","start_date":"2024-07-24","location":"Montreal, Canada","end_date":"2024-07-27"},"researchdata_availability":"yes","acknowledgement":"M. Weininger has received funding from the EU’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 101034413.","year":"2024","file":[{"file_size":368487,"date_created":"2024-08-12T08:39:12Z","access_level":"open_access","file_id":"17419","checksum":"c888231d0a47b55786b7b4c0f02216bb","success":1,"content_type":"application/pdf","relation":"main_file","file_name":"2024_CAV_Meggendorfer.pdf","creator":"dernst","date_updated":"2024-08-12T08:39:12Z"}],"dataavailabilitystatement":"We refer to the artefact with the exact code used for the submission and all logs [31], and the gitlab with the continually developed source code [30].","department":[{"_id":"KrCh"}],"arxiv":1},{"project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"issue":"OOPSLA1","ec_funded":1,"status":"public","has_accepted_license":"1","type":"journal_article","ddc":["000"],"scopus_import":"1","date_updated":"2026-10-15T10:02:32Z","day":"29","fulldoi":"https://doi.org/10.1145/3649824","quality_controlled":"1","researchdata_availability":"yes","acknowledgement":"This work was supported in part by the European Research Council (ERC) under Grant No. 863818\r\n(ForM-SMArt) and the Hong Kong Research Grants Council under ECS Project No. 26208122.","dataavailabilitystatement":"The software that supports Section 8 is available on Zenodo [Meggendorfer and Žikelić 2024]. https://doi.org/10.5281/zenodo.10457566","department":[{"_id":"KrCh"}],"year":"2024","file":[{"date_updated":"2024-06-27T07:48:16Z","content_type":"application/pdf","file_name":"2024_ProcACMProgLanguage_Chatterjee.pdf","relation":"main_file","creator":"dernst","success":1,"file_size":413096,"date_created":"2024-06-27T07:48:16Z","access_level":"open_access","file_id":"17182","checksum":"9243ded966f71df1572be5466019be5c"}],"oa":1,"date_published":"2024-04-29T00:00:00Z","das_tickbox":"1","volume":8,"month":"04","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Quantitative bounds on resource usage of probabilistic programs","article_type":"original","publisher":"Association for Computing Machinery","supplementarymaterial":"no","_id":"17162","date_created":"2024-06-23T22:01:02Z","publication_status":"published","doi":"10.1145/3649824","article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"eissn":["2475-1421"]},"oa_version":"Published Version","file_date_updated":"2024-06-27T07:48:16Z","article_number":"107","abstract":[{"lang":"eng","text":"Cost analysis, also known as resource usage analysis, is the task of finding bounds on the total cost of a program and is a well-studied problem in static analysis. In this work, we consider two classical quantitative problems in cost analysis for probabilistic programs. The first problem is to find a bound on the expected total cost of the program. This is a natural measure for the resource usage of the program and can also be directly applied to average-case runtime analysis. The second problem asks for a tail bound, i.e. given a threshold t the goal is to find a probability bound p such that ℙ[total cost ≥ t] ≤ p. Intuitively, given a threshold t on the resource, the problem is to find the likelihood that the total cost exceeds this threshold.\r\nFirst, for expectation bounds, a major obstacle in previous works on cost analysis is that they can handle only non-negative costs or bounded variable updates. In contrast, we provide a new variant of the standard notion of cost martingales, that allows us to find expectation bounds for a class of programs with general positive or negative costs and no restriction on the variable updates. More specifically, our approach is applicable as long as there is a lower bound on the total cost incurred along every path.\r\nSecond, for tail bounds, all previous methods are limited to programs in which the expected total cost is finite. In contrast, we present a novel approach, based on a combination of our martingale-based method for expectation bounds with a quantitative safety analysis, to obtain a solution to the tail bound problem that is applicable even to programs with infinite expected cost. Specifically, this allows us to obtain runtime tail bounds for programs that do not terminate almost-surely.\r\nIn summary, we provide a novel combination of martingale-based cost analysis and quantitative safety analysis that is able to find expectation and tail cost bounds for probabilistic programs, without the restrictions of non-negative costs, bounded updates, or finiteness of the expected total cost. Finally, we provide experimental results showcasing that our approach can solve instances that were beyond the reach of previous methods."}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady"},{"last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","first_name":"Tobias"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"23140"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Proceedings of the ACM on Programming Languages","citation":{"ieee":"K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Quantitative bounds on resource usage of probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1. Association for Computing Machinery, 2024.","ista":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2024. Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. 8(OOPSLA1), 107.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Quantitative Bounds on Resource Usage of Probabilistic Programs.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2024. https://doi.org/10.1145/3649824.","ama":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. 2024;8(OOPSLA1). doi:10.1145/3649824","short":"K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).","mla":"Chatterjee, Krishnendu, et al. “Quantitative Bounds on Resource Usage of Probabilistic Programs.” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1, 107, Association for Computing Machinery, 2024, doi:10.1145/3649824.","apa":"Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2024). Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3649824"},"intvolume":" 8"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","language":[{"iso":"eng"}],"publication":"38th Conference on Neural Information Processing Systems","citation":{"ista":"Andersson JD, Henzinger M, Pagh R, Steiner TA, Upadhyay J. 2024. Continual counting with gradual privacy expiration. 38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","ieee":"J. D. Andersson, M. Henzinger, R. Pagh, T. A. Steiner, and J. Upadhyay, “Continual counting with gradual privacy expiration,” in 38th Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","chicago":"Andersson, Joel Daniel, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, and Jalaj Upadhyay. “Continual Counting with Gradual Privacy Expiration.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-0299.","short":"J.D. Andersson, M. Henzinger, R. Pagh, T.A. Steiner, J. Upadhyay, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ama":"Andersson JD, Henzinger M, Pagh R, Steiner TA, Upadhyay J. Continual counting with gradual privacy expiration. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-0299","apa":"Andersson, J. D., Henzinger, M., Pagh, R., Steiner, T. A., & Upadhyay, J. (2024). Continual counting with gradual privacy expiration. In 38th Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-0299","mla":"Andersson, Joel Daniel, et al. “Continual Counting with Gradual Privacy Expiration.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-0299."},"intvolume":" 37","oa_version":"Preprint","publication_identifier":{"eissn":["1049-5258"]},"date_created":"2025-04-06T22:01:32Z","publication_status":"published","article_processing_charge":"No","doi":"10.52202/079017-0299","external_id":{"arxiv":["2406.03802"]},"author":[{"full_name":"Andersson, Joel Daniel","first_name":"Joel Daniel","last_name":"Andersson"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"full_name":"Pagh, Rasmus","first_name":"Rasmus","last_name":"Pagh"},{"first_name":"Teresa Anna","full_name":"Steiner, Teresa Anna","last_name":"Steiner"},{"first_name":"Jalaj","full_name":"Upadhyay, Jalaj","last_name":"Upadhyay"}],"abstract":[{"lang":"eng","text":"Differential privacy with gradual expiration models the setting where data items\r\narrive in a stream and at a given time t the privacy loss guaranteed for a data item\r\nseen at time (t − d) is εg(d), where g is a monotonically non-decreasing function.\r\nWe study the fundamental continual (binary) counting problem where each data\r\nitem consists of a bit, and the algorithm needs to output at each time step the sum of\r\nall the bits streamed so far. For a stream of length T and privacy without expiration\r\ncontinual counting is possible with maximum (over all time steps) additive error\r\nO(log2\r\n(T)/ε) and the best known lower bound is Ω(log(T)/ε); closing this gap\r\nis a challenging open problem.\r\nWe show that the situation is very different for privacy with gradual expiration by\r\ngiving upper and lower bounds for a large set of expiration functions g. Specifically,\r\nour algorithm achieves an additive error of O(log(T)/ε) for a large set of privacy\r\nexpiration functions. We also give a lower bound that shows that if C is the additive\r\nerror of any ε-DP algorithm for this problem, then the product of C and the privacy\r\nexpiration function after 2C steps must be Ω(log(T)/ε). Our algorithm matches\r\nthis lower bound as its additive error is O(log(T)/ε), even when g(2C) = O(1).\r\nOur empirical evaluation shows that we achieve a slowly growing privacy loss\r\nwith significantly smaller empirical privacy loss for large values of d than a natural\r\nbaseline algorithm."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.03802"}],"title":"Continual counting with gradual privacy expiration","_id":"19512","publisher":"Neural Information Processing Systems Foundation","volume":37,"month":"12","oa":1,"OA_place":"repository","date_published":"2024-12-20T00:00:00Z","year":"2024","department":[{"_id":"MoHe"}],"arxiv":1,"quality_controlled":"1","OA_type":"green","conference":{"location":"Vancouver, Canada","end_date":"2024-12-15","name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-09"},"acknowledgement":"Monika Henzinger: 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. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Joel Daniel Andersson and Rasmus Pagh are affiliated with Basic Algorithms Research Copenhagen (BARC), supported by the VILLUM Foundation grant 16582, and are also supported by Providentia, a Data Science Distinguished Investigator grant from Novo Nordisk Fonden. Teresa Anna Steiner is supported by a research grant (VIL51463) from VILLUM FONDEN. This work was done while Teresa Anna Steiner was a Postdoc at the Technical University of Denmark. Jalaj Upadhyay’s research was funded by the Rutgers Decanal Grant no. 302918 and an unrestricted gift from Google.","scopus_import":"1","date_updated":"2026-10-15T09:52:07Z","day":"20","fulldoi":"https://doi.org/10.52202/079017-0299","alternative_title":["Advances in Neural Information Processing Systems"],"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422","name":"Efficient algorithms"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"ec_funded":1,"type":"conference","status":"public"},{"author":[{"last_name":"Fumero","full_name":"Fumero, Marco","first_name":"Marco","id":"1c1593eb-393f-11ef-bb8e-ab4f1e979650"},{"last_name":"Pegoraro","first_name":"Marco","full_name":"Pegoraro, Marco"},{"full_name":"Maiorca, Valentino","first_name":"Valentino","last_name":"Maiorca"},{"first_name":"Francesco","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello"},{"last_name":"Rodolà","first_name":"Emanuele","full_name":"Rodolà, Emanuele"}],"abstract":[{"lang":"eng","text":"Neural models learn data representations that lie on low-dimensional manifolds,\r\nyet modeling the relation between these representational spaces is an ongoing challenge. By integrating spectral geometry principles into neural modeling, we show\r\nthat this problem can be better addressed in the functional domain, mitigating complexity, while enhancing interpretability and performances on downstream tasks.\r\nTo this end, we introduce a multi-purpose framework to the representation learning\r\ncommunity, which allows to: (i) compare different spaces in an interpretable way\r\nand measure their intrinsic similarity; (ii) find correspondences between them, both\r\nin unsupervised and weakly supervised settings, and (iii) to effectively transfer\r\nrepresentations between distinct spaces. We validate our framework on various\r\napplications, ranging from stitching to retrieval tasks, and on multiple modalities,\r\ndemonstrating that Latent Functional Maps can serve as a swiss-army knife for\r\nrepresentation alignment"}],"external_id":{"arxiv":["2406.14183"]},"publication_identifier":{"eissn":["1049-5258"]},"oa_version":"Preprint","publication_status":"published","doi":"10.52202/079017-2115","article_processing_charge":"No","date_created":"2025-04-06T22:01:32Z","intvolume":" 37","citation":{"ieee":"M. Fumero, M. Pegoraro, V. Maiorca, F. Locatello, and E. Rodolà, “Latent functional maps: A spectral framework for representation alignment,” in 38th Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","chicago":"Fumero, Marco, Marco Pegoraro, Valentino Maiorca, Francesco Locatello, and Emanuele Rodolà. “Latent Functional Maps: A Spectral Framework for Representation Alignment.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-2115.","ista":"Fumero M, Pegoraro M, Maiorca V, Locatello F, Rodolà E. 2024. Latent functional maps: A spectral framework for representation alignment. 38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","short":"M. Fumero, M. Pegoraro, V. Maiorca, F. Locatello, E. Rodolà, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ama":"Fumero M, Pegoraro M, Maiorca V, Locatello F, Rodolà E. Latent functional maps: A spectral framework for representation alignment. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-2115","apa":"Fumero, M., Pegoraro, M., Maiorca, V., Locatello, F., & Rodolà, E. (2024). Latent functional maps: A spectral framework for representation alignment. In 38th Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-2115","mla":"Fumero, Marco, et al. “Latent Functional Maps: A Spectral Framework for Representation Alignment.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-2115."},"publication":"38th Conference on Neural Information Processing Systems","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"12","volume":37,"date_published":"2024-12-20T00:00:00Z","OA_place":"repository","oa":1,"_id":"19515","publisher":"Neural Information Processing Systems Foundation","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2406.14183","open_access":"1"}],"title":"Latent functional maps: A spectral framework for representation alignment","acknowledgement":"MF is supported by the MSCA IST-Bridge fellowship which has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement No 101034413. ER and VM are supported by the PNRR MUR project PE0000013-FAIR. MP is supported by the Sapienza grant \"Predicting and Explaining Clinical Trial Outcomes\", prot. RG12218166FA3F13.","conference":{"location":"Vancouver, Canada","end_date":"2024-12-15","name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-09"},"OA_type":"green","quality_controlled":"1","arxiv":1,"year":"2024","department":[{"_id":"FrLo"}],"type":"conference","status":"public","alternative_title":["Advances in Neural Information Processing Systems"],"ec_funded":1,"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"fulldoi":"https://doi.org/10.52202/079017-2115","date_updated":"2026-10-15T09:52:55Z","day":"20","scopus_import":"1"},{"ddc":["000"],"title":"Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.10457565","open_access":"1"}],"publisher":"Zenodo","date_updated":"2026-10-15T10:02:33Z","_id":"23140","day":"05","fulldoi":"https://doi.org/10.5281/zenodo.10457565","contributor":[{"last_name":"Meggendorfer","contributor_type":"contact_person","first_name":"Tobias"}],"oa":1,"OA_place":"repository","date_published":"2024-03-05T00:00:00Z","month":"03","status":"public","type":"research_data_reference","related_material":{"record":[{"relation":"used_in_publication","id":"17162","status":"public"}]},"department":[{"_id":"KrCh"}],"year":"2024","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"Đ. Žikelić, (2024).","ama":" Žikelić Đ. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. 2024. doi:10.5281/zenodo.10457565","ista":" Žikelić Đ. 2024. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs, Zenodo, 10.5281/zenodo.10457565.","ieee":"Đ. Žikelić, “Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs.” Zenodo, 2024.","chicago":" Žikelić, Đorđe. “Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs.” Zenodo, 2024. https://doi.org/10.5281/zenodo.10457565.","apa":" Žikelić, Đ. (2024). Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. Zenodo. https://doi.org/10.5281/zenodo.10457565","mla":" Žikelić, Đorđe. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. Zenodo, 2024, doi:10.5281/zenodo.10457565."},"article_processing_charge":"No","date_created":"2026-10-15T10:02:22Z","doi":"10.5281/zenodo.10457565","oa_version":"None","OA_type":"green","author":[{"last_name":" Žikelić","first_name":"Đorđe","full_name":" Žikelić, Đorđe"}],"abstract":[{"lang":"eng","text":"The artefact for the OOPSLA 2024 paper \"Quantitative Bounds on Resource Usage of Probabilistic Programs\".\r\n\r\n"}]},{"APC_amount":"3041,76 EUR","has_accepted_license":"1","status":"public","type":"journal_article","ec_funded":1,"issue":"10","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"fulldoi":"https://doi.org/10.1073/pnas.2315558121","pmid":1,"day":"05","date_updated":"2026-10-15T10:10:26Z","ddc":["000"],"scopus_import":"1","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.), the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement #754411 and the French Agence Nationale de la Recherche (under the Investissement d’Avenir Programme, ANR-17-EURE-0010) (to M.K.).","researchdata_availability":"yes","OA_type":"hybrid","quality_controlled":"1","department":[{"_id":"KrCh"}],"dataavailabilitystatement":"Figures are based on simulation averages over many independent runs of the respective simulation. Results were analyzed and visualized with Python and Matlab R2023a. The computer code is published in (65). All other data are included in the manuscript and/or SI Appendix.","file":[{"date_created":"2024-03-12T13:12:22Z","access_level":"open_access","file_id":"15109","checksum":"068520e3efd4d008bb9177e8aedb7d22","file_size":2203220,"success":1,"creator":"dernst","content_type":"application/pdf","file_name":"2024_PNAS_Huebner.pdf","relation":"main_file","date_updated":"2024-03-12T13:12:22Z"}],"year":"2024","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"das_tickbox":"1","date_published":"2024-03-05T00:00:00Z","OA_place":"publisher","oa":1,"volume":121,"month":"03","publisher":"National Academy of Sciences","_id":"15083","supplementarymaterial":"yes","title":"Efficiency and resilience of cooperation in asymmetric social dilemmas","article_type":"original","article_number":"e2315558121","file_date_updated":"2024-03-12T13:12:22Z","abstract":[{"lang":"eng","text":"Direct reciprocity is a powerful mechanism for cooperation in social dilemmas. The very logic of reciprocity, however, seems to require that individuals are symmetric, and that everyone has the same means to influence each others’ payoffs. Yet in many applications, individuals are asymmetric. Herein, we study the effect of asymmetry in linear public good games. Individuals may differ in their endowments (their ability to contribute to a public good) and in their productivities (how effective their contributions are). Given the individuals’ productivities, we ask which allocation of endowments is optimal for cooperation. To this end, we consider two notions of optimality. The first notion focuses on the resilience of cooperation. The respective endowment distribution ensures that full cooperation is feasible even under the most adverse conditions. The second notion focuses on efficiency. The corresponding endowment distribution maximizes group welfare. Using analytical methods, we fully characterize these two endowment distributions. This analysis reveals that both optimality notions favor some endowment inequality: More productive players ought to get higher endowments. Yet the two notions disagree on how unequal endowments are supposed to be. A focus on resilience results in less inequality. With additional simulations, we show that the optimal endowment allocation needs to account for both the resilience and the efficiency of cooperation."}],"author":[{"last_name":"Hübner","first_name":"Valentin","full_name":"Hübner, Valentin","orcid":"0009-0001-5009-4987","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910"},{"first_name":"Manuel","full_name":"Staab, Manuel","last_name":"Staab"},{"last_name":"Hilbe","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","first_name":"Christian"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Kleshnina","first_name":"Maria","full_name":"Kleshnina, Maria"}],"external_id":{"pmid":["38408249"],"isi":["001207786500004"]},"article_processing_charge":"Yes (in subscription journal)","doi":"10.1073/pnas.2315558121","publication_status":"published","date_created":"2024-03-05T09:18:49Z","oa_version":"Published Version","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"citation":{"ista":"Hübner V, Staab M, Hilbe C, Chatterjee K, Kleshnina M. 2024. Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences of the United States of America. 121(10), e2315558121.","ieee":"V. Hübner, M. Staab, C. Hilbe, K. Chatterjee, and M. Kleshnina, “Efficiency and resilience of cooperation in asymmetric social dilemmas,” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 10. National Academy of Sciences, 2024.","chicago":"Hübner, Valentin, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2315558121.","short":"V. Hübner, M. Staab, C. Hilbe, K. Chatterjee, M. Kleshnina, Proceedings of the National Academy of Sciences of the United States of America 121 (2024).","ama":"Hübner V, Staab M, Hilbe C, Chatterjee K, Kleshnina M. Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences of the United States of America. 2024;121(10). doi:10.1073/pnas.2315558121","mla":"Hübner, Valentin, et al. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 10, e2315558121, National Academy of Sciences, 2024, doi:10.1073/pnas.2315558121.","apa":"Hübner, V., Staab, M., Hilbe, C., Chatterjee, K., & Kleshnina, M. (2024). Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2315558121"},"intvolume":" 121","publication":"Proceedings of the National Academy of Sciences of the United States of America","related_material":{"link":[{"description":"News on ISTA Website","url":"https://ista.ac.at/en/news/what-math-tells-us-about-social-dilemmas/","relation":"press_release"}],"record":[{"status":"public","id":"15108","relation":"research_data"},{"id":"19903","status":"public","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","isi":1},{"file":[{"success":1,"file_size":1425292,"checksum":"a511cf369d9172beb123fe73f291b5cc","date_created":"2024-08-20T10:52:28Z","access_level":"open_access","file_id":"17450","date_updated":"2024-08-20T10:52:28Z","relation":"main_file","file_name":"2024_PloSComBio_Svoboda.pdf","content_type":"application/pdf","creator":"dernst"}],"year":"2024","department":[{"_id":"KrCh"}],"dataavailabilitystatement":"Code for the figures and the computational experiments is available from the Figshare repository: https://figshare.com/s/4e08d78c892749f84201.","arxiv":1,"OA_type":"gold","researchdata_availability":"yes","quality_controlled":"1","acknowledgement":"We thank Gavin Rees for helpful discussions. J.S., S.J., and K.C were supported by\r\nEuropean Research Council (ERC) CoG 863818 (ForM-SMArt). J.T was supported by Center for Foundations of Modern Computer Science (Charles University project UNCE/SCI/004) and by the project PRIMUS/24/SCI/012 from Charles University. ","scopus_import":"1","ddc":["000"],"fulldoi":"https://doi.org/10.1371/journal.pcbi.1012008","date_updated":"2026-10-15T12:28:11Z","day":"29","issue":"3","ec_funded":1,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"type":"journal_article","has_accepted_license":"1","APC_amount":"3149,96 EUR","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","DOAJ_listed":"1","isi":1,"related_material":{"record":[{"id":"20138","status":"public","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"intvolume":" 20","citation":{"ista":"Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. 2024. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 20(3), e1012008.","ieee":"J. Svoboda, S. S. Joshi, J. Tkadlec, and K. Chatterjee, “Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating,” PLoS Computational Biology, vol. 20, no. 3. Public Library of Science, 2024.","chicago":"Svoboda, Jakub, Soham Shrikant Joshi, Josef Tkadlec, and Krishnendu Chatterjee. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pcbi.1012008.","ama":"Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 2024;20(3). doi:10.1371/journal.pcbi.1012008","short":"J. Svoboda, S.S. Joshi, J. Tkadlec, K. Chatterjee, PLoS Computational Biology 20 (2024).","apa":"Svoboda, J., Joshi, S. S., Tkadlec, J., & Chatterjee, K. (2024). Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1012008","mla":"Svoboda, Jakub, et al. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” PLoS Computational Biology, vol. 20, no. 3, e1012008, Public Library of Science, 2024, doi:10.1371/journal.pcbi.1012008."},"publication":"PLoS Computational Biology","publication_identifier":{"issn":["1553-734X"],"eissn":["1553-7358"]},"oa_version":"Published Version","doi":"10.1371/journal.pcbi.1012008","publication_status":"published","date_created":"2024-04-07T22:00:55Z","article_processing_charge":"Yes","author":[{"orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","full_name":"Svoboda, Jakub","last_name":"Svoboda"},{"first_name":"Soham Shrikant","full_name":"Joshi, Soham Shrikant","id":"f97aac0e-f57c-11ee-93d0-a5a82d8df168","last_name":"Joshi"},{"last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","full_name":"Tkadlec, Josef"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"abstract":[{"text":"Populations evolve by accumulating advantageous mutations. Every population has some spatial structure that can be modeled by an underlying network. The network then influences the probability that new advantageous mutations fixate. Amplifiers of selection are networks that increase the fixation probability of advantageous mutants, as compared to the unstructured fully-connected network. Whether or not a network is an amplifier depends on the choice of the random process that governs the evolutionary dynamics. Two popular choices are Moran process with Birth-death updating and Moran process with death-Birth updating. Interestingly, while some networks are amplifiers under Birth-death updating and other networks are amplifiers under death-Birth updating, so far no spatial structures have been found that function as an amplifier under both types of updating simultaneously. In this work, we identify networks that act as amplifiers of selection under both versions of the Moran process. The amplifiers are robust, modular, and increase fixation probability for any mutant fitness advantage in a range r ∈ (1, 1.2). To complement this positive result, we also prove that for certain quantities closely related to fixation probability, it is impossible to improve them simultaneously for both versions of the Moran process. Together, our results highlight how the two versions of the Moran process differ and what they have in common.","lang":"eng"}],"external_id":{"arxiv":["2401.14914"],"isi":["001194482400002"]},"article_number":"e1012008","file_date_updated":"2024-08-20T10:52:28Z","article_type":"original","title":"Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating","supplementarymaterial":"yes","_id":"15297","publisher":"Public Library of Science","volume":20,"month":"03","das_tickbox":"1","date_published":"2024-03-29T00:00:00Z","OA_place":"publisher","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}}]