---
OA_place: repository
OA_type: green
_id: '14854'
abstract:
- lang: eng
text: We study the spectrum of the Fröhlich Hamiltonian for the polaron at fixed
total momentum. We prove the existence of excited eigenvalues between the ground
state energy and the essential spectrum at strong coupling. In fact, our main
result shows that the number of excited energy bands diverges in the strong coupling
limit. To prove this we derive upper bounds for the min-max values of the corresponding
fiber Hamiltonians and compare them with the bottom of the essential spectrum,
a lower bound on which was recently obtained by Brooks and Seiringer (Comm. Math.
Phys. 404:1 (2023), 287–337). The upper bounds are given in terms of the ground
state energy band shifted by momentum-independent excitation energies determined
by an effective Hamiltonian of Bogoliubov type.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: David Johannes
full_name: Mitrouskas, David Johannes
id: cbddacee-2b11-11eb-a02e-a2e14d04e52d
last_name: Mitrouskas
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Mitrouskas DJ, Seiringer R. Ubiquity of bound states for the strongly coupled
polaron. Pure and Applied Analysis. 2023;5(4):973-1008. doi:10.2140/paa.2023.5.973
apa: Mitrouskas, D. J., & Seiringer, R. (2023). Ubiquity of bound states for
the strongly coupled polaron. Pure and Applied Analysis. Mathematical Sciences
Publishers. https://doi.org/10.2140/paa.2023.5.973
chicago: Mitrouskas, David Johannes, and Robert Seiringer. “Ubiquity of Bound States
for the Strongly Coupled Polaron.” Pure and Applied Analysis. Mathematical
Sciences Publishers, 2023. https://doi.org/10.2140/paa.2023.5.973.
ieee: D. J. Mitrouskas and R. Seiringer, “Ubiquity of bound states for the strongly
coupled polaron,” Pure and Applied Analysis, vol. 5, no. 4. Mathematical
Sciences Publishers, pp. 973–1008, 2023.
ista: Mitrouskas DJ, Seiringer R. 2023. Ubiquity of bound states for the strongly
coupled polaron. Pure and Applied Analysis. 5(4), 973–1008.
mla: Mitrouskas, David Johannes, and Robert Seiringer. “Ubiquity of Bound States
for the Strongly Coupled Polaron.” Pure and Applied Analysis, vol. 5, no.
4, Mathematical Sciences Publishers, 2023, pp. 973–1008, doi:10.2140/paa.2023.5.973.
short: D.J. Mitrouskas, R. Seiringer, Pure and Applied Analysis 5 (2023) 973–1008.
corr_author: '1'
date_created: 2024-01-22T08:24:23Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2025-04-23T14:21:39Z
day: '15'
department:
- _id: RoSe
doi: 10.2140/paa.2023.5.973
external_id:
arxiv:
- '2211.03606'
intvolume: ' 5'
issue: '4'
keyword:
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2211.03606
month: '12'
oa: 1
oa_version: Preprint
page: 973-1008
publication: Pure and Applied Analysis
publication_identifier:
eissn:
- 2578-5885
issn:
- 2578-5893
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ubiquity of bound states for the strongly coupled polaron
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2023'
...
---
_id: '14861'
abstract:
- lang: eng
text: Cover Page
article_number: ' e202304138'
article_processing_charge: No
author:
- first_name: Lea Marie
full_name: Becker, Lea Marie
id: 36336939-eb97-11eb-a6c2-c83f1214ca79
last_name: Becker
orcid: 0000-0002-6401-5151
- first_name: Mélanie
full_name: Berbon, Mélanie
last_name: Berbon
- first_name: Alicia
full_name: Vallet, Alicia
last_name: Vallet
- first_name: Axelle
full_name: Grelard, Axelle
last_name: Grelard
- first_name: Estelle
full_name: Morvan, Estelle
last_name: Morvan
- first_name: Benjamin
full_name: Bardiaux, Benjamin
last_name: Bardiaux
- first_name: Roman
full_name: Lichtenecker, Roman
last_name: Lichtenecker
- first_name: Matthias
full_name: Ernst, Matthias
last_name: Ernst
- first_name: Antoine
full_name: Loquet, Antoine
last_name: Loquet
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: 'Becker LM, Berbon M, Vallet A, et al. Cover Picture: The Rigid Core and
Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy
of Aromatic Residues. Vol 62. Wiley; 2023. doi:10.1002/anie.202304138'
apa: 'Becker, L. M., Berbon, M., Vallet, A., Grelard, A., Morvan, E., Bardiaux,
B., … Schanda, P. (2023). Cover Picture: The rigid core and flexible surface
of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic
residues. Angewandte Chemie International Edition (Vol. 62). Wiley.
https://doi.org/10.1002/anie.202304138'
chicago: 'Becker, Lea Marie, Mélanie Berbon, Alicia Vallet, Axelle Grelard, Estelle
Morvan, Benjamin Bardiaux, Roman Lichtenecker, Matthias Ernst, Antoine Loquet,
and Paul Schanda. Cover Picture: The Rigid Core and Flexible Surface of Amyloid
Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic Residues.
Angewandte Chemie International Edition. Vol. 62. Wiley, 2023. https://doi.org/10.1002/anie.202304138.'
ieee: 'L. M. Becker et al., Cover Picture: The rigid core and flexible
surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of
aromatic residues, vol. 62, no. 19. Wiley, 2023.'
ista: 'Becker LM, Berbon M, Vallet A, Grelard A, Morvan E, Bardiaux B, Lichtenecker
R, Ernst M, Loquet A, Schanda P. 2023. Cover Picture: The rigid core and flexible
surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of
aromatic residues, Wiley,p.'
mla: 'Becker, Lea Marie, et al. “Cover Picture: The Rigid Core and Flexible Surface
of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy of Aromatic
Residues.” Angewandte Chemie International Edition, vol. 62, no. 19, e202304138,
Wiley, 2023, doi:10.1002/anie.202304138.'
short: 'L.M. Becker, M. Berbon, A. Vallet, A. Grelard, E. Morvan, B. Bardiaux, R.
Lichtenecker, M. Ernst, A. Loquet, P. Schanda, Cover Picture: The Rigid Core and
Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle‐Spinning NMR Spectroscopy
of Aromatic Residues, Wiley, 2023.'
corr_author: '1'
date_created: 2024-01-22T11:54:34Z
date_published: 2023-05-02T00:00:00Z
date_updated: 2026-06-18T17:41:09Z
day: '02'
ddc:
- '540'
department:
- _id: PaSc
doi: 10.1002/anie.202304138
intvolume: ' 62'
issue: '19'
keyword:
- General Chemistry
- Catalysis
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/anie.202304138
month: '05'
oa: 1
oa_version: Published Version
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
related_material:
link:
- relation: translation
url: https://doi.org/10.1002/ange.202304138
record:
- id: '12675'
relation: other
status: public
status: public
title: 'Cover Picture: The rigid core and flexible surface of amyloid fibrils probed
by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues'
type: other_academic_publication
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 62
year: '2023'
...
---
_id: '14862'
article_number: ckad160.597
article_processing_charge: No
author:
- first_name: Simon
full_name: Rella, Simon
id: B4765ACA-AA38-11E9-AC9A-0930E6697425
last_name: Rella
- first_name: Y
full_name: Kulikova, Y
last_name: Kulikova
- first_name: Aygul
full_name: Minnegalieva, Aygul
id: 87DF77F0-1D9A-11EA-B6AE-CE443DDC885E
last_name: Minnegalieva
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: 'Rella S, Kulikova Y, Minnegalieva A, Kondrashov F. Complex vaccination strategies
prevent the emergence of vaccine resistance. In: European Journal of Public
Health. Vol 33. Oxford University Press; 2023. doi:10.1093/eurpub/ckad160.597'
apa: Rella, S., Kulikova, Y., Minnegalieva, A., & Kondrashov, F. (2023). Complex
vaccination strategies prevent the emergence of vaccine resistance. In European
Journal of Public Health (Vol. 33). Oxford University Press. https://doi.org/10.1093/eurpub/ckad160.597
chicago: Rella, Simon, Y Kulikova, Aygul Minnegalieva, and Fyodor Kondrashov. “Complex
Vaccination Strategies Prevent the Emergence of Vaccine Resistance.” In European
Journal of Public Health, Vol. 33. Oxford University Press, 2023. https://doi.org/10.1093/eurpub/ckad160.597.
ieee: S. Rella, Y. Kulikova, A. Minnegalieva, and F. Kondrashov, “Complex vaccination
strategies prevent the emergence of vaccine resistance,” in European Journal
of Public Health, 2023, vol. 33, no. Supplement_2.
ista: Rella S, Kulikova Y, Minnegalieva A, Kondrashov F. 2023. Complex vaccination
strategies prevent the emergence of vaccine resistance. European Journal of Public
Health. vol. 33, ckad160.597.
mla: Rella, Simon, et al. “Complex Vaccination Strategies Prevent the Emergence
of Vaccine Resistance.” European Journal of Public Health, vol. 33, no.
Supplement_2, ckad160.597, Oxford University Press, 2023, doi:10.1093/eurpub/ckad160.597.
short: S. Rella, Y. Kulikova, A. Minnegalieva, F. Kondrashov, in:, European Journal
of Public Health, Oxford University Press, 2023.
corr_author: '1'
date_created: 2024-01-22T12:02:28Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-09-08T09:58:11Z
day: '01'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1093/eurpub/ckad160.597
file:
- access_level: open_access
checksum: 98706755bb4cc5d553818ade7660a7d2
content_type: application/pdf
creator: dernst
date_created: 2024-01-24T11:12:33Z
date_updated: 2024-01-24T11:12:33Z
file_id: '14882'
file_name: 2023_EurJourPublicHealth_Rella.pdf
file_size: 71057
relation: main_file
success: 1
file_date_updated: 2024-01-24T11:12:33Z
has_accepted_license: '1'
intvolume: ' 33'
issue: Supplement_2
keyword:
- Public Health
- Environmental and Occupational Health
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: European Journal of Public Health
publication_identifier:
eissn:
- 1464-360X
issn:
- 1101-1262
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
record:
- id: '18307'
relation: used_in_publication
status: public
status: public
title: Complex vaccination strategies prevent the emergence of vaccine resistance
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2023'
...
---
_id: '14864'
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Starting Grant (No. 949120).
article_number: '6166'
article_processing_charge: No
author:
- first_name: Andrea
full_name: Stöllner, Andrea
id: 4bdcf7f6-eb97-11eb-a6c2-9981bbdc3bed
last_name: Stöllner
orcid: 0000-0002-0464-8440
- first_name: Isaac C
full_name: Lenton, Isaac C
id: a550210f-223c-11ec-8182-e2d45e817efb
last_name: Lenton
orcid: 0000-0002-5010-6984
- first_name: Caroline J
full_name: Muller, Caroline J
id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
last_name: Muller
orcid: 0000-0001-5836-5350
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
citation:
ama: 'Stöllner A, Lenton IC, Muller CJ, Waitukaitis SR. Measuring spontaneous charging
of single aerosol particles. In: EGU General Assembly 2023. European Geosciences
Union; 2023. doi:10.5194/egusphere-egu23-6166'
apa: 'Stöllner, A., Lenton, I. C., Muller, C. J., & Waitukaitis, S. R. (2023).
Measuring spontaneous charging of single aerosol particles. In EGU General
Assembly 2023. Vienna, Austria & Virtual: European Geosciences Union.
https://doi.org/10.5194/egusphere-egu23-6166'
chicago: Stöllner, Andrea, Isaac C Lenton, Caroline J Muller, and Scott R Waitukaitis.
“Measuring Spontaneous Charging of Single Aerosol Particles.” In EGU General
Assembly 2023. European Geosciences Union, 2023. https://doi.org/10.5194/egusphere-egu23-6166.
ieee: A. Stöllner, I. C. Lenton, C. J. Muller, and S. R. Waitukaitis, “Measuring
spontaneous charging of single aerosol particles,” in EGU General Assembly
2023, Vienna, Austria & Virtual, 2023.
ista: Stöllner A, Lenton IC, Muller CJ, Waitukaitis SR. 2023. Measuring spontaneous
charging of single aerosol particles. EGU General Assembly 2023. EGU General Assembly,
6166.
mla: Stöllner, Andrea, et al. “Measuring Spontaneous Charging of Single Aerosol
Particles.” EGU General Assembly 2023, 6166, European Geosciences Union,
2023, doi:10.5194/egusphere-egu23-6166.
short: A. Stöllner, I.C. Lenton, C.J. Muller, S.R. Waitukaitis, in:, EGU General
Assembly 2023, European Geosciences Union, 2023.
conference:
end_date: 2023-04-28
location: Vienna, Austria & Virtual
name: EGU General Assembly
start_date: 2023-04-23
corr_author: '1'
date_created: 2024-01-22T12:09:07Z
date_published: 2023-04-23T00:00:00Z
date_updated: 2025-04-14T07:54:10Z
day: '23'
ddc:
- '530'
department:
- _id: CaMu
- _id: ScWa
doi: 10.5194/egusphere-egu23-6166
ec_funded: 1
file:
- access_level: open_access
checksum: 8d6ddbb359e584b156f991f00196d86b
content_type: application/pdf
creator: dernst
date_created: 2024-01-23T13:00:26Z
date_updated: 2024-01-23T13:00:26Z
file_id: '14880'
file_name: 2023_EGU_Stoellner.pdf
file_size: 419736
relation: main_file
success: 1
file_date_updated: 2024-01-23T13:00:26Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 0aa60e99-070f-11eb-9043-a6de6bdc3afa
call_identifier: H2020
grant_number: '949120'
name: 'Tribocharge: a multi-scale approach to an enduring problem in physics'
publication: EGU General Assembly 2023
publication_status: published
publisher: European Geosciences Union
status: public
title: Measuring spontaneous charging of single aerosol particles
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_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14865'
article_number: EGU23-4968
article_processing_charge: No
author:
- first_name: Yi-Ling
full_name: Hwong, Yi-Ling
id: 1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22
last_name: Hwong
orcid: 0000-0001-9281-3479
- first_name: Maxime
full_name: Colin, Maxime
last_name: Colin
- first_name: Philipp
full_name: Aglas, Philipp
id: 02eace56-97fc-11ee-b81a-f0939ca85a77
last_name: Aglas
- first_name: Caroline J
full_name: Muller, Caroline J
id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
last_name: Muller
orcid: 0000-0001-5836-5350
- first_name: Steven
full_name: Sherwood, Steven
last_name: Sherwood
citation:
ama: 'Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood S. Evaluating memory properties
in convection schemes using idealised tests. In: EGU General Assembly 2023.
European Geosciences Union; 2023. doi:10.5194/egusphere-egu23-4968'
apa: 'Hwong, Y.-L., Colin, M., Aglas, P., Muller, C. J., & Sherwood, S. (2023).
Evaluating memory properties in convection schemes using idealised tests. In EGU
General Assembly 2023. Vienna, Austria & Virtual: European Geosciences
Union. https://doi.org/10.5194/egusphere-egu23-4968'
chicago: Hwong, Yi-Ling, Maxime Colin, Philipp Aglas, Caroline J Muller, and Steven
Sherwood. “Evaluating Memory Properties in Convection Schemes Using Idealised
Tests.” In EGU General Assembly 2023. European Geosciences Union, 2023.
https://doi.org/10.5194/egusphere-egu23-4968.
ieee: Y.-L. Hwong, M. Colin, P. Aglas, C. J. Muller, and S. Sherwood, “Evaluating
memory properties in convection schemes using idealised tests,” in EGU General
Assembly 2023, Vienna, Austria & Virtual, 2023.
ista: Hwong Y-L, Colin M, Aglas P, Muller CJ, Sherwood S. 2023. Evaluating memory
properties in convection schemes using idealised tests. EGU General Assembly 2023.
EGU General Assembly, EGU23-4968.
mla: Hwong, Yi-Ling, et al. “Evaluating Memory Properties in Convection Schemes
Using Idealised Tests.” EGU General Assembly 2023, EGU23-4968, European
Geosciences Union, 2023, doi:10.5194/egusphere-egu23-4968.
short: Y.-L. Hwong, M. Colin, P. Aglas, C.J. Muller, S. Sherwood, in:, EGU General
Assembly 2023, European Geosciences Union, 2023.
conference:
end_date: 2023-04-28
location: Vienna, Austria & Virtual
name: EGU General Assembly
start_date: 2023-04-23
corr_author: '1'
date_created: 2024-01-22T12:10:32Z
date_published: 2023-04-23T00:00:00Z
date_updated: 2024-10-09T21:08:04Z
day: '23'
ddc:
- '550'
department:
- _id: CaMu
doi: 10.5194/egusphere-egu23-4968
file:
- access_level: open_access
checksum: 628a27caff437855ab320be46b9e8dcc
content_type: application/pdf
creator: dernst
date_created: 2024-02-05T08:48:41Z
date_updated: 2024-02-05T08:48:41Z
file_id: '14936'
file_name: 2023_EGU_Hwong.pdf
file_size: 317541
relation: main_file
success: 1
file_date_updated: 2024-02-05T08:48:41Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: EGU General Assembly 2023
publication_status: published
publisher: European Geosciences Union
status: public
title: Evaluating memory properties in convection schemes using idealised tests
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_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14866'
article_number: EGU23-15870
article_processing_charge: No
author:
- first_name: Sophie
full_name: Abramian, Sophie
last_name: Abramian
- first_name: Caroline J
full_name: Muller, Caroline J
id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
last_name: Muller
orcid: 0000-0001-5836-5350
- first_name: Camille
full_name: Risi, Camille
last_name: Risi
citation:
ama: 'Abramian S, Muller CJ, Risi C. Extreme precipitation in tropical squall lines.
In: EGU General Assembly 2023. European Geosciences Union; 2023. doi:10.5194/egusphere-egu23-15870'
apa: 'Abramian, S., Muller, C. J., & Risi, C. (2023). Extreme precipitation
in tropical squall lines. In EGU General Assembly 2023. Vienna, Austria
& Virtual: European Geosciences Union. https://doi.org/10.5194/egusphere-egu23-15870'
chicago: Abramian, Sophie, Caroline J Muller, and Camille Risi. “Extreme Precipitation
in Tropical Squall Lines.” In EGU General Assembly 2023. European Geosciences
Union, 2023. https://doi.org/10.5194/egusphere-egu23-15870.
ieee: S. Abramian, C. J. Muller, and C. Risi, “Extreme precipitation in tropical
squall lines,” in EGU General Assembly 2023, Vienna, Austria & Virtual,
2023.
ista: Abramian S, Muller CJ, Risi C. 2023. Extreme precipitation in tropical squall
lines. EGU General Assembly 2023. EGU General Assembly, EGU23-15870.
mla: Abramian, Sophie, et al. “Extreme Precipitation in Tropical Squall Lines.”
EGU General Assembly 2023, EGU23-15870, European Geosciences Union, 2023,
doi:10.5194/egusphere-egu23-15870.
short: S. Abramian, C.J. Muller, C. Risi, in:, EGU General Assembly 2023, European
Geosciences Union, 2023.
conference:
end_date: 2023-04-28
location: Vienna, Austria & Virtual
name: EGU General Assembly
start_date: 2023-04-23
corr_author: '1'
date_created: 2024-01-22T12:10:52Z
date_published: 2023-04-23T00:00:00Z
date_updated: 2024-10-09T21:08:04Z
day: '23'
ddc:
- '550'
department:
- _id: CaMu
doi: 10.5194/egusphere-egu23-15870
file:
- access_level: open_access
checksum: 8cd5bb8bf3d48ceefb395b6875819147
content_type: application/pdf
creator: dernst
date_created: 2024-02-05T08:10:43Z
date_updated: 2024-02-05T08:10:43Z
file_id: '14935'
file_name: 2023_EGU_Abramian.pdf
file_size: 294690
relation: main_file
success: 1
file_date_updated: 2024-02-05T08:10:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: EGU General Assembly 2023
publication_status: published
publisher: European Geosciences Union
status: public
title: Extreme precipitation in tropical squall lines
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_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14867'
abstract:
- lang: eng
text: Starting with the empty graph on $[n]$, at each round, a set of $K=K(n)$
edges is presented chosen uniformly at random from the ones that have not been
presented yet. We are then asked to choose at most one of the presented edges
and add it to the current graph. Our goal is to construct a Hamiltonian graph
with $(1+o(1))n$ edges within as few rounds as possible. We show that in this
process, one can build a Hamiltonian graph of size $(1+o(1))n$ in $(1+o(1))(1+(\log
n)/2K) n$ rounds w.h.p. The case $K=1$ implies that w.h.p. one can build a Hamiltonian
graph by choosing $(1+o(1))n$ edges in an online fashion as they appear along
the first $(0.5+o(1))n\log n$ rounds of the random graph process. This answers
a question of Frieze, Krivelevich and Michaeli. Observe that the number of rounds
is asymptotically optimal as the first $0.5n\log n$ edges do not span a Hamilton
cycle w.h.p. The case $K=\Theta(\log n)$ implies that the Hamiltonicity threshold
of the corresponding Achlioptas process is at most $(1+o(1))(1+(\log n)/2K) n$.
This matches the $(1-o(1))(1+(\log n)/2K) n$ lower bound due to Krivelevich, Lubetzky
and Sudakov and resolves the problem of determining the Hamiltonicity threshold
of the Achlioptas process with $K=\Theta(\log n)$. We also show that in the above
process one can construct a graph $G$ that spans a matching of size $\lfloor V(G)/2)
\rfloor$ and $(0.5+o(1))n$ edges within $(1+o(1))(0.5+(\log n)/2K) n$ rounds w.h.p.
Our proof relies on a robust Hamiltonicity property of the strong $4$-core of
the binomial random graph which we use as a black-box. This property allows it
to absorb paths covering vertices outside the strong $4$-core into a cycle.
acknowledgement: "This project has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement
No 101034413.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Michael
full_name: Anastos, Michael
id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb
last_name: Anastos
citation:
ama: 'Anastos M. Constructing Hamilton cycles and perfect matchings efficiently.
In: Proceedings of the 12th European Conference on Combinatorics, Graph Theory
and Applications. Masaryk University Press; 2023:36-41. doi:10.5817/cz.muni.eurocomb23-005'
apa: 'Anastos, M. (2023). Constructing Hamilton cycles and perfect matchings efficiently.
In Proceedings of the 12th European Conference on Combinatorics, Graph Theory
and Applications (pp. 36–41). Prague, Czech Republic: Masaryk University Press.
https://doi.org/10.5817/cz.muni.eurocomb23-005'
chicago: Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.”
In Proceedings of the 12th European Conference on Combinatorics, Graph Theory
and Applications, 36–41. Masaryk University Press, 2023. https://doi.org/10.5817/cz.muni.eurocomb23-005.
ieee: M. Anastos, “Constructing Hamilton cycles and perfect matchings efficiently,”
in Proceedings of the 12th European Conference on Combinatorics, Graph Theory
and Applications, Prague, Czech Republic, 2023, pp. 36–41.
ista: 'Anastos M. 2023. Constructing Hamilton cycles and perfect matchings efficiently.
Proceedings of the 12th European Conference on Combinatorics, Graph Theory and
Applications. EUROCOMB: European Conference on Combinatorics, Graph Theory and
Applications, 36–41.'
mla: Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.”
Proceedings of the 12th European Conference on Combinatorics, Graph Theory
and Applications, Masaryk University Press, 2023, pp. 36–41, doi:10.5817/cz.muni.eurocomb23-005.
short: M. Anastos, in:, Proceedings of the 12th European Conference on Combinatorics,
Graph Theory and Applications, Masaryk University Press, 2023, pp. 36–41.
conference:
end_date: 2023-09-01
location: Prague, Czech Republic
name: 'EUROCOMB: European Conference on Combinatorics, Graph Theory and Applications'
start_date: 2023-08-28
corr_author: '1'
date_created: 2024-01-22T12:20:15Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2025-09-09T14:24:21Z
day: '01'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.5817/cz.muni.eurocomb23-005
ec_funded: 1
external_id:
arxiv:
- '2209.09860'
isi:
- '001448447300005'
file:
- access_level: open_access
checksum: fb1d9a1e7389d90ec0e5e76934373cf8
content_type: application/pdf
creator: dernst
date_created: 2024-01-24T09:34:43Z
date_updated: 2024-01-24T09:34:43Z
file_id: '14881'
file_name: 2023_Eurocomb_Anastos.pdf
file_size: 464230
relation: main_file
success: 1
file_date_updated: 2024-01-24T09:34:43Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: 36-41
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Proceedings of the 12th European Conference on Combinatorics, Graph Theory
and Applications
publication_identifier:
eissn:
- 2788-3116
publication_status: published
publisher: Masaryk University Press
quality_controlled: '1'
status: public
title: Constructing Hamilton cycles and perfect matchings efficiently
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: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2023'
...
---
_id: '14868'
abstract:
- lang: eng
text: The role of nuclear pore complexes (NPCs) in genome organization remains poorly
characterized due to technical limitations in probing genome-wide protein-DNA
interactions specific to the nuclear periphery. Here, we developed a new sensitive
method, NPC-DamID, which combines in vitro reconstitution of nuclear import and
DamID technology. The fixation-free method identifies chromatin interactions at
the NPCs in intact nuclei from cells and tissues. We found that NPCs are preferentially
associated with common and hierarchically arranged super-enhancers (SEs) across
multiple cell types. We also uncovered phase-separated condensates at NPCs that
compartmentalize and concentrate transcriptional coactivators and structural proteins
at SE-regulated genes. Our results support NPCs as anchoring sites for SE regulatory
hubs and cell-type-specific transcriptional control.
acknowledgement: "This work was supported by M.H.’s NIH R01 grants (NS096786, GM126829)
and Salk Cancer Center Support Grant P30 CA014195. M.H. also received financial
support from the W.M. Keck Foundation and the NOMIS Foundation. Further, M.H. received
support from the AHA-Allen Initiative in Brain Health and Cognitive Impairment award
made jointly through the American Heart Association and The Paul G. Allen Frontiers
Group (19PABH134610000).\r\n\r\nS.T. and J.C. were supported by Salk’s Women & Science
Awards. S.T. also received financial support from the Hewitt Foundation fellowship,
and J.C. is a Paul F. Glenn Biology of Aging fellow. J.H. was supported by the National
Natural Science Foundation of China (31871317 and 32070635).\r\n\r\nWe thank Roberta
Schulte for assistance with in vitro transport assays, for comments that greatly
improved the manuscript, and for helping refine the figures presented in this work.
We thank Shefali Krishna for creating the diagram for the NPC-DamID method, for
her input on super-resolution microscopy analysis, and her insightful comments on
this manuscript. We thank all members of the Hetzer lab for helpful discussions
of these research ideas and their thoughtful comments on this manuscript. We are
also grateful to Salk’s core facilities for their assistance. Specifically, we thank
the Next Generation Sequencing Core (NGS) for sequencing our DamID and RNA NGS libraries,
the Advanced Biophotonics Core for assistance with super-resolution microscopy,
and the Razavi Newman Integrative Genomics and Bioinformatics Core (IGC) for their
input on analysis methods for DamID experiments."
article_processing_charge: Yes
article_type: original
author:
- first_name: Swati
full_name: Tyagi, Swati
last_name: Tyagi
- first_name: Juliana S.
full_name: Capitanio, Juliana S.
last_name: Capitanio
- first_name: Jiawei
full_name: Xu, Jiawei
last_name: Xu
- first_name: Fei
full_name: Chen, Fei
last_name: Chen
- first_name: Rahul
full_name: Sharma, Rahul
last_name: Sharma
- first_name: Jialiang
full_name: Huang, Jialiang
last_name: Huang
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Tyagi S, Capitanio JS, Xu J, et al. High-precision mapping of nuclear pore-chromatin
interactions reveals new principles of genome organization at the nuclear envelope.
eLife. 2023. doi:10.7554/elife.87462
apa: Tyagi, S., Capitanio, J. S., Xu, J., Chen, F., Sharma, R., Huang, J., &
Hetzer, M. (2023). High-precision mapping of nuclear pore-chromatin interactions
reveals new principles of genome organization at the nuclear envelope. ELife.
eLife Sciences Publications. https://doi.org/10.7554/elife.87462
chicago: Tyagi, Swati, Juliana S. Capitanio, Jiawei Xu, Fei Chen, Rahul Sharma,
Jialiang Huang, and Martin Hetzer. “High-Precision Mapping of Nuclear Pore-Chromatin
Interactions Reveals New Principles of Genome Organization at the Nuclear Envelope.”
ELife. eLife Sciences Publications, 2023. https://doi.org/10.7554/elife.87462.
ieee: S. Tyagi et al., “High-precision mapping of nuclear pore-chromatin
interactions reveals new principles of genome organization at the nuclear envelope,”
eLife. eLife Sciences Publications, 2023.
ista: Tyagi S, Capitanio JS, Xu J, Chen F, Sharma R, Huang J, Hetzer M. 2023. High-precision
mapping of nuclear pore-chromatin interactions reveals new principles of genome
organization at the nuclear envelope. eLife.
mla: Tyagi, Swati, et al. “High-Precision Mapping of Nuclear Pore-Chromatin Interactions
Reveals New Principles of Genome Organization at the Nuclear Envelope.” ELife,
eLife Sciences Publications, 2023, doi:10.7554/elife.87462.
short: S. Tyagi, J.S. Capitanio, J. Xu, F. Chen, R. Sharma, J. Huang, M. Hetzer,
ELife (2023).
corr_author: '1'
date_created: 2024-01-22T12:21:56Z
date_published: 2023-06-23T00:00:00Z
date_updated: 2024-07-31T11:56:25Z
day: '23'
department:
- _id: MaHe
doi: 10.7554/elife.87462
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.7554/eLife.87462.1
month: '06'
oa: 1
oa_version: Submitted Version
publication: eLife
publication_status: epub_ahead
publisher: eLife Sciences Publications
status: public
title: High-precision mapping of nuclear pore-chromatin interactions reveals new principles
of genome organization at the nuclear envelope
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14872'
abstract:
- lang: eng
text: We entangled microwave and optical photons for the first time as verified
by a measured two-mode vacuum squeezing of 0.7 dB. This electro-optic entanglement
is the key resource needed to connect cryogenic quantum circuits.
article_number: LM1F.3
article_processing_charge: No
author:
- first_name: Rishabh
full_name: Sahu, Rishabh
id: 47D26E34-F248-11E8-B48F-1D18A9856A87
last_name: Sahu
orcid: 0000-0001-6264-2162
- first_name: Liu
full_name: Qiu, Liu
last_name: Qiu
- first_name: William J
full_name: Hease, William J
id: 29705398-F248-11E8-B48F-1D18A9856A87
last_name: Hease
orcid: 0000-0001-9868-2166
- first_name: Georg M
full_name: Arnold, Georg M
id: 3770C838-F248-11E8-B48F-1D18A9856A87
last_name: Arnold
orcid: 0000-0003-1397-7876
- first_name: Yuri
full_name: Minoguchi, Yuri
last_name: Minoguchi
- first_name: Peter
full_name: Rabl, Peter
last_name: Rabl
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: 'Sahu R, Qiu L, Hease WJ, et al. Entangling microwaves and telecom wavelength
light. In: Frontiers in Optics + Laser Science 2023. Optica Publishing
Group; 2023. doi:10.1364/ls.2023.lm1f.3'
apa: 'Sahu, R., Qiu, L., Hease, W. J., Arnold, G. M., Minoguchi, Y., Rabl, P., &
Fink, J. M. (2023). Entangling microwaves and telecom wavelength light. In Frontiers
in Optics + Laser Science 2023. Tacoma, WA, United States: Optica Publishing
Group. https://doi.org/10.1364/ls.2023.lm1f.3'
chicago: Sahu, Rishabh, Liu Qiu, William J Hease, Georg M Arnold, Yuri Minoguchi,
Peter Rabl, and Johannes M Fink. “Entangling Microwaves and Telecom Wavelength
Light.” In Frontiers in Optics + Laser Science 2023. Optica Publishing
Group, 2023. https://doi.org/10.1364/ls.2023.lm1f.3.
ieee: R. Sahu et al., “Entangling microwaves and telecom wavelength light,”
in Frontiers in Optics + Laser Science 2023, Tacoma, WA, United States,
2023.
ista: Sahu R, Qiu L, Hease WJ, Arnold GM, Minoguchi Y, Rabl P, Fink JM. 2023. Entangling
microwaves and telecom wavelength light. Frontiers in Optics + Laser Science 2023.
Laser Science, LM1F.3.
mla: Sahu, Rishabh, et al. “Entangling Microwaves and Telecom Wavelength Light.”
Frontiers in Optics + Laser Science 2023, LM1F.3, Optica Publishing Group,
2023, doi:10.1364/ls.2023.lm1f.3.
short: R. Sahu, L. Qiu, W.J. Hease, G.M. Arnold, Y. Minoguchi, P. Rabl, J.M. Fink,
in:, Frontiers in Optics + Laser Science 2023, Optica Publishing Group, 2023.
conference:
end_date: 2023-10-12
location: Tacoma, WA, United States
name: Laser Science
start_date: 2023-10-09
corr_author: '1'
date_created: 2024-01-22T12:29:41Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2024-10-09T21:07:59Z
day: '01'
department:
- _id: JoFi
doi: 10.1364/ls.2023.lm1f.3
language:
- iso: eng
month: '10'
oa_version: None
publication: Frontiers in Optics + Laser Science 2023
publication_identifier:
isbn:
- '9781957171296'
publication_status: published
publisher: Optica Publishing Group
quality_controlled: '1'
status: public
title: Entangling microwaves and telecom wavelength light
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14892'
abstract:
- lang: eng
text: 'Code and data necessary to reproduce the simulations and data analyses reported
in our manuscript: Tomé, D.F., Zhang, Y., Aida, T., Mosto, O., Lu, Y., Chen, M.,
Sadeh, S., Roy, D. S., Clopath, C. Dynamic and selective engrams emerge with memory
consolidation. 2023.'
article_processing_charge: No
author:
- first_name: Douglas
full_name: Feitosa Tomé, Douglas
id: 0eed2d40-3d48-11ec-8d38-f789cc2e40b2
last_name: Feitosa Tomé
citation:
ama: 'Feitosa Tomé D. douglastome/dynamic-engrams: Dynamic and selective engrams
emerge with memory consolidation. 2023. doi:10.5281/ZENODO.10251087'
apa: 'Feitosa Tomé, D. (2023). douglastome/dynamic-engrams: Dynamic and selective
engrams emerge with memory consolidation. Zenodo. https://doi.org/10.5281/ZENODO.10251087'
chicago: 'Feitosa Tomé, Douglas. “Douglastome/Dynamic-Engrams: Dynamic and Selective
Engrams Emerge with Memory Consolidation.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.10251087.'
ieee: 'D. Feitosa Tomé, “douglastome/dynamic-engrams: Dynamic and selective engrams
emerge with memory consolidation.” Zenodo, 2023.'
ista: 'Feitosa Tomé D. 2023. douglastome/dynamic-engrams: Dynamic and selective
engrams emerge with memory consolidation, Zenodo, 10.5281/ZENODO.10251087.'
mla: 'Feitosa Tomé, Douglas. Douglastome/Dynamic-Engrams: Dynamic and Selective
Engrams Emerge with Memory Consolidation. Zenodo, 2023, doi:10.5281/ZENODO.10251087.'
short: D. Feitosa Tomé, (2023).
corr_author: '1'
date_created: 2024-01-29T09:06:43Z
date_published: 2023-12-02T00:00:00Z
date_updated: 2025-04-23T07:40:21Z
day: '02'
ddc:
- '570'
department:
- _id: TiVo
doi: 10.5281/ZENODO.10251087
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.10251087
month: '12'
oa: 1
oa_version: None
publisher: Zenodo
related_material:
record:
- id: '14887'
relation: used_in_publication
status: public
status: public
title: 'douglastome/dynamic-engrams: Dynamic and selective engrams emerge with memory
consolidation'
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14919'
abstract:
- lang: eng
text: "GLACIER METEOROLOGICAL DATA SWISS ALPS -2022\r\n"
article_processing_charge: No
author:
- first_name: Thomas
full_name: Shaw, Thomas
id: 3caa3f91-1f03-11ee-96ce-e0e553054d6e
last_name: Shaw
orcid: 0000-0001-7640-6152
- first_name: Pascal
full_name: Buri, Pascal
id: 317987aa-9421-11ee-ac5a-b941b041abba
last_name: Buri
- first_name: Michael
full_name: McCarthy, Michael
last_name: McCarthy
- first_name: Evan
full_name: Miles, Evan
last_name: Miles
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
orcid: 0000-0002-5554-8087
citation:
ama: Shaw T, Buri P, McCarthy M, Miles E, Pellicciotti F. Air temperature and near-surface
meteorology datasets on three Swiss glaciers - Extreme 2022 Summer. 2023. doi:10.5281/ZENODO.8277285
apa: Shaw, T., Buri, P., McCarthy, M., Miles, E., & Pellicciotti, F. (2023).
Air temperature and near-surface meteorology datasets on three Swiss glaciers
- Extreme 2022 Summer. Zenodo. https://doi.org/10.5281/ZENODO.8277285
chicago: Shaw, Thomas, Pascal Buri, Michael McCarthy, Evan Miles, and Francesca
Pellicciotti. “Air Temperature and Near-Surface Meteorology Datasets on Three
Swiss Glaciers - Extreme 2022 Summer.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8277285.
ieee: T. Shaw, P. Buri, M. McCarthy, E. Miles, and F. Pellicciotti, “Air temperature
and near-surface meteorology datasets on three Swiss glaciers - Extreme 2022 Summer.”
Zenodo, 2023.
ista: Shaw T, Buri P, McCarthy M, Miles E, Pellicciotti F. 2023. Air temperature
and near-surface meteorology datasets on three Swiss glaciers - Extreme 2022 Summer,
Zenodo, 10.5281/ZENODO.8277285.
mla: Shaw, Thomas, et al. Air Temperature and Near-Surface Meteorology Datasets
on Three Swiss Glaciers - Extreme 2022 Summer. Zenodo, 2023, doi:10.5281/ZENODO.8277285.
short: T. Shaw, P. Buri, M. McCarthy, E. Miles, F. Pellicciotti, (2023).
corr_author: '1'
date_created: 2024-01-31T12:08:26Z
date_published: 2023-08-23T00:00:00Z
date_updated: 2025-09-04T11:58:38Z
day: '23'
ddc:
- '550'
department:
- _id: FrPe
doi: 10.5281/ZENODO.8277285
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/ZENODO.8277285
month: '08'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '14885'
relation: used_in_publication
status: public
status: public
title: Air temperature and near-surface meteorology datasets on three Swiss glaciers
- Extreme 2022 Summer
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14920'
abstract:
- lang: eng
text: "We consider fixpoint algorithms for two-player games on graphs with $\\omega$-regular
winning conditions, where the environment is constrained by a strong transition
fairness assumption. Strong transition fairness is a widely occurring special
case of strong fairness, which requires that any execution is strongly fair with
respect to a specified set of live edges: whenever the\r\nsource vertex of a live
edge is visited infinitely often along a play, the edge itself is traversed infinitely
often along the play as well. We show that, surprisingly, strong transition fairness
retains the algorithmic characteristics of the fixpoint algorithms for $\\omega$-regular
games -- the new algorithms have the same alternation depth as the classical algorithms
but invoke a new type of predecessor operator. For Rabin games with $k$ pairs,
the complexity of the new algorithm is $O(n^{k+2}k!)$ symbolic steps, which is
independent of the number of live edges in the strong transition fairness assumption.
Further, we show that GR(1) specifications with strong transition fairness assumptions
can be solved with a 3-nested fixpoint algorithm, same as the usual algorithm.
In contrast, strong fairness necessarily requires increasing the alternation depth
depending on the number of fairness assumptions. We get symbolic algorithms for
(generalized) Rabin, parity and GR(1) objectives under strong transition fairness
assumptions as well as a direct symbolic algorithm for qualitative winning in
stochastic\r\n$\\omega$-regular games that runs in $O(n^{k+2}k!)$ symbolic steps,
improving the state of the art. Finally, we have implemented a BDD-based synthesis
engine based on our algorithm. We show on a set of synthetic and real benchmarks
that our algorithm is scalable, parallelizable, and outperforms previous algorithms
by orders of magnitude."
acknowledgement: A previous version of this paper has appeared in TACAS 2022. Authors
ordered alphabetically. T. Banerjee was interning with MPI-SWS when this research
was conducted. R. Majumdar and A.-K. Schmuck are partially supported by DFG project
389792660 TRR 248–CPEC. A.-K. Schmuck is additionally funded through DFG project
(SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093.
article_number: '4'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Tamajit
full_name: Banerjee, Tamajit
last_name: Banerjee
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
- first_name: Anne-Kathrin
full_name: Schmuck, Anne-Kathrin
last_name: Schmuck
- first_name: Sadegh
full_name: Soudjani, Sadegh
last_name: Soudjani
citation:
ama: Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. Fast symbolic algorithms
for mega-regular games under strong transition fairness. TheoretiCS. 2023;2.
doi:10.46298/theoretics.23.4
apa: Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., & Soudjani, S.
(2023). Fast symbolic algorithms for mega-regular games under strong transition
fairness. TheoretiCS. EPI Sciences. https://doi.org/10.46298/theoretics.23.4
chicago: Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck,
and Sadegh Soudjani. “Fast Symbolic Algorithms for Mega-Regular Games under Strong
Transition Fairness.” TheoretiCS. EPI Sciences, 2023. https://doi.org/10.46298/theoretics.23.4.
ieee: T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “Fast
symbolic algorithms for mega-regular games under strong transition fairness,”
TheoretiCS, vol. 2. EPI Sciences, 2023.
ista: Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2023. Fast symbolic
algorithms for mega-regular games under strong transition fairness. TheoretiCS.
2, 4.
mla: Banerjee, Tamajit, et al. “Fast Symbolic Algorithms for Mega-Regular Games
under Strong Transition Fairness.” TheoretiCS, vol. 2, 4, EPI Sciences,
2023, doi:10.46298/theoretics.23.4.
short: T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, TheoretiCS
2 (2023).
corr_author: '1'
date_created: 2024-01-31T13:40:49Z
date_published: 2023-02-24T00:00:00Z
date_updated: 2025-04-14T07:55:57Z
day: '24'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.46298/theoretics.23.4
ec_funded: 1
external_id:
arxiv:
- '2202.07480'
file:
- access_level: open_access
checksum: 2972d531122a6f15727b396110fb3f5c
content_type: application/pdf
creator: dernst
date_created: 2024-02-05T10:19:35Z
date_updated: 2024-02-05T10:19:35Z
file_id: '14940'
file_name: 2023_TheoretiCS_Banerjee.pdf
file_size: 917076
relation: main_file
success: 1
file_date_updated: 2024-02-05T10:19:35Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: TheoretiCS
publication_identifier:
issn:
- 2751-4838
publication_status: published
publisher: EPI Sciences
quality_controlled: '1'
status: public
title: Fast symbolic algorithms for mega-regular games under strong transition fairness
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2023'
...
---
_id: '14922'
abstract:
- lang: eng
text: 'We propose a novel approach to concentration for non-independent random variables.
The main idea is to ``pretend'''' that the random variables are independent and
pay a multiplicative price measuring how far they are from actually being independent.
This price is encapsulated in the Hellinger integral between the joint and the
product of the marginals, which is then upper bounded leveraging tensorisation
properties. Our bounds represent a natural generalisation of concentration inequalities
in the presence of dependence: we recover exactly the classical bounds (McDiarmid''s
inequality) when the random variables are independent. Furthermore, in a ``large
deviations'''' regime, we obtain the same decay in the probability as for the
independent case, even when the random variables display non-trivial dependencies.
To show this, we consider a number of applications of interest. First, we provide
a bound for Markov chains with finite state space. Then, we consider the Simple
Symmetric Random Walk, which is a non-contracting Markov chain, and a non-Markovian
setting in which the stochastic process depends on its entire past. To conclude,
we propose an application to Markov Chain Monte Carlo methods, where our approach
leads to an improved lower bound on the minimum burn-in period required to reach
a certain accuracy. In all of these settings, we provide a regime of parameters
in which our bound fares better than what the state of the art can provide.'
acknowledgement: The authors are partially supported by the 2019 Lopez-Loreta Prize.
They would also like to thank Professor Jan Maas for providing valuable suggestions
and comments on an early version of the work.
article_processing_charge: No
arxiv: 1
author:
- first_name: Amedeo Roberto
full_name: Esposito, Amedeo Roberto
id: 9583e921-e1ad-11ec-9862-cef099626dc9
last_name: Esposito
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Esposito AR, Mondelli M. Concentration without independence via information
measures. In: Proceedings of 2023 IEEE International Symposium on Information
Theory. IEEE; 2023:400-405. doi:10.1109/isit54713.2023.10206899'
apa: 'Esposito, A. R., & Mondelli, M. (2023). Concentration without independence
via information measures. In Proceedings of 2023 IEEE International Symposium
on Information Theory (pp. 400–405). Taipei, Taiwan: IEEE. https://doi.org/10.1109/isit54713.2023.10206899'
chicago: Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence
via Information Measures.” In Proceedings of 2023 IEEE International Symposium
on Information Theory, 400–405. IEEE, 2023. https://doi.org/10.1109/isit54713.2023.10206899.
ieee: A. R. Esposito and M. Mondelli, “Concentration without independence via information
measures,” in Proceedings of 2023 IEEE International Symposium on Information
Theory, Taipei, Taiwan, 2023, pp. 400–405.
ista: 'Esposito AR, Mondelli M. 2023. Concentration without independence via information
measures. Proceedings of 2023 IEEE International Symposium on Information Theory.
ISIT: International Symposium on Information Theory, 400–405.'
mla: Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence
via Information Measures.” Proceedings of 2023 IEEE International Symposium
on Information Theory, IEEE, 2023, pp. 400–05, doi:10.1109/isit54713.2023.10206899.
short: A.R. Esposito, M. Mondelli, in:, Proceedings of 2023 IEEE International Symposium
on Information Theory, IEEE, 2023, pp. 400–405.
conference:
end_date: 2023-06-30
location: Taipei, Taiwan
name: 'ISIT: International Symposium on Information Theory'
start_date: 2023-06-25
corr_author: '1'
date_created: 2024-02-02T11:18:40Z
date_published: 2023-06-30T00:00:00Z
date_updated: 2025-09-04T13:06:52Z
day: '30'
department:
- _id: MaMo
doi: 10.1109/isit54713.2023.10206899
external_id:
arxiv:
- '2303.07245'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2303.07245
month: '06'
oa: 1
oa_version: Preprint
page: 400-405
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of 2023 IEEE International Symposium on Information Theory
publication_identifier:
eisbn:
- '9781665475549'
eissn:
- 2157-8117
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '15172'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Concentration without independence via information measures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14923'
abstract:
- lang: eng
text: We study the performance of a Bayesian statistician who estimates a rank-one
signal corrupted by non-symmetric rotationally invariant noise with a generic
distribution of singular values. As the signal-to-noise ratio and the noise structure
are unknown, a Gaussian setup is incorrectly assumed. We derive the exact analytic
expression for the error of the mismatched Bayes estimator and also provide the
analysis of an approximate message passing (AMP) algorithm. The first result exploits
the asymptotic behavior of spherical integrals for rectangular matrices and of
low-rank matrix perturbations; the second one relies on the design and analysis
of an auxiliary AMP. The numerical experiments show that there is a performance
gap between the AMP and Bayes estimators, which is due to the incorrect estimation
of the signal norm.
article_processing_charge: No
arxiv: 1
author:
- first_name: Teng
full_name: Fu, Teng
last_name: Fu
- first_name: YuHao
full_name: Liu, YuHao
last_name: Liu
- first_name: Jean
full_name: Barbier, Jean
last_name: Barbier
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: ShanSuo
full_name: Liang, ShanSuo
last_name: Liang
- first_name: TianQi
full_name: Hou, TianQi
last_name: Hou
citation:
ama: 'Fu T, Liu Y, Barbier J, Mondelli M, Liang S, Hou T. Mismatched estimation
of non-symmetric rank-one matrices corrupted by structured noise. In: Proceedings
of 2023 IEEE International Symposium on Information Theory. IEEE; 2023:1178-1183.
doi:10.1109/isit54713.2023.10206671'
apa: 'Fu, T., Liu, Y., Barbier, J., Mondelli, M., Liang, S., & Hou, T. (2023).
Mismatched estimation of non-symmetric rank-one matrices corrupted by structured
noise. In Proceedings of 2023 IEEE International Symposium on Information Theory
(pp. 1178–1183). Taipei, Taiwan: IEEE. https://doi.org/10.1109/isit54713.2023.10206671'
chicago: Fu, Teng, YuHao Liu, Jean Barbier, Marco Mondelli, ShanSuo Liang, and TianQi
Hou. “Mismatched Estimation of Non-Symmetric Rank-One Matrices Corrupted by Structured
Noise.” In Proceedings of 2023 IEEE International Symposium on Information
Theory, 1178–83. IEEE, 2023. https://doi.org/10.1109/isit54713.2023.10206671.
ieee: T. Fu, Y. Liu, J. Barbier, M. Mondelli, S. Liang, and T. Hou, “Mismatched
estimation of non-symmetric rank-one matrices corrupted by structured noise,”
in Proceedings of 2023 IEEE International Symposium on Information Theory,
Taipei, Taiwan, 2023, pp. 1178–1183.
ista: 'Fu T, Liu Y, Barbier J, Mondelli M, Liang S, Hou T. 2023. Mismatched estimation
of non-symmetric rank-one matrices corrupted by structured noise. Proceedings
of 2023 IEEE International Symposium on Information Theory. ISIT: International
Symposium on Information Theory, 1178–1183.'
mla: Fu, Teng, et al. “Mismatched Estimation of Non-Symmetric Rank-One Matrices
Corrupted by Structured Noise.” Proceedings of 2023 IEEE International Symposium
on Information Theory, IEEE, 2023, pp. 1178–83, doi:10.1109/isit54713.2023.10206671.
short: T. Fu, Y. Liu, J. Barbier, M. Mondelli, S. Liang, T. Hou, in:, Proceedings
of 2023 IEEE International Symposium on Information Theory, IEEE, 2023, pp. 1178–1183.
conference:
end_date: 2023-06-30
location: Taipei, Taiwan
name: 'ISIT: International Symposium on Information Theory'
start_date: 2023-06-25
corr_author: '1'
date_created: 2024-02-02T11:20:39Z
date_published: 2023-06-30T00:00:00Z
date_updated: 2025-07-10T11:51:04Z
day: '30'
department:
- _id: MaMo
doi: 10.1109/isit54713.2023.10206671
external_id:
arxiv:
- '2302.03306'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2302.03306
month: '06'
oa: 1
oa_version: Preprint
page: 1178-1183
publication: Proceedings of 2023 IEEE International Symposium on Information Theory
publication_identifier:
eissn:
- 2157-8117
isbn:
- '9781665475549'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mismatched estimation of non-symmetric rank-one matrices corrupted by structured
noise
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14924'
abstract:
- lang: eng
text: "The stochastic heavy ball method (SHB), also known as stochastic gradient
descent (SGD) with Polyak's momentum, is widely used in training neural networks.
However, despite the remarkable success of such algorithm in practice, its theoretical
characterization remains limited. In this paper, we focus on neural networks with
two and three layers and provide a rigorous understanding of the properties of
the solutions found by SHB: \\emph{(i)} stability after dropping out part of the
neurons, \\emph{(ii)} connectivity along a low-loss path, and \\emph{(iii)} convergence
to the global optimum.\r\nTo achieve this goal, we take a mean-field view and
relate the SHB dynamics to a certain partial differential equation in the limit
of large network widths. This mean-field perspective has inspired a recent line
of work focusing on SGD while, in contrast, our paper considers an algorithm with
momentum. More specifically, after proving existence and uniqueness of the limit
differential equations, we show convergence to the global optimum and give a quantitative
bound between the mean-field limit and the SHB dynamics of a finite-width network.
Armed with this last bound, we are able to establish the dropout-stability and
connectivity of SHB solutions."
acknowledgement: D. Wu and M. Mondelli are partially supported by the 2019 Lopez-Loreta
Prize. V. Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16_019/0000765
"Research Center for Informatics".
alternative_title:
- TMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Diyuan
full_name: Wu, Diyuan
id: 1a5914c2-896a-11ed-bdf8-fb80621a0635
last_name: Wu
- first_name: Vyacheslav
full_name: Kungurtsev, Vyacheslav
last_name: Kungurtsev
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Wu D, Kungurtsev V, Mondelli M. Mean-field analysis for heavy ball methods:
Dropout-stability, connectivity, and global convergence. In: Transactions on
Machine Learning Research. ML Research Press; 2023.'
apa: 'Wu, D., Kungurtsev, V., & Mondelli, M. (2023). Mean-field analysis for
heavy ball methods: Dropout-stability, connectivity, and global convergence. In
Transactions on Machine Learning Research. ML Research Press.'
chicago: 'Wu, Diyuan, Vyacheslav Kungurtsev, and Marco Mondelli. “Mean-Field Analysis
for Heavy Ball Methods: Dropout-Stability, Connectivity, and Global Convergence.”
In Transactions on Machine Learning Research. ML Research Press, 2023.'
ieee: 'D. Wu, V. Kungurtsev, and M. Mondelli, “Mean-field analysis for heavy ball
methods: Dropout-stability, connectivity, and global convergence,” in Transactions
on Machine Learning Research, 2023.'
ista: 'Wu D, Kungurtsev V, Mondelli M. 2023. Mean-field analysis for heavy ball
methods: Dropout-stability, connectivity, and global convergence. Transactions
on Machine Learning Research. , TMLR, .'
mla: 'Wu, Diyuan, et al. “Mean-Field Analysis for Heavy Ball Methods: Dropout-Stability,
Connectivity, and Global Convergence.” Transactions on Machine Learning Research,
ML Research Press, 2023.'
short: D. Wu, V. Kungurtsev, M. Mondelli, in:, Transactions on Machine Learning
Research, ML Research Press, 2023.
corr_author: '1'
date_created: 2024-02-02T11:21:56Z
date_published: 2023-02-28T00:00:00Z
date_updated: 2026-06-18T17:41:36Z
day: '28'
ddc:
- '000'
department:
- _id: MaMo
external_id:
arxiv:
- '2210.06819'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2210.06819
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Transactions on Machine Learning Research
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: 'Mean-field analysis for heavy ball methods: Dropout-stability, connectivity,
and global convergence'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14949'
abstract:
- lang: eng
text: Many approaches have been proposed to use diffusion models to augment training
datasets for downstream tasks, such as classification. However, diffusion models
are themselves trained on large datasets, often with noisy annotations, and it
remains an open question to which extent these models contribute to downstream
classification performance. In particular, it remains unclear if they generalize
enough to improve over directly using the additional data of their pre-training
process for augmentation. We systematically evaluate a range of existing methods
to generate images from diffusion models and study new extensions to assess their
benefit for data augmentation. Personalizing diffusion models towards the target
data outperforms simpler prompting strategies. However, using the pre-training
data of the diffusion model alone, via a simple nearest-neighbor retrieval procedure,
leads to even stronger downstream performance. Our study explores the potential
of diffusion models in generating new training data, and surprisingly finds that
these sophisticated models are not yet able to beat a simple and strong image
retrieval baseline on simple downstream vision tasks.
acknowledgement: The authors would like to thank Varad Gunjal and Vishaal Udandarao.
MFB thanks the International Max Planck Research School for Intelligent Systems
(IMPRS-IS).
alternative_title:
- TMLR
article_processing_charge: No
article_type: original
author:
- first_name: Max
full_name: Burg, Max
last_name: Burg
- first_name: Florian
full_name: Wenzel, Florian
last_name: Wenzel
- first_name: Dominik
full_name: Zietlow, Dominik
last_name: Zietlow
- first_name: Max
full_name: Horn, Max
last_name: Horn
- first_name: Osama
full_name: Makansi, Osama
last_name: Makansi
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Chris
full_name: Russell, Chris
last_name: Russell
citation:
ama: Burg M, Wenzel F, Zietlow D, et al. Image retrieval outperforms diffusion models
on data augmentation. Journal of Machine Learning Research. 2023.
apa: Burg, M., Wenzel, F., Zietlow, D., Horn, M., Makansi, O., Locatello, F., &
Russell, C. (2023). Image retrieval outperforms diffusion models on data augmentation.
Journal of Machine Learning Research. ML Research Press.
chicago: Burg, Max, Florian Wenzel, Dominik Zietlow, Max Horn, Osama Makansi, Francesco
Locatello, and Chris Russell. “Image Retrieval Outperforms Diffusion Models on
Data Augmentation.” Journal of Machine Learning Research. ML Research Press,
2023.
ieee: M. Burg et al., “Image retrieval outperforms diffusion models on data
augmentation,” Journal of Machine Learning Research. ML Research Press,
2023.
ista: Burg M, Wenzel F, Zietlow D, Horn M, Makansi O, Locatello F, Russell C. 2023.
Image retrieval outperforms diffusion models on data augmentation. Journal of
Machine Learning Research.
mla: Burg, Max, et al. “Image Retrieval Outperforms Diffusion Models on Data Augmentation.”
Journal of Machine Learning Research, ML Research Press, 2023.
short: M. Burg, F. Wenzel, D. Zietlow, M. Horn, O. Makansi, F. Locatello, C. Russell,
Journal of Machine Learning Research (2023).
date_created: 2024-02-07T14:57:39Z
date_published: 2023-12-10T00:00:00Z
date_updated: 2024-02-12T08:30:21Z
day: '10'
ddc:
- '000'
department:
- _id: FrLo
file:
- access_level: open_access
checksum: af87ddea7908923426365347b9c87ba7
content_type: application/pdf
creator: ptazenko
date_created: 2024-02-07T14:57:32Z
date_updated: 2024-02-07T14:57:32Z
file_id: '14950'
file_name: Burg_et_al_2023_Image_retrieval_outperforms.pdf
file_size: 27325153
relation: main_file
file_date_updated: 2024-02-07T14:57:32Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/forum?id=xflYdGZMpv
month: '12'
oa: 1
oa_version: Published Version
publication: Journal of Machine Learning Research
publication_identifier:
eissn:
- 2835-8856
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: Image retrieval outperforms diffusion models on data augmentation
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14953'
abstract:
- lang: eng
text: This paper provides statistical sample complexity bounds for score-matching
and its applications in causal discovery. We demonstrate that accurate estimation
of the score function is achievable by training a standard deep ReLU neural network
using stochastic gradient descent. We establish bounds on the error rate of recovering
causal relationships using the score-matching-based causal discovery method of
Rolland et al. [2022], assuming a sufficiently good estimation of the score function.
Finally, we analyze the upper bound of score-matching estimation within the score-based
generative modeling, which has been applied for causal discovery but is also of
independent interest within the domain of generative models.
acknowledgement: 'We are thankful to the reviewers for providing constructive feedback
and Kun Zhang and Dominik Janzing for helpful discussion on the special case of
deterministic children. This work was supported by Hasler Foundation Program: Hasler
Responsible AI (project number 21043). This work was supported by the Swiss National
Science Foundation (SNSF) under grant number 200021_205011. Francesco Locatello
did not contribute to this work at Amazon. '
article_number: '2310.18123'
article_processing_charge: No
arxiv: 1
author:
- first_name: Zhenyu
full_name: Zhu, Zhenyu
last_name: Zhu
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Volkan
full_name: Cevher, Volkan
last_name: Cevher
citation:
ama: 'Zhu Z, Locatello F, Cevher V. Sample complexity bounds for score-matching:
Causal discovery and generative modeling. arXiv. doi:10.48550/arXiv.2310.18123'
apa: 'Zhu, Z., Locatello, F., & Cevher, V. (n.d.). Sample complexity bounds
for score-matching: Causal discovery and generative modeling. arXiv. https://doi.org/10.48550/arXiv.2310.18123'
chicago: 'Zhu, Zhenyu, Francesco Locatello, and Volkan Cevher. “Sample Complexity
Bounds for Score-Matching: Causal Discovery and Generative Modeling.” ArXiv,
n.d. https://doi.org/10.48550/arXiv.2310.18123.'
ieee: 'Z. Zhu, F. Locatello, and V. Cevher, “Sample complexity bounds for score-matching:
Causal discovery and generative modeling,” arXiv. .'
ista: 'Zhu Z, Locatello F, Cevher V. Sample complexity bounds for score-matching:
Causal discovery and generative modeling. arXiv, 2310.18123.'
mla: 'Zhu, Zhenyu, et al. “Sample Complexity Bounds for Score-Matching: Causal Discovery
and Generative Modeling.” ArXiv, 2310.18123, doi:10.48550/arXiv.2310.18123.'
short: Z. Zhu, F. Locatello, V. Cevher, ArXiv (n.d.).
date_created: 2024-02-07T15:11:11Z
date_published: 2023-10-27T00:00:00Z
date_updated: 2024-02-12T09:45:58Z
day: '27'
department:
- _id: FrLo
doi: 10.48550/arXiv.2310.18123
external_id:
arxiv:
- '2310.18123'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2310.18123
month: '10'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 'Sample complexity bounds for score-matching: Causal discovery and generative
modeling'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14954'
abstract:
- lang: eng
text: "When domain knowledge is limited and experimentation is restricted by ethical,
financial, or time constraints, practitioners turn to observational causal discovery
methods to recover the causal structure, exploiting the statistical properties
of their data. Because causal discovery without further assumptions is an ill-posed
problem, each algorithm comes with its own set of\r\nusually untestable assumptions,
some of which are hard to meet in real datasets. Motivated by these considerations,
this paper extensively benchmarks the empirical performance of recent causal discovery
methods on observational i.i.d. data generated under different background conditions,
allowing for violations of the critical assumptions required by each selected
approach. Our experimental findings show that score matching-based methods demonstrate\r\nsurprising
performance in the false positive and false negative rate of the inferred graph
in these challenging scenarios, and we provide theoretical insights into their
performance. This work is also the first effort to benchmark the stability of
causal discovery algorithms with respect to the values of their hyperparameters.
Finally, we hope this paper will set a new standard for the evaluation of causal
discovery methods and can serve as an accessible entry point for practitioners
interested in the field, highlighting the empirical implications of different
algorithm choices."
acknowledgement: "We thank Kun Zhang and Carl-Johann Simon-Gabriel for the insightful
discussions. This work\r\nhas been supported by AFOSR, grant n. FA8655-20-1-7035.
FM is supported by Programma\r\nOperativo Nazionale ricerca e innovazione 2014-2020.
FM partially contributed to this work during an internship at Amazon Web Services
with FL. FL partially contributed while at AWS."
article_number: '2310.13387'
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Montagna, Francesco
last_name: Montagna
- first_name: Atalanti A.
full_name: Mastakouri, Atalanti A.
last_name: Mastakouri
- first_name: Elias
full_name: Eulig, Elias
last_name: Eulig
- first_name: Nicoletta
full_name: Noceti, Nicoletta
last_name: Noceti
- first_name: Lorenzo
full_name: Rosasco, Lorenzo
last_name: Rosasco
- first_name: Dominik
full_name: Janzing, Dominik
last_name: Janzing
- first_name: Bryon
full_name: Aragam, Bryon
last_name: Aragam
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
citation:
ama: Montagna F, Mastakouri AA, Eulig E, et al. Assumption violations in causal
discovery and the robustness of score matching. arXiv. doi:10.48550/arXiv.2310.13387
apa: Montagna, F., Mastakouri, A. A., Eulig, E., Noceti, N., Rosasco, L., Janzing,
D., … Locatello, F. (n.d.). Assumption violations in causal discovery and the
robustness of score matching. arXiv. https://doi.org/10.48550/arXiv.2310.13387
chicago: Montagna, Francesco, Atalanti A. Mastakouri, Elias Eulig, Nicoletta Noceti,
Lorenzo Rosasco, Dominik Janzing, Bryon Aragam, and Francesco Locatello. “Assumption
Violations in Causal Discovery and the Robustness of Score Matching.” ArXiv,
n.d. https://doi.org/10.48550/arXiv.2310.13387.
ieee: F. Montagna et al., “Assumption violations in causal discovery and
the robustness of score matching,” arXiv. .
ista: Montagna F, Mastakouri AA, Eulig E, Noceti N, Rosasco L, Janzing D, Aragam
B, Locatello F. Assumption violations in causal discovery and the robustness of
score matching. arXiv, 2310.13387.
mla: Montagna, Francesco, et al. “Assumption Violations in Causal Discovery and
the Robustness of Score Matching.” ArXiv, 2310.13387, doi:10.48550/arXiv.2310.13387.
short: F. Montagna, A.A. Mastakouri, E. Eulig, N. Noceti, L. Rosasco, D. Janzing,
B. Aragam, F. Locatello, ArXiv (n.d.).
date_created: 2024-02-07T15:11:56Z
date_published: 2023-10-20T00:00:00Z
date_updated: 2024-02-12T09:51:15Z
day: '20'
department:
- _id: FrLo
doi: 10.48550/arXiv.2310.13387
external_id:
arxiv:
- '2310.13387'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2310.13387
month: '10'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Assumption violations in causal discovery and the robustness of score matching
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
OA_place: repository
OA_type: green
_id: '14958'
abstract:
- lang: eng
text: Causal representation learning (CRL) aims at identifying high-level causal
variables from low-level data, e.g. images. Current methods usually assume that
all causal variables are captured in the high-dimensional observations. In this
work, we focus on learning causal representations from data under partial observability,
i.e., when some of the causal variables are not observed in the measurements,
and the set of masked variables changes across the different samples. We introduce
some initial theoretical results for identifying causal variables under partial
observability by exploiting a sparsity regularizer, focusing in particular on
the linear and piecewise linear mixing function case. We provide a theorem that
allows us to identify the causal variables up to permutation and element-wise
linear transformations in the linear case and a lemma that allows us to identify
causal variables up to linear transformation in the piecewise case. Finally, we
provide a conjecture that would allow us to identify the causal variables up to
permutation and element-wise linear transformations also in the piecewise linear
case. We test the theorem and conjecture on simulated data, showing the effectiveness
of our method.
acknowledgement: "This work was initiated at the Second Bellairs Workshop on Causality
held at the Bellairs Research Institute, January 6–13, 2022; we thank all workshop
participants for providing a stimulating research environment. The research of DX
and SM was supported by the Air Force Office of Scientific Research under award
number FA8655-22-1-7155. Any opinions, findings, and conclusions or recommendations
expressed in this material are those of the author(s) and do not necessarily reflect
the views of the United States Air Force. We also thank SURF for the support in
using the Dutch National Supercomputer Snellius. DY was supported by an Amazon fellowship
and the International Max Planck Research School for Intelligent Systems (IMPRS-IS).
Work done outside of Amazon. SL was supported by an IVADO excellence PhD scholarship
and by Samsung Electronics Co., Ldt. JvK acknowledges support from the German Federal
Ministry of Education and Research (BMBF)\r\nthrough the Tübingen AI Center (FKZ:
01IS18039B).\r\n"
article_number: '54'
article_processing_charge: No
author:
- first_name: Danru
full_name: Xu, Danru
last_name: Xu
- first_name: Dingling
full_name: Yao, Dingling
id: d3e02e50-48a8-11ee-8f62-c108061797fa
last_name: Yao
- first_name: Sebastien
full_name: Lachapelle, Sebastien
last_name: Lachapelle
- first_name: Perouz
full_name: Taslakian, Perouz
last_name: Taslakian
- first_name: Julius
full_name: von Kügelgen, Julius
last_name: von Kügelgen
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Sara
full_name: Magliacane, Sara
last_name: Magliacane
citation:
ama: 'Xu D, Yao D, Lachapelle S, et al. A sparsity principle for partially observable
causal representation learning. In: Causal Representation Learning Workshop
at NeurIPS 2023. OpenReview; 2023.'
apa: 'Xu, D., Yao, D., Lachapelle, S., Taslakian, P., von Kügelgen, J., Locatello,
F., & Magliacane, S. (2023). A sparsity principle for partially observable
causal representation learning. In Causal Representation Learning Workshop
at NeurIPS 2023. New Orleans, LA, United States: OpenReview.'
chicago: Xu, Danru, Dingling Yao, Sebastien Lachapelle, Perouz Taslakian, Julius
von Kügelgen, Francesco Locatello, and Sara Magliacane. “A Sparsity Principle
for Partially Observable Causal Representation Learning.” In Causal Representation
Learning Workshop at NeurIPS 2023. OpenReview, 2023.
ieee: D. Xu et al., “A sparsity principle for partially observable causal
representation learning,” in Causal Representation Learning Workshop at NeurIPS
2023, New Orleans, LA, United States, 2023.
ista: 'Xu D, Yao D, Lachapelle S, Taslakian P, von Kügelgen J, Locatello F, Magliacane
S. 2023. A sparsity principle for partially observable causal representation learning.
Causal Representation Learning Workshop at NeurIPS 2023. CRL: Causal Representation
Learning Workshop at NeurIPS, 54.'
mla: Xu, Danru, et al. “A Sparsity Principle for Partially Observable Causal Representation
Learning.” Causal Representation Learning Workshop at NeurIPS 2023, 54,
OpenReview, 2023.
short: D. Xu, D. Yao, S. Lachapelle, P. Taslakian, J. von Kügelgen, F. Locatello,
S. Magliacane, in:, Causal Representation Learning Workshop at NeurIPS 2023, OpenReview,
2023.
conference:
end_date: 2023-12-15
location: New Orleans, LA, United States
name: 'CRL: Causal Representation Learning Workshop at NeurIPS'
start_date: 2023-12-15
date_created: 2024-02-07T15:17:51Z
date_published: 2023-12-05T00:00:00Z
date_updated: 2025-02-04T12:37:34Z
day: '05'
ddc:
- '000'
department:
- _id: FrLo
file:
- access_level: open_access
checksum: 484efc27bda75ed6666044989695d9b6
content_type: application/pdf
creator: dernst
date_created: 2024-02-13T08:50:53Z
date_updated: 2024-02-13T08:50:53Z
file_id: '14982'
file_name: 2023_CRL_Xu.pdf
file_size: 552357
relation: main_file
success: 1
file_date_updated: 2024-02-13T08:50:53Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/forum?id=Whr6uobelR
month: '12'
oa: 1
oa_version: Published Version
publication: Causal Representation Learning Workshop at NeurIPS 2023
publication_status: published
publisher: OpenReview
quality_controlled: '1'
status: public
title: A sparsity principle for partially observable causal representation learning
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14961'
abstract:
- lang: eng
text: "The use of simulated data in the field of causal discovery is ubiquitous
due to the scarcity of annotated real data. Recently, Reisach et al., 2021 highlighted
the emergence of patterns in simulated linear data, which displays increasing
marginal variance in the casual direction. As an ablation in their experiments,
Montagna et al., 2023 found that similar patterns may emerge in\r\nnonlinear models
for the variance of the score vector $\\nabla \\log p_{\\mathbf{X}}$, and introduced
the ScoreSort algorithm. In this work, we formally define and characterize this
score-sortability pattern of nonlinear additive noise models. We find that it
defines a class of identifiable (bivariate) causal models overlapping with nonlinear
additive noise models. We\r\ntheoretically demonstrate the advantages of ScoreSort
in terms of statistical efficiency compared to prior state-of-the-art score matching-based
methods and empirically show the score-sortability of the most common synthetic
benchmarks in the literature. Our findings remark (1) the lack of diversity in
the data as an important limitation in the evaluation of nonlinear causal discovery
approaches, (2) the importance of thoroughly testing different settings within
a problem class, and (3) the importance of analyzing statistical properties in\r\ncausal
discovery, where research is often limited to defining identifiability conditions
of the model. "
article_number: '2310.14246'
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Montagna, Francesco
last_name: Montagna
- first_name: Nicoletta
full_name: Noceti, Nicoletta
last_name: Noceti
- first_name: Lorenzo
full_name: Rosasco, Lorenzo
last_name: Rosasco
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
citation:
ama: Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery
of nonlinear models by score matching. arXiv. doi:10.48550/arXiv.2310.14246
apa: Montagna, F., Noceti, N., Rosasco, L., & Locatello, F. (n.d.). Shortcuts
for causal discovery of nonlinear models by score matching. arXiv. https://doi.org/10.48550/arXiv.2310.14246
chicago: Montagna, Francesco, Nicoletta Noceti, Lorenzo Rosasco, and Francesco Locatello.
“Shortcuts for Causal Discovery of Nonlinear Models by Score Matching.” ArXiv,
n.d. https://doi.org/10.48550/arXiv.2310.14246.
ieee: F. Montagna, N. Noceti, L. Rosasco, and F. Locatello, “Shortcuts for causal
discovery of nonlinear models by score matching,” arXiv. .
ista: Montagna F, Noceti N, Rosasco L, Locatello F. Shortcuts for causal discovery
of nonlinear models by score matching. arXiv, 2310.14246.
mla: Montagna, Francesco, et al. “Shortcuts for Causal Discovery of Nonlinear Models
by Score Matching.” ArXiv, 2310.14246, doi:10.48550/arXiv.2310.14246.
short: F. Montagna, N. Noceti, L. Rosasco, F. Locatello, ArXiv (n.d.).
corr_author: '1'
date_created: 2024-02-08T15:31:46Z
date_published: 2023-10-22T00:00:00Z
date_updated: 2024-10-09T21:08:10Z
day: '22'
department:
- _id: FrLo
doi: 10.48550/arXiv.2310.14246
external_id:
arxiv:
- '2310.14246'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2310.14246
month: '10'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Shortcuts for causal discovery of nonlinear models by score matching
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...