---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '15407'
abstract:
- lang: eng
text: We propose and implement a family of quantum-informed recursive optimization
(QIRO) algorithms for combinatorial optimization problems. Our approach leverages
quantum resources to obtain information that is used in problem-specific classical
reduction steps that recursively simplify the problem. These reduction steps address
the limitations of the quantum component (e.g., locality) and ensure solution
feasibility in constrained optimization problems. Additionally, we use backtracking
techniques to further improve the performance of the algorithm without increasing
the requirements on the quantum hardware. We showcase the capabilities of our
approach by informing QIRO with correlations from classical simulations of shallow
circuits of the quantum approximate optimization algorithm, solving instances
of maximum independent set and maximum satisfiability problems with hundreds of
variables. We also demonstrate how QIRO can be deployed on a neutral atom quantum
processor to find large independent sets of graphs. In summary, our scheme achieves
results comparable to classical heuristics even with relatively weak quantum resources.
Furthermore, enhancing the quality of these quantum resources improves the performance
of the algorithms. Notably, the modular nature of QIRO offers various avenues
for modifications, positioning our work as a template for a broader class of hybrid
quantum-classical algorithms for combinatorial optimization.
acknowledgement: J.R.F. and A.K. thank Libor Caha and Alexander Kliesch for insightful
discussions. The authors thank Lilly Palackal, Maximilian Passek, Carlos Riofrío,
and Gili Rosenberg for thorough reviews of the manuscript, and the Amazon Braket,
BMW, and QuEra teams for their support. C.M. thanks the Munich Quantum Valley initiative,
which is supported by the Bavarian State Government with funds from the Hightech
Agenda Bayern Plus. H.G.K. would like to thank Am Platzl 1A for providing the necessary
environment for creative thinking. An open-source implementation of QIRO is available
online [60].
article_number: '020327'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Jernej Rudi
full_name: Finžgar, Jernej Rudi
last_name: Finžgar
- first_name: Aron
full_name: Kerschbaumer, Aron
id: ade85a9c-3200-11ee-973b-91c1eb240410
last_name: Kerschbaumer
- first_name: Martin J.A.
full_name: Schuetz, Martin J.A.
last_name: Schuetz
- first_name: Christian B.
full_name: Mendl, Christian B.
last_name: Mendl
- first_name: Helmut G.
full_name: Katzgraber, Helmut G.
last_name: Katzgraber
citation:
ama: Finžgar JR, Kerschbaumer A, Schuetz MJA, Mendl CB, Katzgraber HG. Quantum-informed
recursive optimization algorithms. PRX Quantum. 2024;5(2). doi:10.1103/PRXQuantum.5.020327
apa: Finžgar, J. R., Kerschbaumer, A., Schuetz, M. J. A., Mendl, C. B., & Katzgraber,
H. G. (2024). Quantum-informed recursive optimization algorithms. PRX Quantum.
American Physical Society. https://doi.org/10.1103/PRXQuantum.5.020327
chicago: Finžgar, Jernej Rudi, Aron Kerschbaumer, Martin J.A. Schuetz, Christian
B. Mendl, and Helmut G. Katzgraber. “Quantum-Informed Recursive Optimization Algorithms.”
PRX Quantum. American Physical Society, 2024. https://doi.org/10.1103/PRXQuantum.5.020327.
ieee: J. R. Finžgar, A. Kerschbaumer, M. J. A. Schuetz, C. B. Mendl, and H. G. Katzgraber,
“Quantum-informed recursive optimization algorithms,” PRX Quantum, vol.
5, no. 2. American Physical Society, 2024.
ista: Finžgar JR, Kerschbaumer A, Schuetz MJA, Mendl CB, Katzgraber HG. 2024. Quantum-informed
recursive optimization algorithms. PRX Quantum. 5(2), 020327.
mla: Finžgar, Jernej Rudi, et al. “Quantum-Informed Recursive Optimization Algorithms.”
PRX Quantum, vol. 5, no. 2, 020327, American Physical Society, 2024, doi:10.1103/PRXQuantum.5.020327.
short: J.R. Finžgar, A. Kerschbaumer, M.J.A. Schuetz, C.B. Mendl, H.G. Katzgraber,
PRX Quantum 5 (2024).
corr_author: '1'
date_created: 2024-05-19T22:01:13Z
date_published: 2024-05-01T00:00:00Z
date_updated: 2025-05-14T09:29:40Z
day: '01'
ddc:
- '530'
department:
- _id: GradSch
doi: 10.1103/PRXQuantum.5.020327
external_id:
arxiv:
- '2308.13607'
file:
- access_level: open_access
checksum: 76bdf0b4dc06d59d073a57bd6957a96c
content_type: application/pdf
creator: dernst
date_created: 2024-05-21T09:35:14Z
date_updated: 2024-05-21T09:35:14Z
file_id: '15409'
file_name: 2024_PRXQuantum_Finzgar.pdf
file_size: 2016085
relation: main_file
success: 1
file_date_updated: 2024-05-21T09:35:14Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '05'
oa: 1
oa_version: Published Version
publication: PRX Quantum
publication_identifier:
eissn:
- 2691-3399
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantum-informed recursive optimization algorithms
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: 5
year: '2024'
...
---
_id: '17136'
abstract:
- lang: eng
text: "This paper focuses on Majority Dynamics in sparse graphs, in particular,
as a\r\ntool to study internal cuts. It is known that, in Majority Dynamics on
a finite\r\ngraph, each vertex eventually either comes to a fixed state, or oscillates
with\r\nperiod two. The empirical evidence acquired by simulations suggests that
for\r\nrandom odd-regular graphs, approximately half of the vertices end up\r\noscillating
with high probability. We notice a local symmetry between\r\noscillating and non-oscillating
vertices, that potentially can explain why the\r\nfraction of the oscillating
vertices is concentrated around $\\frac{1}{2}$. In\r\nour simulations, we observe
that the parts of random odd-regular graph under\r\nMajority Dynamics with high
probability do not contain $\\lceil \\frac{d}{2}\r\n\\rceil$-cores at any timestep,
and thus, one cannot use Majority Dynamics to\r\nprove that internal cuts exist
in odd-regular graphs almost surely. However, we\r\nsuggest a modification of
Majority Dynamics, that yields parts with desired\r\ncores with high probability."
acknowledgement: "I am grateful to Matthew Kwan for setting the problem, providing
useful literature,\r\nfruitful discussions, text review, mentorship, general encouragement
and support."
article_number: '2406.07026'
article_processing_charge: No
arxiv: 1
author:
- first_name: Pavel
full_name: Arkhipov, Pavel
id: b25f2ab2-1fed-11ee-8599-fe02d211784f
last_name: Arkhipov
citation:
ama: 'Arkhipov P. Majority dynamics and internal partitions of random regular graphs:
Experimental results. arXiv. doi:10.48550/arXiv.2406.07026'
apa: 'Arkhipov, P. (n.d.). Majority dynamics and internal partitions of random regular
graphs: Experimental results. arXiv. https://doi.org/10.48550/arXiv.2406.07026'
chicago: 'Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random
Regular Graphs: Experimental Results.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2406.07026.'
ieee: 'P. Arkhipov, “Majority dynamics and internal partitions of random regular
graphs: Experimental results,” arXiv. .'
ista: 'Arkhipov P. Majority dynamics and internal partitions of random regular graphs:
Experimental results. arXiv, 2406.07026.'
mla: 'Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random Regular
Graphs: Experimental Results.” ArXiv, 2406.07026, doi:10.48550/arXiv.2406.07026.'
short: P. Arkhipov, ArXiv (n.d.).
date_created: 2024-06-12T07:01:52Z
date_published: 2024-06-11T00:00:00Z
date_updated: 2024-06-17T10:45:32Z
day: '11'
department:
- _id: GradSch
doi: 10.48550/arXiv.2406.07026
external_id:
arxiv:
- '2406.07026'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2406.07026
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 'Majority dynamics and internal partitions of random regular graphs: Experimental
results'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17141'
abstract:
- lang: eng
text: The TIR1/AFB–Aux/IAA–ARF canonical auxin signaling pathway is widely accepted
to (de)active transcriptional regulation, thus controlling auxin-associated developmental
processes. However, the theme of a rapid auxin response has emerged since the
2018 Auxins and Cytokinin in Plant Development conference. To date, a few signaling
components have been identified to mediate both slow and rapid auxin responses,
which unveils the complexity of auxin signaling.
acknowledgement: "We thank other lab members for their critical comments on this manuscript.
We also thank the editor and reviewers for their constructive comments to improve
our manuscript. We apologize to authors whose important work we could not include
due to space limitations.\r\nThis work is supported by funding from Jiangxi Agricultural
University (9232308314) and the Science and Technology Department of Jiangxi Province
(20223BCJ25037) to HBH, and the Science and Technology Department of Jiangxi Province
(20202ACB215002) to SYP."
article_number: erae246
article_processing_charge: No
article_type: original
author:
- first_name: Zilin
full_name: Zhang, Zilin
last_name: Zhang
- first_name: Huihuang
full_name: Chen, Huihuang
id: 83c96512-15b2-11ec-abd3-b7eede36184f
last_name: Chen
- first_name: Shuaiying
full_name: Peng, Shuaiying
last_name: Peng
- first_name: Huibin
full_name: Han, Huibin
last_name: Han
citation:
ama: Zhang Z, Chen H, Peng S, Han H. Slow and rapid auxin responses in Arabidopsis.
Journal of Experimental Botany. 2024;75(18). doi:10.1093/jxb/erae246
apa: Zhang, Z., Chen, H., Peng, S., & Han, H. (2024). Slow and rapid auxin responses
in Arabidopsis. Journal of Experimental Botany. Oxford University Press.
https://doi.org/10.1093/jxb/erae246
chicago: Zhang, Zilin, Huihuang Chen, Shuaiying Peng, and Huibin Han. “Slow and
Rapid Auxin Responses in Arabidopsis.” Journal of Experimental Botany.
Oxford University Press, 2024. https://doi.org/10.1093/jxb/erae246.
ieee: Z. Zhang, H. Chen, S. Peng, and H. Han, “Slow and rapid auxin responses in
Arabidopsis,” Journal of Experimental Botany, vol. 75, no. 18. Oxford University
Press, 2024.
ista: Zhang Z, Chen H, Peng S, Han H. 2024. Slow and rapid auxin responses in Arabidopsis.
Journal of Experimental Botany. 75(18), erae246.
mla: Zhang, Zilin, et al. “Slow and Rapid Auxin Responses in Arabidopsis.” Journal
of Experimental Botany, vol. 75, no. 18, erae246, Oxford University Press,
2024, doi:10.1093/jxb/erae246.
short: Z. Zhang, H. Chen, S. Peng, H. Han, Journal of Experimental Botany 75 (2024).
date_created: 2024-06-15T19:50:15Z
date_published: 2024-09-27T00:00:00Z
date_updated: 2025-09-08T07:57:50Z
day: '27'
ddc:
- '580'
department:
- _id: GradSch
- _id: JiFr
doi: 10.1093/jxb/erae246
external_id:
isi:
- '001270051200001'
pmid:
- '38794966'
file:
- access_level: open_access
checksum: 91b9435ed0f6640809c7588df19abf2f
content_type: application/pdf
creator: dernst
date_created: 2025-01-02T10:26:22Z
date_updated: 2025-01-02T10:26:22Z
file_id: '18720'
file_name: 2024_JourExperimentalBotany_Zhang.pdf
file_size: 763097
relation: main_file
success: 1
file_date_updated: 2025-01-02T10:26:22Z
has_accepted_license: '1'
intvolume: ' 75'
isi: 1
issue: '18'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Journal of Experimental Botany
publication_identifier:
issn:
- 0022-0957
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Slow and rapid auxin responses in Arabidopsis
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 75
year: '2024'
...
---
_id: '17170'
abstract:
- lang: eng
text: "In this article we extend and strengthen the seminal work by Niyogi, Smale,
and Weinberger on the learning of the homotopy type from a sample of an underlying
space. In their work, Niyogi, Smale, and Weinberger studied samples of C² manifolds
with positive reach embedded in ℝ^d. We extend their results in the following
ways: - As the ambient space we consider both ℝ^d and Riemannian manifolds with
lower bounded sectional curvature. - In both types of ambient spaces, we study
sets of positive reach - a significantly more general setting than C² manifolds
- as well as general manifolds of positive reach. - The sample P of a set (or
a manifold) \U0001D4AE of positive reach may be noisy. We work with two one-sided
Hausdorff distances - ε and δ - between P and \U0001D4AE. We provide tight bounds
in terms of ε and δ, that guarantee that there exists a parameter r such that
the union of balls of radius r centred at the sample P deformation-retracts to
\U0001D4AE. We exhibit their tightness by an explicit construction. We carefully
distinguish the roles of δ and ε. This is not only essential to achieve tight
bounds, but also sensible in practical situations, since it allows one to adapt
the bound according to sample density and the amount of noise present in the sample
separately."
acknowledgement: "This research has been supported by the European Research Council
(ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF),
grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian
Science Fund (FWF), grant No. I 02979-N35.\r\nWintraecken, Mathijs: Supported by
the European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant
No. M-3073, and the welcome package from IDEX of the Université Côte d'Azur."
alternative_title:
- LIPIcs
article_processing_charge: No
arxiv: 1
author:
- first_name: Dominique
full_name: Attali, Dominique
last_name: Attali
- first_name: Hana
full_name: Kourimska, Hana
id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E
last_name: Kourimska
orcid: 0000-0001-7841-0091
- first_name: Christopher D
full_name: Fillmore, Christopher D
id: 35638A5C-AAC7-11E9-B0BF-5503E6697425
last_name: Fillmore
- first_name: Ishika
full_name: Ghosh, Ishika
id: ee449b28-344d-11ef-a6d5-9ca430e9e9ff
last_name: Ghosh
- first_name: André
full_name: Lieutier, André
last_name: Lieutier
- first_name: Elizabeth R
full_name: Stephenson, Elizabeth R
id: 2D04F932-F248-11E8-B48F-1D18A9856A87
last_name: Stephenson
orcid: 0000-0002-6862-208X
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: 'Attali D, Kourimska H, Fillmore CD, et al. Tight bounds for the learning of
homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and
of Riemannian manifolds. In: 40th International Symposium on Computational
Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:11:1-11:19.
doi:10.4230/LIPIcs.SoCG.2024.11'
apa: 'Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson,
E. R., & Wintraecken, M. (2024). Tight bounds for the learning of homotopy
à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian
manifolds. In 40th International Symposium on Computational Geometry (Vol.
293, p. 11:1-11:19). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2024.11'
chicago: Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh,
André Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “Tight Bounds
for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of
Euclidean Spaces and of Riemannian Manifolds.” In 40th International Symposium
on Computational Geometry, 293:11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.11.
ieee: D. Attali et al., “Tight bounds for the learning of homotopy à la Niyogi,
Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds,”
in 40th International Symposium on Computational Geometry, Athens, Greece,
2024, vol. 293, p. 11:1-11:19.
ista: 'Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken
M. 2024. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger
for subsets of euclidean spaces and of Riemannian manifolds. 40th International
Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry,
LIPIcs, vol. 293, 11:1-11:19.'
mla: Attali, Dominique, et al. “Tight Bounds for the Learning of Homotopy à La Niyogi,
Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.”
40th International Symposium on Computational Geometry, vol. 293, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19, doi:10.4230/LIPIcs.SoCG.2024.11.
short: D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson,
M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19.
conference:
end_date: 2024-06-14
location: Athens, Greece
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2024-06-11
date_created: 2024-06-25T11:45:58Z
date_published: 2024-06-06T00:00:00Z
date_updated: 2025-04-15T07:16:57Z
day: '06'
ddc:
- '516'
department:
- _id: GradSch
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2024.11
ec_funded: 1
external_id:
arxiv:
- '2206.10485'
file:
- access_level: open_access
checksum: 6a2ddc8b51aa58f197a8b294750f1f8d
content_type: application/pdf
creator: cfillmor
date_created: 2024-06-25T11:47:26Z
date_updated: 2024-06-25T11:47:26Z
file_id: '17171'
file_name: LIPIcs.SoCG.2024.11.pdf
file_size: 20886142
relation: main_file
success: 1
file_date_updated: 2024-06-25T11:47:26Z
has_accepted_license: '1'
intvolume: ' 293'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 11:1-11:19
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: 40th International Symposium on Computational Geometry
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959773164'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger
for subsets of euclidean spaces and of Riemannian manifolds
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
volume: 293
year: '2024'
...
---
_id: '17214'
abstract:
- lang: eng
text: 'Current numerical algorithms for simulating friction fall in one of two camps:
smooth solvers sacrifice the stable treatment of static friction in exchange for
fast convergence, and non-smooth solvers accurately compute friction at convergence
rates that are often prohibitive for large graphics applications. We introduce
a novel bridge between these two ideas that computes static and dynamic friction
stably and efficiently. Our key idea is to convert the highly constrained non-smooth
problem into an unconstrained smooth problem using logarithmic barriers that converges
to the exact solution as accuracy increases. We phrase the problem as an interior
point primal-dual problem that can be solved efficiently with Newton iteration.
We observe quadratic convergence despite the non-smooth nature of the original
problem, and our method is well-suited for large systems of tightly packed objects
with many contact points. We demonstrate the efficacy of our method with stable
piles of grains and stacks of objects, complex granular flows, and robust interlocking
assemblies of rigid bodies.'
acknowledgement: We thank Vincent Acary for his help with Siconos, as well as the
anonymous reviewers and the members of the Visual Computing Group at ISTA for their
helpful comments. This research was funded in part by the European Union (ERC-2021-COG
101045083 CoDiNA).
article_processing_charge: Yes (via OA deal)
author:
- first_name: Yi-Lu
full_name: Chen, Yi-Lu
id: 0b467602-dbcd-11ea-9d1d-ed480aa46b70
last_name: Chen
- first_name: Mickaël
full_name: Ly, Mickaël
id: 6340d7f0-b48d-11eb-b10d-b7487e71d9f1
last_name: Ly
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: 'Chen Y-L, Ly M, Wojtan C. Primal-dual non-smooth friction for rigid body animation.
In: Special Interest Group on Computer Graphics and Interactive Techniques
Conference Conference Papers ’24. Association for Computing Machinery; 2024.
doi:10.1145/3641519.3657485'
apa: 'Chen, Y.-L., Ly, M., & Wojtan, C. (2024). Primal-dual non-smooth friction
for rigid body animation. In Special Interest Group on Computer Graphics and
Interactive Techniques Conference Conference Papers ’24. Denver, United States:
Association for Computing Machinery. https://doi.org/10.1145/3641519.3657485'
chicago: Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. “Primal-Dual Non-Smooth Friction
for Rigid Body Animation.” In Special Interest Group on Computer Graphics and
Interactive Techniques Conference Conference Papers ’24. Association for Computing
Machinery, 2024. https://doi.org/10.1145/3641519.3657485.
ieee: Y.-L. Chen, M. Ly, and C. Wojtan, “Primal-dual non-smooth friction for rigid
body animation,” in Special Interest Group on Computer Graphics and Interactive
Techniques Conference Conference Papers ’24, Denver, United States, 2024.
ista: 'Chen Y-L, Ly M, Wojtan C. 2024. Primal-dual non-smooth friction for rigid
body animation. Special Interest Group on Computer Graphics and Interactive Techniques
Conference Conference Papers ’24. SIGGRAPH: Computer Graphics and Interactive
Techniques Conference.'
mla: Chen, Yi-Lu, et al. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.”
Special Interest Group on Computer Graphics and Interactive Techniques Conference
Conference Papers ’24, Association for Computing Machinery, 2024, doi:10.1145/3641519.3657485.
short: Y.-L. Chen, M. Ly, C. Wojtan, in:, Special Interest Group on Computer Graphics
and Interactive Techniques Conference Conference Papers ’24, Association for Computing
Machinery, 2024.
conference:
end_date: 2024-08-01
location: Denver, United States
name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference'
start_date: 2024-07-28
corr_author: '1'
date_created: 2024-07-10T11:06:20Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-09-08T08:54:38Z
day: '01'
ddc:
- '621'
- '531'
- '006'
department:
- _id: GradSch
- _id: ChWo
doi: 10.1145/3641519.3657485
external_id:
isi:
- '001282218200091'
file:
- access_level: open_access
checksum: b8b203ed09e3995ba0d7e6a76288663a
content_type: application/pdf
creator: yichen
date_created: 2024-07-10T11:03:14Z
date_updated: 2024-07-10T11:03:14Z
file_id: '17215'
file_name: sig24_friction_authors.pdf
file_size: 47309472
relation: main_file
success: 1
- access_level: open_access
checksum: 89d81b397b4b6469d828808a68b70820
content_type: application/pdf
creator: yichen
date_created: 2024-07-10T11:03:12Z
date_updated: 2024-07-10T11:03:12Z
file_id: '17216'
file_name: sig24_friction_supplementary.pdf
file_size: 10518286
relation: main_file
success: 1
- access_level: open_access
checksum: 7123deed34a5456810e7b5336a31c657
content_type: video/mp4
creator: yichen
date_created: 2024-07-10T11:03:51Z
date_updated: 2024-07-10T11:03:51Z
file_id: '17217'
file_name: friction_paper_extra_video_finished.mp4
file_size: 71789192
relation: main_file
success: 1
- access_level: open_access
checksum: e606fc1ae8f2610ce3b4421566800b45
content_type: video/mp4
creator: yichen
date_created: 2024-07-10T11:03:58Z
date_updated: 2024-07-10T11:03:58Z
file_id: '17218'
file_name: friction_paper_video_finished.mp4
file_size: 280610763
relation: main_file
success: 1
file_date_updated: 2024-07-10T11:03:58Z
has_accepted_license: '1'
isi: 1
keyword:
- physical simulation
- frictional contact
- rigid body mechanics
- non-smooth dynamics
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088
grant_number: '101045083'
name: Computational Discovery of Numerical Algorithms for Animation and Simulation
of Natural Phenomena
publication: Special Interest Group on Computer Graphics and Interactive Techniques
Conference Conference Papers '24
publication_identifier:
isbn:
- '9798400705250'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Primal-dual non-smooth friction for rigid body animation
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '17278'
abstract:
- lang: eng
text: An azeotrope is a constant boiling point mixture, and its behavior is important
for fluid separation processes. Predicting azeotropes from atomistic simulations
is difficult due to the complexities and convergence problems of Monte Carlo and
free-energy perturbation techniques. Here, we present a methodology for predicting
the azeotropes of binary mixtures, which computes the compositional dependence
of chemical potentials from molecular dynamics simulations using the S0 method
and employs experimental boiling point and vaporization enthalpy data. Using this
methodology, we reproduce the azeotropes, or lack thereof, in five case studies,
including ethanol/water, ethanol/isooctane, methanol/water, hydrazine/water, and
acetone/chloroform mixtures. We find that it is crucial to use the experimental
boiling point and vaporization enthalpy for reliable azeotrope predictions, as
empirical force fields are not accurate enough for these quantities. Finally,
we use regular solution models to rationalize the azeotropes and reveal that they
tend to form when the mixture components have similar boiling points and strong
interactions.
acknowledgement: B.C. thanks Alessandro Laio, who introduced the phenomenon of azeotrope
and suggested using the S0 method to compute it. B.C. and X.W. thank Felix Wodaczek
for the insightful comments and suggestions on the manuscript. B.C. and X.W. acknowledge
the resources provided by the Cambridge Tier-2 system operated by the University
of Cambridge Research Computing Service, funded by EPSRC Tier-2 capital (Grant No.
EP/P020259/1).
article_number: '034111'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xiaoyu
full_name: Wang, Xiaoyu
id: 8dff9c62-32b0-11ee-9fa8-fc73025e10f3
last_name: Wang
- first_name: Bingqing
full_name: Cheng, Bingqing
id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9
last_name: Cheng
orcid: 0000-0002-3584-9632
citation:
ama: Wang X, Cheng B. Integrating molecular dynamics simulations and experimental
data for azeotrope predictions in binary mixtures. Journal of Chemical Physics.
2024;161(3). doi:10.1063/5.0217232
apa: Wang, X., & Cheng, B. (2024). Integrating molecular dynamics simulations
and experimental data for azeotrope predictions in binary mixtures. Journal
of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0217232
chicago: Wang, Xiaoyu, and Bingqing Cheng. “Integrating Molecular Dynamics Simulations
and Experimental Data for Azeotrope Predictions in Binary Mixtures.” Journal
of Chemical Physics. AIP Publishing, 2024. https://doi.org/10.1063/5.0217232.
ieee: X. Wang and B. Cheng, “Integrating molecular dynamics simulations and experimental
data for azeotrope predictions in binary mixtures,” Journal of Chemical Physics,
vol. 161, no. 3. AIP Publishing, 2024.
ista: Wang X, Cheng B. 2024. Integrating molecular dynamics simulations and experimental
data for azeotrope predictions in binary mixtures. Journal of Chemical Physics.
161(3), 034111.
mla: Wang, Xiaoyu, and Bingqing Cheng. “Integrating Molecular Dynamics Simulations
and Experimental Data for Azeotrope Predictions in Binary Mixtures.” Journal
of Chemical Physics, vol. 161, no. 3, 034111, AIP Publishing, 2024, doi:10.1063/5.0217232.
short: X. Wang, B. Cheng, Journal of Chemical Physics 161 (2024).
corr_author: '1'
date_created: 2024-07-21T22:01:00Z
date_published: 2024-07-14T00:00:00Z
date_updated: 2025-09-08T08:26:09Z
day: '14'
department:
- _id: BiCh
- _id: GradSch
doi: 10.1063/5.0217232
external_id:
arxiv:
- '2405.02216'
isi:
- '001281819100016'
pmid:
- '39007379'
intvolume: ' 161'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2405.02216
month: '07'
oa: 1
oa_version: Preprint
pmid: 1
publication: Journal of Chemical Physics
publication_identifier:
eissn:
- 1089-7690
issn:
- 0021-9606
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/Xiaoyu-Wang-Stone/Azeotrope_S0
scopus_import: '1'
status: public
title: Integrating molecular dynamics simulations and experimental data for azeotrope
predictions in binary mixtures
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 161
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17283'
abstract:
- lang: eng
text: 'We consider the problems of statically refuting equivalence and similarity
of output distributions defined by a pair of probabilistic programs. Equivalence
and similarity are two fundamental relational properties of probabilistic programs
that are essential for their correctness both in implementation and in compilation.
In this work, we present a new method for static equivalence and similarity refutation.
Our method refutes equivalence and similarity by computing a function over program
outputs whose expected value with respect to the output distributions of two programs
is different. The function is computed simultaneously with an upper expectation
supermartingale and a lower expectation submartingale for the two programs, which
we show to together provide a formal certificate for refuting equivalence and
similarity. To the best of our knowledge, our method is the first approach to
relational program analysis to offer the combination of the following desirable
features: (1) it is fully automated, (2) it is applicable to infinite-state probabilistic
programs, and (3) it provides formal guarantees on the correctness of its results.
We implement a prototype of our method and our experiments demonstrate the effectiveness
of our method to refute equivalence and similarity for a number of examples collected
from the literature.'
acknowledgement: "This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant. Petr Novotný\r\nis supported by the Czech Science Foundation grant no. GA23-06963S.\r\n"
article_number: '232'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ehsan
full_name: Kafshdar Goharshadi, Ehsan
id: 103b4fa0-896a-11ed-bdf8-87b697bef40d
last_name: Kafshdar Goharshadi
orcid: 0000-0002-8595-0587
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: Chatterjee K, Goharshady E, Novotný P, Zikelic D. Equivalence and similarity
refutation for probabilistic programs. Proceedings of the ACM on Programming
Languages. 2024;8. doi:10.1145/3656462
apa: Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2024). Equivalence
and similarity refutation for probabilistic programs. Proceedings of the ACM
on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3656462
chicago: Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic.
“Equivalence and Similarity Refutation for Probabilistic Programs.” Proceedings
of the ACM on Programming Languages. Association for Computing Machinery,
2024. https://doi.org/10.1145/3656462.
ieee: K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Equivalence and
similarity refutation for probabilistic programs,” Proceedings of the ACM on
Programming Languages, vol. 8. Association for Computing Machinery, 2024.
ista: Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2024. Equivalence and similarity
refutation for probabilistic programs. Proceedings of the ACM on Programming Languages.
8, 232.
mla: Chatterjee, Krishnendu, et al. “Equivalence and Similarity Refutation for Probabilistic
Programs.” Proceedings of the ACM on Programming Languages, vol. 8, 232,
Association for Computing Machinery, 2024, doi:10.1145/3656462.
short: K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, Proceedings of the
ACM on Programming Languages 8 (2024).
corr_author: '1'
date_created: 2024-07-21T22:01:01Z
date_published: 2024-06-20T00:00:00Z
date_updated: 2025-04-14T07:52:47Z
day: '20'
ddc:
- '000'
department:
- _id: KrCh
- _id: GradSch
doi: 10.1145/3656462
ec_funded: 1
external_id:
arxiv:
- '2404.03430'
file:
- access_level: open_access
checksum: 8cbf220f284a4a87d093db5320c5afdd
content_type: application/pdf
creator: dernst
date_created: 2024-07-22T07:17:14Z
date_updated: 2024-07-22T07:17:14Z
file_id: '17290'
file_name: 2024_ACMProgLang_Chatterjee.pdf
file_size: 355421
relation: main_file
success: 1
file_date_updated: 2024-07-22T07:17:14Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Equivalence and similarity refutation for probabilistic programs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2024'
...
---
_id: '17344'
abstract:
- lang: eng
text: 'This file contains the Mathematica notebook associated with the paper Effect
of assortative mating and sexual selection on polygenic barriers to gene flow.
It contains the numerical approximations, analyses, and simulations used in the
study. '
acknowledged_ssus:
- _id: ScienComp
article_processing_charge: No
author:
- first_name: Parvathy
full_name: Surendranadh, Parvathy
id: 455235B8-F248-11E8-B48F-1D18A9856A87
last_name: Surendranadh
orcid: 0000-0001-6395-386X
- first_name: Himani
full_name: Sachdeva, Himani
last_name: Sachdeva
citation:
ama: Surendranadh P, Sachdeva H. Mathematica notebook for “Effect of assortative
mating and sexual selection on polygenic barriers to gene flow.” 2024. doi:10.15479/AT:ISTA:17344
apa: Surendranadh, P., & Sachdeva, H. (2024). Mathematica notebook for “Effect
of assortative mating and sexual selection on polygenic barriers to gene flow.”
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:17344
chicago: Surendranadh, Parvathy, and Himani Sachdeva. “Mathematica Notebook for
‘Effect of Assortative Mating and Sexual Selection on Polygenic Barriers to Gene
Flow.’” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/AT:ISTA:17344.
ieee: P. Surendranadh and H. Sachdeva, “Mathematica notebook for ‘Effect of assortative
mating and sexual selection on polygenic barriers to gene flow.’” Institute of
Science and Technology Austria, 2024.
ista: Surendranadh P, Sachdeva H. 2024. Mathematica notebook for ‘Effect of assortative
mating and sexual selection on polygenic barriers to gene flow’, Institute of
Science and Technology Austria, 10.15479/AT:ISTA:17344.
mla: Surendranadh, Parvathy, and Himani Sachdeva. Mathematica Notebook for “Effect
of Assortative Mating and Sexual Selection on Polygenic Barriers to Gene Flow.”
Institute of Science and Technology Austria, 2024, doi:10.15479/AT:ISTA:17344.
short: P. Surendranadh, H. Sachdeva, (2024).
date_created: 2024-07-29T14:01:43Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-01-14T13:02:59Z
ddc:
- '576'
department:
- _id: GradSch
- _id: NiBa
doi: 10.15479/AT:ISTA:17344
file:
- access_level: open_access
checksum: 75bdbc7ad7cc6afe4459bc4a8824a302
content_type: application/octet-stream
creator: psurendr
date_created: 2024-07-29T13:51:11Z
date_updated: 2024-07-29T13:51:11Z
file_id: '17345'
file_name: Submission.nb
file_size: 726132
relation: main_file
success: 1
file_date_updated: 2024-07-29T13:51:11Z
has_accepted_license: '1'
month: '07'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Mathematica notebook for 'Effect of assortative mating and sexual selection
on polygenic barriers to gene flow'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
_id: '17488'
abstract:
- lang: eng
text: Behavioural data for Pokusaeva, Satapathy et al. Relevant information can
be found in the 'README.txt' file.
acknowledged_ssus:
- _id: M-Shop
article_processing_charge: No
author:
- first_name: Roshan K
full_name: Satapathy, Roshan K
id: 46046B7A-F248-11E8-B48F-1D18A9856A87
last_name: Satapathy
orcid: 0009-0006-2974-5075
- first_name: Maximilian A
full_name: Jösch, Maximilian A
id: 2BD278E6-F248-11E8-B48F-1D18A9856A87
last_name: Jösch
orcid: 0000-0002-3937-1330
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
orcid: 0000-0003-2012-9947
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
citation:
ama: Satapathy RK, Jösch MA, Symonova O, Pokusaeva V. Bilateral interactions of
optic-flow sensitive neurons coordinate course control in flies. 2024. doi:10.15479/AT:ISTA:17488
apa: Satapathy, R. K., Jösch, M. A., Symonova, O., & Pokusaeva, V. (2024). Bilateral
interactions of optic-flow sensitive neurons coordinate course control in flies.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:17488
chicago: Satapathy, Roshan K, Maximilian A Jösch, Olga Symonova, and Victoria Pokusaeva.
“Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control
in Flies.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/AT:ISTA:17488.
ieee: R. K. Satapathy, M. A. Jösch, O. Symonova, and V. Pokusaeva, “Bilateral interactions
of optic-flow sensitive neurons coordinate course control in flies.” Institute
of Science and Technology Austria, 2024.
ista: Satapathy RK, Jösch MA, Symonova O, Pokusaeva V. 2024. Bilateral interactions
of optic-flow sensitive neurons coordinate course control in flies, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:17488.
mla: Satapathy, Roshan K., et al. Bilateral Interactions of Optic-Flow Sensitive
Neurons Coordinate Course Control in Flies. Institute of Science and Technology
Austria, 2024, doi:10.15479/AT:ISTA:17488.
short: R.K. Satapathy, M.A. Jösch, O. Symonova, V. Pokusaeva, (2024).
corr_author: '1'
date_created: 2024-09-03T17:42:46Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-09-08T14:24:24Z
ddc:
- '570'
department:
- _id: GradSch
- _id: MaJö
doi: 10.15479/AT:ISTA:17488
file:
- access_level: open_access
checksum: df9d6c8ddffa046c3b1639281f83cfcf
content_type: application/x-zip-compressed
creator: rsatapat
date_created: 2024-09-03T17:39:32Z
date_updated: 2024-09-03T17:39:32Z
file_id: '17489'
file_name: BehaviouralData.zip
file_size: 965778072
relation: main_file
success: 1
file_date_updated: 2024-09-03T17:39:32Z
has_accepted_license: '1'
keyword:
- drosophila
- behaviour
- locomotion
- gap junctions
month: '09'
oa: 1
oa_version: None
project:
- _id: 9B767A34-BA93-11EA-9121-9846C619BF3A
grant_number: '429960716'
name: Evolution of Sensorimotor Transformation Across Diptera
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '18444'
relation: used_in_publication
status: public
status: public
title: Bilateral interactions of optic-flow sensitive neurons coordinate course control
in flies
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
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '20071'
abstract:
- lang: eng
text: Farkas established that a system of linear inequalities has a solution if
and only if we cannot obtain a contradiction by taking a linear combination of
the inequalities. We state and formally prove several Farkas-like theorems over
linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the
case when some coefficients are allowed to take "infinite values".
acknowledgement: We would like to thank David Bartl and Jasmin Blanchette for frequent
consultations. We would also like to express gratitude to Andrew Yang for the proof
of Finset.univ sum of zero when not and to Henrik B¨oving for a help with generalization
from extended rationals to extended linearly ordered fields. We would also like
to acknowledge Antoine Chambert-Loir, Apurva Nakade, Ya¨el Dillies, Richard Copley,
Edward van de Meent, Markus Himmel, Mario Carneiro, and Kevin Buzzard.
article_number: '2409.08119'
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Dvorak, Martin
id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425
last_name: Dvorak
orcid: 0000-0001-5293-214X
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions
-- formally verified. arXiv. doi:10.48550/arXiv.2409.08119
apa: Dvorak, M., & Kolmogorov, V. (n.d.). Duality theory in linear optimization
and its extensions -- formally verified. arXiv. https://doi.org/10.48550/arXiv.2409.08119
chicago: Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization
and Its Extensions -- Formally Verified.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2409.08119.
ieee: M. Dvorak and V. Kolmogorov, “Duality theory in linear optimization and its
extensions -- formally verified,” arXiv. .
ista: Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions
-- formally verified. arXiv, 2409.08119.
mla: Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization
and Its Extensions -- Formally Verified.” ArXiv, 2409.08119, doi:10.48550/arXiv.2409.08119.
short: M. Dvorak, V. Kolmogorov, ArXiv (n.d.).
corr_author: '1'
date_created: 2025-07-23T11:21:52Z
date_published: 2024-09-12T00:00:00Z
date_updated: 2026-03-27T12:36:59Z
day: '12'
department:
- _id: GradSch
- _id: VlKo
doi: 10.48550/arXiv.2409.08119
external_id:
arxiv:
- '2409.08119'
keyword:
- Farkas lemma
- linear programming
- extended reals
- calculus of inductive constructions
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2409.08119
month: '09'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
link:
- description: full version of all definitions, statement, and proofs
relation: software
url: https://github.com/madvorak/duality/tree/v3.2
record:
- id: '21393'
relation: dissertation_contains
status: public
status: public
title: Duality theory in linear optimization and its extensions -- formally verified
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2024'
...
---
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-04-07T11:49:51Z
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'
...
---
OA_place: repository
_id: '18874'
abstract:
- lang: eng
text: "Despite extensive research since the community learned about adversarial\r\nexamples
10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that
are guaranteed to be robust to small perturbations of their\r\ninputs. Previous
works often argued that this might be because no classifier\r\nexists that is
robust and accurate at the same time. However, in computer\r\nvision this assumption
does not match reality where humans are usually accurate\r\nand robust on most
tasks of interest. We offer an alternative explanation and\r\nshow that in certain
settings robust generalization is only possible with\r\nunrealistically large
amounts of data. More precisely we find a setting where a\r\nrobust classifier
exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential
amount of data to learn a robust classifier. Based on\r\nthis theoretical result,
we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10.
We come to the conclusion that on this datasets, the\r\nlimitation of current
robust models also lies in the generalization, and that\r\nthey require a lot
of data to do well on the test set. We also show that the\r\nproblem is not in
the expressiveness or generalization capabilities of current\r\narchitectures,
and that there are low magnitude features in the data which are\r\nuseful for
non-robust generalization but are not available for robust\r\nclassifiers."
article_number: '2412.04245'
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. Intriguing properties of robust classification. arXiv.
doi:10.48550/arXiv.2412.04245
apa: Prach, B., & Lampert, C. (n.d.). Intriguing properties of robust classification.
arXiv. https://doi.org/10.48550/arXiv.2412.04245
chicago: Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.2412.04245.
ieee: B. Prach and C. Lampert, “Intriguing properties of robust classification,”
arXiv. .
ista: Prach B, Lampert C. Intriguing properties of robust classification. arXiv,
2412.04245.
mla: Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.”
ArXiv, 2412.04245, doi:10.48550/arXiv.2412.04245.
short: B. Prach, C. Lampert, ArXiv (n.d.).
corr_author: '1'
date_created: 2025-01-24T16:57:29Z
date_published: 2024-12-05T00:00:00Z
date_updated: 2026-04-07T11:49:51Z
day: '05'
department:
- _id: GradSch
- _id: ChLa
doi: 10.48550/arXiv.2412.04245
external_id:
arxiv:
- '2412.04245'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2412.04245
month: '12'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '20455'
relation: later_version
status: public
- id: '19759'
relation: dissertation_contains
status: public
status: public
title: Intriguing properties of robust classification
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '12846'
abstract:
- lang: eng
text: We present a formula for the signed area of a spherical polygon via prequantization.
In contrast to the traditional formula based on the Gauss-Bonnet theorem that
requires measuring angles, the new formula mimics Green's theorem and is applicable
to a wider range of degenerate spherical curves and polygons.
acknowledgement: This work was funded by European Research Council Consolidator grant
101045083 CoDiNA and National Science Foundation CAREER award 2239062. Some figures
in the article were generated by the software Houdini and its education license
was provided by SideFX. The authors acknowledge anonymous referees for their reviews
and insightful suggestions, and Chris Wojtan for his continuous support through
discussions. The second author thanks Anna Sisak for a fruitful discussion on prequantum
bundles.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Albert
full_name: Chern, Albert
last_name: Chern
- first_name: Sadashige
full_name: Ishida, Sadashige
id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425
last_name: Ishida
orcid: 0000-0002-3121-3100
citation:
ama: Chern A, Ishida S. Area formula for spherical polygons via prequantization.
SIAM Journal on Applied Algebra and Geometry. 2024;8(3):782-796. doi:10.1137/23M1565255
apa: Chern, A., & Ishida, S. (2024). Area formula for spherical polygons via
prequantization. SIAM Journal on Applied Algebra and Geometry. Society
for Industrial and Applied Mathematics. https://doi.org/10.1137/23M1565255
chicago: Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons
via Prequantization.” SIAM Journal on Applied Algebra and Geometry. Society
for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/23M1565255.
ieee: A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,”
SIAM Journal on Applied Algebra and Geometry, vol. 8, no. 3. Society for
Industrial and Applied Mathematics, pp. 782–796, 2024.
ista: Chern A, Ishida S. 2024. Area formula for spherical polygons via prequantization.
SIAM Journal on Applied Algebra and Geometry. 8(3), 782–796.
mla: Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via
Prequantization.” SIAM Journal on Applied Algebra and Geometry, vol. 8,
no. 3, Society for Industrial and Applied Mathematics, 2024, pp. 782–96, doi:10.1137/23M1565255.
short: A. Chern, S. Ishida, SIAM Journal on Applied Algebra and Geometry 8 (2024)
782–796.
corr_author: '1'
date_created: 2023-04-18T19:16:06Z
date_published: 2024-09-23T00:00:00Z
date_updated: 2026-04-07T12:02:22Z
day: '23'
ddc:
- '516'
department:
- _id: GradSch
- _id: ChWo
doi: 10.1137/23M1565255
external_id:
arxiv:
- '2303.14555'
isi:
- '001342265800009'
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2303.14555
month: '09'
oa: 1
oa_version: Preprint
page: 782-796
project:
- _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088
grant_number: '101045083'
name: Computational Discovery of Numerical Algorithms for Animation and Simulation
of Natural Phenomena
publication: SIAM Journal on Applied Algebra and Geometry
publication_identifier:
eissn:
- 2470-6566
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '20551'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Area formula for spherical polygons via prequantization
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: 8
year: '2024'
...
---
APC_amount: 2748 EUR
OA_place: publisher
OA_type: hybrid
_id: '17634'
abstract:
- lang: eng
text: System behaviors are traditionally evaluated through binary classifications
of correctness, which do not suffice for properties involving quantitative aspects
of systems and executions. Quantitative automata offer a more nuanced approach,
mapping each execution to a real number by incorporating weighted transitions
and value functions generalizing acceptance conditions. In this paper, we introduce
QuAK, the first tool designed to automate the analysis of quantitative automata.
QuAK currently supports a variety of quantitative automaton types, including Inf,
Sup, LimInf, LimSup, LimInfAvg, and LimSupAvg automata, and implements decision
procedures for problems such as emptiness, universality, inclusion, equivalence,
as well as for checking whether an automaton is safe, live, or constant. Additionally,
QuAK is able to compute extremal values when possible, construct safety-liveness
decompositions, and monitor system behaviors. We demonstrate the effectiveness
of QuAK through experiments focusing on the inclusion, constant-function check,
and monitoring problems.
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093. N.
Mazzocchi was affiliated with ISTA when his collaboration started.
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. QuAK: Quantitative Automata
Kit. In: 12th International Symposium on Leveraging Applications of Formal
Methods, Verification and Validation. Vol 15222. Springer Nature; 2024:3-20.
doi:10.1007/978-3-031-75387-9_1'
apa: 'Chalupa, M., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2024).
QuAK: Quantitative Automata Kit. In 12th International Symposium on Leveraging
Applications of Formal Methods, Verification and Validation (Vol. 15222, pp.
3–20). Crete, Greece: Springer Nature. https://doi.org/10.1007/978-3-031-75387-9_1'
chicago: 'Chalupa, Marek, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci
E Sarac. “QuAK: Quantitative Automata Kit.” In 12th International Symposium
on Leveraging Applications of Formal Methods, Verification and Validation,
15222:3–20. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-75387-9_1.'
ieee: 'M. Chalupa, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “QuAK: Quantitative
Automata Kit,” in 12th International Symposium on Leveraging Applications of
Formal Methods, Verification and Validation, Crete, Greece, 2024, vol. 15222,
pp. 3–20.'
ista: 'Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. 2024. QuAK: Quantitative
Automata Kit. 12th International Symposium on Leveraging Applications of Formal
Methods, Verification and Validation. ISoLA: International Symposium on Leveraging
Applications, LNCS, vol. 15222, 3–20.'
mla: 'Chalupa, Marek, et al. “QuAK: Quantitative Automata Kit.” 12th International
Symposium on Leveraging Applications of Formal Methods, Verification and Validation,
vol. 15222, Springer Nature, 2024, pp. 3–20, doi:10.1007/978-3-031-75387-9_1.'
short: M. Chalupa, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 12th International
Symposium on Leveraging Applications of Formal Methods, Verification and Validation,
Springer Nature, 2024, pp. 3–20.
conference:
end_date: 2024-10-31
location: Crete, Greece
name: 'ISoLA: International Symposium on Leveraging Applications'
start_date: 2024-10-27
corr_author: '1'
date_created: 2024-09-05T14:27:08Z
date_published: 2024-10-26T00:00:00Z
date_updated: 2026-04-07T12:02:57Z
day: '26'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1007/978-3-031-75387-9_1
ec_funded: 1
external_id:
arxiv:
- '2409.03569'
isi:
- '001419008700001'
file:
- access_level: open_access
checksum: 43e432f82be376434b358f3dd7a94b71
content_type: application/pdf
creator: esarac
date_created: 2024-09-05T14:26:02Z
date_updated: 2024-09-05T14:26:02Z
file_id: '17635'
file_name: isola24.pdf
file_size: 847422
relation: main_file
success: 1
- access_level: open_access
checksum: 6bc04f07bb5612c0e7ea00ac121a69b6
content_type: application/pdf
creator: dernst
date_created: 2025-01-21T14:39:49Z
date_updated: 2025-01-21T14:39:49Z
file_id: '18865'
file_name: 2024_LNCS_Chalupa.pdf
file_size: 1358706
relation: main_file
success: 1
file_date_updated: 2025-01-21T14:39:49Z
has_accepted_license: '1'
intvolume: ' 15222'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 3-20
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 12th International Symposium on Leveraging Applications of Formal Methods,
Verification and Validation
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031753862'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '20147'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'QuAK: Quantitative Automata Kit'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 15222
year: '2024'
...
---
_id: '14687'
abstract:
- lang: eng
text: The short history of research on Li-O2 batteries has seen a remarkable number
of mechanistic U-turns over the years. From the initial use of carbonate electrolytes,
that were then found to be entirely unsuitable, to the belief that (su)peroxide
was solely responsible for degradation, before the more reactive singlet oxygen
was found to form, to the hypothesis that capacity depends on a competing surface/solution
mechanism before a practically exclusive solution mechanism was identified. Herein,
we argue for an ever-fresh look at the reported data without bias towards supposedly
established explanations. We explain how the latest findings on rate and capacity
limits, as well as the origin of side reactions, are connected via the disproportionation
(DISP) step in the (dis)charge mechanism. Therefrom, directions emerge for the
design of electrolytes and mediators on how to suppress side reactions and to
enable high rate and high reversible capacity.
acknowledgement: S.A.F. is indebted to ISTA for support. R.B.J. thanks the European
Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
grant agreement No 101034413 for funding. B.P. thanks Alistore ERI for providing
a PhD scholarship.
article_number: e202316476
article_processing_charge: Yes (via OA deal)
article_type: review
author:
- first_name: Rajesh B
full_name: Jethwa, Rajesh B
id: 4cc538d5-803f-11ed-ab7e-8139573aad8f
last_name: Jethwa
orcid: 0000-0002-0404-4356
- first_name: Soumyadip
full_name: Mondal, Soumyadip
id: d25d21ef-dc8d-11ea-abe3-ec4576307f48
last_name: Mondal
- first_name: Bhargavi
full_name: Pant, Bhargavi
id: 50c64d4d-eb97-11eb-a6c2-d33e5e14f112
last_name: Pant
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Jethwa RB, Mondal S, Pant B, Freunberger SA. To DISP or not? The far‐reaching
reaction mechanisms underpinning Lithium‐air batteries. Angewandte Chemie International
Edition. 2024;63(28). doi:10.1002/anie.202316476
apa: Jethwa, R. B., Mondal, S., Pant, B., & Freunberger, S. A. (2024). To DISP
or not? The far‐reaching reaction mechanisms underpinning Lithium‐air batteries.
Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.202316476
chicago: Jethwa, Rajesh B, Soumyadip Mondal, Bhargavi Pant, and Stefan Alexander
Freunberger. “To DISP or Not? The Far‐reaching Reaction Mechanisms Underpinning
Lithium‐air Batteries.” Angewandte Chemie International Edition. Wiley,
2024. https://doi.org/10.1002/anie.202316476.
ieee: R. B. Jethwa, S. Mondal, B. Pant, and S. A. Freunberger, “To DISP or not?
The far‐reaching reaction mechanisms underpinning Lithium‐air batteries,” Angewandte
Chemie International Edition, vol. 63, no. 28. Wiley, 2024.
ista: Jethwa RB, Mondal S, Pant B, Freunberger SA. 2024. To DISP or not? The far‐reaching
reaction mechanisms underpinning Lithium‐air batteries. Angewandte Chemie International
Edition. 63(28), e202316476.
mla: Jethwa, Rajesh B., et al. “To DISP or Not? The Far‐reaching Reaction Mechanisms
Underpinning Lithium‐air Batteries.” Angewandte Chemie International Edition,
vol. 63, no. 28, e202316476, Wiley, 2024, doi:10.1002/anie.202316476.
short: R.B. Jethwa, S. Mondal, B. Pant, S.A. Freunberger, Angewandte Chemie International
Edition 63 (2024).
corr_author: '1'
date_created: 2023-12-15T16:10:13Z
date_published: 2024-07-08T00:00:00Z
date_updated: 2026-04-07T12:27:23Z
day: '08'
ddc:
- '540'
department:
- _id: StFr
- _id: GradSch
doi: 10.1002/anie.202316476
ec_funded: 1
external_id:
isi:
- '001241932700001'
pmid:
- '38095355'
file:
- access_level: open_access
checksum: fe2c23454279eb9d76ed6ca9970c21c7
content_type: application/pdf
creator: dernst
date_created: 2024-07-16T11:54:46Z
date_updated: 2024-07-16T11:54:46Z
file_id: '17261'
file_name: 2024_AngChemieInt_Jethwa.pdf
file_size: 4766445
relation: main_file
success: 1
file_date_updated: 2024-07-16T11:54:46Z
has_accepted_license: '1'
intvolume: ' 63'
isi: 1
issue: '28'
keyword:
- General Chemistry
- Catalysis
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '20607'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: To DISP or not? The far‐reaching reaction mechanisms underpinning Lithium‐air
batteries
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 63
year: '2024'
...
---
OA_type: closed access
_id: '18266'
abstract:
- lang: eng
text: Matrix games are the most basic model in game theory, and yet robustness with
respect to small perturbations of the matrix entries is not fully understood.
In this paper, we introduce value positivity and uniform value positivity, two
properties that refine the notion of optimality in the context of polynomially
perturbed matrix games. The first concept captures how the value depends on the
perturbation parameter, and the second consists of the existence of a fixed strategy
that guarantees the value of the unperturbed matrix game for every sufficiently
small positive parameter. We provide polynomial-time algorithms to check whether
a polynomially perturbed matrix game satisfies these properties. We further provide
the functional form for a parameterized optimal strategy and the value function.
Finally, we translate our results to linear programming and stochastic games,
where value positivity is related to the existence of robust solutions.
acknowledgement: This research was supported by Fondation CFM pour la Recherche, the
H2020 European Research Council [Grant ERC-CoG-863818 (ForM-SMArt)], the Austrian
Science Fund [Grant 10.55776/COE12], ANID Chile [Grant ACT210005], and Agence Nationale
de la Recherche [Grant ANR-21-CE40-0020].
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Miquel
full_name: Oliu-Barton, Miquel
last_name: Oliu-Barton
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
citation:
ama: Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. Value-positivity for matrix
games. Mathematics of Operations Research. 2024;50(4):2433-3282. doi:10.1287/moor.2022.0332
apa: Chatterjee, K., Oliu-Barton, M., & Saona Urmeneta, R. J. (2024). Value-positivity
for matrix games. Mathematics of Operations Research. Institute for Operations
Research and the Management Sciences. https://doi.org/10.1287/moor.2022.0332
chicago: Chatterjee, Krishnendu, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta.
“Value-Positivity for Matrix Games.” Mathematics of Operations Research.
Institute for Operations Research and the Management Sciences, 2024. https://doi.org/10.1287/moor.2022.0332.
ieee: K. Chatterjee, M. Oliu-Barton, and R. J. Saona Urmeneta, “Value-positivity
for matrix games,” Mathematics of Operations Research, vol. 50, no. 4.
Institute for Operations Research and the Management Sciences, pp. 2433–3282,
2024.
ista: Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. 2024. Value-positivity for
matrix games. Mathematics of Operations Research. 50(4), 2433–3282.
mla: Chatterjee, Krishnendu, et al. “Value-Positivity for Matrix Games.” Mathematics
of Operations Research, vol. 50, no. 4, Institute for Operations Research
and the Management Sciences, 2024, pp. 2433–3282, doi:10.1287/moor.2022.0332.
short: K. Chatterjee, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations
Research 50 (2024) 2433–3282.
corr_author: '1'
date_created: 2024-10-09T07:02:20Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2026-04-07T12:31:21Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1287/moor.2022.0332
ec_funded: 1
external_id:
isi:
- '001328875900001'
intvolume: ' 50'
isi: 1
issue: '4'
language:
- iso: eng
month: '10'
oa_version: None
page: 2433-3282
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Mathematics of Operations Research
publication_identifier:
eissn:
- 1526-5471
issn:
- 0364-765X
publication_status: published
publisher: Institute for Operations Research and the Management Sciences
quality_controlled: '1'
related_material:
record:
- id: '20234'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Value-positivity for matrix games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2024'
...
---
OA_place: publisher
_id: '18588'
abstract:
- lang: eng
text: "This thesis is an experimental work about two distinct research projects
that evolved from a single project: non-equilibrium dynamics of an acoustically
vibrated particle and microfabrication of particles with nano-scale 3D printing.
The first project explores non equilibrium dynamics of a particle driven by ultrasonic
vibrations. We design an experimental system consisting of an electromechanical
vibration scheme to drive the particle’s vibrations and an imaging scheme to track
its trajectories. We study the trajectories to determine how the particle’s dynamics
evolve under the driven conditions, considering out of equilibrium systems in
the context of equilibrium statistical mechanics. Using a Langevin framework and
the Boltzmann factor, we characterize the particle’s dynamics as complex; the
particle motion\r\nis not purely diffusive. We extract physical parameters like
spring constant, effective temperature, damping coefficient and resonance frequency.\r\n\r\nIn
the second project, we explore and develop techniques in the design and microfabrication
of particles across scales. Microfabrication involves building structures at the
micron or submicron scale. These designed miniaturized patterns, objects, or devices
are useful in biophysics, pharmacology, medical biology, and nanotechnology. We
specifically apply two-photon polymerization, a form of 3D nano printing. We print
millimetric particles, characterizing different designs to evaluate and showcase
the resolution, aspect ratio integrity and print quality of the printing process.
We also design and fabricate a microsensor to deflect under applicable force of
order 0.1 pN. We present fundamental concepts needed to design the microsensor,
showcasing 3D printing at considerably smaller scales down to the µm or below."
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
acknowledgement: "I would like to acknowledge Scott Waitukaitis and Jérémie Palacci,
for their supervision, and their extensive support of my learning. \r\n\r\nFor the
beautiful characterization images used in this work, I would like to thank Dr. Daniel
Grober, Samuel Hajek and Felix Pertl.\r\n\r\nThe Palacci group, particularly Malina
Strugaru and Dan Grober, for their continuous guidance in decoding and following
my streams of thought.\r\n\r\nTo the Waitukaitis group, for helping me find my footing
in science, and making me feel at\r\nhome.\r\n\r\nTo the Nanofabrication Facility
(NFF) at ISTA, for training me in significant aspects of my research. The MIBA Facility,
and particularly Todor Asenov for consistently picking up the phone for my machining
and designing needs.\r\n\r\nTo my friends, Mariana, Lenka, Aaron, Rebecca, Eavan
who provided an ear, wine, and a lot more when I needed to vent, talk through my
crises as well as experiment. For the walks, for the coffees, for reading through
my work and providing edits, for dinners to take me out of blocks and binds and
for cheering me on when it felt insurmountable. \r\n\r\nFinally, I am grateful to
Griff and Fletcher, whose music helped me through several blocks, especially with
my writing.\r\n\r\nMy science would not have been possible without the guidance,
support and contributions of\r\nall these people, and more."
alternative_title:
- ISTA Master's Thesis
article_processing_charge: No
author:
- first_name: Cecelia N
full_name: Mweka, Cecelia N
id: 2a69ab4b-896a-11ed-bdf8-cb8641cf2b21
last_name: Mweka
citation:
ama: Mweka CN. Non equilibrium dynamics of driven individual particles and 3D printing
across scales. 2024. doi:10.15479/at:ista:18588
apa: Mweka, C. N. (2024). Non equilibrium dynamics of driven individual particles
and 3D printing across scales. Institute of Science and Technology Austria.
https://doi.org/10.15479/at:ista:18588
chicago: Mweka, Cecelia N. “Non Equilibrium Dynamics of Driven Individual Particles
and 3D Printing across Scales.” Institute of Science and Technology Austria, 2024.
https://doi.org/10.15479/at:ista:18588.
ieee: C. N. Mweka, “Non equilibrium dynamics of driven individual particles and
3D printing across scales,” Institute of Science and Technology Austria, 2024.
ista: Mweka CN. 2024. Non equilibrium dynamics of driven individual particles and
3D printing across scales. Institute of Science and Technology Austria.
mla: Mweka, Cecelia N. Non Equilibrium Dynamics of Driven Individual Particles
and 3D Printing across Scales. Institute of Science and Technology Austria,
2024, doi:10.15479/at:ista:18588.
short: C.N. Mweka, Non Equilibrium Dynamics of Driven Individual Particles and 3D
Printing across Scales, Institute of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-11-27T09:12:02Z
date_published: 2024-11-29T00:00:00Z
date_updated: 2026-04-07T12:42:13Z
day: '29'
ddc:
- '530'
degree_awarded: MS
department:
- _id: GradSch
doi: 10.15479/at:ista:18588
file:
- access_level: open_access
checksum: 054ed7a5e5ae6e7220e6bb37ea57a3c3
content_type: application/pdf
creator: cmweka
date_created: 2024-11-28T12:50:32Z
date_updated: 2024-11-28T12:50:32Z
file_id: '18597'
file_name: Cecelia Mweka Master Thesis.pdf
file_size: 3836671
relation: main_file
success: 1
- access_level: closed
checksum: 7d7d9299f090d83e628d65d93116e8c2
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cmweka
date_created: 2024-11-28T12:51:43Z
date_updated: 2024-12-13T11:30:53Z
file_id: '18598'
file_name: Cecelia Mweka Master Thesis.docx
file_size: 7068210
relation: source_file
file_date_updated: 2024-12-13T11:30:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '61'
publication_identifier:
issn:
- 2791-4585
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Jérémie A
full_name: Palacci, Jérémie A
id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d
last_name: Palacci
orcid: 0000-0002-7253-9465
title: Non equilibrium dynamics of driven individual particles and 3D printing across
scales
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
OA_place: publisher
_id: '17225'
abstract:
- lang: eng
text: "This thesis describes the development of an atom interferometer designed
to exploit the\r\nadvantages of utilizing quantum entanglement for enhanced precision
measurements beyond\r\nthe standard quantum limit. While the project remains ongoing,
significant progress has been\r\nmade.\r\nA key contribution of this work is the
development of Quantrol, an experimental control\r\nsystem leveraging the ARTIQ
framework. This software enables precise timing and control\r\nwithout requiring
prior knowledge of ARTIQ’s implementation details or coding experience.\r\nThe
interface offers user friendly visual comprehension of the experimental sequence
and\r\nextended capabilities, allowing researchers to scan variables with a simple
click of a mouse.\r\nThe main proposed project is to implement atom interferometric
sequence with squeezed input\r\nstates inside of a dipole trap generated by a
high finesse cavity. The presence of the dipole\r\ntrap allows one dimensional
atomic cloud split while maintaining relatively strong confinement\r\nin other
directions.\r\nWe are currently able to trap and cool 87Rb atoms to few micro
kelvin temperatures, load\r\nthem into the dipole trap and state prepare them
to be used for squeezing and interferometric\r\nsequence."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Vyacheslav
full_name: Li, Vyacheslav
id: 3A4FAA92-F248-11E8-B48F-1D18A9856A87
last_name: Li
citation:
ama: Li V. Towards a quantum entanglement enhanced atom interferomter. 2024. doi:10.15479/at:ista:17225
apa: Li, V. (2024). Towards a quantum entanglement enhanced atom interferomter.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17225
chicago: Li, Vyacheslav. “Towards a Quantum Entanglement Enhanced Atom Interferomter.”
Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17225.
ieee: V. Li, “Towards a quantum entanglement enhanced atom interferomter,” Institute
of Science and Technology Austria, 2024.
ista: Li V. 2024. Towards a quantum entanglement enhanced atom interferomter. Institute
of Science and Technology Austria.
mla: Li, Vyacheslav. Towards a Quantum Entanglement Enhanced Atom Interferomter.
Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17225.
short: V. Li, Towards a Quantum Entanglement Enhanced Atom Interferomter, Institute
of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-07-11T09:46:48Z
date_published: 2024-07-11T00:00:00Z
date_updated: 2026-04-07T12:42:28Z
day: '11'
ddc:
- '530'
degree_awarded: PhD
department:
- _id: GradSch
- _id: OnHo
doi: 10.15479/at:ista:17225
file:
- access_level: open_access
checksum: 15b2dbe8d2c9ed7ca5dd413827928077
content_type: application/pdf
creator: vli
date_created: 2024-07-11T10:26:22Z
date_updated: 2024-07-11T10:26:22Z
file_id: '17228'
file_name: PhD_Thesis_Vyacheslav_Li_no_signatures_PDFA.pdf
file_size: 6729761
relation: main_file
success: 1
- access_level: closed
checksum: 16e904a11d8d0ebb167cb654ddfc7fe5
content_type: application/x-zip-compressed
creator: vli
date_created: 2024-07-11T10:26:22Z
date_updated: 2024-07-11T10:26:22Z
file_id: '17229'
file_name: PhD Thesis Vyacheslav Li.zip
file_size: 9542859
relation: source_file
file_date_updated: 2024-07-11T10:26:22Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: '79'
project:
- _id: bdb2a702-d553-11ed-ba76-f12e3e5a3bc6
grant_number: '101087907'
name: 'A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational
quantum mechanics'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '11438'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
title: Towards a quantum entanglement enhanced atom interferomter
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
OA_place: publisher
OA_type: free access
_id: '18443'
abstract:
- lang: eng
text: "In [KW06] Kapustin and Witten conjectured that there is a mirror symmetry
relation between\r\nthe hyperkähler structures on certain Higgs bundle moduli
spaces. As a consequence, they\r\nconjecture an equivalence between categories
of BBB and BAA-branes. At the classical\r\nlevel, this mirror symmetry is given
by T-duality between semi-flat hyperkähler structures on\r\nalgebraic integrable
systems.\r\nIn this thesis, we investigate the T-duality relation between hyperkähler
structures and the\r\ncorresponding branes on affine torus bundles. We use the
techniques of generalized geometry\r\nto show that semi-flat hyperkähler structures
are T-dual on algebraic integrable systems.\r\nWe also describe T-duality for
generalized branes. Motivated by Fourier-Mukai transform\r\nwe upgrade the T-duality
between generalized branes to T-duality of submanifolds endowed\r\nwith U(1)-bundles
and connections. This T-duality in the appropriate context specializes to\r\nT-duality
between BBB and BAA-branes.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Maria A
full_name: Sisak, Maria A
id: 44A03D04-AEA4-11E9-B225-EA2DE6697425
last_name: Sisak
citation:
ama: Sisak MA. T-dual branes on hyperkähler manifolds. 2024. doi:10.15479/at:ista:18443
apa: Sisak, M. A. (2024). T-dual branes on hyperkähler manifolds. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:18443
chicago: Sisak, Maria A. “T-Dual Branes on Hyperkähler Manifolds.” Institute of
Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18443.
ieee: M. A. Sisak, “T-dual branes on hyperkähler manifolds,” Institute of Science
and Technology Austria, 2024.
ista: Sisak MA. 2024. T-dual branes on hyperkähler manifolds. Institute of Science
and Technology Austria.
mla: Sisak, Maria A. T-Dual Branes on Hyperkähler Manifolds. Institute of
Science and Technology Austria, 2024, doi:10.15479/at:ista:18443.
short: M.A. Sisak, T-Dual Branes on Hyperkähler Manifolds, Institute of Science
and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-10-19T12:00:37Z
date_published: 2024-10-24T00:00:00Z
date_updated: 2026-04-07T12:42:44Z
day: '24'
ddc:
- '516'
degree_awarded: PhD
department:
- _id: GradSch
- _id: TaHa
doi: 10.15479/at:ista:18443
file:
- access_level: open_access
checksum: 8c4893e726aaa4b3efb82758da9b6851
content_type: application/pdf
creator: msisak
date_created: 2024-10-23T14:42:45Z
date_updated: 2024-10-23T14:42:45Z
file_id: '18467'
file_name: MASisak_dissertation.pdf
file_size: 1672547
relation: main_file
success: 1
- access_level: closed
checksum: 1831b072e861a1e5481024ca9d02b036
content_type: application/x-zip-compressed
creator: msisak
date_created: 2024-10-23T14:43:56Z
date_updated: 2024-10-24T08:09:13Z
file_id: '18468'
file_name: MASisak_source.zip
file_size: 617913
relation: source_file
file_date_updated: 2024-10-24T08:09:13Z
has_accepted_license: '1'
keyword:
- hyperkaehler geometry
- branes
- mirror symmetry
- T-duality
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '178'
project:
- _id: 6286e8c4-2b32-11ec-9570-f5297902f67f
grant_number: '26069'
name: Branes on hyperkähler manifolds
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Tamás
full_name: Hausel, Tamás
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
orcid: 0000-0002-9582-2634
title: T-dual branes on hyperkähler manifolds
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
OA_place: publisher
_id: '17485'
abstract:
- lang: eng
text: "Large language models (LLMs) have made tremendous progress in the past few
years, from being able to generate coherent text to matching or surpassing humans
in a wide variety of creative, knowledge or reasoning tasks. Much of this can
be attributed to massively increased scale, both in the size of the model as well
as the amount of training data, from 100s of millions to 100s of billions, or
even trillions. This trend is expected to continue, which, although exciting,
also raises major practical concerns. Already today's 100+ billion parameter LLMs
require top-of-the-line hardware just to run. Hence, it is clear that sustaining
these developments will require significant efficiency advances.\r\n\r\nHistorically,
one of the most practical ways of improving model efficiency has been compression,
especially in the form of sparsity or quantization. While this has been studied
extensively in the past, existing accurate methods are all designed for models
around 100 million parameters; scaling them up to ones literally 1000x larger
is highly challenging. In this thesis, we introduce a new unified sparsification
and quantization approach OBC, which through additional algorithmic enhancements
leads to GPTQ and SparseGPT, the first techniques fast and accurate enough to
compress 100+ billion parameter models to 4- or even 3-bit precision and 50% weight-sparsity,
respectively. Additionally, we show how weight-only quantizion does not just bring
space savings but also up to 4.5x faster generation speed, via custom GPU kernels.\r\n\r\nIn
fact, we show for the first time that it is possible to develop an FP16 times
INT4 mixed-precision matrix multiplication kernel, called Marlin, which comes
close to simultaneously maximizing both memory and compute utilization, making
weight-only quantization highly practical even for multi-user serving. Further,
we demonstrate that GPTQ can be scaled to widely overparametrized trillion-parameter
models, where extreme sub-1-bit compression rates can be achieved without any
inference slow-down, by co-designing a bespoke entropy coding scheme together
with an efficient kernel.\r\n\r\nFinally, we also study compression from the perspective
of someone with access to massive amounts of compute resources for training large
models completely from scratch. Here the key questions evolve around the joint
scaling behavior between compression, model size, and amount of training data
used. Based on extensive experimental results for both vision and text models,
we introduce the first scaling law which accurately captures the relationship
between weight-sparsity, number of non-zero weights and data. This further allows
us to characterize the optimal sparsity, which we find to increase the longer
a fixed cost model is being trained.\r\n\r\nOverall, this thesis presents contributions
to three different angles of large model efficiency: affordable but accurate algorithms,
highly efficient systems implementations, and fundamental scaling laws for compressed
training."
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
citation:
ama: 'Frantar E. Compressing large neural networks : Algorithms, systems and scaling
laws. 2024. doi:10.15479/at:ista:17485'
apa: 'Frantar, E. (2024). Compressing large neural networks : Algorithms, systems
and scaling laws. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17485'
chicago: 'Frantar, Elias. “Compressing Large Neural Networks : Algorithms, Systems
and Scaling Laws.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17485.'
ieee: 'E. Frantar, “Compressing large neural networks : Algorithms, systems and
scaling laws,” Institute of Science and Technology Austria, 2024.'
ista: 'Frantar E. 2024. Compressing large neural networks : Algorithms, systems
and scaling laws. Institute of Science and Technology Austria.'
mla: 'Frantar, Elias. Compressing Large Neural Networks : Algorithms, Systems
and Scaling Laws. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17485.'
short: 'E. Frantar, Compressing Large Neural Networks : Algorithms, Systems and
Scaling Laws, Institute of Science and Technology Austria, 2024.'
corr_author: '1'
date_created: 2024-09-02T11:01:48Z
date_published: 2024-09-05T00:00:00Z
date_updated: 2026-04-07T12:43:04Z
day: '05'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: DaAl
doi: 10.15479/at:ista:17485
ec_funded: 1
file:
- access_level: closed
checksum: 5d785645805a78c5b4ce7cc3df557b09
content_type: application/zip
creator: efrantar
date_created: 2024-09-05T12:04:11Z
date_updated: 2024-09-05T12:04:11Z
file_id: '17570'
file_name: thesis-final.zip
file_size: 1615167
relation: source_file
- access_level: open_access
checksum: a9dd1c2d23734986924eb44ebb55fd8f
content_type: application/pdf
creator: efrantar
date_created: 2024-09-06T16:24:59Z
date_updated: 2024-09-06T16:24:59Z
file_id: '17880'
file_name: frantar_thesis_final.pdf
file_size: 2376611
relation: main_file
success: 1
file_date_updated: 2024-09-06T16:24:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '129'
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '18062'
relation: part_of_dissertation
status: public
- id: '18061'
relation: part_of_dissertation
status: public
- id: '17378'
relation: part_of_dissertation
status: public
- id: '17087'
relation: part_of_dissertation
status: public
- id: '14458'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
title: 'Compressing large neural networks : Algorithms, systems and scaling laws'
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...