---
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: 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-06-18T17:58:39Z
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: '17378'
relation: part_of_dissertation
status: public
- id: '17087'
relation: part_of_dissertation
status: public
- id: '14458'
relation: part_of_dissertation
status: public
- id: '18061'
relation: part_of_dissertation
status: public
- id: '18062'
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'
...
---
_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: 2026-06-10T07:58:35Z
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: Published Version
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: 68b8ca59-c5b3-11ee-8790-cd641c68093d
year: '2024'
...
---
OA_place: publisher
_id: '17490'
abstract:
- lang: eng
text: "Deep learning is essential in numerous applications nowadays, with many recent
advancements made possible by training very large models. Despite their broad
applicability, training neural networks is often time-intensive, and it is usually
impractical to manage large models and datasets on a single machine. To address
these issues, distributed deep learning training has become increasingly important.
However, distributed training requires synchronization among nodes, and the mini-batch
stochastic gradient descent algorithm places a significant load on network connections.
A possible solution to tackle the synchronization bottleneck is to reduce a message
size by lossy compression.\r\n\r\nIn this thesis, we investigate systems and algorithmic
approaches to communication compression during training. From the systems perspective,
we demonstrate that a common approach of expensive hardware overprovisioning can
be replaced through a thorough system design. We introduce a framework that introduces
efficient software support for compressed communication in machine learning applications,
applicable to both multi-GPU single-node training and larger-scale multi-node
training. Our framework integrates with popular ML frameworks, providing up to
3x speedups for multi-GPU nodes based on commodity hardware and order-of-magnitude
improvements in the multi-node setting, with negligible impact on accuracy.\r\n\r\nAlso,
we consider an application of our framework to different communication schemes,
such as Fully Sharded Data Parallel. We provide strong convergence guarantees
for the compression in such a setup. Empirical validation shows that our method
preserves model accuracy for GPT-family models with up to 1.3 billion parameters,
while completely removing the communication bottlenecks of non-compressed alternatives,
providing up to 2.2x speedups end-to-end.\r\n\r\nFrom the algorithmic side, we
propose a general framework that dynamically adjusts the degree of compression
across a model's layers during training. This approach enhances overall compression
and results in significant speedups without compromising accuracy. Our algorithm
utilizes an adaptive algorithm that automatically selects the optimal compression
parameters for model layers, ensuring the best compression ratio while adhering
to an error constraint. Our method is effective across all existing families of
compression methods. It achieves up to 2.5x faster training and up to a 5x improvement
in compression compared to efficient implementations of current approaches. Additionally,
LGreCo can complement existing adaptive algorithms.\r\n"
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
citation:
ama: 'Markov I. Communication-efficient distributed training of deep neural networks :
An algorithms and systems perspective. 2024. doi:10.15479/at:ista:17490'
apa: 'Markov, I. (2024). Communication-efficient distributed training of deep
neural networks : An algorithms and systems perspective. Institute of Science
and Technology Austria. https://doi.org/10.15479/at:ista:17490'
chicago: 'Markov, Ilia. “Communication-Efficient Distributed Training of Deep Neural
Networks : An Algorithms and Systems Perspective.” Institute of Science and Technology
Austria, 2024. https://doi.org/10.15479/at:ista:17490.'
ieee: 'I. Markov, “Communication-efficient distributed training of deep neural networks :
An algorithms and systems perspective,” Institute of Science and Technology Austria,
2024.'
ista: 'Markov I. 2024. Communication-efficient distributed training of deep neural
networks : An algorithms and systems perspective. Institute of Science and Technology
Austria.'
mla: 'Markov, Ilia. Communication-Efficient Distributed Training of Deep Neural
Networks : An Algorithms and Systems Perspective. Institute of Science and
Technology Austria, 2024, doi:10.15479/at:ista:17490.'
short: 'I. Markov, Communication-Efficient Distributed Training of Deep Neural Networks :
An Algorithms and Systems Perspective, Institute of Science and Technology Austria,
2024.'
corr_author: '1'
date_created: 2024-09-04T08:51:11Z
date_published: 2024-09-04T00:00:00Z
date_updated: 2026-06-18T17:55:23Z
day: '04'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: DaAl
doi: 10.15479/at:ista:17490
ec_funded: 1
file:
- access_level: closed
checksum: 77609f4835d2730e46fa0d42d9134ed9
content_type: application/x-zip-compressed
creator: imarkov
date_created: 2024-09-04T08:35:35Z
date_updated: 2024-09-04T08:35:35Z
file_id: '17491'
file_name: Thesis.zip
file_size: 43327753
relation: source_file
- access_level: open_access
checksum: 9e68f7217570f756ceb8f70b980938cd
content_type: application/pdf
creator: imarkov
date_created: 2024-09-04T08:36:06Z
date_updated: 2024-09-04T08:36:06Z
file_id: '17492'
file_name: Thesis_final_version_pdfa2.pdf
file_size: 2756082
relation: main_file
success: 1
file_date_updated: 2024-09-04T08:36:06Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '102'
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: '14461'
relation: part_of_dissertation
status: public
- id: '12780'
relation: part_of_dissertation
status: public
- id: '17456'
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: 'Communication-efficient distributed training of deep neural networks : An
algorithms and systems perspective'
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'
...
---
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'
...
---
OA_place: publisher
_id: '17850'
abstract:
- lang: eng
text: "Understanding the relationship between a given phenotype and its underlying
genotype or genotypes is one of the most pressing challenges of biology, as it
lies at the heart of not only basic understanding of evolutionary theory, but
also of practical applications in medicine and bioengineering. Understanding this
relationship is complicated by the ubiquitous phenomenon of epistasis, wherein
mutation effects are dependent on their genetic context. Fitness landscapes —
representations of phenotype as a function of genotype — are being increasingly
used as a tool to study the effects and interactions of thousands of mutations,
but are experimentally limited to exploring a small fraction of a protein’s theoretical
sequence space. Furthermore, not all regions of said sequence space are necessarily
equally informative. Thus, gene selection for landscape surveys should be carefully
considered in order to maximize the usable output of necessarily limited data.\r\n\r\nIn
this work, we analyzed the fitness landscapes of orthologous green fluorescent
proteins from four different species, by systematically measuring the phenotype,
fluorescence, of tens of thousands of mutant genotypes from each protein. These
landscapes were highly heterogeneous, with some genes being mutationally robust
and displaying epistasis only rarely, and others being highly epistatic and mutationally
fragile. We used this data to train machine learning models to predict fluorescence
from genotype. Although the training data contained almost exclusively genotypes
with less than 3% sequence divergence from the original wild-type sequences, we
were able to create novel, functional genotypes with up to 20% sequence divergence.
Counterintuitively however, genes with high mutational robustness and rare epistasis
were more difficult to introduce large numbers of mutations into, not less. This
represents the first study of large-scale fitness landscapes of a protein family,
and provides insights into how to approach future landscape surveys and their
applications in novel protein design."
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
- _id: ScienComp
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Louisa
full_name: Gonzalez Somermeyer, Louisa
id: 4720D23C-F248-11E8-B48F-1D18A9856A87
last_name: Gonzalez Somermeyer
orcid: 0000-0001-9139-5383
citation:
ama: Gonzalez Somermeyer L. Fitness landscapes of orthologous green fluorescent
proteins. 2024. doi:10.15479/at:ista:17850
apa: Gonzalez Somermeyer, L. (2024). Fitness landscapes of orthologous green
fluorescent proteins. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17850
chicago: Gonzalez Somermeyer, Louisa. “Fitness Landscapes of Orthologous Green Fluorescent
Proteins.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17850.
ieee: L. Gonzalez Somermeyer, “Fitness landscapes of orthologous green fluorescent
proteins,” Institute of Science and Technology Austria, 2024.
ista: Gonzalez Somermeyer L. 2024. Fitness landscapes of orthologous green fluorescent
proteins. Institute of Science and Technology Austria.
mla: Gonzalez Somermeyer, Louisa. Fitness Landscapes of Orthologous Green Fluorescent
Proteins. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17850.
short: L. Gonzalez Somermeyer, Fitness Landscapes of Orthologous Green Fluorescent
Proteins, Institute of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-09-06T12:57:44Z
date_published: 2024-09-06T00:00:00Z
date_updated: 2026-04-07T13:25:01Z
day: '06'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: FyKo
doi: 10.15479/at:ista:17850
ec_funded: 1
file:
- access_level: open_access
checksum: d3303724e8d3c91321d71bbad4062048
content_type: application/pdf
creator: lgonzale
date_created: 2024-09-27T10:32:33Z
date_updated: 2024-09-27T10:32:33Z
file_id: '18151'
file_name: louisa_thesis_draft__240904b.pdf
file_size: 11219837
relation: main_file
- access_level: closed
checksum: 22e63f7f9014dffde2af7a47e7d1d014
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: lgonzale
date_created: 2024-09-27T10:34:34Z
date_updated: 2024-09-27T10:34:34Z
file_id: '18152'
file_name: louisa_thesis_draft__240904b.docx
file_size: 43338677
relation: source_file
file_date_updated: 2024-09-27T10:34:34Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '89'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 26580278-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '771209'
name: Characterizing the fitness landscape on population and global scales
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
link:
- relation: software
url: https://github.com/aequorea238/Orthologous_GFP_Fitness_Peaks
record:
- id: '11448'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
title: Fitness landscapes of orthologous green fluorescent proteins
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: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18068'
abstract:
- lang: eng
text: "We study the following refinement relation between nondeterministic state-transition
models: model ℬ strategically dominates model \U0001D49C iff every deterministic
refinement of \U0001D49C is language contained in some deterministic refinement
of ℬ. While language containment is trace inclusion, and the (fair) simulation
preorder coincides with tree inclusion, strategic dominance falls strictly between
the two and can be characterized as \"strategy inclusion\" between \U0001D49C
and ℬ: every strategy that resolves the nondeterminism of \U0001D49C is dominated
by a strategy that resolves the nondeterminism of ℬ. Strategic dominance can be
checked in 2-ExpTime by a decidable first-order Presburger logic with quantification
over words and strategies, called resolver logic. We give several other applications
of resolver logic, including checking the co-safety, co-liveness, and history-determinism
of boolean and quantitative automata, and checking the inclusion between hyperproperties
that are specified by nondeterministic boolean and quantitative automata."
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093. N.
Mazzocchi was affiliated with ISTA when this work was submitted for publication.
alternative_title:
- LIPIcs
article_number: '29'
article_processing_charge: Yes
arxiv: 1
author:
- 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: 'Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder
for nondeterministic processes. In: 35th International Conference on Concurrency
Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024.
doi:10.4230/LIPIcs.CONCUR.2024.29'
apa: 'Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2024). Strategic dominance:
A new preorder for nondeterministic processes. In 35th International Conference
on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29'
chicago: 'Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic
Dominance: A New Preorder for Nondeterministic Processes.” In 35th International
Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29.'
ieee: 'T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Strategic dominance:
A new preorder for nondeterministic processes,” in 35th International Conference
on Concurrency Theory, Calgary, Canada, 2024, vol. 311.'
ista: 'Henzinger TA, Mazzocchi NA, Sarac NE. 2024. Strategic dominance: A new preorder
for nondeterministic processes. 35th International Conference on Concurrency Theory.
CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 29.'
mla: 'Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic
Processes.” 35th International Conference on Concurrency Theory, vol. 311,
29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.29.'
short: T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 35th International Conference
on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-09-13
location: Calgary, Canada
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2024-09-09
corr_author: '1'
date_created: 2024-09-15T22:01:40Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-12-02T13:45:38Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: GradSch
doi: 10.4230/LIPIcs.CONCUR.2024.29
ec_funded: 1
external_id:
arxiv:
- '2407.10473'
isi:
- '001556847400029'
file:
- access_level: open_access
checksum: 555bd343e1fb38adeab8fc465ff4fad8
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T07:48:56Z
date_updated: 2024-09-17T07:48:56Z
file_id: '18081'
file_name: 2024_LIPICS_Henzinger.pdf
file_size: 964124
relation: main_file
success: 1
file_date_updated: 2024-09-17T07:48:56Z
has_accepted_license: '1'
intvolume: ' 311'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 35th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959773393'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Strategic dominance: A new preorder for nondeterministic processes'
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: 311
year: '2024'
...
---
OA_place: publisher
_id: '18076'
abstract:
- lang: eng
text: "The new era of Ge has opened up new possibilities in quantum computing. The
maturity of Ge\r\nspin qubits is unquestioned, while hybrid semiconductor-superconductor
Ge circuits are on track\r\nto enter the game. Gate-tunable transmons (gatemons)
employing semiconductor Josephson\r\njunctions have recently emerged as building
blocks for such hybrid quantum circuits. In this\r\nthesis, we present a gatemon
fabricated in planar Germanium. We induce superconductivity\r\nin a two-dimensional
hole gas by evaporating aluminum atop a thin spacer, which separates\r\nthe superconductor
from the Ge quantum well. The Josephson junction is then integrated\r\ninto an
Xmon circuit and capacitively coupled to a transmission line resonator. We showcase\r\nthe
qubit tunability in a broad frequency range with resonator and two-tone spectroscopy.\r\nTime-domain
characterizations reveal energy relaxation and coherence times up to 75 ns. Our\r\nresults,
combined with the recent advances in the spin qubit field, pave the way towards
novel\r\nhybrid and protected qubits in a group IV, CMOS-compatible material."
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Oliver
full_name: Sagi, Oliver
id: 71616374-A8E9-11E9-A7CA-09ECE5697425
last_name: Sagi
citation:
ama: Sagi O. Hybrid circuits on planar Germanium. 2024. doi:10.15479/at:ista:18076
apa: Sagi, O. (2024). Hybrid circuits on planar Germanium. Institute of Science
and Technology Austria. https://doi.org/10.15479/at:ista:18076
chicago: Sagi, Oliver. “Hybrid Circuits on Planar Germanium.” Institute of Science
and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18076.
ieee: O. Sagi, “Hybrid circuits on planar Germanium,” Institute of Science and Technology
Austria, 2024.
ista: Sagi O. 2024. Hybrid circuits on planar Germanium. Institute of Science and
Technology Austria.
mla: Sagi, Oliver. Hybrid Circuits on Planar Germanium. Institute of Science
and Technology Austria, 2024, doi:10.15479/at:ista:18076.
short: O. Sagi, Hybrid Circuits on Planar Germanium, Institute of Science and Technology
Austria, 2024.
corr_author: '1'
date_created: 2024-09-16T12:58:36Z
date_published: 2024-09-18T00:00:00Z
date_updated: 2026-04-16T12:20:39Z
day: '18'
ddc:
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: GeKa
doi: 10.15479/at:ista:18076
ec_funded: 1
file:
- access_level: open_access
checksum: d01d0e2846c2f3ac5bb14d321554a4cd
content_type: application/pdf
creator: osagi
date_created: 2024-09-18T14:13:01Z
date_updated: 2024-09-18T14:13:01Z
file_id: '18093'
file_name: OliverSagi_Thesis_pdfa.pdf
file_size: 86679095
relation: main_file
success: 1
- access_level: local
checksum: 0543f473d509ee545f4ed3a56f742f4b
content_type: application/x-zip-compressed
creator: osagi
date_created: 2024-09-18T14:14:02Z
date_updated: 2024-09-19T09:20:33Z
file_id: '18094'
file_name: Thesis_OliverSagi.zip
file_size: 172098524
relation: source_file
file_date_updated: 2024-09-19T09:20:33Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '111'
project:
- _id: bd8bd29e-d553-11ed-ba76-f0070d4b237a
grant_number: P36507
name: Merging spin and superconducting qubits in planar Ge
- _id: c0977eea-5a5b-11eb-8a69-a862db0cf4d1
grant_number: I05060
name: High impedance circuit quantum electrodynamics with hole spins
- _id: 262116AA-B435-11E9-9278-68D0E5697425
name: Hybrid Semiconductor - Superconductor Quantum Devices
- _id: 237E5020-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '862046'
name: TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '17202'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Hybrid circuits on planar Germanium
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'
...
---
_id: '18086'
abstract:
- lang: eng
text: "Abstract. Continuous group key agreement (CGKA) allows a group of\r\nusers
to maintain a continuously updated shared key in an asynchronous\r\nsetting where
parties only come online sporadically and their messages\r\nare relayed by an
untrusted server. CGKA captures the basic primitive\r\nunderlying group messaging
schemes.\r\nCurrent solutions including TreeKEM (“Messaging Layer Security”\r\n(MLS)
IETF RFC 9420) cannot handle concurrent requests while retaining low communication
complexity. The exception being CoCoA, which\r\nis concurrent while having extremely
low communication complexity (in\r\ngroups of size n and for m concurrent updates
the communication per\r\nuser is log(n), i.e., independent of m). The main downside
of CoCoA\r\nis that in groups of size n, users might have to do up to log(n) update\r\nrequests
to the server to ensure their (potentially corrupted) key material has been refreshed.\r\nIn
this work we present a “fast healing” concurrent CGKA protocol,\r\nnamed DeCAF,
where users will heal after at most log(t) requests, with\r\nt being the number
of corrupted users. While also suitable for the standard central-server setting,
our protocol is particularly interesting for\r\nrealizing decentralized group
messaging, where protocol messages (add,\r\nremove, update) are being posted on
some append-only data structure\r\nrather than sent to a server. In this setting,
concurrency is crucial once\r\nthe rate of requests exceeds, say, the rate at
which new blocks are added\r\nto a blockchain.\r\nIn the central-server setting,
CoCoA (the only alternative with concurrency, sub-linear communication and basic
post-compromise security)\r\nenjoys much lower download communication. However,
in the decentralized setting – where there is no server which can craft specific
messages\r\nfor different users to reduce their download communication – our protocol\r\nsignificantly
outperforms CoCoA. DeCAF heals in fewer epochs (log(t)\r\nvs. log(n)) while incurring
a similar per epoch per user communication\r\ncost."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Benedikt
full_name: Auerbach, Benedikt
id: D33D2B18-E445-11E9-ABB7-15F4E5697425
last_name: Auerbach
orcid: 0000-0002-7553-6606
- first_name: Miguel
full_name: Cueto Noval, Miguel
id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
last_name: Cueto Noval
orcid: 0000-0002-2505-4246
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Guillermo
full_name: Pascual Perez, Guillermo
id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
last_name: Pascual Perez
orcid: 0000-0001-8630-415X
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ.
DeCAF: Decentralizable CGKA with fast healing. In: Galdi C, Phan DH, eds. Security
and Cryptography for Networks: 14th International Conference. Vol 14974. Cham:
Springer Nature; 2024:294–313. doi:10.1007/978-3-031-71073-5_14'
apa: 'Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G.,
& Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In
C. Galdi & D. H. Phan (Eds.), Security and Cryptography for Networks: 14th
International Conference (Vol. 14974, pp. 294–313). Cham: Springer Nature.
https://doi.org/10.1007/978-3-031-71073-5_14'
chicago: 'Alwen, Joel F, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo
Pascual Perez, and Krzysztof Z Pietrzak. “DeCAF: Decentralizable CGKA with Fast
Healing.” In Security and Cryptography for Networks: 14th International Conference,
edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature,
2024. https://doi.org/10.1007/978-3-031-71073-5_14.'
ieee: 'J. F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, and
K. Z. Pietrzak, “DeCAF: Decentralizable CGKA with fast healing,” in Security
and Cryptography for Networks: 14th International Conference, Amalfi, Italy,
2024, vol. 14974, pp. 294–313.'
ista: 'Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ.
2024. DeCAF: Decentralizable CGKA with fast healing. Security and Cryptography
for Networks: 14th International Conference. SCN: Security and Cryptography for
Networks, LNCS, vol. 14974, 294–313.'
mla: 'Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” Security
and Cryptography for Networks: 14th International Conference, edited by Clemente
Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:10.1007/978-3-031-71073-5_14.'
short: 'J.F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z.
Pietrzak, in:, C. Galdi, D.H. Phan (Eds.), Security and Cryptography for Networks:
14th International Conference, Springer Nature, Cham, 2024, pp. 294–313.'
conference:
end_date: 2024-09-13
location: Amalfi, Italy
name: 'SCN: Security and Cryptography for Networks'
start_date: 2024-09-11
corr_author: '1'
date_created: 2024-09-18T11:35:14Z
date_published: 2024-09-10T00:00:00Z
date_updated: 2026-04-07T13:01:26Z
day: '10'
department:
- _id: GradSch
- _id: KrPi
doi: 10.1007/978-3-031-71073-5_14
editor:
- first_name: Clemente
full_name: Galdi, Clemente
last_name: Galdi
- first_name: Duong Hieu
full_name: Phan, Duong Hieu
last_name: Phan
external_id:
isi:
- '001330408000014'
intvolume: ' 14974'
isi: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 294–313
place: Cham
publication: 'Security and Cryptography for Networks: 14th International Conference'
publication_identifier:
eisbn:
- '9783031710735'
eissn:
- 1611-3349
isbn:
- '9783031710728'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '18088'
relation: dissertation_contains
status: public
status: public
title: 'DeCAF: Decentralizable CGKA with fast healing'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14974
year: '2024'
...
---
APC_amount: 3028,31 EUR
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '18087'
abstract:
- lang: eng
text: We present a theory describing the interaction of structured light, such as
light carrying orbital angular momentum, with molecules. The light-matter interaction
Hamiltonian we derive is expressed through couplings between spherical gradients
of the electric field and the (transition) electric multipole moments of a particle
of any nontrivial rotation point group. Our model can therefore accommodate an
arbitrary complexity of the molecular and electric field structure, and it can
be straightforwardly extended to atoms or nanostructures. Applying this framework
to rovibrational spectroscopy of molecules, we uncover the general mechanism of
angular momentum exchange between the spin and orbital angular momenta of light,
molecular rotation, and its center-of-mass motion. We show that the nonzero vorticity
of Laguerre-Gaussian beams can strongly enhance certain rovibrational transitions
that are considered forbidden in the case of nonhelical light. We discuss the
experimental requirements for the observation of these forbidden transitions in
state-of-the-art spatially resolved spectroscopy measurements.
acknowledgement: We are grateful to Emilio Pisanty and Philipp Lunt for valuable discussions.
This research was funded wholly or in part by the Austrian Science Fund (FWF) [10.55776/F1004].
G.M.K. gratefully acknowledges funding from the European Union’s Horizon 2020 research
and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.
M.L. acknowledges support by the European Research Council (ERC) Starting Grant
No. 801770 (ANGULON). O.H.H. acknowledges support by the Austrian Science Fund (FWF)
[10.55776/P36040]. Furthermore, the financial support by the Austrian Federal Ministry
for Digital and Economic Affairs, the National Foundation for Research, Technology
and Development, and the Christian Doppler Research Association is gratefully acknowledged.
article_number: '033277'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Mikhail
full_name: Maslov, Mikhail
id: 2E65BB0E-F248-11E8-B48F-1D18A9856A87
last_name: Maslov
orcid: 0000-0003-4074-2570
- first_name: Georgios
full_name: Koutentakis, Georgios
id: d7b23d3a-9e21-11ec-b482-f76739596b95
last_name: Koutentakis
- first_name: Mateja
full_name: Hrast, Mateja
id: 48dbb294-2a9c-11ef-905d-f56be71f0e5d
last_name: Hrast
- first_name: Oliver H.
full_name: Heckl, Oliver H.
last_name: Heckl
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. Theory of angular momentum
transfer from light to molecules. Physical Review Research. 2024;6(3).
doi:10.1103/physrevresearch.6.033277
apa: Maslov, M., Koutentakis, G., Hrast, M., Heckl, O. H., & Lemeshko, M. (2024).
Theory of angular momentum transfer from light to molecules. Physical Review
Research. American Physical Society. https://doi.org/10.1103/physrevresearch.6.033277
chicago: Maslov, Mikhail, Georgios Koutentakis, Mateja Hrast, Oliver H. Heckl, and
Mikhail Lemeshko. “Theory of Angular Momentum Transfer from Light to Molecules.”
Physical Review Research. American Physical Society, 2024. https://doi.org/10.1103/physrevresearch.6.033277.
ieee: M. Maslov, G. Koutentakis, M. Hrast, O. H. Heckl, and M. Lemeshko, “Theory
of angular momentum transfer from light to molecules,” Physical Review Research,
vol. 6, no. 3. American Physical Society, 2024.
ista: Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. 2024. Theory of angular
momentum transfer from light to molecules. Physical Review Research. 6(3), 033277.
mla: Maslov, Mikhail, et al. “Theory of Angular Momentum Transfer from Light to
Molecules.” Physical Review Research, vol. 6, no. 3, 033277, American Physical
Society, 2024, doi:10.1103/physrevresearch.6.033277.
short: M. Maslov, G. Koutentakis, M. Hrast, O.H. Heckl, M. Lemeshko, Physical Review
Research 6 (2024).
corr_author: '1'
date_created: 2024-09-18T11:43:16Z
date_published: 2024-09-10T00:00:00Z
date_updated: 2026-04-07T11:52:53Z
day: '10'
ddc:
- '530'
department:
- _id: GradSch
- _id: MiLe
doi: 10.1103/physrevresearch.6.033277
ec_funded: 1
external_id:
arxiv:
- '2310.00095'
file:
- access_level: open_access
checksum: 8f744d94956a1683b473b1cf9b411a37
content_type: application/pdf
creator: dernst
date_created: 2024-09-23T09:46:20Z
date_updated: 2024-09-23T09:46:20Z
file_id: '18125'
file_name: 2024_PhysicalReviewResearch_Maslov.pdf
file_size: 1563824
relation: main_file
success: 1
file_date_updated: 2024-09-23T09:46:20Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 7c040762-9f16-11ee-852c-dd79eeee4ab3
grant_number: F100403
name: Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Physical Review Research
publication_identifier:
eissn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '19048'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Theory of angular momentum transfer from light to molecules
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: 6
year: '2024'
...
---
OA_place: publisher
_id: '18088'
abstract:
- lang: eng
text: "Instant messaging applications like Whatsapp, Signal or Telegram have become
ubiquitous in today's society.\r\nMany of them provide not only end-to-end encryption,
but also security guarantees even when the key material gets compromised.\r\nThese
are achieved through frequent key update performed by users.\r\nIn particular,
the compromise of a group key should preserve confidentiality of previously exchanged
messages (forward secrecy), and a subsequent key update will ensure security for
future ones (post-compromise security).\r\nThough great protocols for one-on-one
communication have been known for some time, the design of ones that scale efficiently
for larger groups while achieving akin security guarantees is a hard problem.\r\nA
great deal of research has been aimed at this topic, much of it under the umbrella
of the Messaging Layer Security (MLS) working group at the IETF. \r\nStarted in
2018, this joint effort by academics and industry culminated in 2023 with the
publication of the first standard for secure group messaging [IETF, RFC9420].\r\n\r\nAt
the core of secure group messaging is a cryptographic primitive termed Continuous
Group Key Agreement, or CGKA [Alwen et al. 2021], that essentially allows a changing
group of users to agree on a common key with the added functionality security
against compromises is achieved by users asynchronously issuing a key update.
In this thesis we contribute to the understanding of CGKA across different angles.\r\nFirst,
we present a new technique to effect dynamic operations in groups, i.e., add or
remove members, that can be more efficient that the one employed by MLS in certain
settings.\r\nConsidering the setting of users belonging to multiple overlapping
groups, we then show lowerbounds on the communication cost of constructions that
leverage said overlap, at the same time showing protocols that are asymptotically
optimal and efficient for practical settings, respectively. Along the way, we
show that the communication cost of key updates in MLS is average-cost optimal.\r\nAn
important feature in CGKA protocols, particularly for big groups, is the possibility
of executing several group operations concurrently. While later versions of MLS
support this, they do at the cost of worsening the communication efficiency of
future group operations.\r\nIn this thesis we introduce two new protocols that
permit concurrency without any negative effect on efficiency. Our protocols circumvent
previously existing lower bounds by satisfying a new notion of post-compromise
security that only asks for security to be re-established after a certain number
of key updates have taken place. While this can be slower than MLS in terms of
rounds of communication, we show that it leads to more efficient overall communication.
\r\nAdditionally, we introduce a new technique that allows group members to decrease
the information they need to store and download, which makes one of our protocols
enjoy much lower download cost than any other existing CGKA constructions. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Guillermo
full_name: Pascual Perez, Guillermo
id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
last_name: Pascual Perez
orcid: 0000-0001-8630-415X
citation:
ama: Pascual Perez G. On the efficiency and security of secure group messaging.
2024. doi:10.15479/at:ista:18088
apa: Pascual Perez, G. (2024). On the efficiency and security of secure group
messaging. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18088
chicago: Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group
Messaging.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18088.
ieee: G. Pascual Perez, “On the efficiency and security of secure group messaging,”
Institute of Science and Technology Austria, 2024.
ista: Pascual Perez G. 2024. On the efficiency and security of secure group messaging.
Institute of Science and Technology Austria.
mla: Pascual Perez, Guillermo. On the Efficiency and Security of Secure Group
Messaging. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18088.
short: G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging,
Institute of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-09-18T12:59:49Z
date_published: 2024-09-18T00:00:00Z
date_updated: 2026-04-07T13:01:26Z
day: '18'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrPi
- _id: GradSch
doi: 10.15479/at:ista:18088
ec_funded: 1
file:
- access_level: closed
checksum: ce0dca715b3df48e52e2e891b6ac1bc5
content_type: application/x-zip-compressed
creator: gpascual
date_created: 2024-09-19T12:35:38Z
date_updated: 2024-09-19T12:35:38Z
file_id: '18099'
file_name: thesis_bundle.zip
file_size: 11917734
relation: source_file
- access_level: open_access
checksum: 4a2c72e90f1a0ef2a13cff800f8d1265
content_type: application/pdf
creator: gpascual
date_created: 2024-09-19T12:36:08Z
date_updated: 2024-09-19T12:36:08Z
file_id: '18100'
file_name: thesis_gpasper.pdf
file_size: 2729427
relation: main_file
file_date_updated: 2024-09-19T12:36:08Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '239'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10408'
relation: part_of_dissertation
status: public
- id: '11476'
relation: part_of_dissertation
status: public
- id: '18086'
relation: part_of_dissertation
status: public
- id: '10049'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
title: On the efficiency and security of secure group messaging
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'
...
---
_id: '18107'
abstract:
- lang: eng
text: We consider a dilute fully spin-polarized Fermi gas at positive temperature
in dimensions d∈{1,2,3} . We show that the pressure of the interacting gas is
bounded from below by that of the free gas plus, to leading order, an explicit
term of order adρ2+2/d, where a is the p-wave scattering length of the repulsive
interaction and ρ is the particle density. The results are valid for a wide
range of repulsive interactions, including that of a hard core, and uniform in
temperatures at most of the order of the Fermi temperature. A central ingredient
in the proof is a rigorous implementation of the fermionic cluster expansion of
Gaudin, Gillespie and Ripka (Nucl. Phys. A, 176.2 (1971), pp. 237–260).
acknowledgement: 'Financial support by the Austrian Science Fund (FWF) through grant
DOI: 10.55776/I6427 (as part of the SFB/TRR 352) is gratefully acknowledged.'
article_number: e78
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Asbjørn Bækgaard
full_name: Lauritsen, Asbjørn Bækgaard
id: e1a2682f-dc8d-11ea-abe3-81da9ac728f1
last_name: Lauritsen
orcid: 0000-0003-4476-2288
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas:
Lower bound. Forum of Mathematics, Sigma. 2024;12. doi:10.1017/fms.2024.56'
apa: 'Lauritsen, A. B., & Seiringer, R. (2024). Pressure of a dilute spin-polarized
Fermi gas: Lower bound. Forum of Mathematics, Sigma. Cambridge University
Press. https://doi.org/10.1017/fms.2024.56'
chicago: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute
Spin-Polarized Fermi Gas: Lower Bound.” Forum of Mathematics, Sigma. Cambridge
University Press, 2024. https://doi.org/10.1017/fms.2024.56.'
ieee: 'A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi
gas: Lower bound,” Forum of Mathematics, Sigma, vol. 12. Cambridge University
Press, 2024.'
ista: 'Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi
gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.'
mla: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized
Fermi Gas: Lower Bound.” Forum of Mathematics, Sigma, vol. 12, e78, Cambridge
University Press, 2024, doi:10.1017/fms.2024.56.'
short: A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024).
corr_author: '1'
date_created: 2024-09-20T12:25:25Z
date_published: 2024-09-09T00:00:00Z
date_updated: 2026-04-07T13:01:40Z
day: '09'
ddc:
- '510'
department:
- _id: GradSch
- _id: RoSe
doi: 10.1017/fms.2024.56
external_id:
arxiv:
- '2407.05990'
isi:
- '001307817400001'
file:
- access_level: open_access
checksum: 330b881240013213a8e08538fec13d29
content_type: application/pdf
creator: dernst
date_created: 2024-09-23T09:56:17Z
date_updated: 2024-09-23T09:56:17Z
file_id: '18126'
file_name: 2024_ForumMath_Lauritsen.pdf
file_size: 599886
relation: main_file
success: 1
file_date_updated: 2024-09-23T09:56:17Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b
grant_number: I06427
name: Mathematical Challenges in BCS Theory of Superconductivity
publication: Forum of Mathematics, Sigma
publication_identifier:
issn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
record:
- id: '18135'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Pressure of a dilute spin-polarized Fermi gas: Lower bound'
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: 12
year: '2024'
...
---
_id: '18113'
abstract:
- lang: eng
text: 'The emergence of accurate open large language models (LLMs) has led to a
race towards performant quantization techniques which can enable their execution
on end-user devices. In this paper, we revisit the problem of “extreme” LLM compression—defined
as targeting extremely low bit counts, such as 2 to 3 bits per parameter—from
the point of view of classic methods in Multi-Codebook Quantization (MCQ). Our
algorithm, called AQLM, generalizes the classic Additive Quantization (AQ) approach
for information retrieval to advance the state-of-the-art in LLM compression,
via two innovations: 1) learned additive quantization of weight matrices in input-adaptive
fashion, and 2) joint optimization of codebook parameters across each transformer
blocks. Broadly, AQLM is the first scheme that is Pareto optimal in terms of accuracy-vs-model-size
when compressing to less than 3 bits per parameter, and significantly improves
upon all known schemes in the extreme compression (2bit) regime. In addition,
AQLM is practical: we provide fast GPU and CPU implementations of AQLM for token
generation, which enable us to match or outperform optimized FP16 implementations
for speed, while executing in a much smaller memory footprint.'
acknowledgement: "Authors would like to thank Ruslan Svirschevski for his help in
solving technical issues with AQLM and baselines. We also thank Tim Dettmers for
helpful discussions on the structure of weights in modern LLMs and size-accuracy
trade-offs. The authors would also like to thank Daniil Pavlov for his assistance
with CPU benchmarking. Finally, authors would like to thank the communities of ML
enthusiasts known as LocalLLaMA5 and Petals community on discord6\r\nfor the crowd
wisdom about running LLMs on consumer devices. Egiazarian Vage and Denis Kuznedelev
and Andrei Panferov were supported by the grant for research centers in the field
of AI provided by the Analytical Center for the Government of the Russian Federation
(ACRF) in\r\naccordance with the agreement on the provision of subsidies (identifier
of the agreement 000000D730321P5Q0002) and the agreement with HSE University No.
70-2021-00139."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Vage
full_name: Egiazarian, Vage
last_name: Egiazarian
- first_name: Andrei
full_name: Panferov, Andrei
id: 2c18daae-4dbe-11ef-8491-98ce2d960f09
last_name: Panferov
- first_name: Denis
full_name: Kuznedelev, Denis
last_name: Kuznedelev
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- first_name: Artem
full_name: Babenko, Artem
last_name: Babenko
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A.
Extreme compression of large language models via additive quantization. In: Proceedings
of the 41st International Conference on Machine Learning. Vol 235. ML Research
Press; 2024:12284-12303.'
apa: 'Egiazarian, V., Panferov, A., Kuznedelev, D., Frantar, E., Babenko, A., &
Alistarh, D.-A. (2024). Extreme compression of large language models via additive
quantization. In Proceedings of the 41st International Conference on Machine
Learning (Vol. 235, pp. 12284–12303). Vienna, Austria: ML Research Press.'
chicago: Egiazarian, Vage, Andrei Panferov, Denis Kuznedelev, Elias Frantar, Artem
Babenko, and Dan-Adrian Alistarh. “Extreme Compression of Large Language Models
via Additive Quantization.” In Proceedings of the 41st International Conference
on Machine Learning, 235:12284–303. ML Research Press, 2024.
ieee: V. Egiazarian, A. Panferov, D. Kuznedelev, E. Frantar, A. Babenko, and D.-A.
Alistarh, “Extreme compression of large language models via additive quantization,”
in Proceedings of the 41st International Conference on Machine Learning,
Vienna, Austria, 2024, vol. 235, pp. 12284–12303.
ista: 'Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A.
2024. Extreme compression of large language models via additive quantization.
Proceedings of the 41st International Conference on Machine Learning. ICML: International
Conference on Machine Learning, PMLR, vol. 235, 12284–12303.'
mla: Egiazarian, Vage, et al. “Extreme Compression of Large Language Models via
Additive Quantization.” Proceedings of the 41st International Conference on
Machine Learning, vol. 235, ML Research Press, 2024, pp. 12284–303.
short: V. Egiazarian, A. Panferov, D. Kuznedelev, E. Frantar, A. Babenko, D.-A.
Alistarh, in:, Proceedings of the 41st International Conference on Machine Learning,
ML Research Press, 2024, pp. 12284–12303.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
corr_author: '1'
date_created: 2024-09-22T22:01:43Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2024-10-01T08:13:05Z
day: '01'
department:
- _id: DaAl
- _id: GradSch
external_id:
arxiv:
- '2401.06118'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2401.06118'
month: '09'
oa: 1
oa_version: Preprint
page: 12284-12303
publication: Proceedings of the 41st International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extreme compression of large language models via additive quantization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 235
year: '2024'
...
---
_id: '18117'
abstract:
- lang: eng
text: "We investigate parameter-efficient fine-tuning (PEFT) methods that can provide
good accuracy under limited computational and memory budgets in the context of
large language models (LLMs). We present a new PEFT method called Robust Adaptation
(RoSA) inspired by robust principal component analysis that jointly trains low-rank\r\n
and highly-sparse components on top of a set of fixed pretrained weights to efficiently
approximate the performance of a full-fine-tuning (FFT) solution. Across a series
of challenging generative tasks such as grade-school math and SQL query generation,
which require fine-tuning for good performance, we show that RoSA outperforms
LoRA, pure sparse fine-tuning, and alternative hybrid methods at the same parameter
budget, and can even recover the performance of FFT on some tasks. We provide
system support for RoSA to complement the training algorithm, specifically in
the form of sparse GPU kernels which enable memory- and computationally-efficient
training, and show that it is also compatible with low-precision base weights,
resulting in the first joint representation combining quantization, low-rank and
sparse approximations. Our code is available at https://github.com/IST-DASLab/RoSA."
acknowledgement: The authors would like to thank Eldar Kurtic for experimental support
and useful suggestions throughout the project
article_processing_charge: No
arxiv: 1
author:
- first_name: Mahdi
full_name: Nikdan, Mahdi
id: 66374281-f394-11eb-9cf6-869147deecc0
last_name: Nikdan
- first_name: Soroush
full_name: Tabesh, Soroush
id: 06000900-6068-11ef-8d61-c2472ef2e752
last_name: Tabesh
orcid: 0009-0003-4119-6281
- first_name: Elvir
full_name: Crncevic, Elvir
id: 41888001-440d-11ef-8299-d0e838b8185e
last_name: Crncevic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nikdan M, Tabesh S, Crncevic E, Alistarh D-A. RoSA: Accurate parameter-efficient
fine-tuning via robust adaptation. In: Proceedings of the 41st International
Conference on Machine Learning. Vol 235. ML Research Press; 2024:38187-38206.'
apa: 'Nikdan, M., Tabesh, S., Crncevic, E., & Alistarh, D.-A. (2024). RoSA:
Accurate parameter-efficient fine-tuning via robust adaptation. In Proceedings
of the 41st International Conference on Machine Learning (Vol. 235, pp. 38187–38206).
Vienna, Austria: ML Research Press.'
chicago: 'Nikdan, Mahdi, Soroush Tabesh, Elvir Crncevic, and Dan-Adrian Alistarh.
“RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation.” In Proceedings
of the 41st International Conference on Machine Learning, 235:38187–206. ML
Research Press, 2024.'
ieee: 'M. Nikdan, S. Tabesh, E. Crncevic, and D.-A. Alistarh, “RoSA: Accurate parameter-efficient
fine-tuning via robust adaptation,” in Proceedings of the 41st International
Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 38187–38206.'
ista: 'Nikdan M, Tabesh S, Crncevic E, Alistarh D-A. 2024. RoSA: Accurate parameter-efficient
fine-tuning via robust adaptation. Proceedings of the 41st International Conference
on Machine Learning. ICML: International Conference on Machine Learning vol. 235,
38187–38206.'
mla: 'Nikdan, Mahdi, et al. “RoSA: Accurate Parameter-Efficient Fine-Tuning via
Robust Adaptation.” Proceedings of the 41st International Conference on Machine
Learning, vol. 235, ML Research Press, 2024, pp. 38187–206.'
short: M. Nikdan, S. Tabesh, E. Crncevic, D.-A. Alistarh, in:, Proceedings of the
41st International Conference on Machine Learning, ML Research Press, 2024, pp.
38187–38206.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
corr_author: '1'
date_created: 2024-09-22T22:01:44Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2024-10-01T08:22:01Z
day: '01'
department:
- _id: DaAl
- _id: GradSch
external_id:
arxiv:
- '2401.04679'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2401.04679
month: '09'
oa: 1
oa_version: Preprint
page: 38187-38206
publication: Proceedings of the 41st International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/IST-DASLab/RoSA
scopus_import: '1'
status: public
title: 'RoSA: Accurate parameter-efficient fine-tuning via robust adaptation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 235
year: '2024'
...
---
OA_place: publisher
_id: '18132'
abstract:
- lang: eng
text: "In this thesis, we are dealing with both arithmetic and geometric problems
coming from the\r\nstudy of rational points with a particular focus on function
fields over finite fields:\r\n(1) Using the circle method we produce upper bounds
for the number of rational points of\r\nbounded height on diagonal cubic surfaces
and fourfolds over Fq(t). This is based on\r\njoint work with Leonhard Hochfilzer.\r\n(2)
We study rational points on smooth complete intersections X defined by cubic and\r\nquadratic
hypersurfaces over Fq(t). We refine the Farey dissection of the “unit square”\r\ndeveloped
by Vishe [202] and use the circle method with a Kloosterman refinement to\r\nestablish
an asymptotic formula for the number of rational points of bounded height on\r\nX
when dim(X) ≥ 23. Under the same hypotheses, we also verify weak approximation.\r\n(3)
In joint work with Hochfilzer, we obtain upper bounds for the number of rational
points of\r\nbounded height on del Pezzo surfaces of low degree over any global
field. Our approach\r\nis to take hyperplane sections, which reduces the problem
to uniform estimates for the\r\nnumber of rational points on curves.\r\n(4) We
develop a version of the circle method capable of counting Fq-points on jet schemes\r\nof
moduli spaces of rational curves on hypersurfaces. Combining this with a spreading\r\nout
argument and a result of Mustaţă [150], this allows us to show that these moduli\r\nspaces
only have canonical singularities under suitable assumptions on the degree and
the\r\ndimension.\r\nIn addition, we give an overview of guiding questions and
conjectures in the field of rational\r\npoints and explain the basic mechanism
underlying the circle method.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Jakob
full_name: Glas, Jakob
id: d6423cba-dc74-11ea-a0a7-ee61689ff5fb
last_name: Glas
citation:
ama: Glas J. Counting rational points over function fields. 2024. doi:10.15479/at:ista:18132
apa: Glas, J. (2024). Counting rational points over function fields. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:18132
chicago: Glas, Jakob. “Counting Rational Points over Function Fields.” Institute
of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18132.
ieee: J. Glas, “Counting rational points over function fields,” Institute of Science
and Technology Austria, 2024.
ista: Glas J. 2024. Counting rational points over function fields. Institute of
Science and Technology Austria.
mla: Glas, Jakob. Counting Rational Points over Function Fields. Institute
of Science and Technology Austria, 2024, doi:10.15479/at:ista:18132.
short: J. Glas, Counting Rational Points over Function Fields, Institute of Science
and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-09-23T18:58:08Z
date_published: 2024-09-23T00:00:00Z
date_updated: 2026-04-07T12:53:54Z
day: '23'
ddc:
- '512'
degree_awarded: PhD
department:
- _id: GradSch
- _id: TiBr
doi: 10.15479/at:ista:18132
file:
- access_level: closed
checksum: 2f8cf5cefdab108b1979caa8146cae9a
content_type: application/x-zip-compressed
creator: jglas
date_created: 2024-09-23T18:49:22Z
date_updated: 2024-09-23T18:49:22Z
file_id: '18133'
file_name: PhDthesis (3).zip
file_size: 5382106
relation: source_file
- access_level: open_access
checksum: 08bb6f14c42b47ff25882a2ce3ea0d8a
content_type: application/pdf
creator: jglas
date_created: 2024-09-25T14:08:57Z
date_updated: 2024-09-25T14:08:57Z
file_id: '18140'
file_name: example-phd.pdf
file_size: 2380127
relation: main_file
success: 1
file_date_updated: 2024-09-25T14:08:57Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '195'
project:
- _id: bd8a4fdc-d553-11ed-ba76-80a0167441a3
grant_number: P36278
name: Rational curves via function field analytic number theory
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '18293'
relation: part_of_dissertation
status: public
- id: '18294'
relation: part_of_dissertation
status: public
- id: '18295'
relation: part_of_dissertation
status: public
- id: '18173'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
title: Counting rational points over function fields
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
OA_place: publisher
_id: '18135'
abstract:
- lang: eng
text: "This thesis consists of two separate parts. In the first part we consider
a dilute Fermi gas interacting through a repulsive interaction in dimensions $d=1,2,3$.
Our focus is mostly on the physically most relevant dimension $d=3$ \r\nand the
setting of a spin-polarized (equivalently spinless) gas, where the Pauli exclusion
principle plays a key role. We show that, at zero temperature, the ground state
energy density of the interacting spin-polarized gas differs (to leading order)
from that of the free (i.e. non-interacting) gas by a term of order $a_p^d\\rho^{2+2/d}$
\ with $a_p$ the $p$-wave scattering length of the repulsive interaction and $\\rho$
the density. Further, we extend this to positive temperature and show that the
pressure of an interacting spin-polarized gas differs from that of the free gas
by a now temperature dependent term, again of order $a_p^d\\rho^{2+2/d}$. Lastly,
we consider the setting of a spin-$\\frac{1}{2}$ Fermi gas in $d=3$ dimensions
and show that here, as an upper bound, the ground state energy density differs
from that of the free system by a term of order $a_s \\rho^2$ with an error smaller
than $a_s \\rho^2 (a_s\\rho^{1/3})^{1-\\eps}$ for any $\\eps > 0$, where $a_s$
is the $s$-wave scattering length of the repulsive interaction. \r\n\r\nThese
asymptotic formulas complement the similar formulas in the literature for the
dilute Bose and spin-$\\frac{1}{2}$ Fermi gas, where the ground state energies
or pressures differ from that of the corresponding free systems by a term of order
$a_s \\rho^2$ in dimension $d=3$. In the spin-polarized setting, the corrections,
of order $a_p^3\\rho^{8/3}$ in dimension $d=3$, are thus much smaller and requires
a more delicate analysis.\r\n\r\nIn the second part of the thesis we consider
the Bardeen--Cooper--Schrieffer (BCS) theory of superconductivity and in particular
its associated critical temperature and energy gap. We prove that the ratio of
the zero-temperature energy gap and critical temperature $\\Xi(T=0)/T_c$ approaches
a universal constant $\\pi e^{-\\gamma}\\approx 1.76$ in both the limit of high
density in dimension $d=3$ and in the limit of weak coupling in dimensions $d=1,2$.
This complements the proofs in the literature of this universal behaviour in the
limit of weak coupling or low density in dimension $d=3$. Secondly, we prove that
the ratio of the energy gap at positive temperature and critical temperature $\\Xi(T)/T_c$
approaches a universal function of the relative temperature $T/T_c$ in the limit
of weak coupling in dimensions $d=1,2,3$."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Asbjørn Bækgaard
full_name: Lauritsen, Asbjørn Bækgaard
id: e1a2682f-dc8d-11ea-abe3-81da9ac728f1
last_name: Lauritsen
orcid: 0000-0003-4476-2288
citation:
ama: Lauritsen AB. Energies of dilute Fermi gases and universalities in BCS theory.
2024. doi:10.15479/at:ista:18135
apa: Lauritsen, A. B. (2024). Energies of dilute Fermi gases and universalities
in BCS theory. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18135
chicago: Lauritsen, Asbjørn Bækgaard. “Energies of Dilute Fermi Gases and Universalities
in BCS Theory.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18135.
ieee: A. B. Lauritsen, “Energies of dilute Fermi gases and universalities in BCS
theory,” Institute of Science and Technology Austria, 2024.
ista: Lauritsen AB. 2024. Energies of dilute Fermi gases and universalities in BCS
theory. Institute of Science and Technology Austria.
mla: Lauritsen, Asbjørn Bækgaard. Energies of Dilute Fermi Gases and Universalities
in BCS Theory. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18135.
short: A.B. Lauritsen, Energies of Dilute Fermi Gases and Universalities in BCS
Theory, Institute of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-09-24T10:56:25Z
date_published: 2024-09-23T00:00:00Z
date_updated: 2026-04-16T08:17:55Z
day: '23'
ddc:
- '515'
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: RoSe
doi: 10.15479/at:ista:18135
ec_funded: 1
file:
- access_level: open_access
checksum: c7bc3b31e430d57c65393051ca439575
content_type: application/pdf
creator: alaurits
date_created: 2024-09-26T13:11:24Z
date_updated: 2024-09-26T13:11:24Z
file_id: '18147'
file_name: Lauritsen-thesis-final.pdf
file_size: 3648831
relation: main_file
success: 1
- access_level: closed
checksum: 39f6b1b7f83e25a3bf9f933f1ea0bc06
content_type: application/x-zip-compressed
creator: alaurits
date_created: 2024-09-26T13:12:55Z
date_updated: 2024-09-26T13:12:55Z
file_id: '18148'
file_name: Lauritsen-thesis-source.zip
file_size: 1625888
relation: source_file
file_date_updated: 2024-09-26T13:12:55Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '353'
project:
- _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b
grant_number: I06427
name: Mathematical Challenges in BCS Theory of Superconductivity
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication_identifier:
isbn:
- 978-3-99078-042-8
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '11732'
relation: part_of_dissertation
status: public
- id: '14542'
relation: part_of_dissertation
status: public
- id: '18107'
relation: part_of_dissertation
status: public
- id: '17240'
relation: part_of_dissertation
status: public
- id: '14931'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
title: Energies of dilute Fermi gases and universalities in BCS theory
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'
...
---
_id: '18174'
abstract:
- lang: eng
text: We investigate the phase ordering (pattern formation) of systems of two-dimensional
core–shell particles using Monte Carlo (MC) computer simulations and classical
density functional theory (DFT). The particles interact via a pair potential having
a hard core and a repulsive square shoulder. Our simulations show that on cooling,
the liquid state structure becomes increasingly characterized by long wavelength
density modulations and on further cooling forms a variety of other phases, including
clustered, striped, and other patterned phases. In DFT, the hard core part of
the potential is treated using either fundamental measure theory or a simple local
density approximation, whereas the soft shoulder is treated using the random phase
approximation. The different DFTs are benchmarked using large-scale grand-canonical-MC
and Gibbs-ensemble-MC simulations, demonstrating their predictive capabilities
and shortcomings. We find that having the liquid state static structure factor
S(k) for wavenumber k is sufficient to identify the Fourier modes governing both
the liquid and solid phases. This allows us to identify from easier-to-obtain
liquid state data the wavenumbers relevant to the periodic phases and to predict
roughly where in the phase diagram these patterned phases arise.
acknowledgement: The computational results presented here were enabled via a generous
share of CPU time, offered by the Vienna Scientific Cluster (VSC) under Project
No. 71263. The authors thank Ms. Katrin Muck for her guidance related to the use
of HPC. A.J.A. gratefully acknowledges support from the EPSRC under Grant No. EP/P015689/1.
article_number: '124503 '
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Michael
full_name: Wassermair, Michael
id: 23d132c4-4e98-11ef-b275-9e8d4cd8c917
last_name: Wassermair
- first_name: Gerhard
full_name: Kahl, Gerhard
last_name: Kahl
- first_name: Roland
full_name: Roth, Roland
last_name: Roth
- first_name: Andrew J.
full_name: Archer, Andrew J.
last_name: Archer
citation:
ama: Wassermair M, Kahl G, Roth R, Archer AJ. Fingerprints of ordered self-assembled
structures in the liquid phase of a hard-core, square-shoulder system. The
Journal of chemical physics. 2024;161(12). doi:10.1063/5.0226954
apa: Wassermair, M., Kahl, G., Roth, R., & Archer, A. J. (2024). Fingerprints
of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder
system. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0226954
chicago: Wassermair, Michael, Gerhard Kahl, Roland Roth, and Andrew J. Archer. “Fingerprints
of Ordered Self-Assembled Structures in the Liquid Phase of a Hard-Core, Square-Shoulder
System.” The Journal of Chemical Physics. AIP Publishing, 2024. https://doi.org/10.1063/5.0226954.
ieee: M. Wassermair, G. Kahl, R. Roth, and A. J. Archer, “Fingerprints of ordered
self-assembled structures in the liquid phase of a hard-core, square-shoulder
system,” The Journal of chemical physics, vol. 161, no. 12. AIP Publishing,
2024.
ista: Wassermair M, Kahl G, Roth R, Archer AJ. 2024. Fingerprints of ordered self-assembled
structures in the liquid phase of a hard-core, square-shoulder system. The Journal
of chemical physics. 161(12), 124503.
mla: Wassermair, Michael, et al. “Fingerprints of Ordered Self-Assembled Structures
in the Liquid Phase of a Hard-Core, Square-Shoulder System.” The Journal of
Chemical Physics, vol. 161, no. 12, 124503, AIP Publishing, 2024, doi:10.1063/5.0226954.
short: M. Wassermair, G. Kahl, R. Roth, A.J. Archer, The Journal of Chemical Physics
161 (2024).
corr_author: '1'
date_created: 2024-10-06T22:01:12Z
date_published: 2024-09-28T00:00:00Z
date_updated: 2025-09-08T09:55:52Z
day: '28'
ddc:
- '530'
department:
- _id: GradSch
doi: 10.1063/5.0226954
external_id:
arxiv:
- '2409.06447'
isi:
- '001325268300004'
pmid:
- '39344889'
file:
- access_level: open_access
checksum: f3874e64ef94e94b2376f00a1fee24c3
content_type: application/pdf
creator: dernst
date_created: 2024-10-07T11:25:00Z
date_updated: 2024-10-07T11:25:00Z
file_id: '18185'
file_name: 2024_JourChemicalPhysics_Wassermair.pdf
file_size: 15009000
relation: main_file
success: 1
file_date_updated: 2024-10-07T11:25:00Z
has_accepted_license: '1'
intvolume: ' 161'
isi: 1
issue: '12'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: The Journal of chemical physics
publication_identifier:
eissn:
- 1089-7690
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fingerprints of ordered self-assembled structures in the liquid phase of a
hard-core, square-shoulder system
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: 161
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: '18301'
abstract:
- lang: eng
text: Physics simulation in computer graphics can bring triangle meshes into topologically
invalid states. The method in this thesis contributed to Heiss-Synak* and Kalinov*
et al. [2024] who devised a non-manifold hybrid surface tracker—a surface tracker
that repairs explicit non-manifold triangle meshes with the help of the implicit
domain. Specifically, this thesis provides an algorithm for filling the holes
that are left after removing problematic parts of the mesh.
alternative_title:
- ISTA Master's Thesis
article_processing_charge: No
author:
- first_name: Arian
full_name: Etemadihaghighi, Arian
id: 36cea3aa-f38e-11ec-8ae0-c65ae6f6098f
last_name: Etemadihaghighi
citation:
ama: Etemadi A. Filling the holes of non-manifold self-intersecting meshes for implicit
topology changes in surface tracking. 2024. doi:10.15479/at:ista:18301
apa: Etemadi, A. (2024). Filling the holes of non-manifold self-intersecting
meshes for implicit topology changes in surface tracking. Institute of Science
and Technology Austria. https://doi.org/10.15479/at:ista:18301
chicago: Etemadi, Arian. “Filling the Holes of Non-Manifold Self-Intersecting Meshes
for Implicit Topology Changes in Surface Tracking.” Institute of Science and Technology
Austria, 2024. https://doi.org/10.15479/at:ista:18301.
ieee: A. Etemadi, “Filling the holes of non-manifold self-intersecting meshes for
implicit topology changes in surface tracking,” Institute of Science and Technology
Austria, 2024.
ista: Etemadi A. 2024. Filling the holes of non-manifold self-intersecting meshes
for implicit topology changes in surface tracking. Institute of Science and Technology
Austria.
mla: Etemadi, Arian. Filling the Holes of Non-Manifold Self-Intersecting Meshes
for Implicit Topology Changes in Surface Tracking. Institute of Science and
Technology Austria, 2024, doi:10.15479/at:ista:18301.
short: A. Etemadi, Filling the Holes of Non-Manifold Self-Intersecting Meshes for
Implicit Topology Changes in Surface Tracking, Institute of Science and Technology
Austria, 2024.
corr_author: '1'
date_created: 2024-10-11T19:52:20Z
date_published: 2024-10-15T00:00:00Z
date_updated: 2026-04-07T13:02:36Z
day: '15'
ddc:
- '000'
degree_awarded: MS
department:
- _id: GradSch
- _id: ChWo
doi: 10.15479/at:ista:18301
file:
- access_level: open_access
checksum: 80fb7923e229ad9d39253d7c8a8083d0
content_type: application/pdf
creator: aetemadi
date_created: 2024-10-24T14:34:42Z
date_updated: 2024-10-24T14:34:42Z
file_id: '18469'
file_name: thesis-arian-etemadi.pdf
file_size: 8914218
relation: main_file
success: 1
- access_level: closed
checksum: 1c02586ed7d441d5ec441867650568d1
content_type: application/x-zip-compressed
creator: aetemadi
date_created: 2024-10-24T14:34:54Z
date_updated: 2024-10-24T14:34:54Z
file_id: '18470'
file_name: thesis-arian-etemadi-latex-source.zip
file_size: 9802650
relation: source_file
file_date_updated: 2024-10-24T14:34:54Z
has_accepted_license: '1'
keyword:
- surface tracking
- non-manifold
- hole-filling
- topology change
- multi-material
- solid-modeling
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '39'
publication_identifier:
issn:
- 2791-4585
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '17219'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
title: Filling the holes of non-manifold self-intersecting meshes for implicit topology
changes in surface tracking
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-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'
...