---
OA_place: publisher
OA_type: hybrid
_id: '19007'
abstract:
- lang: eng
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"
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).
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Avinash
full_name: Kori, Avinash
last_name: Kori
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Ainkaran
full_name: Santhirasekaram, Ainkaran
last_name: Santhirasekaram
- first_name: Francesca
full_name: Toni, Francesca
last_name: Toni
- first_name: Ben
full_name: Glocker, Ben
last_name: Glocker
- first_name: Fabio
full_name: De Sousa Ribeiro, Fabio
last_name: De Sousa Ribeiro
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'
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'
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.
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.
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.'
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.
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.
conference:
end_date: 2024-12-16
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2024-12-16
das_tickbox: '0'
date_created: 2025-02-05T08:36:22Z
date_published: 2024-12-01T00:00:00Z
date_updated: 2026-10-15T09:48:32Z
day: '01'
ddc:
- '000'
department:
- _id: FrLo
doi: 10.52202/079017-2960
external_id:
arxiv:
- '2406.07141'
file:
- access_level: open_access
checksum: d27b3c7102adc28e798fe41001f0b919
content_type: application/pdf
creator: dernst
date_created: 2025-02-05T08:34:25Z
date_updated: 2025-02-05T08:34:25Z
file_id: '19008'
file_name: 2024_NeurIPS_Kori.pdf
file_size: 6943800
relation: main_file
success: 1
file_date_updated: 2025-02-05T08:34:25Z
fulldoi: https://doi.org/10.52202/079017-2960
has_accepted_license: '1'
intvolume: ' 37'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: 38th Conference on Neural Information Processing Systems
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Identifiable object-centric representation learning via probabilistic slot
attention
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '15098'
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.
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).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Antonio
full_name: Agresti, Antonio
id: 673cd0cc-9b9a-11eb-b144-88f30e1fbb72
last_name: Agresti
orcid: 0000-0002-9573-2962
- first_name: Eliseo
full_name: Luongo, Eliseo
last_name: Luongo
citation:
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
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
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.
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.
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.
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.
das_tickbox: '1'
dataavailabilitystatement: Data sharing not applicable to this article as no data
sets were generated or analyzed during the current study.
date_created: 2024-03-10T23:00:54Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2026-10-15T09:48:57Z
day: '01'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1007/s00208-024-02812-0
ec_funded: 1
external_id:
arxiv:
- '2306.11081'
isi:
- '001172711400002'
pmid:
- '39351582'
file:
- access_level: open_access
checksum: d55cac8bddea09a97f06612825c4f229
content_type: application/pdf
creator: dernst
date_created: 2025-01-09T08:23:36Z
date_updated: 2025-01-09T08:23:36Z
file_id: '18790'
file_name: 2024_MathAnnalen_Agresti.pdf
file_size: 661557
relation: main_file
success: 1
file_date_updated: 2025-01-09T08:23:36Z
fulldoi: https://doi.org/10.1007/s00208-024-02812-0
has_accepted_license: '1'
intvolume: ' 390'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 2727-2766
pmid: 1
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication: Mathematische Annalen
publication_identifier:
eissn:
- 1432-1807
issn:
- 0025-5831
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: not applicable
scopus_import: '1'
status: public
supplementarymaterial: no
title: Global well-posedness and interior regularity of 2D Navier-Stokes equations
with stochastic boundary conditions
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 390
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '17462'
abstract:
- lang: eng
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.
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.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nicolas
full_name: Clozeau, Nicolas
id: fea1b376-906f-11eb-847d-b2c0cf46455b
last_name: Clozeau
- first_name: Lihan
full_name: Wang, Lihan
last_name: Wang
citation:
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
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.
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.
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.
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.
short: N. Clozeau, L. Wang, Multiscale Modeling and Simulation 22 (2024) 973–1029.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-08-25T22:01:08Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-10-15T09:49:19Z
day: '01'
department:
- _id: JuFi
doi: 10.1137/23M1603819
ec_funded: 1
external_id:
arxiv:
- '2309.06798'
isi:
- '001285416500001'
fulldoi: https://doi.org/10.1137/23M1603819
intvolume: ' 22'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2309.06798
month: '09'
oa: 1
oa_version: Preprint
page: 973-1029
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication: Multiscale Modeling and Simulation
publication_identifier:
eissn:
- 1540-3467
issn:
- 1540-3459
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Artificial boundary conditions for random elliptic systems with correlated
coefficient field
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 22
year: '2024'
...
---
_id: '15119'
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.
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.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Antonio
full_name: Agresti, Antonio
id: 673cd0cc-9b9a-11eb-b144-88f30e1fbb72
last_name: Agresti
orcid: 0000-0002-9573-2962
- first_name: Mark
full_name: Veraar, Mark
last_name: Veraar
citation:
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
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.
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.
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.
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.
short: A. Agresti, M. Veraar, Annales de l’Institut Henri Poincaré, Probabilités
et Statistiques 60 (2024) 413–430.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-03-17T23:00:58Z
date_published: 2024-02-01T00:00:00Z
date_updated: 2026-10-15T09:46:19Z
day: '01'
department:
- _id: JuFi
doi: 10.1214/22-AIHP1333
external_id:
arxiv:
- '2106.01274'
fulldoi: https://doi.org/10.1214/22-AIHP1333
intvolume: ' 60'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2106.01274
month: '02'
oa: 1
oa_version: Preprint
page: 413-430
publication: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
publication_identifier:
issn:
- 0246-0203
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Stochastic maximal Lp(Lq)-regularity for second order systems with periodic
boundary conditions
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 60
year: '2024'
...
---
_id: '17481'
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."
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."
article_processing_charge: Yes
article_type: original
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Alice
full_name: Marveggio, Alice
id: 25647992-AA84-11E9-9D75-8427E6697425
last_name: Marveggio
citation:
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
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.
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.
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.
short: J.L. Fischer, A. Marveggio, Annales de l’Institut Henri Poincaré C 41 (2024)
1117–1178.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-09-01T22:01:09Z
date_published: 2024-01-24T00:00:00Z
date_updated: 2026-10-15T09:49:35Z
day: '24'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.4171/AIHPC/109
ec_funded: 1
external_id:
isi:
- '001293853900003'
file:
- access_level: open_access
checksum: b5ad02d9abd5b4701269cd1ad0a1cc8f
content_type: application/pdf
creator: dernst
date_created: 2024-09-09T07:46:42Z
date_updated: 2024-09-09T07:46:42Z
file_id: '17923'
file_name: 2024_AnnInstHPoincare_Fischer.pdf
file_size: 1348896
relation: main_file
success: 1
file_date_updated: 2024-09-09T07:46:42Z
fulldoi: https://doi.org/10.4171/AIHPC/109
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '5'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 1117-1178
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication: Annales de l'Institut Henri Poincaré C
publication_identifier:
eissn:
- 1873-1430
issn:
- 0294-1449
publication_status: published
publisher: EMS Press
quality_controlled: '1'
related_material:
record:
- id: '14597'
relation: earlier_version
status: public
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Quantitative convergence of the vectorial Allen–Cahn equation towards multiphase
mean curvature flow
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 41
year: '2024'
...
---
_id: '17098'
abstract:
- lang: eng
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.
acknowledgement: "This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant.\r\n"
article_number: '6'
article_processing_charge: No
arxiv: 1
author:
- first_name: Ali
full_name: Asadi, Ali
id: 02d96aae-000e-11ec-b801-cadd0a5eefbb
last_name: Asadi
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
citation:
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'
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'
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.
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.'
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.
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.
conference:
end_date: 2024-07-11
location: Tallinn, Estonia
name: 'LICS: Logic in Computer Science'
start_date: 2024-07-08
corr_author: '1'
das_tickbox: '0'
date_created: 2024-06-03T07:43:15Z
date_published: 2024-07-08T00:00:00Z
date_updated: 2026-10-15T09:51:23Z
day: '08'
department:
- _id: KrCh
doi: 10.1145/3661814.3662080
ec_funded: 1
external_id:
arxiv:
- '2405.02479'
isi:
- '001275042100006'
fulldoi: https://doi.org/10.1145/3661814.3662080
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2405.02479
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 39th Annual ACM/IEEE Symposium on Logic in Computer Science
publication_identifier:
eissn:
- 1043-6871
isbn:
- '9798400706608'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Deterministic sub-exponential algorithm for discounted-sum games with unary
weights
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19510'
abstract:
- lang: eng
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."
acknowledged_ssus:
- _id: CampIT
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.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Ionut-Vlad
full_name: Modoranu, Ionut-Vlad
id: 449f7a18-f128-11eb-9611-9b430c0c6333
last_name: Modoranu
- first_name: Mher
full_name: Safaryan, Mher
id: dd546b39-0804-11ed-9c55-ef075c39778d
last_name: Safaryan
- first_name: Grigory
full_name: Malinovsky, Grigory
last_name: Malinovsky
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Thomas
full_name: Robert, Thomas
id: de632733-1457-11f0-ae22-b5914b8c1c41
last_name: Robert
- first_name: Peter
full_name: Richtárik, Peter
last_name: Richtárik
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: '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'
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'
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.'
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.'
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.'
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.
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2026-10-15T09:49:27Z
day: '20'
department:
- _id: DaAl
doi: 10.52202/079017-0001
ec_funded: 1
external_id:
arxiv:
- '2405.15593'
fulldoi: https://doi.org/10.52202/079017-0001
intvolume: ' 37'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2405.15593
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/IST-DASLab/MicroAdam
scopus_import: '1'
status: public
title: 'MICROADAM: Accurate adaptive optimization with low space overhead and provable
convergence'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '18654'
abstract:
- lang: eng
text: "We compute the rotational anisotropy of the free energy of \U0001D6FC−RuCl3
in an external magnetic field. This quantity, known as the magnetotropic susceptibility,
\U0001D458, 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 \U0001D6FC−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 \U0001D6FC−RuCl3
displays scaling behavior \U0001D458=\U0001D447\U0001D453(\U0001D435/\U0001D447)
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 \U0001D453
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 \U0001D458=\U0001D447\U0001D453(\U0001D435/\U0001D447)
breaks down at a temperature scale where the uniform spin susceptibility deviates
from the Curie law and never reemerges at low temperatures."
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.
article_number: L201114
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Toshihiro
full_name: Sato, Toshihiro
last_name: Sato
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Fakher F.
full_name: Assaad, Fakher F.
last_name: Assaad
citation:
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'
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'
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.'
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.'
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.'
short: T. Sato, B.J. Ramshaw, K.A. Modic, F.F. Assaad, Physical Review B 110 (2024).
das_tickbox: '0'
date_created: 2024-12-15T23:01:50Z
date_published: 2024-11-15T00:00:00Z
date_updated: 2026-10-15T09:50:59Z
day: '15'
department:
- _id: KiMo
doi: 10.1103/PhysRevB.110.L201114
external_id:
arxiv:
- '2312.03080'
isi:
- '001447562900001'
fulldoi: https://doi.org/10.1103/PhysRevB.110.L201114
intvolume: ' 110'
isi: 1
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2312.03080
month: '11'
oa: 1
oa_version: Preprint
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'
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 110
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19511'
abstract:
- lang: eng
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.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Saleh
full_name: Ashkboos, Saleh
last_name: Ashkboos
- first_name: Amirkeivan
full_name: Mohtashami, Amirkeivan
last_name: Mohtashami
- first_name: Maximilian L.
full_name: Croci, Maximilian L.
last_name: Croci
- first_name: Bo
full_name: Li, Bo
last_name: Li
- first_name: Pashmina
full_name: Cameron, Pashmina
last_name: Cameron
- first_name: Martin
full_name: Jaggi, Martin
last_name: Jaggi
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Torsten
full_name: Hoefler, Torsten
last_name: Hoefler
- first_name: James
full_name: Hensman, James
last_name: Hensman
citation:
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'
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'
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.'
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.'
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.'
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.
conference:
end_date: 2024-12-15
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2024-12-09
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2026-10-15T09:50:27Z
day: '20'
department:
- _id: DaAl
doi: 10.52202/079017-3180
external_id:
arxiv:
- '2404.00456'
fulldoi: https://doi.org/10.52202/079017-3180
intvolume: ' 37'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2404.00456
month: '12'
oa: 1
oa_version: Preprint
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/spcl/QuaRot
scopus_import: '1'
status: public
title: 'QuaRot: Outlier-free 4-bit inference in rotated LLMs'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
_id: '15003'
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.
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. "
article_number: '054405'
article_processing_charge: No
article_type: original
author:
- first_name: D. G.
full_name: Franco, D. G.
last_name: Franco
- first_name: R.
full_name: Avalos, R.
last_name: Avalos
- first_name: D.
full_name: Hafner, D.
last_name: Hafner
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Yu
full_name: Prots, Yu
last_name: Prots
- first_name: O.
full_name: Stockert, O.
last_name: Stockert
- first_name: A.
full_name: Hoser, A.
last_name: Hoser
- first_name: P. J.W.
full_name: Moll, P. J.W.
last_name: Moll
- first_name: M.
full_name: Brando, M.
last_name: Brando
- first_name: A. A.
full_name: Aligia, A. A.
last_name: Aligia
- first_name: C.
full_name: Geibel, C.
last_name: Geibel
citation:
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
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
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.
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.
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.
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.
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).
das_tickbox: '0'
date_created: 2024-02-18T23:01:01Z
date_published: 2024-02-01T00:00:00Z
date_updated: 2026-10-15T09:50:31Z
day: '01'
department:
- _id: KiMo
doi: 10.1103/PhysRevB.109.054405
external_id:
isi:
- '001198571800008'
fulldoi: https://doi.org/10.1103/PhysRevB.109.054405
intvolume: ' 109'
isi: 1
issue: '5'
language:
- iso: eng
month: '02'
oa_version: None
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Frustrated magnetism in octahedra-based Ce6 Ni6 P17
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 109
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '18926'
abstract:
- lang: eng
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. '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
- first_name: Tim
full_name: Laux, Tim
last_name: Laux
citation:
ama: 'Hensel S, Laux T. 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'
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.'
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.'
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.'
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.'
short: S. Hensel, T. Laux, Indiana University Mathematics Journal 73 (2024) 111–148.
corr_author: '1'
date_created: 2025-01-27T15:20:19Z
date_published: 2024-01-01T00:00:00Z
date_updated: 2026-10-15T09:49:54Z
day: '01'
department:
- _id: JuFi
doi: 10.1512/iumj.2024.73.9701
external_id:
arxiv:
- '2112.11150'
fulldoi: https://doi.org/10.1512/iumj.2024.73.9701
intvolume: ' 73'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2112.11150
month: '01'
oa: 1
oa_version: Preprint
page: 111-148
publication: Indiana University Mathematics Journal
publication_identifier:
issn:
- 0022-2518
publication_status: published
publisher: Indiana University Mathematics Journal
quality_controlled: '1'
researchdata_availability: unclear
scopus_import: '1'
status: public
supplementarymaterial: unclear
title: 'BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation
and weak-strong uniqueness'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 73
year: '2024'
...
---
_id: '17101'
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."
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."
article_number: '2401.16252'
article_processing_charge: No
arxiv: 1
author:
- first_name: Luc
full_name: Attia, Luc
last_name: Attia
- first_name: Lyuben
full_name: Lichev, Lyuben
last_name: Lichev
- first_name: Dieter
full_name: Mitsche, Dieter
last_name: Mitsche
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
- first_name: Bruno
full_name: Ziliotto, Bruno
last_name: Ziliotto
citation:
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
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
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.
ieee: L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Zero-sum
random games on directed graphs,” arXiv. .
ista: Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Zero-sum random
games on directed graphs. arXiv, 2401.16252.
mla: Attia, Luc, et al. “Zero-Sum Random Games on Directed Graphs.” ArXiv,
2401.16252, doi:10.48550/arXiv.2401.16252.
short: L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, ArXiv
(n.d.).
das_tickbox: '0'
date_created: 2024-06-03T07:45:22Z
date_published: 2024-01-29T00:00:00Z
date_updated: 2026-10-15T09:51:45Z
day: '29'
department:
- _id: KrCh
doi: 10.48550/arXiv.2401.16252
external_id:
arxiv:
- '2401.16252'
fulldoi: https://doi.org/10.48550/arXiv.2401.16252
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2401.16252
month: '01'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
researchdata_availability: no
status: public
supplementarymaterial: no
title: Zero-sum random games on directed graphs
type: preprint
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '15006'
abstract:
- lang: eng
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.
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.
alternative_title:
- LIPIcs
article_number: '11'
article_processing_charge: No
arxiv: 1
author:
- first_name: Juho
full_name: Hirvonen, Juho
last_name: Hirvonen
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
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'
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'
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.'
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.'
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.
conference:
end_date: 2023-12-08
location: Tokyo, Japan
name: 'OPODIS: Conference on Principles of Distributed Systems'
start_date: 2023-12-06
corr_author: '1'
das_tickbox: '0'
date_created: 2024-02-18T23:01:01Z
date_published: 2024-01-18T00:00:00Z
date_updated: 2026-10-15T10:07:37Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.OPODIS.2023.11
ec_funded: 1
external_id:
arxiv:
- '2102.13457'
isi:
- '001585185800011'
file:
- access_level: open_access
checksum: 4fc7eea6e4ba140b904781fc7df868ec
content_type: application/pdf
creator: dernst
date_created: 2024-02-26T09:04:58Z
date_updated: 2024-02-26T09:04:58Z
file_id: '15028'
file_name: 2024_LIPICs_Hirvonen.pdf
file_size: 867363
relation: main_file
success: 1
file_date_updated: 2024-02-26T09:04:58Z
fulldoi: https://doi.org/10.4230/LIPIcs.OPODIS.2023.11
has_accepted_license: '1'
intvolume: ' 286'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 27th International Conference on Principles of Distributed Systems
publication_identifier:
isbn:
- '9783959773089'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'On the convergence time in graphical games: A locality-sensitive approach'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 286
year: '2024'
...
---
_id: '17402'
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.
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.
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Maximilian
full_name: Weininger, Maximilian
id: 02ab0197-cc70-11ed-ab61-918e71f56881
last_name: Weininger
orcid: 0000-0002-0163-2152
citation:
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'
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'
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.'
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.'
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.'
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.'
short: T. Meggendorfer, M. Weininger, in:, 36th International Conference on Computer
Aided Verification, Springer Nature, 2024, pp. 359–372.
conference:
end_date: 2024-07-27
location: Montreal, Canada
name: 'CAV: Computer Aided Verification'
start_date: 2024-07-24
corr_author: '1'
das_tickbox: '1'
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].
date_created: 2024-08-09T11:24:54Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2026-10-15T10:06:48Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-65633-0_16
ec_funded: 1
external_id:
arxiv:
- '2405.03885'
isi:
- '001307897000016'
file:
- access_level: open_access
checksum: c888231d0a47b55786b7b4c0f02216bb
content_type: application/pdf
creator: dernst
date_created: 2024-08-12T08:39:12Z
date_updated: 2024-08-12T08:39:12Z
file_id: '17419'
file_name: 2024_CAV_Meggendorfer.pdf
file_size: 368487
relation: main_file
success: 1
file_date_updated: 2024-08-12T08:39:12Z
fulldoi: https://doi.org/10.1007/978-3-031-65633-0_16
has_accepted_license: '1'
intvolume: ' 14683'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 359-372
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 36th International Conference on Computer Aided Verification
publication_identifier:
eisbn:
- '9783031656330'
eissn:
- 1611-3349
isbn:
- '9783031656323'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Playing games with your PET: Extending the Partial Exploration Tool to stochastic
games'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14683
year: '2024'
...
---
_id: '17162'
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."
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."
article_number: '107'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
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
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
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.
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.
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.
short: K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, Proceedings
of the ACM on Programming Languages 8 (2024).
das_tickbox: '1'
dataavailabilitystatement: The software that supports Section 8 is available on Zenodo
[Meggendorfer and Žikelić 2024]. https://doi.org/10.5281/zenodo.10457566
date_created: 2024-06-23T22:01:02Z
date_published: 2024-04-29T00:00:00Z
date_updated: 2026-10-15T10:02:32Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3649824
ec_funded: 1
file:
- access_level: open_access
checksum: 9243ded966f71df1572be5466019be5c
content_type: application/pdf
creator: dernst
date_created: 2024-06-27T07:48:16Z
date_updated: 2024-06-27T07:48:16Z
file_id: '17182'
file_name: 2024_ProcACMProgLanguage_Chatterjee.pdf
file_size: 413096
relation: main_file
success: 1
file_date_updated: 2024-06-27T07:48:16Z
fulldoi: https://doi.org/10.1145/3649824
has_accepted_license: '1'
intvolume: ' 8'
issue: OOPSLA1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '23140'
relation: research_data
status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: no
title: Quantitative bounds on resource usage of probabilistic programs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 8
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19512'
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."
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.'
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Joel Daniel
full_name: Andersson, Joel Daniel
last_name: Andersson
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Rasmus
full_name: Pagh, 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
citation:
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'
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.
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.
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.'
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.
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.
conference:
end_date: 2024-12-15
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2024-12-09
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2026-10-15T09:52:07Z
day: '20'
department:
- _id: MoHe
doi: 10.52202/079017-0299
ec_funded: 1
external_id:
arxiv:
- '2406.03802'
fulldoi: https://doi.org/10.52202/079017-0299
intvolume: ' 37'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2406.03802
month: '12'
oa: 1
oa_version: Preprint
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
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
eissn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Continual counting with gradual privacy expiration
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19515'
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"
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.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Marco
full_name: Fumero, Marco
id: 1c1593eb-393f-11ef-bb8e-ab4f1e979650
last_name: Fumero
- first_name: Marco
full_name: Pegoraro, Marco
last_name: Pegoraro
- first_name: Valentino
full_name: Maiorca, Valentino
last_name: Maiorca
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Emanuele
full_name: Rodolà, Emanuele
last_name: Rodolà
citation:
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'
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.'
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.'
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.'
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.'
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.
conference:
end_date: 2024-12-15
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2024-12-09
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2026-10-15T09:52:55Z
day: '20'
department:
- _id: FrLo
doi: 10.52202/079017-2115
ec_funded: 1
external_id:
arxiv:
- '2406.14183'
fulldoi: https://doi.org/10.52202/079017-2115
intvolume: ' 37'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2406.14183
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
eissn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Latent functional maps: A spectral framework for representation alignment'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '23140'
abstract:
- lang: eng
text: "The artefact for the OOPSLA 2024 paper \"Quantitative Bounds on Resource
Usage of Probabilistic Programs\".\r\n\r\n"
article_processing_charge: No
author:
- first_name: Đorđe
full_name: ' Žikelić, Đorđe'
last_name: ' Žikelić'
citation:
ama: ' Žikelić Đ. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic
Programs. 2024. doi: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'
chicago: ' Žikelić, Đorđe. “Artefact for: Quantitative Bounds on Resource Usage
of Probabilistic Programs.” Zenodo, 2024. https://doi.org/10.5281/zenodo.10457565.'
ieee: 'Đ. Žikelić, “Artefact for: Quantitative Bounds on Resource Usage of Probabilistic
Programs.” Zenodo, 2024.'
ista: ' Žikelić Đ. 2024. Artefact for: Quantitative Bounds on Resource Usage of
Probabilistic Programs, Zenodo, 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.'
short: Đ. Žikelić, (2024).
contributor:
- contributor_type: contact_person
first_name: Tobias
last_name: Meggendorfer
date_created: 2026-10-15T10:02:22Z
date_published: 2024-03-05T00:00:00Z
date_updated: 2026-10-15T10:02:33Z
day: '05'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.5281/zenodo.10457565
fulldoi: https://doi.org/10.5281/zenodo.10457565
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.10457565
month: '03'
oa: 1
oa_version: None
publisher: Zenodo
related_material:
record:
- id: '17162'
relation: used_in_publication
status: public
status: public
title: 'Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs'
type: research_data_reference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
APC_amount: 3041,76 EUR
OA_place: publisher
OA_type: hybrid
_id: '15083'
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.'
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.).'
article_number: e2315558121
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Valentin
full_name: Hübner, Valentin
id: 2c8aa207-dc7d-11ea-9b2f-f22972ecd910
last_name: Hübner
orcid: 0009-0001-5009-4987
- first_name: Manuel
full_name: Staab, Manuel
last_name: Staab
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Maria
full_name: Kleshnina, Maria
last_name: Kleshnina
citation:
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
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
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.
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.
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.
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.
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).
corr_author: '1'
das_tickbox: '1'
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.
date_created: 2024-03-05T09:18:49Z
date_published: 2024-03-05T00:00:00Z
date_updated: 2026-10-15T10:10:26Z
day: '05'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1073/pnas.2315558121
ec_funded: 1
external_id:
isi:
- '001207786500004'
pmid:
- '38408249'
file:
- access_level: open_access
checksum: 068520e3efd4d008bb9177e8aedb7d22
content_type: application/pdf
creator: dernst
date_created: 2024-03-12T13:12:22Z
date_updated: 2024-03-12T13:12:22Z
file_id: '15109'
file_name: 2024_PNAS_Huebner.pdf
file_size: 2203220
relation: main_file
success: 1
file_date_updated: 2024-03-12T13:12:22Z
fulldoi: https://doi.org/10.1073/pnas.2315558121
has_accepted_license: '1'
intvolume: ' 121'
isi: 1
issue: '10'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
link:
- description: News on ISTA Website
relation: press_release
url: https://ista.ac.at/en/news/what-math-tells-us-about-social-dilemmas/
record:
- id: '15108'
relation: research_data
status: public
- id: '19903'
relation: dissertation_contains
status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Efficiency and resilience of cooperation in asymmetric social dilemmas
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 121
year: '2024'
...
---
APC_amount: 3149,96 EUR
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '15297'
abstract:
- lang: eng
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.
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. "
article_number: e1012008
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
- first_name: Soham Shrikant
full_name: Joshi, Soham Shrikant
id: f97aac0e-f57c-11ee-93d0-a5a82d8df168
last_name: Joshi
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
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
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
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.
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.
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.
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.
short: J. Svoboda, S.S. Joshi, J. Tkadlec, K. Chatterjee, PLoS Computational Biology
20 (2024).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: 'Code for the figures and the computational experiments
is available from the Figshare repository: https://figshare.com/s/4e08d78c892749f84201.'
date_created: 2024-04-07T22:00:55Z
date_published: 2024-03-29T00:00:00Z
date_updated: 2026-10-15T12:28:11Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1371/journal.pcbi.1012008
ec_funded: 1
external_id:
arxiv:
- '2401.14914'
isi:
- '001194482400002'
file:
- access_level: open_access
checksum: a511cf369d9172beb123fe73f291b5cc
content_type: application/pdf
creator: dernst
date_created: 2024-08-20T10:52:28Z
date_updated: 2024-08-20T10:52:28Z
file_id: '17450'
file_name: 2024_PloSComBio_Svoboda.pdf
file_size: 1425292
relation: main_file
success: 1
file_date_updated: 2024-08-20T10:52:28Z
fulldoi: https://doi.org/10.1371/journal.pcbi.1012008
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: PLoS Computational Biology
publication_identifier:
eissn:
- 1553-7358
issn:
- 1553-734X
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
record:
- id: '20138'
relation: dissertation_contains
status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Amplifiers of selection for the Moran process with both Birth-death and death-Birth
updating
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 20
year: '2024'
...