---
OA_place: repository
OA_type: green
_id: '17426'
abstract:
- lang: eng
text: "The robustness of neural networks against input perturbations with bounded\r\nmagnitude
represents a serious concern in the deployment of deep learning\r\nmodels in safety-critical
systems. Recently, the scientific community has\r\nfocused on enhancing certifiable
robustness guarantees by crafting 1-Lipschitz\r\nneural networks that leverage
Lipschitz bounded dense and convolutional layers.\r\nAlthough different methods
have been proposed in the literature to achieve this\r\ngoal, understanding the
performance of such methods is not straightforward,\r\nsince different metrics
can be relevant (e.g., training time, memory usage,\r\naccuracy, certifiable robustness)
for different applications. For this reason,\r\nthis work provides a thorough
theoretical and empirical comparison between\r\nmethods by evaluating them in
terms of memory usage, speed, and certifiable\r\nrobust accuracy. The paper also
provides some guidelines and recommendations to\r\nsupport the user in selecting
the methods that work best depending on the\r\navailable resources. We provide
code at\r\nhttps://github.com/berndprach/1LipschitzLayersCompared."
acknowledgement: "This work was partially supported by project SERICS (PE00000014)
under the MUR National Recovery and Resilience Plan funded by the European Union
- NextGenerationEU.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Bernd
full_name: Prach, Bernd
id: 2D561D42-C427-11E9-89B4-9C1AE6697425
last_name: Prach
- first_name: Fabio
full_name: Brau, Fabio
last_name: Brau
- first_name: Giorgio
full_name: Buttazzo, Giorgio
last_name: Buttazzo
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Prach B, Brau F, Buttazzo G, Lampert C. 1-Lipschitz layers compared: Memory,
speed, and certifiable robustness. In: Proceedings of the IEEE/CVF Conference
on Computer Vision and Pattern Recognition. Computer Vision Foundation; 2024:24574-24583.
doi:10.1109/CVPR52733.2024.02320'
apa: 'Prach, B., Brau, F., Buttazzo, G., & Lampert, C. (2024). 1-Lipschitz layers
compared: Memory, speed, and certifiable robustness. In Proceedings of the
IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 24574–24583).
Seattle, WA, United States: Computer Vision Foundation. https://doi.org/10.1109/CVPR52733.2024.02320'
chicago: 'Prach, Bernd, Fabio Brau, Giorgio Buttazzo, and Christoph Lampert. “1-Lipschitz
Layers Compared: Memory, Speed, and Certifiable Robustness.” In Proceedings
of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 24574–83.
Computer Vision Foundation, 2024. https://doi.org/10.1109/CVPR52733.2024.02320.'
ieee: 'B. Prach, F. Brau, G. Buttazzo, and C. Lampert, “1-Lipschitz layers compared:
Memory, speed, and certifiable robustness,” in Proceedings of the IEEE/CVF
Conference on Computer Vision and Pattern Recognition, Seattle, WA, United
States, 2024, pp. 24574–24583.'
ista: 'Prach B, Brau F, Buttazzo G, Lampert C. 2024. 1-Lipschitz layers compared:
Memory, speed, and certifiable robustness. Proceedings of the IEEE/CVF Conference
on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision
and Pattern Recognition, 24574–24583.'
mla: 'Prach, Bernd, et al. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable
Robustness.” Proceedings of the IEEE/CVF Conference on Computer Vision and
Pattern Recognition, Computer Vision Foundation, 2024, pp. 24574–83, doi:10.1109/CVPR52733.2024.02320.'
short: B. Prach, F. Brau, G. Buttazzo, C. Lampert, in:, Proceedings of the IEEE/CVF
Conference on Computer Vision and Pattern Recognition, Computer Vision Foundation,
2024, pp. 24574–24583.
conference:
end_date: 2024-06-22
location: Seattle, WA, United States
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2024-06-16
corr_author: '1'
date_created: 2024-08-14T08:42:32Z
date_published: 2024-06-01T00:00:00Z
date_updated: 2026-07-27T12:47:43Z
day: '01'
department:
- _id: GradSch
- _id: ChLa
doi: 10.1109/CVPR52733.2024.02320
external_id:
arxiv:
- '2311.16833'
isi:
- '001344387500055'
has_accepted_license: '1'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2311.16833
month: '06'
oa: 1
oa_version: Preprint
page: 24574-24583
publication: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern
Recognition
publication_status: published
publisher: Computer Vision Foundation
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/berndprach/1LipschitzLayersCompared
record:
- id: '19759'
relation: dissertation_contains
status: public
status: public
title: '1-Lipschitz layers compared: Memory, speed, and certifiable robustness'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '18121'
abstract:
- lang: eng
text: It is known that sparsity can improve interpretability for deep neural networks.
However, existing methods in the area either require networks that are pre-trained
with sparsity constraints, or impose sparsity after the fact, altering the network’s
general behavior. In this paper, we demonstrate, for the first time, that sparsity
can instead be incorporated into the interpretation process itself, as a sample-specific
preprocessing step. Unlike previous work, this approach, which we call SPADE,
does not place constraints on the trained model and does not affect its behavior
during inference on the sample. Given a trained model and a target sample, SPADE
uses sample-targeted pruning to provide a "trace" of the network’s execution on
the sample, reducing the network to the most important connections prior to computing
an interpretation. We demonstrate that preprocessing with SPADE significantly
increases the accuracy of image saliency maps across several interpretability
methods. Additionally, SPADE improves the usefulness of neuron visualizations,
aiding humans in reasoning about network behavior. Our code is available at https://github.com/IST-DASLab/SPADE.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: The authors would like to thank Stephen Casper and Tony Wang for
their feedback on this work, and Eldar Kurtic for his advice on aspects of the project.
This research was supported by the Scientific Service Units (SSU) of IST Austria
through resources provided by Scientific Computing (SciComp). EI was supported in
part by the FWF DK VGSCO, grant agreement number W1260-N35.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Arshia Soltani
full_name: Moakhar, Arshia Soltani
last_name: Moakhar
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- 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: 'Moakhar AS, Iofinova EB, Frantar E, Alistarh D-A. SPADE: Sparsity-guided debugging
for deep neural networks. In: Proceedings of the 41st International Conference
on Machine Learning. Vol 235. ML Research Press; 2024:45955-45987.'
apa: 'Moakhar, A. S., Iofinova, E. B., Frantar, E., & Alistarh, D.-A. (2024).
SPADE: Sparsity-guided debugging for deep neural networks. In Proceedings of
the 41st International Conference on Machine Learning (Vol. 235, pp. 45955–45987).
Vienna, Austria: ML Research Press.'
chicago: 'Moakhar, Arshia Soltani, Eugenia B Iofinova, Elias Frantar, and Dan-Adrian
Alistarh. “SPADE: Sparsity-Guided Debugging for Deep Neural Networks.” In Proceedings
of the 41st International Conference on Machine Learning, 235:45955–87. ML
Research Press, 2024.'
ieee: 'A. S. Moakhar, E. B. Iofinova, E. Frantar, and D.-A. Alistarh, “SPADE: Sparsity-guided
debugging for deep neural networks,” in Proceedings of the 41st International
Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 45955–45987.'
ista: 'Moakhar AS, Iofinova EB, Frantar E, Alistarh D-A. 2024. SPADE: Sparsity-guided
debugging for deep neural networks. Proceedings of the 41st International Conference
on Machine Learning. ICML: International Conference on Machine Learning, PMLR,
vol. 235, 45955–45987.'
mla: 'Moakhar, Arshia Soltani, et al. “SPADE: Sparsity-Guided Debugging for Deep
Neural Networks.” Proceedings of the 41st International Conference on Machine
Learning, vol. 235, ML Research Press, 2024, pp. 45955–87.'
short: A.S. Moakhar, E.B. Iofinova, E. Frantar, D.-A. Alistarh, in:, Proceedings
of the 41st International Conference on Machine Learning, ML Research Press, 2024,
pp. 45955–45987.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
corr_author: '1'
date_created: 2024-09-22T22:01:46Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-07-27T12:50:03Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '2310.04519'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2310.04519
month: '09'
oa: 1
oa_version: Preprint
page: 45955-45987
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
grant_number: W1260-N35
name: Vienna Graduate School on Computational Optimization
publication: Proceedings of the 41st International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/IST-DASLab/SPADE
record:
- id: '21854'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'SPADE: Sparsity-guided debugging for deep neural networks'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 235
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19063'
abstract:
- lang: eng
text: "Instruction-tuned Large Language Models (LLMs) show impressive results in
numerous practical applications, but they lack essential safety features that
are common in other areas of computer science, particularly an explicit separation
of instructions and data. This makes them vulnerable to manipulations such as
indirect prompt injections and generally unsuitable for safety-critical tasks.
Surprisingly, there is currently no established definition or benchmark to quantify
this phenomenon. In this work, we close this gap by introducing a formal measure
for instruction-data separation and an empirical variant that is calculable from
a model's outputs. We also present a new dataset, SEP, that allows estimating
the measure for real-world models. Our results on various LLMs show that the problem
of instruction-data separation is real: all models fail to achieve high separation,
and canonical mitigation techniques, such as prompt engineering and fine-tuning,
either fail to substantially improve separation or reduce model utility. The source
code and SEP dataset are openly accessible at https://github.com/egozverev/Shold-It-Be-Executed-Or-Processed.\r\n"
acknowledged_ssus:
- _id: ScienComp
acknowledgement: The authors would like to sincerely thank Juan Rocamonde for valuable
feedback to our manuscript. We acknowledge the support from the Scientific Service
Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).
We thank Dan Alistarh for providing us with computational resources. This work was
partially funded by the German Federal Ministry of Education and Research (BMBF)
under the grant AIgenCY (16KIS2012) and ELSA – European Lighthouse on Secure and
Safe AI funded by the European Union under grant agreement No. 101070617. Views
and opinions expressed are however those of the authors only and do not necessarily
reflect those of the European Union or European Commission. Neither the European
Union nor the European Commission can be held responsible for them.
article_number: '2403.06833'
article_processing_charge: No
arxiv: 1
author:
- first_name: Egor
full_name: Zverev, Egor
id: 05162b19-1340-11ed-8f02-fa94e0e8c3bc
last_name: Zverev
- first_name: Sahar
full_name: Abdelnabi, Sahar
last_name: Abdelnabi
- first_name: Soroush
full_name: Tabesh, Soroush
id: 06000900-6068-11ef-8d61-c2472ef2e752
last_name: Tabesh
orcid: 0009-0003-4119-6281
- first_name: Mario
full_name: Fritz, Mario
last_name: Fritz
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Zverev E, Abdelnabi S, Tabesh S, Fritz M, Lampert C. Can LLMs separate instructions
from data? And what do we even mean by that? arXiv. doi:10.48550/arXiv.2403.06833
apa: Zverev, E., Abdelnabi, S., Tabesh, S., Fritz, M., & Lampert, C. (n.d.).
Can LLMs separate instructions from data? And what do we even mean by that? arXiv.
https://doi.org/10.48550/arXiv.2403.06833
chicago: Zverev, Egor, Sahar Abdelnabi, Soroush Tabesh, Mario Fritz, and Christoph
Lampert. “Can LLMs Separate Instructions from Data? And What Do We Even Mean by
That?” ArXiv, n.d. https://doi.org/10.48550/arXiv.2403.06833.
ieee: E. Zverev, S. Abdelnabi, S. Tabesh, M. Fritz, and C. Lampert, “Can LLMs separate
instructions from data? And what do we even mean by that?,” arXiv. .
ista: Zverev E, Abdelnabi S, Tabesh S, Fritz M, Lampert C. Can LLMs separate instructions
from data? And what do we even mean by that? arXiv, 2403.06833.
mla: Zverev, Egor, et al. “Can LLMs Separate Instructions from Data? And What Do
We Even Mean by That?” ArXiv, 2403.06833, doi:10.48550/arXiv.2403.06833.
short: E. Zverev, S. Abdelnabi, S. Tabesh, M. Fritz, C. Lampert, ArXiv (n.d.).
corr_author: '1'
date_created: 2025-02-20T10:13:42Z
date_published: 2024-03-01T00:00:00Z
date_updated: 2026-08-13T07:26:54Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ChLa
doi: 10.48550/arXiv.2403.06833
external_id:
arxiv:
- '2403.06833'
file:
- access_level: open_access
checksum: 35eb43968684b87be59144603ef10af0
content_type: application/pdf
creator: ezverev
date_created: 2025-02-20T10:11:45Z
date_updated: 2025-02-20T10:11:45Z
file_id: '19064'
file_name: 2403.06833v3.pdf
file_size: 530972
relation: main_file
success: 1
file_date_updated: 2025-02-20T10:11:45Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '03'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
link:
- relation: software
url: ' https://github.com/egozverev/Shold-It-Be-Executed-Or-Processed'
status: public
title: Can LLMs separate instructions from data? And what do we even mean by that?
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
_id: '11434'
abstract:
- lang: eng
text: The Indian summer monsoon rainfall (ISMR) has been declining since the 1950s.
However, since 2002 it is reported to have revived. For these observed changes
in the ISMR, several explanations have been reported. Among these explanations,
however, the role of the eastern equatorial Indian Ocean (EEIO) is missing despite
being one of the warmest regions in the Indian Ocean, and monotonously warming.
A recent study reported that EEIO warming impacts the rainfall over northern India.
Here we report that warming in the EEIO weakens the low-level Indian summer monsoon
circulation and reduces ISMR. A warm EEIO drives easterly winds in the Indo–Pacific
sector as a Gill response. The warm EEIO also enhances nocturnal convection offshore
the western coast of Sumatra. The latent heating associated with the increased
convection augments the Gill response and the resultant circulation opposes the
monsoon low-level circulation and weakens the seasonal rainfall.
acknowledgement: This work was supported by the National Research Foundation of Korea
(NRF) grant funded by the Korea government (MSIT) (NRF-2018R1A5A1024958). Model
simulation and data transfer were supported by the National Supercomputing Center
with supercomputing resources including technical support (KSC-2019-CHA-0005), the
National Center for Meteorological Supercomputer of Korea Meteorological Administration,
and by the Korea Research Environment Open NETwork (KREONET), respectively. The
authors declare no conflicts of interest.
article_processing_charge: No
article_type: original
author:
- first_name: Bidyut B
full_name: Goswami, Bidyut B
id: 3a4ac09c-6d61-11ec-bf66-884cde66b64b
last_name: Goswami
orcid: 0000-0001-8602-3083
citation:
ama: GOSWAMI BB. Role of the eastern equatorial Indian Ocean warming in the Indian
summer monsoon rainfall trend. Climate Dynamics. 2023;60:427-442. doi:10.1007/s00382-022-06337-7
apa: GOSWAMI, B. B. (2023). Role of the eastern equatorial Indian Ocean warming
in the Indian summer monsoon rainfall trend. Climate Dynamics. Springer
Nature. https://doi.org/10.1007/s00382-022-06337-7
chicago: GOSWAMI, BIDYUT B. “Role of the Eastern Equatorial Indian Ocean Warming
in the Indian Summer Monsoon Rainfall Trend.” Climate Dynamics. Springer
Nature, 2023. https://doi.org/10.1007/s00382-022-06337-7.
ieee: B. B. GOSWAMI, “Role of the eastern equatorial Indian Ocean warming in the
Indian summer monsoon rainfall trend,” Climate Dynamics, vol. 60. Springer
Nature, pp. 427–442, 2023.
ista: GOSWAMI BB. 2023. Role of the eastern equatorial Indian Ocean warming in the
Indian summer monsoon rainfall trend. Climate Dynamics. 60, 427–442.
mla: GOSWAMI, BIDYUT B. “Role of the Eastern Equatorial Indian Ocean Warming in
the Indian Summer Monsoon Rainfall Trend.” Climate Dynamics, vol. 60, Springer
Nature, 2023, pp. 427–42, doi:10.1007/s00382-022-06337-7.
short: B.B. GOSWAMI, Climate Dynamics 60 (2023) 427–442.
corr_author: '1'
date_created: 2022-06-05T22:01:50Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2024-10-09T20:53:52Z
day: '01'
department:
- _id: CaMu
doi: 10.1007/s00382-022-06337-7
external_id:
isi:
- '000803119400002'
intvolume: ' 60'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 427-442
publication: Climate Dynamics
publication_identifier:
eissn:
- 1432-0894
issn:
- 0930-7575
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: ' https://doi.org/10.1007/s00382-022-06401-2'
scopus_import: '1'
status: public
title: Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon
rainfall trend
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2023'
...
---
_id: '12792'
abstract:
- lang: eng
text: In the physics literature the spectral form factor (SFF), the squared Fourier
transform of the empirical eigenvalue density, is the most common tool to test
universality for disordered quantum systems, yet previous mathematical results
have been restricted only to two exactly solvable models (Forrester in J Stat
Phys 183:33, 2021. https://doi.org/10.1007/s10955-021-02767-5, Commun Math Phys
387:215–235, 2021. https://doi.org/10.1007/s00220-021-04193-w). We rigorously
prove the physics prediction on SFF up to an intermediate time scale for a large
class of random matrices using a robust method, the multi-resolvent local laws.
Beyond Wigner matrices we also consider the monoparametric ensemble and prove
that universality of SFF can already be triggered by a single random parameter,
supplementing the recently proven Wigner–Dyson universality (Cipolloni et al.
in Probab Theory Relat Fields, 2021. https://doi.org/10.1007/s00440-022-01156-7)
to larger spectral scales. Remarkably, extensive numerics indicates that our formulas
correctly predict the SFF in the entire slope-dip-ramp regime, as customarily
called in physics.
acknowledgement: "We are grateful to the authors of [25] for sharing with us their
insights and preliminary numerical results. We are especially thankful to Stephen
Shenker for very valuable advice over several email communications. Helpful comments
on the manuscript from Peter Forrester and from the anonymous referees are also
acknowledged.\r\nOpen access funding provided by Institute of Science and Technology
(IST Austria).\r\nLászló Erdős: Partially supported by ERC Advanced Grant \"RMTBeyond\"
No. 101020331. Dominik Schröder: Supported by Dr. Max Rössler, the Walter Haefner
Foundation and the ETH Zürich Foundation."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Cipolloni G, Erdös L, Schröder DJ. On the spectral form factor for random matrices.
Communications in Mathematical Physics. 2023;401:1665-1700. doi:10.1007/s00220-023-04692-y
apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2023). On the spectral form
factor for random matrices. Communications in Mathematical Physics. Springer
Nature. https://doi.org/10.1007/s00220-023-04692-y
chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “On the Spectral
Form Factor for Random Matrices.” Communications in Mathematical Physics.
Springer Nature, 2023. https://doi.org/10.1007/s00220-023-04692-y.
ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “On the spectral form factor for
random matrices,” Communications in Mathematical Physics, vol. 401. Springer
Nature, pp. 1665–1700, 2023.
ista: Cipolloni G, Erdös L, Schröder DJ. 2023. On the spectral form factor for random
matrices. Communications in Mathematical Physics. 401, 1665–1700.
mla: Cipolloni, Giorgio, et al. “On the Spectral Form Factor for Random Matrices.”
Communications in Mathematical Physics, vol. 401, Springer Nature, 2023,
pp. 1665–700, doi:10.1007/s00220-023-04692-y.
short: G. Cipolloni, L. Erdös, D.J. Schröder, Communications in Mathematical Physics
401 (2023) 1665–1700.
corr_author: '1'
date_created: 2023-04-02T22:01:11Z
date_published: 2023-07-01T00:00:00Z
date_updated: 2025-04-14T07:57:19Z
day: '01'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1007/s00220-023-04692-y
ec_funded: 1
external_id:
isi:
- '000957343500001'
file:
- access_level: open_access
checksum: 72057940f76654050ca84a221f21786c
content_type: application/pdf
creator: dernst
date_created: 2023-10-04T12:09:18Z
date_updated: 2023-10-04T12:09:18Z
file_id: '14397'
file_name: 2023_CommMathPhysics_Cipolloni.pdf
file_size: 859967
relation: main_file
success: 1
file_date_updated: 2023-10-04T12:09:18Z
has_accepted_license: '1'
intvolume: ' 401'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 1665-1700
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the spectral form factor for random matrices
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: 401
year: '2023'
...
---
_id: '13052'
abstract:
- lang: eng
text: Imaging of the immunological synapse (IS) between dendritic cells (DCs) and
T cells in suspension is hampered by suboptimal alignment of cell-cell contacts
along the vertical imaging plane. This requires optical sectioning that often
results in unsatisfactory resolution in time and space. Here, we present a workflow
where DCs and T cells are confined between a layer of glass and polydimethylsiloxane
(PDMS) that orients the cells along one, horizontal imaging plane, allowing for
fast en-face-imaging of the DC-T cell IS.
acknowledged_ssus:
- _id: Bio
- _id: NanoFab
- _id: M-Shop
acknowledgement: 'A.L. was funded by an Erwin Schrödinger postdoctoral fellowship
of the Austrian Science Fund (FWF, project number: J4542-B) and is an EMBO non-stipendiary
postdoctoral fellow. This work was supported by a European Research Council grant
ERC-CoG-72437 to M.S. We thank the Imaging & Optics facility, the Nanofabrication
facility, and the Miba Machine Shop of ISTA for their excellent support.'
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: 'Leithner AF, Merrin J, Sixt MK. En-Face Imaging of T Cell-Dendritic Cell Immunological
Synapses. In: Baldari C, Dustin M, eds. The Immune Synapse. Vol 2654. MIMB.
New York, NY: Springer Nature; 2023:137-147. doi:10.1007/978-1-0716-3135-5_9'
apa: 'Leithner, A. F., Merrin, J., & Sixt, M. K. (2023). En-Face Imaging of
T Cell-Dendritic Cell Immunological Synapses. In C. Baldari & M. Dustin (Eds.),
The Immune Synapse (Vol. 2654, pp. 137–147). New York, NY: Springer Nature.
https://doi.org/10.1007/978-1-0716-3135-5_9'
chicago: 'Leithner, Alexander F, Jack Merrin, and Michael K Sixt. “En-Face Imaging
of T Cell-Dendritic Cell Immunological Synapses.” In The Immune Synapse,
edited by Cosima Baldari and Michael Dustin, 2654:137–47. MIMB. New York, NY:
Springer Nature, 2023. https://doi.org/10.1007/978-1-0716-3135-5_9.'
ieee: 'A. F. Leithner, J. Merrin, and M. K. Sixt, “En-Face Imaging of T Cell-Dendritic
Cell Immunological Synapses,” in The Immune Synapse, vol. 2654, C. Baldari
and M. Dustin, Eds. New York, NY: Springer Nature, 2023, pp. 137–147.'
ista: 'Leithner AF, Merrin J, Sixt MK. 2023.En-Face Imaging of T Cell-Dendritic
Cell Immunological Synapses. In: The Immune Synapse. Methods in Molecular Biology,
vol. 2654, 137–147.'
mla: Leithner, Alexander F., et al. “En-Face Imaging of T Cell-Dendritic Cell Immunological
Synapses.” The Immune Synapse, edited by Cosima Baldari and Michael Dustin,
vol. 2654, Springer Nature, 2023, pp. 137–47, doi:10.1007/978-1-0716-3135-5_9.
short: A.F. Leithner, J. Merrin, M.K. Sixt, in:, C. Baldari, M. Dustin (Eds.), The
Immune Synapse, Springer Nature, New York, NY, 2023, pp. 137–147.
date_created: 2023-05-22T08:41:48Z
date_published: 2023-04-28T00:00:00Z
date_updated: 2025-04-14T07:42:07Z
day: '28'
department:
- _id: MiSi
- _id: NanoFab
doi: 10.1007/978-1-0716-3135-5_9
ec_funded: 1
editor:
- first_name: Cosima
full_name: Baldari, Cosima
last_name: Baldari
- first_name: Michael
full_name: Dustin, Michael
last_name: Dustin
external_id:
pmid:
- '37106180'
intvolume: ' 2654'
language:
- iso: eng
month: '04'
oa_version: None
page: 137-147
place: New York, NY
pmid: 1
project:
- _id: 25FE9508-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '724373'
name: Cellular Navigation Along Spatial Gradients
publication: The Immune Synapse
publication_identifier:
eisbn:
- '9781071631355'
eissn:
- 1940-6029
isbn:
- '9781071631348'
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: En-Face Imaging of T Cell-Dendritic Cell Immunological Synapses
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2654
year: '2023'
...
---
_id: '13053'
abstract:
- lang: eng
text: 'Deep neural networks (DNNs) often have to be compressed, via pruning and/or
quantization, before they can be deployed in practical settings. In this work
we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization
step in a principled way, in order to produce models whose local loss behavior
is stable under compression operations such as pruning. Thus, dense models trained
via CrAM should be compressible post-training, in a single step, without significant
accuracy loss. Experimental results on standard benchmarks, such as residual networks
for ImageNet classification and BERT models for language modelling, show that
CrAM produces dense models that can be more accurate than the standard SGD/Adam-based
baselines, but which are stable under weight pruning: specifically, we can prune
models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90%
with reasonable (∼1%) accuracy loss, which is competitive with gradual compression
methods. Additionally, CrAM can produce sparse models which perform well for transfer
learning, and it also works for semi-structured 2:4 pruning patterns supported
by GPU hardware. The code for reproducing the results is available at this https
URL .'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "AP, EK, DA received funding from the European Research Council (ERC)
under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant
agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale
de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further
acknowledge the support from the Scientific Service Units (SSU) of ISTA through
resources provided by Scientific Computing (SciComp)."
article_processing_charge: No
arxiv: 1
author:
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- first_name: Adrian
full_name: Vladu, Adrian
last_name: Vladu
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- 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: 'Krumes A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
Minimizer. In: 11th International Conference on Learning Representations .
OpenReview; 2023.'
apa: 'Krumes, A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (2023).
CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning
Representations . Kigali, Rwanda : OpenReview.'
chicago: 'Krumes, Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and
Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International
Conference on Learning Representations . OpenReview, 2023.'
ieee: 'A. Krumes, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM: A
Compression-Aware Minimizer,” in 11th International Conference on Learning
Representations , Kigali, Rwanda , 2023.'
ista: 'Krumes A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. 2023. CrAM: A Compression-Aware
Minimizer. 11th International Conference on Learning Representations . ICLR: International
Conference on Learning Representations.'
mla: 'Krumes, Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th International
Conference on Learning Representations , OpenReview, 2023.'
short: A. Krumes, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International
Conference on Learning Representations , OpenReview, 2023.
conference:
end_date: 2023-05-05
location: 'Kigali, Rwanda '
name: 'ICLR: International Conference on Learning Representations'
start_date: 2023-05-01
corr_author: '1'
date_created: 2023-05-23T11:36:18Z
date_published: 2023-05-01T00:00:00Z
date_updated: 2026-04-07T13:30:19Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '2207.14200'
file:
- access_level: open_access
checksum: a6eec897e13a91cdc3eeaf309801752c
content_type: application/pdf
creator: dernst
date_created: 2024-07-22T09:09:45Z
date_updated: 2024-07-22T09:09:45Z
file_id: '17294'
file_name: 2023_ICLR_Peste.pdf
file_size: 458201
relation: main_file
success: 1
file_date_updated: 2024-07-22T09:09:45Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/pdf?id=_eTZBs-yedr
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: '11th International Conference on Learning Representations '
publication_status: published
publisher: OpenReview
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/IST-DASLab/CrAM
record:
- id: '13074'
relation: dissertation_contains
status: public
status: public
title: 'CrAM: A Compression-Aware Minimizer'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14043'
abstract:
- lang: eng
text: 'Over the last two decades, a significant line of work in theoretical algorithms
has made progress in solving linear systems of the form Lx=b, where L is the Laplacian
matrix of a weighted graph with weights w(i,j)>0 on the edges. The solution x
of the linear system can be interpreted as the potentials of an electrical flow
in which the resistance on edge (i, j) is 1/w(i, j). Kelner et al. (in: Proceedings
of the 45th Annual ACM Symposium on the Theory of Computing, pp 911–920, 2013.
https://doi.org/10.1145/2488608.2488724) give a combinatorial, near-linear time
algorithm that maintains the Kirchoff Current Law, and gradually enforces the
Kirchoff Potential Law by updating flows around cycles (cycle toggling). In this
paper, we consider a dual version of the algorithm that maintains the Kirchoff
Potential Law, and gradually enforces the Kirchoff Current Law by cut toggling:
each iteration updates all potentials on one side of a fundamental cut of a spanning
tree by the same amount. We prove that this dual algorithm also runs in a near-linear
number of iterations. We show, however, that if we abstract cut toggling as a
natural data structure problem, this problem can be reduced to the online vector–matrix-vector
problem, which has been conjectured to be difficult for dynamic algorithms (Henzinger
et al., in: Proceedings of the 47th Annual ACM Symposium on the Theory of Computing,
pp 21–30, 2015. https://doi.org/10.1145/2746539.2746609). The conjecture implies
that the data structure does not have an O(n1−ϵ) time algorithm for any ϵ>0, and
thus a straightforward implementation of the cut-toggling algorithm requires essentially
linear time per iteration. To circumvent the lower bound, we batch update steps,
and perform them simultaneously instead of sequentially. An appropriate choice
of batching leads to an O˜(m1.5) time cut-toggling algorithm for solving Laplacian
systems. Furthermore, we show that if we sparsify the graph and call our algorithm
recursively on the Laplacian system implied by batching and sparsifying, we can
reduce the running time to O(m1+ϵ) for any ϵ>0. Thus, the dual cut-toggling algorithm
can achieve (almost) the same running time as its primal cycle-toggling counterpart.'
acknowledgement: Monika Henzinger was supported by funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures
(MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms
for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from
the netidee SCIENCE Stiftung, 2020–2024. Billy Jin was Supported in part by NSERC
fellowship PGSD3-532673-2019 and NSF grant CCF-2007009. Richard Peng was supported
in part by an NSERC Discovery Grant and NSF grant CCF-1846218. David P. Williamson
was supported in part by NSF grant CCF-2007009.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- 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: Billy
full_name: Jin, Billy
last_name: Jin
- first_name: Richard
full_name: Peng, Richard
last_name: Peng
- first_name: David P.
full_name: Williamson, David P.
last_name: Williamson
citation:
ama: Henzinger M, Jin B, Peng R, Williamson DP. A combinatorial cut-toggling algorithm
for solving Laplacian linear systems. Algorithmica. 2023;85:2680-3716.
doi:10.1007/s00453-023-01154-8
apa: Henzinger, M., Jin, B., Peng, R., & Williamson, D. P. (2023). A combinatorial
cut-toggling algorithm for solving Laplacian linear systems. Algorithmica.
Springer Nature. https://doi.org/10.1007/s00453-023-01154-8
chicago: Henzinger, Monika, Billy Jin, Richard Peng, and David P. Williamson. “A
Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.” Algorithmica.
Springer Nature, 2023. https://doi.org/10.1007/s00453-023-01154-8.
ieee: M. Henzinger, B. Jin, R. Peng, and D. P. Williamson, “A combinatorial cut-toggling
algorithm for solving Laplacian linear systems,” Algorithmica, vol. 85.
Springer Nature, pp. 2680–3716, 2023.
ista: Henzinger M, Jin B, Peng R, Williamson DP. 2023. A combinatorial cut-toggling
algorithm for solving Laplacian linear systems. Algorithmica. 85, 2680–3716.
mla: Henzinger, Monika, et al. “A Combinatorial Cut-Toggling Algorithm for Solving
Laplacian Linear Systems.” Algorithmica, vol. 85, Springer Nature, 2023,
pp. 2680–3716, doi:10.1007/s00453-023-01154-8.
short: M. Henzinger, B. Jin, R. Peng, D.P. Williamson, Algorithmica 85 (2023) 2680–3716.
date_created: 2023-08-13T22:01:13Z
date_published: 2023-12-01T00:00:00Z
date_updated: 2025-04-15T06:24:05Z
day: '01'
department:
- _id: MoHe
doi: 10.1007/s00453-023-01154-8
ec_funded: 1
external_id:
arxiv:
- '2010.16316'
isi:
- '001041254900002'
intvolume: ' 85'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2010.16316
month: '12'
oa: 1
oa_version: Preprint
page: 2680-3716
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: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A combinatorial cut-toggling algorithm for solving Laplacian linear systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 85
year: '2023'
...
---
_id: '14444'
abstract:
- lang: eng
text: "We prove several results about substructures in Latin squares. First, we
explain how to adapt our recent work on high-girth Steiner triple systems to the
setting of Latin squares, resolving a conjecture of Linial that there exist Latin
squares with arbitrarily high girth. As a consequence, we see that the number
of order- n Latin squares with no intercalate (i.e., no 2×2 Latin subsquare)
is at least (e−9/4n−o(n))n2. Equivalently, P[N=0]≥e−n2/4−o(n2)=e−(1+o(1))EN\r\n
, where N is the number of intercalates in a uniformly random order- n Latin
square. \r\nIn fact, extending recent work of Kwan, Sah, and Sawhney, we resolve
the general large-deviation problem for intercalates in random Latin squares,
up to constant factors in the exponent: for any constant 0<δ≤1 we have P[N≤(1−δ)EN]=exp(−Θ(n2))
and for any constant δ>0 we have P[N≥(1+δ)EN]=exp(−Θ(n4/3logn)). \r\nFinally,
as an application of some new general tools for studying substructures in random
Latin squares, we show that in almost all order- n Latin squares, the number of
cuboctahedra (i.e., the number of pairs of possibly degenerate 2×2 submatrices
with the same arrangement of symbols) is of order n4, which is the minimum possible.
As observed by Gowers and Long, this number can be interpreted as measuring ``how
associative'' the quasigroup associated with the Latin square is."
acknowledgement: Sah and Sawhney were supported by NSF Graduate Research Fellowship
Program DGE-1745302. Sah was supported by the PD Soros Fellowship. Simkin was supported
by the Center of Mathematical Sciences and Applications at Harvard University.
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Ashwin
full_name: Sah, Ashwin
last_name: Sah
- first_name: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
- first_name: Michael
full_name: Simkin, Michael
last_name: Simkin
citation:
ama: Kwan MA, Sah A, Sawhney M, Simkin M. Substructures in Latin squares. Israel
Journal of Mathematics. 2023;256(2):363-416. doi:10.1007/s11856-023-2513-9
apa: Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2023). Substructures in
Latin squares. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2513-9
chicago: Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures
in Latin Squares.” Israel Journal of Mathematics. Springer Nature, 2023.
https://doi.org/10.1007/s11856-023-2513-9.
ieee: M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,”
Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416,
2023.
ista: Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares.
Israel Journal of Mathematics. 256(2), 363–416.
mla: Kwan, Matthew Alan, et al. “Substructures in Latin Squares.” Israel Journal
of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9.
short: M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256
(2023) 363–416.
date_created: 2023-10-22T22:01:14Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2025-09-09T13:08:47Z
day: '01'
department:
- _id: MaKw
doi: 10.1007/s11856-023-2513-9
external_id:
arxiv:
- '2202.05088'
isi:
- '001081646400001'
intvolume: ' 256'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2202.05088
month: '09'
oa: 1
oa_version: Preprint
page: 363-416
publication: Israel Journal of Mathematics
publication_identifier:
eissn:
- 1565-8511
issn:
- 0021-2172
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Substructures in Latin squares
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 256
year: '2023'
...
---
_id: '14453'
abstract:
- lang: eng
text: Squall lines are substantially influenced by the interaction of low-level
shear with cold pools associated with convective downdrafts. Beyond an optimal
shear amplitude, squall lines tend to orient themselves at an angle with respect
to the low-level shear. While the mechanisms behind squall line orientation seem
to be increasingly well understood, uncertainties remain on the implications of
this orientation. Roca and Fiolleau (2020, https://doi.org/10.1038/s43247-020-00015-4)
show that long lived mesoscale convective systems, including squall lines, are
disproportionately involved in rainfall extremes in the tropics. This article
investigates the influence of the interaction between low-level shear and squall
line outflow on squall line generated precipitation extrema in the tropics. Using
a cloud resolving model, simulated squall lines in radiative convective equilibrium
amid a shear-dominated regime (super optimal), a balanced regime (optimal), and
an outflow dominated regime (suboptimal). Our results show that precipitation
extremes in squall lines are 40% more intense in the case of optimal shear and
remain 30% superior in the superoptimal regime relative to a disorganized case.
With a theoretical scaling of precipitation extremes (C. Muller & Takayabu, 2020,
https://doi.org/10.1088/1748-9326/ab7130), we show that the condensation rates
control the amplification of precipitation extremes in tropical squall lines,
mainly due to its change in vertical mass flux (dynamic component). The reduction
of dilution by entrainment explains half of this change, consistent with Mulholland
et al. (2021, https://doi.org/10.1175/jas-d-20-0299.1). The other half is explained
by increased cloud-base velocity intensity in optimal and superoptimal squall
lines.
acknowledgement: The authors gratefully acknowledge funding from the European Research
Council under the European Union's Horizon 2020 research and innovation program
(Project CLUSTER, Grant Agreement No. 805041). This work is also supported by a
PhD fellowship funded by the Ecole Normale Supérieure de Paris-Saclay. Authors are
also grateful to Benjamin Filider, who was of great help and support in the development
of ideas. Eventually, we would like to thank Martin Singh, John M. Peters and an
anonymous reviewer for their valuable comments and suggestions, which greatly improved
the quality of the manuscript.
article_number: e2022MS003477
article_processing_charge: Yes
article_type: original
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.
Journal of Advances in Modeling Earth Systems. 2023;15(10). doi:10.1029/2022MS003477
apa: Abramian, S., Muller, C. J., & Risi, C. (2023). Extreme precipitation in
tropical squall lines. Journal of Advances in Modeling Earth Systems. Wiley.
https://doi.org/10.1029/2022MS003477
chicago: Abramian, Sophie, Caroline J Muller, and Camille Risi. “Extreme Precipitation
in Tropical Squall Lines.” Journal of Advances in Modeling Earth Systems.
Wiley, 2023. https://doi.org/10.1029/2022MS003477.
ieee: S. Abramian, C. J. Muller, and C. Risi, “Extreme precipitation in tropical
squall lines,” Journal of Advances in Modeling Earth Systems, vol. 15,
no. 10. Wiley, 2023.
ista: Abramian S, Muller CJ, Risi C. 2023. Extreme precipitation in tropical squall
lines. Journal of Advances in Modeling Earth Systems. 15(10), e2022MS003477.
mla: Abramian, Sophie, et al. “Extreme Precipitation in Tropical Squall Lines.”
Journal of Advances in Modeling Earth Systems, vol. 15, no. 10, e2022MS003477,
Wiley, 2023, doi:10.1029/2022MS003477.
short: S. Abramian, C.J. Muller, C. Risi, Journal of Advances in Modeling Earth
Systems 15 (2023).
date_created: 2023-10-29T23:01:15Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2024-11-05T09:00:44Z
day: '01'
ddc:
- '550'
department:
- _id: CaMu
doi: 10.1029/2022MS003477
ec_funded: 1
external_id:
isi:
- '001084933600001'
file:
- access_level: open_access
checksum: 43e6a1a35b663843c7d3f8d0caaca1a5
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T13:31:42Z
date_updated: 2023-10-30T13:31:42Z
file_id: '14470'
file_name: 2023_JAMES_Abramian.pdf
file_size: 1975210
relation: main_file
success: 1
file_date_updated: 2023-10-30T13:31:42Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 629205d8-2b32-11ec-9570-e1356ff73576
call_identifier: H2020
grant_number: '805041'
name: Organization of CLoUdS, and implications of Tropical cyclones and for the
Energetics of the tropics, in current and waRming climate
publication: Journal of Advances in Modeling Earth Systems
publication_identifier:
eissn:
- 1942-2466
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2023'
...
---
_id: '14472'
abstract:
- lang: eng
text: "Data related to the following paper:\r\n\"Stress granules plug and stabilize
damaged endolysosomal membranes\" (https://doi.org/10.1038/s41586-023-06726-w)\r\n\r\nAbstract:
\r\nEndomembrane damage represents a form of stress that is detrimental for eukaryotic
cells. To cope with this threat, cells possess mechanisms that repair the damage
and restore cellular homeostasis. Endomembrane damage also results in organelle
instability and the mechanisms by which cells stabilize damaged endomembranes
to enable membrane repair remains unknown. In this work we use a minimal coarse-grained
molecular dynamics system to explore how lipid vesicles undergoing poration in
a protein-rich medium can be plugged and stabilised by condensate formation. The
solution of proteins in and out of the vesicle is described by beads dispersed
in implicit solvent. The membrane is described as a one-bead-thick fluid elastic
layer of mechanical properties that mimic biological membranes. We tune the interactions
between solution beads in the different compartments to capture the differences
between the cytoplasmic and endosomal protein solutions and explore how the system
responds to different degrees of membrane poration. We find that, in the right
interaction regime, condensates form rapidly at the damage site upon solution
mixing and act as a plug that prevents futher mixing and destabilisation of the
vesicle. Further, when the condensate can interact with the membrane (wetting
interactions) we find that it mediates pore sealing and membrane repair. This
research is part of the work published in \"Stress granules plug and stabilize
damaged endolysosomal membranes\", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w."
article_processing_charge: No
author:
- first_name: Christian Eduardo
full_name: Vanhille-Campos, Christian Eduardo
id: 3adeca52-9313-11ed-b1ac-c170b2505714
last_name: Vanhille-Campos
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
citation:
ama: Vanhille-Campos CE, Šarić A. Stress granules plug and stabilize damaged endolysosomal
membranes. 2023. doi:10.15479/AT:ISTA:14472
apa: Vanhille-Campos, C. E., & Šarić, A. (2023). Stress granules plug and stabilize
damaged endolysosomal membranes. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:14472
chicago: Vanhille-Campos, Christian Eduardo, and Anđela Šarić. “Stress Granules
Plug and Stabilize Damaged Endolysosomal Membranes.” Institute of Science and
Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:14472.
ieee: C. E. Vanhille-Campos and A. Šarić, “Stress granules plug and stabilize damaged
endolysosomal membranes.” Institute of Science and Technology Austria, 2023.
ista: Vanhille-Campos CE, Šarić A. 2023. Stress granules plug and stabilize damaged
endolysosomal membranes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14472.
mla: Vanhille-Campos, Christian Eduardo, and Anđela Šarić. Stress Granules Plug
and Stabilize Damaged Endolysosomal Membranes. Institute of Science and Technology
Austria, 2023, doi:10.15479/AT:ISTA:14472.
short: C.E. Vanhille-Campos, A. Šarić, (2023).
corr_author: '1'
date_created: 2023-10-30T16:38:32Z
date_published: 2023-10-31T00:00:00Z
date_updated: 2025-09-09T13:30:33Z
day: '31'
ddc:
- '570'
department:
- _id: AnSa
doi: 10.15479/AT:ISTA:14472
file:
- access_level: open_access
checksum: a18706e952e8660c51ede52a167270b7
content_type: application/zip
creator: ipalaia
date_created: 2023-10-30T16:31:08Z
date_updated: 2023-10-30T16:31:08Z
file_id: '14473'
file_name: SGporecondensation-main.zip
file_size: 62821432
relation: main_file
success: 1
- access_level: open_access
checksum: 389eab31c6509dbc05795017fb618758
content_type: text/plain
creator: dernst
date_created: 2023-10-31T08:57:50Z
date_updated: 2023-10-31T08:57:50Z
file_id: '14474'
file_name: README.txt
file_size: 1697
relation: main_file
success: 1
file_date_updated: 2023-10-31T08:57:50Z
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '10'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '14610'
relation: used_in_publication
status: public
status: public
title: Stress granules plug and stabilize damaged endolysosomal membranes
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14776'
abstract:
- lang: eng
text: Soluble chaperones residing in the endoplasmic reticulum (ER) play vitally
important roles in folding and quality control of newly synthesized proteins that
transiently pass through the ER en route to their final destinations. These soluble
residents of the ER are themselves endowed with an ER retrieval signal that enables
the cell to bring the escaped residents back from the Golgi. Here, by using purified
proteins, we showed that Nicotiana tabacum phytaspase, a plant aspartate-specific
protease, introduces two breaks at the C-terminus of the N. tabacum ER resident
calreticulin-3. These cleavages resulted in removal of either a dipeptide or a
hexapeptide from the C-terminus of calreticulin-3 encompassing part or all of
the ER retrieval signal. Consistently, expression of the calreticulin-3 derivative
mimicking the phytaspase cleavage product in Nicotiana benthamiana cells demonstrated
loss of the ER accumulation of the protein. Notably, upon its escape from the
ER, calreticulin-3 was further processed by an unknown protease(s) to generate
the free N-terminal (N) domain of calreticulin-3, which was ultimately secreted
into the apoplast. Our study thus identified a specific proteolytic enzyme capable
of precise detachment of the ER retrieval signal from a plant ER resident protein,
with implications for the further fate of the escaped resident.
acknowledgement: "We thank C.U.T. Hellen for critically reading the manuscript. The
MALDI MS facility and CLSM became available to us in the framework of Moscow State
University Development Programs PNG 5.13 and PNR 5.13.\r\nThis work was funded by
the Russian Science Foundation, grant numbers 19-14-00010 and 22-14-00071."
article_number: '16527'
article_processing_charge: Yes
article_type: original
author:
- first_name: Anastasiia
full_name: Teplova, Anastasiia
id: e3736151-106c-11ec-b916-c2558e2762c6
last_name: Teplova
- first_name: Artemii A.
full_name: Pigidanov, Artemii A.
last_name: Pigidanov
- first_name: Marina V.
full_name: Serebryakova, Marina V.
last_name: Serebryakova
- first_name: Sergei A.
full_name: Golyshev, Sergei A.
last_name: Golyshev
- first_name: Raisa A.
full_name: Galiullina, Raisa A.
last_name: Galiullina
- first_name: Nina V.
full_name: Chichkova, Nina V.
last_name: Chichkova
- first_name: Andrey B.
full_name: Vartapetian, Andrey B.
last_name: Vartapetian
citation:
ama: Teplova A, Pigidanov AA, Serebryakova MV, et al. Phytaspase Is capable of detaching
the endoplasmic reticulum retrieval signal from tobacco calreticulin-3. International
Journal of Molecular Sciences. 2023;24(22). doi:10.3390/ijms242216527
apa: Teplova, A., Pigidanov, A. A., Serebryakova, M. V., Golyshev, S. A., Galiullina,
R. A., Chichkova, N. V., & Vartapetian, A. B. (2023). Phytaspase Is capable
of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3.
International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms242216527
chicago: Teplova, Anastasiia, Artemii A. Pigidanov, Marina V. Serebryakova, Sergei
A. Golyshev, Raisa A. Galiullina, Nina V. Chichkova, and Andrey B. Vartapetian.
“Phytaspase Is Capable of Detaching the Endoplasmic Reticulum Retrieval Signal
from Tobacco Calreticulin-3.” International Journal of Molecular Sciences.
MDPI, 2023. https://doi.org/10.3390/ijms242216527.
ieee: A. Teplova et al., “Phytaspase Is capable of detaching the endoplasmic
reticulum retrieval signal from tobacco calreticulin-3,” International Journal
of Molecular Sciences, vol. 24, no. 22. MDPI, 2023.
ista: Teplova A, Pigidanov AA, Serebryakova MV, Golyshev SA, Galiullina RA, Chichkova
NV, Vartapetian AB. 2023. Phytaspase Is capable of detaching the endoplasmic reticulum
retrieval signal from tobacco calreticulin-3. International Journal of Molecular
Sciences. 24(22), 16527.
mla: Teplova, Anastasiia, et al. “Phytaspase Is Capable of Detaching the Endoplasmic
Reticulum Retrieval Signal from Tobacco Calreticulin-3.” International Journal
of Molecular Sciences, vol. 24, no. 22, 16527, MDPI, 2023, doi:10.3390/ijms242216527.
short: A. Teplova, A.A. Pigidanov, M.V. Serebryakova, S.A. Golyshev, R.A. Galiullina,
N.V. Chichkova, A.B. Vartapetian, International Journal of Molecular Sciences
24 (2023).
corr_author: '1'
date_created: 2024-01-10T09:24:35Z
date_published: 2023-11-01T00:00:00Z
date_updated: 2024-10-09T21:07:49Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.3390/ijms242216527
external_id:
isi:
- '001113792600001'
pmid:
- '38003717'
file:
- access_level: open_access
checksum: 4df7d206ba022b7f54eff1f0aec1659a
content_type: application/pdf
creator: dernst
date_created: 2024-01-10T13:39:42Z
date_updated: 2024-01-10T13:39:42Z
file_id: '14791'
file_name: 2023_IJMS_Teplova.pdf
file_size: 2637784
relation: main_file
success: 1
file_date_updated: 2024-01-10T13:39:42Z
has_accepted_license: '1'
intvolume: ' 24'
isi: 1
issue: '22'
keyword:
- Inorganic Chemistry
- Organic Chemistry
- Physical and Theoretical Chemistry
- Computer Science Applications
- Spectroscopy
- Molecular Biology
- General Medicine
- Catalysis
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: International Journal of Molecular Sciences
publication_identifier:
issn:
- 1422-0067
publication_status: published
publisher: MDPI
quality_controlled: '1'
status: public
title: Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal
from tobacco calreticulin-3
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: 24
year: '2023'
...
---
_id: '14812'
abstract:
- lang: eng
text: This repository contains the code and VCF files needed to conduct the analyses
in our MS. Each folder contains a readMe document explaining the nature of each
file and dataset and the results and analyses that they relate to. The same anlaysis
code (but not VCF files) is also available at https://github.com/seanstankowski/Littorina_reproductive_mode
article_processing_charge: No
author:
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
citation:
ama: 'Stankowski S. Data and code for: The genetic architecture of a recent transition
to live-bearing in marine snails. 2023. doi:10.5281/ZENODO.8318995'
apa: 'Stankowski, S. (2023). Data and code for: The genetic architecture of a recent
transition to live-bearing in marine snails. Zenodo. https://doi.org/10.5281/ZENODO.8318995'
chicago: 'Stankowski, Sean. “Data and Code for: The Genetic Architecture of a Recent
Transition to Live-Bearing in Marine Snails.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8318995.'
ieee: 'S. Stankowski, “Data and code for: The genetic architecture of a recent transition
to live-bearing in marine snails.” Zenodo, 2023.'
ista: 'Stankowski S. 2023. Data and code for: The genetic architecture of a recent
transition to live-bearing in marine snails, Zenodo, 10.5281/ZENODO.8318995.'
mla: 'Stankowski, Sean. Data and Code for: The Genetic Architecture of a Recent
Transition to Live-Bearing in Marine Snails. Zenodo, 2023, doi:10.5281/ZENODO.8318995.'
short: S. Stankowski, (2023).
contributor:
- first_name: Zusanna
last_name: Zagrodzka
- first_name: Martin
last_name: Garlovsky
- first_name: Arka
id: 6AAB2240-CA9A-11E9-9C1A-D9D1E5697425
last_name: Pal
orcid: 0000-0002-4530-8469
- first_name: Daria
id: 428A94B0-F248-11E8-B48F-1D18A9856A87
last_name: Shipilina
orcid: 0000-0002-1145-9226
- first_name: Diego Fernando
id: ae681a14-dc74-11ea-a0a7-c6ef18161701
last_name: Garcia Castillo
- first_name: Hila
id: d6ab5470-2fb3-11ed-8633-986a9b84edac
last_name: Lifchitz
- first_name: Alan
last_name: Le Moan
- first_name: Erica
last_name: Leder
- first_name: James
last_name: Reeve
- first_name: Kerstin
last_name: Johannesson
- first_name: Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Roger
last_name: Butlin
corr_author: '1'
date_created: 2024-01-16T10:23:01Z
date_published: 2023-09-05T00:00:00Z
date_updated: 2025-09-04T11:38:30Z
day: '05'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5281/ZENODO.8318995
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.8318995
month: '09'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '14796'
relation: used_in_publication
status: public
status: public
title: 'Data and code for: The genetic architecture of a recent transition to live-bearing
in marine snails'
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'
...
---
OA_place: publisher
OA_type: gold
_id: '15027'
abstract:
- lang: eng
text: 'This data repository underpins the paper, published in PNAS (doi pending)
and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777).'
article_processing_charge: No
author:
- first_name: Samo
full_name: Curk, Samo
id: 031eff0d-d481-11ee-8508-cd12a7a86e5b
last_name: Curk
orcid: 0000-0001-6160-9766
citation:
ama: Curk S. aggregation_data. 2023.
apa: Curk, S. (2023). aggregation_data. Figshare.
chicago: Curk, Samo. “Aggregation_data.” Figshare, 2023.
ieee: S. Curk, “aggregation_data.” Figshare, 2023.
ista: Curk S. 2023. aggregation_data, Figshare.
mla: Curk, Samo. Aggregation_data. Figshare, 2023.
short: S. Curk, (2023).
corr_author: '1'
date_created: 2024-02-26T08:37:57Z
date_published: 2023-12-13T00:00:00Z
date_updated: 2025-09-04T12:03:11Z
day: '13'
ddc:
- '570'
department:
- _id: AnSa
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://figshare.com/s/85798bba4ebc68d822ed
month: '12'
oa: 1
oa_version: Published Version
publisher: Figshare
related_material:
record:
- id: '15001'
relation: used_in_publication
status: public
status: public
title: aggregation_data
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '17074'
abstract:
- lang: eng
text: We verify Bogoliubov's approximation for translation invariant Bose gases
in the mean field regime, i.e. we prove that the ground state energy EN is given
by EN=NeH+infσ(H)+oN→∞(1), where N is the number of particles, eH is the minimal
Hartree energy and H is the Bogoliubov Hamiltonian. As an intermediate result
we show the existence of approximate ground states ΨN, i.e. states satisfying
⟨HN⟩ΨN=EN+oN→∞(1), exhibiting complete Bose--Einstein condensation with respect
to one of the Hartree minimizers.
acknowledgement: "We are grateful to Rupert Frank for helpful discussions at an early
stage of this project.\r\nFunding from the European Union’s Horizon 2020 research
and innovation programme\r\nunder the ERC grant agreement No 694227 is acknowledged."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Morris
full_name: Brooks, Morris
id: B7ECF9FC-AA38-11E9-AC9A-0930E6697425
last_name: Brooks
orcid: 0000-0002-6249-0928
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Brooks M, Seiringer R. Validity of Bogoliubov’s approximation fortranslation-invariant
Bose gases. Probability and Mathematical Physics. 2023;3(4):939-1000. doi:10.2140/pmp.2022.3.939
apa: Brooks, M., & Seiringer, R. (2023). Validity of Bogoliubov’s approximation
fortranslation-invariant Bose gases. Probability and Mathematical Physics.
Mathematical Sciences Publishers. https://doi.org/10.2140/pmp.2022.3.939
chicago: Brooks, Morris, and Robert Seiringer. “Validity of Bogoliubov’s Approximation
Fortranslation-Invariant Bose Gases.” Probability and Mathematical Physics.
Mathematical Sciences Publishers, 2023. https://doi.org/10.2140/pmp.2022.3.939.
ieee: M. Brooks and R. Seiringer, “Validity of Bogoliubov’s approximation fortranslation-invariant
Bose gases,” Probability and Mathematical Physics, vol. 3, no. 4. Mathematical
Sciences Publishers, pp. 939–1000, 2023.
ista: Brooks M, Seiringer R. 2023. Validity of Bogoliubov’s approximation fortranslation-invariant
Bose gases. Probability and Mathematical Physics. 3(4), 939–1000.
mla: Brooks, Morris, and Robert Seiringer. “Validity of Bogoliubov’s Approximation
Fortranslation-Invariant Bose Gases.” Probability and Mathematical Physics,
vol. 3, no. 4, Mathematical Sciences Publishers, 2023, pp. 939–1000, doi:10.2140/pmp.2022.3.939.
short: M. Brooks, R. Seiringer, Probability and Mathematical Physics 3 (2023) 939–1000.
corr_author: '1'
date_created: 2024-05-29T06:12:54Z
date_published: 2023-02-21T00:00:00Z
date_updated: 2025-04-14T07:26:59Z
day: '21'
department:
- _id: RoSe
doi: 10.2140/pmp.2022.3.939
ec_funded: 1
external_id:
arxiv:
- '2111.13864'
intvolume: ' 3'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2111.13864
month: '02'
oa: 1
oa_version: Preprint
page: 939-1000
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Probability and Mathematical Physics
publication_identifier:
eissn:
- 2690-1005
issn:
- 2690-0998
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Validity of Bogoliubov’s approximation fortranslation-invariant Bose gases
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2023'
...
---
_id: '18218'
abstract:
- lang: eng
text: Deep neural networks are known to be susceptible to adversarial perturbations
– small perturbations that alter the output of the network and exist under strict
norm limitations. While such perturbations are usually discussed as tailored to
a specific input, a universal perturbation can be constructed to alter the model’s
output on a set of inputs. Universal perturbations present a more realistic case
of adversarial attacks, as awareness of the model’s exact input is not required.
In addition, the universal attack setting raises the subject of generalization
to unseen data, where given a set of inputs, the universal perturbations aim to
alter the model’s output on out-of-sample data. In this work, we study physical
passive patch adversarial attacks on visual odometry-based autonomous navigation
systems. A visual odometry system aims to infer the relative camera motion between
two corresponding viewpoints, and is frequently used by vision-based autonomous
navigation systems to estimate their state. For such navigation systems, a patch
adversarial perturbation poses a severe security issue, as it can be used to mislead
a system onto some collision course. To the best of our knowledge, we show for
the first time that the error margin of a visual odometry model can be significantly
increased by deploying patch adversarial attacks in the scene. We provide evaluation
on synthetic closed-loop drone navigation data and demonstrate that a comparable
vulnerability exists in real data. A reference implementation of the proposed
method and the reported experiments is provided at https://github.com/patchadversarialattacks/patchadversarialattacks.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Yaniv
full_name: Nemcovsky, Yaniv
last_name: Nemcovsky
- first_name: Matan
full_name: Jacoby, Matan
last_name: Jacoby
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Chaim
full_name: Baskin, Chaim
last_name: Baskin
citation:
ama: 'Nemcovsky Y, Jacoby M, Bronstein AM, Baskin C. Physical passive patch adversarial
attacks on visual odometry systems. In: 16th Asian Conference on Computer Vision.
Vol 13847. Springer Nature; 2023:518-534. doi:10.1007/978-3-031-26293-7_31'
apa: 'Nemcovsky, Y., Jacoby, M., Bronstein, A. M., & Baskin, C. (2023). Physical
passive patch adversarial attacks on visual odometry systems. In 16th Asian
Conference on Computer Vision (Vol. 13847, pp. 518–534). Macao, China: Springer
Nature. https://doi.org/10.1007/978-3-031-26293-7_31'
chicago: Nemcovsky, Yaniv, Matan Jacoby, Alex M. Bronstein, and Chaim Baskin. “Physical
Passive Patch Adversarial Attacks on Visual Odometry Systems.” In 16th Asian
Conference on Computer Vision, 13847:518–34. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-26293-7_31.
ieee: Y. Nemcovsky, M. Jacoby, A. M. Bronstein, and C. Baskin, “Physical passive
patch adversarial attacks on visual odometry systems,” in 16th Asian Conference
on Computer Vision, Macao, China, 2023, vol. 13847, pp. 518–534.
ista: 'Nemcovsky Y, Jacoby M, Bronstein AM, Baskin C. 2023. Physical passive patch
adversarial attacks on visual odometry systems. 16th Asian Conference on Computer
Vision. ACCV: Asian Conference on Computer Vision, LNCS, vol. 13847, 518–534.'
mla: Nemcovsky, Yaniv, et al. “Physical Passive Patch Adversarial Attacks on Visual
Odometry Systems.” 16th Asian Conference on Computer Vision, vol. 13847,
Springer Nature, 2023, pp. 518–34, doi:10.1007/978-3-031-26293-7_31.
short: Y. Nemcovsky, M. Jacoby, A.M. Bronstein, C. Baskin, in:, 16th Asian Conference
on Computer Vision, Springer Nature, 2023, pp. 518–534.
conference:
end_date: 2022-12-08
location: Macao, China
name: 'ACCV: Asian Conference on Computer Vision'
start_date: 2022-12-04
date_created: 2024-10-08T12:51:14Z
date_published: 2023-03-11T00:00:00Z
date_updated: 2024-10-09T12:13:36Z
day: '11'
doi: 10.1007/978-3-031-26293-7_31
extern: '1'
external_id:
arxiv:
- '2207.05729'
intvolume: ' 13847'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2207.05729
month: '03'
oa: 1
oa_version: Preprint
page: 518-534
publication: 16th Asian Conference on Computer Vision
publication_identifier:
eisbn:
- '9783031262937'
eissn:
- 1611-3349
isbn:
- '9783031262920'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/patchadversarialattacks/patchadversarialattacks
scopus_import: '1'
status: public
title: Physical passive patch adversarial attacks on visual odometry systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13847
year: '2023'
...
---
OA_place: repository
_id: '15039'
abstract:
- lang: eng
text: 'A crucial property for achieving secure, trustworthy and interpretable deep
learning systems is their robustness: small changes to a system''s inputs should
not result in large changes to its outputs. Mathematically, this means one strives
for networks with a small Lipschitz constant. Several recent works have focused
on how to construct such Lipschitz networks, typically by imposing constraints
on the weight matrices. In this work, we study an orthogonal aspect, namely the
role of the activation function. We show that commonly used activation functions,
such as MaxMin, as well as all piece-wise linear ones with two segments unnecessarily
restrict the class of representable functions, even in the simplest one-dimensional
setting. We furthermore introduce the new N-activation function that is provably
more expressive than currently popular activation functions. We provide code at
this https URL.'
article_number: '2311.06103'
article_processing_charge: No
arxiv: 1
author:
- first_name: Bernd
full_name: Prach, Bernd
id: 2D561D42-C427-11E9-89B4-9C1AE6697425
last_name: Prach
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations.
arXiv. doi:10.48550/ARXIV.2311.06103
apa: Prach, B., & Lampert, C. (n.d.). 1-Lipschitz neural networks are more expressive
with N-activations. arXiv. https://doi.org/10.48550/ARXIV.2311.06103
chicago: Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More
Expressive with N-Activations.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2311.06103.
ieee: B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive
with N-activations,” arXiv. .
ista: Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations.
arXiv, 2311.06103.
mla: Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More
Expressive with N-Activations.” ArXiv, 2311.06103, doi:10.48550/ARXIV.2311.06103.
short: B. Prach, C. Lampert, ArXiv (n.d.).
corr_author: '1'
date_created: 2024-02-28T17:59:32Z
date_published: 2023-11-10T00:00:00Z
date_updated: 2026-07-27T12:47:43Z
day: '10'
department:
- _id: GradSch
- _id: ChLa
doi: 10.48550/ARXIV.2311.06103
external_id:
arxiv:
- '2311.06103'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2311.06103
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '19759'
relation: dissertation_contains
status: public
status: public
title: 1-Lipschitz neural networks are more expressive with N-activations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '14771'
abstract:
- lang: eng
text: Pruning—that is, setting a significant subset of the parameters of a neural
network to zero—is one of the most popular methods of model compression. Yet,
several recent works have raised the issue that pruning may induce or exacerbate
bias in the output of the compressed model. Despite existing evidence for this
phenomenon, the relationship between neural network pruning and induced bias is
not well-understood. In this work, we systematically investigate and characterize
this phenomenon in Convolutional Neural Networks for computer vision. First, we
show that it is in fact possible to obtain highly-sparse models, e.g. with less
than 10% remaining weights, which do not decrease in accuracy nor substantially
increase in bias when compared to dense models. At the same time, we also find
that, at higher sparsities, pruned models exhibit higher uncertainty in their
outputs, as well as increased correlations, which we directly link to increased
bias. We propose easy-to-use criteria which, based only on the uncompressed model,
establish whether bias will increase with pruning, and identify the samples most
susceptible to biased predictions post-compression. Our code can be found at https://github.com/IST-DASLab/pruned-vision-model-bias.
acknowledgement: The authors would like to sincerely thank Sara Hooker for her feedback
during the development of this work. EI was supported in part by the FWF DK VGSCO,
grant agreement number W1260-N35. AP and DA acknowledge generous ERC support, via
Starting Grant 805223 ScaleML.
article_processing_charge: No
arxiv: 1
author:
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- 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: 'Iofinova EB, Krumes A, Alistarh D-A. Bias in pruned vision models: In-depth
analysis and countermeasures. In: 2023 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. IEEE; 2023:24364-24373. doi:10.1109/cvpr52729.2023.02334'
apa: 'Iofinova, E. B., Krumes, A., & Alistarh, D.-A. (2023). Bias in pruned
vision models: In-depth analysis and countermeasures. In 2023 IEEE/CVF Conference
on Computer Vision and Pattern Recognition (pp. 24364–24373). Vancouver, BC,
Canada: IEEE. https://doi.org/10.1109/cvpr52729.2023.02334'
chicago: 'Iofinova, Eugenia B, Alexandra Krumes, and Dan-Adrian Alistarh. “Bias
in Pruned Vision Models: In-Depth Analysis and Countermeasures.” In 2023 IEEE/CVF
Conference on Computer Vision and Pattern Recognition, 24364–73. IEEE, 2023.
https://doi.org/10.1109/cvpr52729.2023.02334.'
ieee: 'E. B. Iofinova, A. Krumes, and D.-A. Alistarh, “Bias in pruned vision models:
In-depth analysis and countermeasures,” in 2023 IEEE/CVF Conference on Computer
Vision and Pattern Recognition, Vancouver, BC, Canada, 2023, pp. 24364–24373.'
ista: 'Iofinova EB, Krumes A, Alistarh D-A. 2023. Bias in pruned vision models:
In-depth analysis and countermeasures. 2023 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition,
24364–24373.'
mla: 'Iofinova, Eugenia B., et al. “Bias in Pruned Vision Models: In-Depth Analysis
and Countermeasures.” 2023 IEEE/CVF Conference on Computer Vision and Pattern
Recognition, IEEE, 2023, pp. 24364–73, doi:10.1109/cvpr52729.2023.02334.'
short: E.B. Iofinova, A. Krumes, D.-A. Alistarh, in:, 2023 IEEE/CVF Conference on
Computer Vision and Pattern Recognition, IEEE, 2023, pp. 24364–24373.
conference:
end_date: 2023-06-24
location: Vancouver, BC, Canada
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2023-06-17
corr_author: '1'
date_created: 2024-01-10T08:42:40Z
date_published: 2023-08-22T00:00:00Z
date_updated: 2026-07-27T12:50:03Z
day: '22'
department:
- _id: DaAl
- _id: ChLa
doi: 10.1109/cvpr52729.2023.02334
ec_funded: 1
external_id:
arxiv:
- '2304.12622'
isi:
- '001062531308068'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2304.12622
month: '08'
oa: 1
oa_version: Preprint
page: 24364-24373
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
grant_number: W1260-N35
name: Vienna Graduate School on Computational Optimization
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition
publication_identifier:
eisbn:
- '9798350301298'
eissn:
- 2575-7075
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/IST-DASLab/pruned-vision-model-bias
record:
- id: '21854'
relation: dissertation_contains
status: public
status: public
title: 'Bias in pruned vision models: In-depth analysis and countermeasures'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '18179'
abstract:
- lang: eng
text: 'Linnik type problems concern the distribution of projections of integral
points on the unit sphere as their norm increases, and different generalizations
of this phenomenon. Our work addresses a question of this type: we prove the uniform
distribution of the projections of primitive Z2 points in the p-adic unit sphere,
as their (real) norm tends to infinity. The proof is via counting lattice points
in semi-simple S-arithmetic groups.'
- lang: fre
text: 'Les problèmes de type Linnik concernent la distribution des projections des
points entiers sur la sphère unitaire lorsque leur norme augmente et différentes
généralisations de ce phénomène. Notre travail s’intéresse à une question de ce
type : nous prouvons la distribution uniforme des projections des points primitifs
de Z2 sur la sphère unitaire p-adique lorsque leur norme (réelle) tend vers l’infini.
La preuve se fait en comptant les points d’un réseau dans des S-groupes arithmétiques
semi-simples.'
acknowledgement: The second author is supported by EPRSC grant EP/P026710/1.
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Antonin
full_name: Guilloux, Antonin
last_name: Guilloux
- first_name: Tal
full_name: Horesh, Tal
id: C8B7BF48-8D81-11E9-BCA9-F536E6697425
last_name: Horesh
citation:
ama: Guilloux A, Horesh T. p-adic directions of primitive vectors. Publications
mathématiques de Besançon - Algèbre et Théorie des nombres. 2023;2023:85-107.
doi:10.5802/pmb.50
apa: Guilloux, A., & Horesh, T. (2023). p-adic directions of primitive vectors.
Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres.
Presses Universitaires de Franche-Comté. https://doi.org/10.5802/pmb.50
chicago: Guilloux, Antonin, and Tal Horesh. “P-Adic Directions of Primitive Vectors.”
Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres.
Presses Universitaires de Franche-Comté, 2023. https://doi.org/10.5802/pmb.50.
ieee: A. Guilloux and T. Horesh, “p-adic directions of primitive vectors,” Publications
mathématiques de Besançon - Algèbre et Théorie des nombres, vol. 2023. Presses
Universitaires de Franche-Comté, pp. 85–107, 2023.
ista: Guilloux A, Horesh T. 2023. p-adic directions of primitive vectors. Publications
mathématiques de Besançon - Algèbre et Théorie des nombres. 2023, 85–107.
mla: Guilloux, Antonin, and Tal Horesh. “P-Adic Directions of Primitive Vectors.”
Publications Mathématiques de Besançon - Algèbre et Théorie Des Nombres,
vol. 2023, Presses Universitaires de Franche-Comté, 2023, pp. 85–107, doi:10.5802/pmb.50.
short: A. Guilloux, T. Horesh, Publications Mathématiques de Besançon - Algèbre
et Théorie Des Nombres 2023 (2023) 85–107.
corr_author: '1'
das_tickbox: '0'
date_created: 2024-10-06T22:01:13Z
date_published: 2023-06-15T00:00:00Z
date_updated: 2026-07-29T10:40:38Z
day: '15'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.5802/pmb.50
external_id:
arxiv:
- '2103.10889'
file:
- access_level: open_access
checksum: cefc47a2cf55a87f8e4960197f73353b
content_type: application/pdf
creator: dernst
date_created: 2024-10-07T11:32:32Z
date_updated: 2024-10-07T11:32:32Z
file_id: '18186'
file_name: 2023_MathBesancon_Guilloux.pdf
file_size: 1399390
relation: main_file
success: 1
file_date_updated: 2024-10-07T11:32:32Z
has_accepted_license: '1'
intvolume: ' 2023'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '06'
oa: 1
oa_version: Published Version
page: 85-107
project:
- _id: 26A8D266-B435-11E9-9278-68D0E5697425
grant_number: EP-P026710-2
name: Between rational and integral points
publication: Publications mathématiques de Besançon - Algèbre et Théorie des nombres
publication_identifier:
eissn:
- 2592-6616
issn:
- 2804-8504
publication_status: published
publisher: Presses Universitaires de Franche-Comté
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: p-adic directions of primitive vectors
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2023
year: '2023'
...
---
_id: '13317'
abstract:
- lang: eng
text: We prove the Eigenstate Thermalisation Hypothesis (ETH) for local observables
in a typical translation invariant system of quantum spins with L-body interactions,
where L is the number of spins. This mathematically verifies the observation first
made by Santos and Rigol (Phys Rev E 82(3):031130, 2010, https://doi.org/10.1103/PhysRevE.82.031130)
that the ETH may hold for systems with additional translational symmetries for
a naturally restricted class of observables. We also present numerical support
for the same phenomenon for Hamiltonians with local interaction.
acknowledgement: "LE, JH, and VR were supported by ERC Advanced Grant “RMTBeyond”
No. 101020331. SS was supported by KAKENHI Grant Number JP22J14935 from the Japan
Society for the Promotion of Science (JSPS) and Forefront Physics and Mathematics
Program to Drive Transformation (FoPM), a World-leading Innovative Graduate Study
(WINGS) Program, the University of Tokyo.\r\nOpen access funding provided by The
University of Tokyo."
article_number: '128'
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Shoki
full_name: Sugimoto, Shoki
last_name: Sugimoto
- first_name: Sven Joscha
full_name: Henheik, Sven Joscha
id: 31d731d7-d235-11ea-ad11-b50331c8d7fb
last_name: Henheik
orcid: 0000-0003-1106-327X
- first_name: Volodymyr
full_name: Riabov, Volodymyr
id: 1949f904-edfb-11eb-afb5-e2dfddabb93b
last_name: Riabov
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
citation:
ama: Sugimoto S, Henheik SJ, Riabov V, Erdös L. Eigenstate thermalisation hypothesis
for translation invariant spin systems. Journal of Statistical Physics.
2023;190(7). doi:10.1007/s10955-023-03132-4
apa: Sugimoto, S., Henheik, S. J., Riabov, V., & Erdös, L. (2023). Eigenstate
thermalisation hypothesis for translation invariant spin systems. Journal of
Statistical Physics. Springer Nature. https://doi.org/10.1007/s10955-023-03132-4
chicago: Sugimoto, Shoki, Sven Joscha Henheik, Volodymyr Riabov, and László Erdös.
“Eigenstate Thermalisation Hypothesis for Translation Invariant Spin Systems.”
Journal of Statistical Physics. Springer Nature, 2023. https://doi.org/10.1007/s10955-023-03132-4.
ieee: S. Sugimoto, S. J. Henheik, V. Riabov, and L. Erdös, “Eigenstate thermalisation
hypothesis for translation invariant spin systems,” Journal of Statistical
Physics, vol. 190, no. 7. Springer Nature, 2023.
ista: Sugimoto S, Henheik SJ, Riabov V, Erdös L. 2023. Eigenstate thermalisation
hypothesis for translation invariant spin systems. Journal of Statistical Physics.
190(7), 128.
mla: Sugimoto, Shoki, et al. “Eigenstate Thermalisation Hypothesis for Translation
Invariant Spin Systems.” Journal of Statistical Physics, vol. 190, no.
7, 128, Springer Nature, 2023, doi:10.1007/s10955-023-03132-4.
short: S. Sugimoto, S.J. Henheik, V. Riabov, L. Erdös, Journal of Statistical Physics
190 (2023).
date_created: 2023-07-30T22:01:02Z
date_published: 2023-07-21T00:00:00Z
date_updated: 2026-07-29T13:18:16Z
day: '21'
ddc:
- '510'
- '530'
department:
- _id: LaEr
doi: 10.1007/s10955-023-03132-4
ec_funded: 1
external_id:
arxiv:
- '2304.04213'
isi:
- '001035677200002'
file:
- access_level: open_access
checksum: c2ef6b2aecfee1ad6d03fab620507c2c
content_type: application/pdf
creator: dernst
date_created: 2023-07-31T07:49:31Z
date_updated: 2023-07-31T07:49:31Z
file_id: '13325'
file_name: 2023_JourStatPhysics_Sugimoto.pdf
file_size: 612755
relation: main_file
success: 1
file_date_updated: 2023-07-31T07:49:31Z
has_accepted_license: '1'
intvolume: ' 190'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Journal of Statistical Physics
publication_identifier:
eissn:
- 1572-9613
issn:
- 0022-4715
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '20575'
relation: dissertation_contains
status: public
- id: '19540'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Eigenstate thermalisation hypothesis for translation invariant spin systems
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: 190
year: '2023'
...