[{"status":"public","ec_funded":1,"publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/at:ista:17485","related_material":{"record":[{"status":"public","id":"17378","relation":"part_of_dissertation"},{"status":"public","id":"17087","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"14458","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18061"},{"status":"public","relation":"part_of_dissertation","id":"18062"}]},"page":"129","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","ddc":["000"],"degree_awarded":"PhD","article_processing_charge":"No","type":"dissertation","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"file":[{"checksum":"5d785645805a78c5b4ce7cc3df557b09","file_id":"17570","date_updated":"2024-09-05T12:04:11Z","file_name":"thesis-final.zip","access_level":"closed","relation":"source_file","date_created":"2024-09-05T12:04:11Z","file_size":1615167,"content_type":"application/zip","creator":"efrantar"},{"file_id":"17880","checksum":"a9dd1c2d23734986924eb44ebb55fd8f","success":1,"date_updated":"2024-09-06T16:24:59Z","file_name":"frantar_thesis_final.pdf","access_level":"open_access","date_created":"2024-09-06T16:24:59Z","relation":"main_file","file_size":2376611,"content_type":"application/pdf","creator":"efrantar"}],"citation":{"short":"E. Frantar, Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws, Institute of Science and Technology Austria, 2024.","chicago":"Frantar, Elias. “Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>.","ista":"Frantar E. 2024. Compressing large neural networks : Algorithms, systems and scaling laws. Institute of Science and Technology Austria.","ama":"Frantar E. Compressing large neural networks : Algorithms, systems and scaling laws. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>","ieee":"E. Frantar, “Compressing large neural networks : Algorithms, systems and scaling laws,” Institute of Science and Technology Austria, 2024.","mla":"Frantar, Elias. <i>Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>.","apa":"Frantar, E. (2024). <i>Compressing large neural networks : Algorithms, systems and scaling laws</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>"},"has_accepted_license":"1","title":"Compressing large neural networks : Algorithms, systems and scaling laws","_id":"17485","OA_place":"publisher","supervisor":[{"last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"date_updated":"2026-06-18T17:58:39Z","alternative_title":["ISTA Thesis"],"day":"05","project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"author":[{"first_name":"Elias","last_name":"Frantar","full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"}],"publication_status":"published","corr_author":"1","language":[{"iso":"eng"}],"oa":1,"date_created":"2024-09-02T11:01:48Z","year":"2024","date_published":"2024-09-05T00:00:00Z","file_date_updated":"2024-09-06T16:24:59Z","acknowledged_ssus":[{"_id":"ScienComp"}],"month":"09","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."}]},{"project":[{"_id":"9B767A34-BA93-11EA-9121-9846C619BF3A","grant_number":"429960716","name":"Evolution of Sensorimotor Transformation Across Diptera"}],"oa_version":"Published Version","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","related_material":{"record":[{"status":"public","id":"18444","relation":"used_in_publication"}]},"status":"public","doi":"10.15479/AT:ISTA:17488","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_processing_charge":"No","type":"research_data","corr_author":"1","ddc":["570"],"author":[{"first_name":"Roshan K","last_name":"Satapathy","orcid":"0009-0006-2974-5075","full_name":"Satapathy, Roshan K","id":"46046B7A-F248-11E8-B48F-1D18A9856A87"},{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","last_name":"Jösch","first_name":"Maximilian A"},{"last_name":"Symonova","first_name":"Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga","orcid":"0000-0003-2012-9947"},{"full_name":"Pokusaeva, Victoria","orcid":"0000-0001-7660-444X","id":"3184041C-F248-11E8-B48F-1D18A9856A87","first_name":"Victoria","last_name":"Pokusaeva"}],"date_created":"2024-09-03T17:42:46Z","_id":"17488","title":"Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies","date_published":"2024-09-01T00:00:00Z","file_date_updated":"2024-09-03T17:39:32Z","year":"2024","file":[{"success":1,"checksum":"df9d6c8ddffa046c3b1639281f83cfcf","file_id":"17489","file_name":"BehaviouralData.zip","date_updated":"2024-09-03T17:39:32Z","date_created":"2024-09-03T17:39:32Z","relation":"main_file","access_level":"open_access","creator":"rsatapat","file_size":965778072,"content_type":"application/x-zip-compressed"}],"department":[{"_id":"GradSch"},{"_id":"MaJö"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","oa":1,"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:<a href=\"https://doi.org/10.15479/AT:ISTA:17488\">10.15479/AT:ISTA:17488</a>","apa":"Satapathy, R. K., Jösch, M. A., Symonova, O., &#38; Pokusaeva, V. (2024). Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:17488\">https://doi.org/10.15479/AT:ISTA:17488</a>","mla":"Satapathy, Roshan K., et al. <i>Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:17488\">10.15479/AT:ISTA:17488</a>.","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.","short":"R.K. Satapathy, M.A. Jösch, O. Symonova, V. Pokusaeva, (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, <a href=\"https://doi.org/10.15479/AT:ISTA:17488\">10.15479/AT:ISTA:17488</a>.","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. <a href=\"https://doi.org/10.15479/AT:ISTA:17488\">https://doi.org/10.15479/AT:ISTA:17488</a>."},"keyword":["drosophila","behaviour","locomotion","gap junctions"],"month":"09","acknowledged_ssus":[{"_id":"M-Shop"}],"abstract":[{"text":"Behavioural data for Pokusaeva, Satapathy et al. Relevant information can be found in the 'README.txt' file.","lang":"eng"}],"date_updated":"2026-06-10T07:58:35Z"},{"date_updated":"2026-06-18T17:55:23Z","day":"04","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","citation":{"chicago":"Markov, Ilia. “Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17490\">https://doi.org/10.15479/at:ista:17490</a>.","ista":"Markov I. 2024. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. Institute of Science and Technology Austria.","short":"I. Markov, Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective, Institute of Science and Technology Austria, 2024.","ieee":"I. Markov, “Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective,” Institute of Science and Technology Austria, 2024.","apa":"Markov, I. (2024). <i>Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17490\">https://doi.org/10.15479/at:ista:17490</a>","mla":"Markov, Ilia. <i>Communication-Efficient Distributed Training of Deep Neural Networks : An Algorithms and Systems Perspective</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17490\">10.15479/at:ista:17490</a>.","ama":"Markov I. Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17490\">10.15479/at:ista:17490</a>"},"file":[{"checksum":"77609f4835d2730e46fa0d42d9134ed9","file_id":"17491","date_updated":"2024-09-04T08:35:35Z","file_name":"Thesis.zip","access_level":"closed","relation":"source_file","date_created":"2024-09-04T08:35:35Z","content_type":"application/x-zip-compressed","file_size":43327753,"creator":"imarkov"},{"file_name":"Thesis_final_version_pdfa2.pdf","date_updated":"2024-09-04T08:36:06Z","success":1,"checksum":"9e68f7217570f756ceb8f70b980938cd","file_id":"17492","creator":"imarkov","content_type":"application/pdf","file_size":2756082,"relation":"main_file","date_created":"2024-09-04T08:36:06Z","access_level":"open_access"}],"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"publisher":"Institute of Science and Technology Austria","OA_place":"publisher","supervisor":[{"last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"title":"Communication-efficient distributed training of deep neural networks : An algorithms and systems perspective","_id":"17490","ddc":["000"],"degree_awarded":"PhD","type":"dissertation","article_processing_charge":"No","doi":"10.15479/at:ista:17490","publication_identifier":{"issn":["2663-337X"]},"status":"public","ec_funded":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","page":"102","related_material":{"record":[{"relation":"part_of_dissertation","id":"14461","status":"public"},{"relation":"part_of_dissertation","id":"12780","status":"public"},{"relation":"part_of_dissertation","id":"17456","status":"public"}]},"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"}],"month":"09","acknowledged_ssus":[{"_id":"ScienComp"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","language":[{"iso":"eng"}],"oa":1,"file_date_updated":"2024-09-04T08:36:06Z","date_published":"2024-09-04T00:00:00Z","year":"2024","date_created":"2024-09-04T08:51:11Z","author":[{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","full_name":"Markov, Ilia","last_name":"Markov","first_name":"Ilia"}],"corr_author":"1","publication_status":"published","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020"}]},{"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."}],"month":"10","APC_amount":"2748 EUR","volume":15222,"date_published":"2024-10-26T00:00:00Z","file_date_updated":"2025-01-21T14:39:49Z","year":"2024","date_created":"2024-09-05T14:27:08Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. N. Mazzocchi was affiliated with ISTA when his collaboration started.","language":[{"iso":"eng"}],"isi":1,"oa":1,"intvolume":"     15222","external_id":{"arxiv":["2409.03569"],"isi":["001419008700001"]},"corr_author":"1","publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"author":[{"last_name":"Chalupa","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"first_name":"Nicolas Adrien","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"last_name":"Sarac","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E"}],"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"day":"26","alternative_title":["LNCS"],"date_updated":"2026-04-07T12:02:57Z","OA_type":"hybrid","OA_place":"publisher","_id":"17634","title":"QuAK: Quantitative Automata Kit","publication":"12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation","has_accepted_license":"1","citation":{"apa":"Chalupa, M., Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2024). QuAK: Quantitative Automata Kit. In <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i> (Vol. 15222, pp. 3–20). Crete, Greece: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-75387-9_1\">https://doi.org/10.1007/978-3-031-75387-9_1</a>","mla":"Chalupa, Marek, et al. “QuAK: Quantitative Automata Kit.” <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i>, vol. 15222, Springer Nature, 2024, pp. 3–20, doi:<a href=\"https://doi.org/10.1007/978-3-031-75387-9_1\">10.1007/978-3-031-75387-9_1</a>.","ieee":"M. Chalupa, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “QuAK: Quantitative Automata Kit,” in <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i>, Crete, Greece, 2024, vol. 15222, pp. 3–20.","ama":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. QuAK: Quantitative Automata Kit. In: <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i>. Vol 15222. Springer Nature; 2024:3-20. doi:<a href=\"https://doi.org/10.1007/978-3-031-75387-9_1\">10.1007/978-3-031-75387-9_1</a>","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.","chicago":"Chalupa, Marek, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “QuAK: Quantitative Automata Kit.” In <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i>, 15222:3–20. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-75387-9_1\">https://doi.org/10.1007/978-3-031-75387-9_1</a>.","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."},"file":[{"file_id":"17635","checksum":"43e432f82be376434b358f3dd7a94b71","success":1,"date_updated":"2024-09-05T14:26:02Z","file_name":"isola24.pdf","access_level":"open_access","date_created":"2024-09-05T14:26:02Z","relation":"main_file","content_type":"application/pdf","file_size":847422,"creator":"esarac"},{"access_level":"open_access","relation":"main_file","date_created":"2025-01-21T14:39:49Z","content_type":"application/pdf","file_size":1358706,"creator":"dernst","checksum":"6bc04f07bb5612c0e7ea00ac121a69b6","file_id":"18865","success":1,"date_updated":"2025-01-21T14:39:49Z","file_name":"2024_LNCS_Chalupa.pdf"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Springer Nature","type":"conference","article_processing_charge":"Yes (in subscription journal)","arxiv":1,"ddc":["000"],"scopus_import":"1","oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"status":"public","id":"20147","relation":"dissertation_contains"}]},"page":"3-20","conference":{"end_date":"2024-10-31","start_date":"2024-10-27","name":"ISoLA: International Symposium on Leveraging Applications","location":"Crete, Greece"},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031753862"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-031-75387-9_1","quality_controlled":"1","status":"public","ec_funded":1},{"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020"},{"_id":"26580278-B435-11E9-9278-68D0E5697425","grant_number":"771209","call_identifier":"H2020","name":"Characterizing the fitness landscape on population and global scales"}],"author":[{"id":"4720D23C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9139-5383","full_name":"Gonzalez Somermeyer, Louisa","last_name":"Gonzalez Somermeyer","first_name":"Louisa"}],"corr_author":"1","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)"},"publication_status":"published","oa":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","language":[{"iso":"eng"}],"year":"2024","date_published":"2024-09-06T00:00:00Z","file_date_updated":"2024-09-27T10:34:34Z","date_created":"2024-09-06T12:57:44Z","abstract":[{"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.","lang":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"ScienComp"}],"month":"09","doi":"10.15479/at:ista:17850","publication_identifier":{"issn":["2663-337X"]},"status":"public","ec_funded":1,"related_material":{"link":[{"url":"https://github.com/aequorea238/Orthologous_GFP_Fitness_Peaks","relation":"software"}],"record":[{"status":"public","id":"11448","relation":"part_of_dissertation"}]},"page":"89","oa_version":"Published Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["570"],"degree_awarded":"PhD","type":"dissertation","article_processing_charge":"No","citation":{"ista":"Gonzalez Somermeyer L. 2024. Fitness landscapes of orthologous green fluorescent proteins. Institute of Science and Technology Austria.","chicago":"Gonzalez Somermeyer, Louisa. “Fitness Landscapes of Orthologous Green Fluorescent Proteins.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17850\">https://doi.org/10.15479/at:ista:17850</a>.","short":"L. Gonzalez Somermeyer, Fitness Landscapes of Orthologous Green Fluorescent Proteins, Institute of Science and Technology Austria, 2024.","apa":"Gonzalez Somermeyer, L. (2024). <i>Fitness landscapes of orthologous green fluorescent proteins</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17850\">https://doi.org/10.15479/at:ista:17850</a>","mla":"Gonzalez Somermeyer, Louisa. <i>Fitness Landscapes of Orthologous Green Fluorescent Proteins</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17850\">10.15479/at:ista:17850</a>.","ieee":"L. Gonzalez Somermeyer, “Fitness landscapes of orthologous green fluorescent proteins,” Institute of Science and Technology Austria, 2024.","ama":"Gonzalez Somermeyer L. Fitness landscapes of orthologous green fluorescent proteins. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17850\">10.15479/at:ista:17850</a>"},"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"FyKo"}],"file":[{"file_id":"18151","checksum":"d3303724e8d3c91321d71bbad4062048","file_name":"louisa_thesis_draft__240904b.pdf","date_updated":"2024-09-27T10:32:33Z","date_created":"2024-09-27T10:32:33Z","relation":"main_file","access_level":"open_access","creator":"lgonzale","content_type":"application/pdf","file_size":11219837},{"file_name":"louisa_thesis_draft__240904b.docx","date_updated":"2024-09-27T10:34:34Z","file_id":"18152","checksum":"22e63f7f9014dffde2af7a47e7d1d014","creator":"lgonzale","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":43338677,"date_created":"2024-09-27T10:34:34Z","relation":"source_file","access_level":"closed"}],"OA_place":"publisher","supervisor":[{"last_name":"Kondrashov","first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor"}],"title":"Fitness landscapes of orthologous green fluorescent proteins","_id":"17850","date_updated":"2026-04-07T13:25:01Z","alternative_title":["ISTA Thesis"],"day":"06"},{"date_updated":"2025-12-02T13:45:38Z","OA_type":"gold","day":"01","alternative_title":["LIPIcs"],"has_accepted_license":"1","publication":"35th International Conference on Concurrency Theory","citation":{"chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.29</a>.","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.","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.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Strategic dominance: A new preorder for nondeterministic processes,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2024). Strategic dominance: A new preorder for nondeterministic processes. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.29</a>","mla":"Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">10.4230/LIPIcs.CONCUR.2024.29</a>.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder for nondeterministic processes. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">10.4230/LIPIcs.CONCUR.2024.29</a>"},"file":[{"access_level":"open_access","date_created":"2024-09-17T07:48:56Z","relation":"main_file","content_type":"application/pdf","file_size":964124,"creator":"dernst","checksum":"555bd343e1fb38adeab8fc465ff4fad8","file_id":"18081","success":1,"date_updated":"2024-09-17T07:48:56Z","file_name":"2024_LIPICS_Henzinger.pdf"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"OA_place":"publisher","_id":"18068","title":"Strategic dominance: A new preorder for nondeterministic processes","ddc":["000"],"type":"conference","article_processing_charge":"Yes","arxiv":1,"publication_identifier":{"isbn":["9783959773393"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.CONCUR.2024.29","quality_controlled":"1","ec_funded":1,"status":"public","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","conference":{"end_date":"2024-09-13","location":"Calgary, Canada","name":"CONCUR: Conference on Concurrency Theory","start_date":"2024-09-09"},"volume":311,"abstract":[{"text":"We study the following refinement relation between nondeterministic state-transition models: model ℬ strategically dominates model 𝒜 iff every deterministic refinement of 𝒜 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 𝒜 and ℬ: every strategy that resolves the nondeterminism of 𝒜 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.","lang":"eng"}],"month":"09","isi":1,"oa":1,"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.","language":[{"iso":"eng"}],"intvolume":"       311","date_published":"2024-09-01T00:00:00Z","file_date_updated":"2024-09-17T07:48:56Z","year":"2024","date_created":"2024-09-15T22:01:40Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien","last_name":"Mazzocchi"},{"full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","last_name":"Sarac"}],"external_id":{"arxiv":["2407.10473"],"isi":["001556847400029"]},"corr_author":"1","publication_status":"published","article_number":"29","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}]},{"abstract":[{"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.","lang":"eng"}],"month":"09","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"language":[{"iso":"eng"}],"oa":1,"date_published":"2024-09-18T00:00:00Z","file_date_updated":"2024-09-19T09:20:33Z","year":"2024","date_created":"2024-09-16T12:58:36Z","author":[{"last_name":"Sagi","first_name":"Oliver","id":"71616374-A8E9-11E9-A7CA-09ECE5697425","full_name":"Sagi, Oliver"}],"corr_author":"1","publication_status":"published","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"project":[{"_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a","grant_number":"P36507","name":"Merging spin and superconducting qubits in planar Ge"},{"name":"High impedance circuit quantum electrodynamics with hole spins","grant_number":"I05060","_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1"},{"name":"Hybrid Semiconductor - Superconductor Quantum Devices","_id":"262116AA-B435-11E9-9278-68D0E5697425"},{"_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","call_identifier":"H2020","grant_number":"862046"}],"date_updated":"2026-04-16T12:20:39Z","day":"18","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","citation":{"ama":"Sagi O. Hybrid circuits on planar Germanium. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18076\">10.15479/at:ista:18076</a>","apa":"Sagi, O. (2024). <i>Hybrid circuits on planar Germanium</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18076\">https://doi.org/10.15479/at:ista:18076</a>","mla":"Sagi, Oliver. <i>Hybrid Circuits on Planar Germanium</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18076\">10.15479/at:ista:18076</a>.","ieee":"O. Sagi, “Hybrid circuits on planar Germanium,” Institute of Science and Technology Austria, 2024.","short":"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.","chicago":"Sagi, Oliver. “Hybrid Circuits on Planar Germanium.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18076\">https://doi.org/10.15479/at:ista:18076</a>."},"file":[{"success":1,"checksum":"d01d0e2846c2f3ac5bb14d321554a4cd","file_id":"18093","file_name":"OliverSagi_Thesis_pdfa.pdf","date_updated":"2024-09-18T14:13:01Z","date_created":"2024-09-18T14:13:01Z","relation":"main_file","access_level":"open_access","creator":"osagi","content_type":"application/pdf","file_size":86679095},{"file_id":"18094","checksum":"0543f473d509ee545f4ed3a56f742f4b","date_updated":"2024-09-19T09:20:33Z","file_name":"Thesis_OliverSagi.zip","access_level":"local","relation":"source_file","date_created":"2024-09-18T14:14:02Z","content_type":"application/x-zip-compressed","file_size":172098524,"creator":"osagi"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"GeKa"}],"supervisor":[{"last_name":"Katsaros","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios"}],"OA_place":"publisher","title":"Hybrid circuits on planar Germanium","_id":"18076","ddc":["539"],"degree_awarded":"PhD","type":"dissertation","article_processing_charge":"No","doi":"10.15479/at:ista:18076","publication_identifier":{"issn":["2663-337X"]},"status":"public","ec_funded":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","page":"111","related_material":{"record":[{"status":"public","id":"17202","relation":"part_of_dissertation"}]}},{"article_processing_charge":"No","type":"conference","status":"public","doi":"10.1007/978-3-031-71073-5_14","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783031710735"],"isbn":["9783031710728"]},"quality_controlled":"1","conference":{"start_date":"2024-09-11","name":"SCN: Security and Cryptography for Networks","location":"Amalfi, Italy","end_date":"2024-09-13"},"oa_version":"None","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"294–313","related_material":{"record":[{"id":"18088","relation":"dissertation_contains","status":"public"}]},"date_updated":"2026-04-07T13:01:26Z","day":"10","alternative_title":["LNCS"],"publisher":"Springer Nature","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"publication":"Security and Cryptography for Networks: 14th International Conference","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. <i>Security and Cryptography for Networks: 14th International Conference</i>. Vol 14974. Cham: Springer Nature; 2024:294–313. doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>","apa":"Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., &#38; Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In C. Galdi &#38; D. H. Phan (Eds.), <i>Security and Cryptography for Networks: 14th International Conference</i> (Vol. 14974, pp. 294–313). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>","mla":"Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>.","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 <i>Security and Cryptography for Networks: 14th International Conference</i>, Amalfi, Italy, 2024, vol. 14974, pp. 294–313.","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.","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.","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 <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>."},"place":"Cham","_id":"18086","title":"DeCAF: Decentralizable CGKA with fast healing","author":[{"first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Auerbach","first_name":"Benedikt","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","orcid":"0000-0002-7553-6606","full_name":"Auerbach, Benedikt"},{"orcid":"0000-0002-2505-4246","full_name":"Cueto Noval, Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","first_name":"Miguel","last_name":"Cueto Noval"},{"first_name":"Karen","last_name":"Klein","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","full_name":"Pascual Perez, Guillermo","orcid":"0000-0001-8630-415X","last_name":"Pascual Perez","first_name":"Guillermo"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","external_id":{"isi":["001330408000014"]},"corr_author":"1","volume":14974,"month":"09","abstract":[{"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.","lang":"eng"}],"intvolume":"     14974","isi":1,"language":[{"iso":"eng"}],"date_created":"2024-09-18T11:35:14Z","editor":[{"first_name":"Clemente","last_name":"Galdi","full_name":"Galdi, Clemente"},{"last_name":"Phan","first_name":"Duong Hieu","full_name":"Phan, Duong Hieu"}],"date_published":"2024-09-10T00:00:00Z","year":"2024"},{"project":[{"grant_number":"F100403","name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions","_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3"},{"call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","call_identifier":"H2020"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","call_identifier":"FWF","name":"FWF Open Access Fund"}],"DOAJ_listed":"1","author":[{"full_name":"Maslov, Mikhail","orcid":"0000-0003-4074-2570","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","last_name":"Maslov"},{"full_name":"Koutentakis, Georgios","id":"d7b23d3a-9e21-11ec-b482-f76739596b95","first_name":"Georgios","last_name":"Koutentakis"},{"last_name":"Hrast","first_name":"Mateja","id":"48dbb294-2a9c-11ef-905d-f56be71f0e5d","full_name":"Hrast, Mateja"},{"last_name":"Heckl","first_name":"Oliver H.","full_name":"Heckl, Oliver H."},{"last_name":"Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802"}],"publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"033277","external_id":{"arxiv":["2310.00095"]},"corr_author":"1","intvolume":"         6","issue":"3","oa":1,"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.","language":[{"iso":"eng"}],"date_created":"2024-09-18T11:43:16Z","file_date_updated":"2024-09-23T09:46:20Z","date_published":"2024-09-10T00:00:00Z","year":"2024","article_type":"original","volume":6,"APC_amount":"3028,31 EUR","month":"09","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."}],"status":"public","ec_funded":1,"doi":"10.1103/physrevresearch.6.033277","publication_identifier":{"eissn":["2643-1564"]},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","scopus_import":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19048"}]},"ddc":["530"],"article_processing_charge":"Yes","arxiv":1,"type":"journal_article","file":[{"file_name":"2024_PhysicalReviewResearch_Maslov.pdf","date_updated":"2024-09-23T09:46:20Z","success":1,"checksum":"8f744d94956a1683b473b1cf9b411a37","file_id":"18125","creator":"dernst","content_type":"application/pdf","file_size":1563824,"relation":"main_file","date_created":"2024-09-23T09:46:20Z","access_level":"open_access"}],"publisher":"American Physical Society","department":[{"_id":"GradSch"},{"_id":"MiLe"}],"publication":"Physical Review Research","has_accepted_license":"1","citation":{"ieee":"M. Maslov, G. Koutentakis, M. Hrast, O. H. Heckl, and M. Lemeshko, “Theory of angular momentum transfer from light to molecules,” <i>Physical Review Research</i>, vol. 6, no. 3. American Physical Society, 2024.","mla":"Maslov, Mikhail, et al. “Theory of Angular Momentum Transfer from Light to Molecules.” <i>Physical Review Research</i>, vol. 6, no. 3, 033277, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">10.1103/physrevresearch.6.033277</a>.","apa":"Maslov, M., Koutentakis, G., Hrast, M., Heckl, O. H., &#38; Lemeshko, M. (2024). Theory of angular momentum transfer from light to molecules. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">https://doi.org/10.1103/physrevresearch.6.033277</a>","ama":"Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. Theory of angular momentum transfer from light to molecules. <i>Physical Review Research</i>. 2024;6(3). doi:<a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">10.1103/physrevresearch.6.033277</a>","chicago":"Maslov, Mikhail, Georgios Koutentakis, Mateja Hrast, Oliver H. Heckl, and Mikhail Lemeshko. “Theory of Angular Momentum Transfer from Light to Molecules.” <i>Physical Review Research</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">https://doi.org/10.1103/physrevresearch.6.033277</a>.","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.","short":"M. Maslov, G. Koutentakis, M. Hrast, O.H. Heckl, M. Lemeshko, Physical Review Research 6 (2024)."},"_id":"18087","title":"Theory of angular momentum transfer from light to molecules","OA_place":"publisher","OA_type":"gold","date_updated":"2026-04-07T11:52:53Z","day":"10"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","related_material":{"record":[{"relation":"part_of_dissertation","id":"10408","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"11476"},{"status":"public","relation":"part_of_dissertation","id":"18086"},{"status":"public","relation":"part_of_dissertation","id":"10049"}]},"page":"239","status":"public","ec_funded":1,"publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/at:ista:18088","article_processing_charge":"No","type":"dissertation","ddc":["000"],"degree_awarded":"PhD","title":"On the efficiency and security of secure group messaging","_id":"18088","supervisor":[{"first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","file":[{"file_id":"18099","checksum":"ce0dca715b3df48e52e2e891b6ac1bc5","file_name":"thesis_bundle.zip","date_updated":"2024-09-19T12:35:38Z","relation":"source_file","date_created":"2024-09-19T12:35:38Z","access_level":"closed","creator":"gpascual","content_type":"application/x-zip-compressed","file_size":11917734},{"access_level":"open_access","date_created":"2024-09-19T12:36:08Z","relation":"main_file","content_type":"application/pdf","file_size":2729427,"creator":"gpascual","checksum":"4a2c72e90f1a0ef2a13cff800f8d1265","file_id":"18100","date_updated":"2024-09-19T12:36:08Z","file_name":"thesis_gpasper.pdf"}],"department":[{"_id":"KrPi"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","citation":{"ieee":"G. Pascual Perez, “On the efficiency and security of secure group messaging,” Institute of Science and Technology Austria, 2024.","mla":"Pascual Perez, Guillermo. <i>On the Efficiency and Security of Secure Group Messaging</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>.","apa":"Pascual Perez, G. (2024). <i>On the efficiency and security of secure group messaging</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>","ama":"Pascual Perez G. On the efficiency and security of secure group messaging. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>","chicago":"Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group Messaging.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>.","ista":"Pascual Perez G. 2024. On the efficiency and security of secure group messaging. Institute of Science and Technology Austria.","short":"G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging, Institute of Science and Technology Austria, 2024."},"day":"18","alternative_title":["ISTA Thesis"],"date_updated":"2026-04-07T13:01:26Z","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"corr_author":"1","author":[{"full_name":"Pascual Perez, Guillermo","orcid":"0000-0001-8630-415X","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","first_name":"Guillermo","last_name":"Pascual Perez"}],"date_created":"2024-09-18T12:59:49Z","date_published":"2024-09-18T00:00:00Z","file_date_updated":"2024-09-19T12:36:08Z","year":"2024","oa":1,"language":[{"iso":"eng"}],"month":"09","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. "}]},{"author":[{"orcid":"0000-0003-4476-2288","full_name":"Lauritsen, Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","first_name":"Asbjørn Bækgaard","last_name":"Lauritsen"},{"first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","external_id":{"arxiv":["2407.05990"],"isi":["001307817400001"]},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"e78","publication_status":"published","project":[{"grant_number":"I06427","name":"Mathematical Challenges in BCS Theory of Superconductivity","_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b"}],"volume":12,"abstract":[{"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).","lang":"eng"}],"month":"09","oa":1,"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.","isi":1,"language":[{"iso":"eng"}],"intvolume":"        12","article_type":"original","year":"2024","file_date_updated":"2024-09-23T09:56:17Z","date_published":"2024-09-09T00:00:00Z","date_created":"2024-09-20T12:25:25Z","ddc":["510"],"type":"journal_article","arxiv":1,"article_processing_charge":"Yes","quality_controlled":"1","publication_identifier":{"issn":["2050-5094"]},"doi":"10.1017/fms.2024.56","status":"public","related_material":{"record":[{"status":"public","id":"18135","relation":"dissertation_contains"}]},"scopus_import":"1","oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-04-07T13:01:40Z","day":"09","citation":{"chicago":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2024. <a href=\"https://doi.org/10.1017/fms.2024.56\">https://doi.org/10.1017/fms.2024.56</a>.","ista":"Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.","short":"A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024).","ieee":"A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi gas: Lower bound,” <i>Forum of Mathematics, Sigma</i>, vol. 12. Cambridge University Press, 2024.","apa":"Lauritsen, A. B., &#38; Seiringer, R. (2024). Pressure of a dilute spin-polarized Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2024.56\">https://doi.org/10.1017/fms.2024.56</a>","mla":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>, vol. 12, e78, Cambridge University Press, 2024, doi:<a href=\"https://doi.org/10.1017/fms.2024.56\">10.1017/fms.2024.56</a>.","ama":"Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. 2024;12. doi:<a href=\"https://doi.org/10.1017/fms.2024.56\">10.1017/fms.2024.56</a>"},"publication":"Forum of Mathematics, Sigma","has_accepted_license":"1","publisher":"Cambridge University Press","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"file":[{"creator":"dernst","file_size":599886,"content_type":"application/pdf","relation":"main_file","date_created":"2024-09-23T09:56:17Z","access_level":"open_access","file_name":"2024_ForumMath_Lauritsen.pdf","date_updated":"2024-09-23T09:56:17Z","success":1,"checksum":"330b881240013213a8e08538fec13d29","file_id":"18126"}],"_id":"18107","title":"Pressure of a dilute spin-polarized Fermi gas: Lower bound"},{"status":"public","quality_controlled":"1","publication_identifier":{"eissn":["2640-3498"]},"conference":{"end_date":"2024-07-27","location":"Vienna, Austria","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-21"},"page":"12284-12303","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Preprint","article_processing_charge":"No","arxiv":1,"type":"conference","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"publisher":"ML Research Press","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2401.06118"}],"citation":{"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.","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 <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:12284–303. ML Research Press, 2024.","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.","apa":"Egiazarian, V., Panferov, A., Kuznedelev, D., Frantar, E., Babenko, A., &#38; Alistarh, D.-A. (2024). Extreme compression of large language models via additive quantization. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 12284–12303). Vienna, Austria: ML Research Press.","mla":"Egiazarian, Vage, et al. “Extreme Compression of Large Language Models via Additive Quantization.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 12284–303.","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 <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 12284–12303.","ama":"Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A. Extreme compression of large language models via additive quantization. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:12284-12303."},"publication":"Proceedings of the 41st International Conference on Machine Learning","_id":"18113","title":"Extreme compression of large language models via additive quantization","date_updated":"2024-10-01T08:13:05Z","alternative_title":["PMLR"],"day":"01","author":[{"first_name":"Vage","last_name":"Egiazarian","full_name":"Egiazarian, Vage"},{"first_name":"Andrei","last_name":"Panferov","full_name":"Panferov, Andrei","id":"2c18daae-4dbe-11ef-8491-98ce2d960f09"},{"full_name":"Kuznedelev, Denis","first_name":"Denis","last_name":"Kuznedelev"},{"full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","first_name":"Elias","last_name":"Frantar"},{"full_name":"Babenko, Artem","first_name":"Artem","last_name":"Babenko"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"}],"publication_status":"published","corr_author":"1","external_id":{"arxiv":["2401.06118"]},"intvolume":"       235","oa":1,"language":[{"iso":"eng"}],"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.","date_created":"2024-09-22T22:01:43Z","year":"2024","date_published":"2024-09-01T00:00:00Z","volume":235,"month":"09","abstract":[{"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.","lang":"eng"}]},{"day":"01","date_updated":"2024-10-01T08:22:01Z","title":"RoSA: Accurate parameter-efficient fine-tuning via robust adaptation","_id":"18117","publication":"Proceedings of the 41st International Conference on Machine Learning","citation":{"ama":"Nikdan M, Tabesh S, Crncevic E, Alistarh D-A. RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:38187-38206.","ieee":"M. Nikdan, S. Tabesh, E. Crncevic, and D.-A. Alistarh, “RoSA: Accurate parameter-efficient fine-tuning via robust adaptation,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 38187–38206.","mla":"Nikdan, Mahdi, et al. “RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 38187–206.","apa":"Nikdan, M., Tabesh, S., Crncevic, E., &#38; Alistarh, D.-A. (2024). RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 38187–38206). Vienna, Austria: ML Research Press.","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.","chicago":"Nikdan, Mahdi, Soroush Tabesh, Elvir Crncevic, and Dan-Adrian Alistarh. “RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:38187–206. ML Research Press, 2024.","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."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2401.04679"}],"publisher":"ML Research Press","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"type":"conference","article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/IST-DASLab/RoSA"}]},"page":"38187-38206","conference":{"start_date":"2024-07-21","name":"ICML: International Conference on Machine Learning","location":"Vienna, Austria","end_date":"2024-07-27"},"publication_identifier":{"eissn":["2640-3498"]},"quality_controlled":"1","status":"public","abstract":[{"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.","lang":"eng"}],"month":"09","volume":235,"date_published":"2024-09-01T00:00:00Z","year":"2024","date_created":"2024-09-22T22:01:44Z","oa":1,"language":[{"iso":"eng"}],"acknowledgement":"The authors would like to thank Eldar Kurtic for experimental support and useful suggestions throughout the project","intvolume":"       235","external_id":{"arxiv":["2401.04679"]},"corr_author":"1","publication_status":"published","author":[{"id":"66374281-f394-11eb-9cf6-869147deecc0","full_name":"Nikdan, Mahdi","last_name":"Nikdan","first_name":"Mahdi"},{"first_name":"Soroush","last_name":"Tabesh","full_name":"Tabesh, Soroush","orcid":"0009-0003-4119-6281","id":"06000900-6068-11ef-8d61-c2472ef2e752"},{"first_name":"Elvir","last_name":"Crncevic","full_name":"Crncevic, Elvir","id":"41888001-440d-11ef-8299-d0e838b8185e"},{"last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}]},{"author":[{"first_name":"Jakob","last_name":"Glas","full_name":"Glas, Jakob","id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb"}],"corr_author":"1","publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"project":[{"_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3","name":"Rational curves via function field analytic number theory","grant_number":"P36278"}],"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"}],"month":"09","language":[{"iso":"eng"}],"oa":1,"file_date_updated":"2024-09-25T14:08:57Z","date_published":"2024-09-23T00:00:00Z","year":"2024","date_created":"2024-09-23T18:58:08Z","degree_awarded":"PhD","ddc":["512"],"type":"dissertation","article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/at:ista:18132","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"18293","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"18294"},{"id":"18295","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"18173","status":"public"}]},"page":"195","date_updated":"2026-04-07T12:53:54Z","day":"23","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","citation":{"short":"J. Glas, Counting Rational Points over Function Fields, Institute of Science and Technology Austria, 2024.","chicago":"Glas, Jakob. “Counting Rational Points over Function Fields.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18132\">https://doi.org/10.15479/at:ista:18132</a>.","ista":"Glas J. 2024. Counting rational points over function fields. Institute of Science and Technology Austria.","ama":"Glas J. Counting rational points over function fields. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18132\">10.15479/at:ista:18132</a>","ieee":"J. Glas, “Counting rational points over function fields,” Institute of Science and Technology Austria, 2024.","apa":"Glas, J. (2024). <i>Counting rational points over function fields</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18132\">https://doi.org/10.15479/at:ista:18132</a>","mla":"Glas, Jakob. <i>Counting Rational Points over Function Fields</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18132\">10.15479/at:ista:18132</a>."},"file":[{"file_id":"18133","checksum":"2f8cf5cefdab108b1979caa8146cae9a","file_name":"PhDthesis (3).zip","date_updated":"2024-09-23T18:49:22Z","date_created":"2024-09-23T18:49:22Z","relation":"source_file","access_level":"closed","creator":"jglas","content_type":"application/x-zip-compressed","file_size":5382106},{"file_id":"18140","checksum":"08bb6f14c42b47ff25882a2ce3ea0d8a","success":1,"date_updated":"2024-09-25T14:08:57Z","file_name":"example-phd.pdf","access_level":"open_access","relation":"main_file","date_created":"2024-09-25T14:08:57Z","file_size":2380127,"content_type":"application/pdf","creator":"jglas"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"TiBr"}],"supervisor":[{"first_name":"Timothy D","last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","title":"Counting rational points over function fields","_id":"18132"},{"oa":1,"language":[{"iso":"eng"}],"date_created":"2024-09-24T10:56:25Z","year":"2024","file_date_updated":"2024-09-26T13:12:55Z","date_published":"2024-09-23T00:00:00Z","month":"09","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$."}],"project":[{"grant_number":"I06427","name":"Mathematical Challenges in BCS Theory of Superconductivity","_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"author":[{"last_name":"Lauritsen","first_name":"Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","orcid":"0000-0003-4476-2288","full_name":"Lauritsen, Asbjørn Bækgaard"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"publisher":"Institute of Science and Technology Austria","file":[{"access_level":"open_access","date_created":"2024-09-26T13:11:24Z","relation":"main_file","content_type":"application/pdf","file_size":3648831,"creator":"alaurits","file_id":"18147","checksum":"c7bc3b31e430d57c65393051ca439575","success":1,"date_updated":"2024-09-26T13:11:24Z","file_name":"Lauritsen-thesis-final.pdf"},{"access_level":"closed","date_created":"2024-09-26T13:12:55Z","relation":"source_file","content_type":"application/x-zip-compressed","file_size":1625888,"creator":"alaurits","checksum":"39f6b1b7f83e25a3bf9f933f1ea0bc06","file_id":"18148","date_updated":"2024-09-26T13:12:55Z","file_name":"Lauritsen-thesis-source.zip"}],"citation":{"short":"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.","chicago":"Lauritsen, Asbjørn Bækgaard. “Energies of Dilute Fermi Gases and Universalities in BCS Theory.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18135\">https://doi.org/10.15479/at:ista:18135</a>.","ama":"Lauritsen AB. Energies of dilute Fermi gases and universalities in BCS theory. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18135\">10.15479/at:ista:18135</a>","mla":"Lauritsen, Asbjørn Bækgaard. <i>Energies of Dilute Fermi Gases and Universalities in BCS Theory</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18135\">10.15479/at:ista:18135</a>.","apa":"Lauritsen, A. B. (2024). <i>Energies of dilute Fermi gases and universalities in BCS theory</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18135\">https://doi.org/10.15479/at:ista:18135</a>","ieee":"A. B. Lauritsen, “Energies of dilute Fermi gases and universalities in BCS theory,” Institute of Science and Technology Austria, 2024."},"has_accepted_license":"1","title":"Energies of dilute Fermi gases and universalities in BCS theory","_id":"18135","supervisor":[{"first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","date_updated":"2026-04-16T08:17:55Z","alternative_title":["ISTA Thesis"],"day":"23","status":"public","ec_funded":1,"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-042-8"]},"doi":"10.15479/at:ista:18135","page":"353","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"11732"},{"status":"public","id":"14542","relation":"part_of_dissertation"},{"id":"18107","relation":"part_of_dissertation","status":"public"},{"id":"17240","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"14931","relation":"part_of_dissertation"}]},"oa_version":"Published Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["515","539"],"degree_awarded":"PhD","article_processing_charge":"No","type":"dissertation"},{"status":"public","quality_controlled":"1","doi":"10.1063/5.0226954","publication_identifier":{"eissn":["1089-7690"]},"oa_version":"Published Version","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["530"],"article_processing_charge":"Yes (in subscription journal)","arxiv":1,"type":"journal_article","publisher":"AIP Publishing","department":[{"_id":"GradSch"}],"file":[{"creator":"dernst","content_type":"application/pdf","file_size":15009000,"date_created":"2024-10-07T11:25:00Z","relation":"main_file","access_level":"open_access","file_name":"2024_JourChemicalPhysics_Wassermair.pdf","date_updated":"2024-10-07T11:25:00Z","success":1,"checksum":"f3874e64ef94e94b2376f00a1fee24c3","file_id":"18185"}],"citation":{"mla":"Wassermair, Michael, et al. “Fingerprints of Ordered Self-Assembled Structures in the Liquid Phase of a Hard-Core, Square-Shoulder System.” <i>The Journal of Chemical Physics</i>, vol. 161, no. 12, 124503, AIP Publishing, 2024, doi:<a href=\"https://doi.org/10.1063/5.0226954\">10.1063/5.0226954</a>.","apa":"Wassermair, M., Kahl, G., Roth, R., &#38; Archer, A. J. (2024). Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0226954\">https://doi.org/10.1063/5.0226954</a>","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,” <i>The Journal of chemical physics</i>, vol. 161, no. 12. AIP Publishing, 2024.","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. <i>The Journal of chemical physics</i>. 2024;161(12). doi:<a href=\"https://doi.org/10.1063/5.0226954\">10.1063/5.0226954</a>","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.","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.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2024. <a href=\"https://doi.org/10.1063/5.0226954\">https://doi.org/10.1063/5.0226954</a>.","short":"M. Wassermair, G. Kahl, R. Roth, A.J. Archer, The Journal of Chemical Physics 161 (2024)."},"has_accepted_license":"1","publication":"The Journal of chemical physics","_id":"18174","title":"Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system","date_updated":"2025-09-08T09:55:52Z","day":"28","author":[{"first_name":"Michael","last_name":"Wassermair","full_name":"Wassermair, Michael","id":"23d132c4-4e98-11ef-b275-9e8d4cd8c917"},{"full_name":"Kahl, Gerhard","first_name":"Gerhard","last_name":"Kahl"},{"last_name":"Roth","first_name":"Roland","full_name":"Roth, Roland"},{"last_name":"Archer","first_name":"Andrew J.","full_name":"Archer, Andrew J."}],"pmid":1,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"124503 ","publication_status":"published","corr_author":"1","external_id":{"pmid":["39344889"],"arxiv":["2409.06447"],"isi":["001325268300004"]},"intvolume":"       161","language":[{"iso":"eng"}],"issue":"12","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.","oa":1,"isi":1,"date_created":"2024-10-06T22:01:12Z","article_type":"original","year":"2024","date_published":"2024-09-28T00:00:00Z","file_date_updated":"2024-10-07T11:25:00Z","volume":161,"month":"09","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."}]},{"publication_status":"published","corr_author":"1","external_id":{"isi":["001328875900001"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Oliu-Barton","first_name":"Miquel","full_name":"Oliu-Barton, Miquel"},{"last_name":"Saona Urmeneta","first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"month":"10","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."}],"volume":50,"date_created":"2024-10-09T07:02:20Z","year":"2024","article_type":"original","date_published":"2024-10-01T00:00:00Z","intvolume":"        50","isi":1,"issue":"4","language":[{"iso":"eng"}],"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","type":"journal_article","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20234"}]},"page":"2433-3282","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","scopus_import":"1","status":"public","ec_funded":1,"quality_controlled":"1","doi":"10.1287/moor.2022.0332","publication_identifier":{"eissn":["1526-5471"],"issn":["0364-765X"]},"day":"01","OA_type":"closed access","date_updated":"2026-04-07T12:31:21Z","_id":"18266","title":"Value-positivity for matrix games","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Institute for Operations Research and the Management Sciences","citation":{"ieee":"K. Chatterjee, M. Oliu-Barton, and R. J. Saona Urmeneta, “Value-positivity for matrix games,” <i>Mathematics of Operations Research</i>, vol. 50, no. 4. Institute for Operations Research and the Management Sciences, pp. 2433–3282, 2024.","mla":"Chatterjee, Krishnendu, et al. “Value-Positivity for Matrix Games.” <i>Mathematics of Operations Research</i>, vol. 50, no. 4, Institute for Operations Research and the Management Sciences, 2024, pp. 2433–3282, doi:<a href=\"https://doi.org/10.1287/moor.2022.0332\">10.1287/moor.2022.0332</a>.","apa":"Chatterjee, K., Oliu-Barton, M., &#38; Saona Urmeneta, R. J. (2024). Value-positivity for matrix games. <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences. <a href=\"https://doi.org/10.1287/moor.2022.0332\">https://doi.org/10.1287/moor.2022.0332</a>","ama":"Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. Value-positivity for matrix games. <i>Mathematics of Operations Research</i>. 2024;50(4):2433-3282. doi:<a href=\"https://doi.org/10.1287/moor.2022.0332\">10.1287/moor.2022.0332</a>","chicago":"Chatterjee, Krishnendu, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Value-Positivity for Matrix Games.” <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences, 2024. <a href=\"https://doi.org/10.1287/moor.2022.0332\">https://doi.org/10.1287/moor.2022.0332</a>.","ista":"Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. 2024. Value-positivity for matrix games. Mathematics of Operations Research. 50(4), 2433–3282.","short":"K. Chatterjee, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2024) 2433–3282."},"publication":"Mathematics of Operations Research"},{"oa_version":"Published Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"id":"17219","relation":"part_of_dissertation","status":"public"}]},"page":"39","status":"public","doi":"10.15479/at:ista:18301","publication_identifier":{"issn":["2791-4585"]},"article_processing_charge":"No","type":"dissertation","degree_awarded":"MS","ddc":["000"],"title":"Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking","_id":"18301","supervisor":[{"first_name":"Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","file":[{"creator":"aetemadi","file_size":8914218,"content_type":"application/pdf","date_created":"2024-10-24T14:34:42Z","relation":"main_file","access_level":"open_access","file_name":"thesis-arian-etemadi.pdf","date_updated":"2024-10-24T14:34:42Z","success":1,"file_id":"18469","checksum":"80fb7923e229ad9d39253d7c8a8083d0"},{"checksum":"1c02586ed7d441d5ec441867650568d1","file_id":"18470","file_name":"thesis-arian-etemadi-latex-source.zip","date_updated":"2024-10-24T14:34:54Z","relation":"source_file","date_created":"2024-10-24T14:34:54Z","access_level":"closed","creator":"aetemadi","file_size":9802650,"content_type":"application/x-zip-compressed"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","keyword":["surface tracking","non-manifold","hole-filling","topology change","multi-material","solid-modeling"],"citation":{"ama":"Etemadi A. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>","mla":"Etemadi, Arian. <i>Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>.","apa":"Etemadi, A. (2024). <i>Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>","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.","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.","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.","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. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>."},"day":"15","alternative_title":["ISTA Master's Thesis"],"date_updated":"2026-04-07T13:02:36Z","publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","image":"/images/cc_by_sa.png","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"corr_author":"1","author":[{"first_name":"Arian","last_name":"Etemadihaghighi","full_name":"Etemadihaghighi, Arian","id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f"}],"date_created":"2024-10-11T19:52:20Z","file_date_updated":"2024-10-24T14:34:54Z","date_published":"2024-10-15T00:00:00Z","year":"2024","license":"https://creativecommons.org/licenses/by-sa/4.0/","oa":1,"language":[{"iso":"eng"}],"month":"10","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."}]},{"status":"public","doi":"10.15479/at:ista:18443","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"178","ddc":["516"],"degree_awarded":"PhD","article_processing_charge":"No","type":"dissertation","file":[{"date_created":"2024-10-23T14:42:45Z","relation":"main_file","access_level":"open_access","creator":"msisak","file_size":1672547,"content_type":"application/pdf","success":1,"checksum":"8c4893e726aaa4b3efb82758da9b6851","file_id":"18467","file_name":"MASisak_dissertation.pdf","date_updated":"2024-10-23T14:42:45Z"},{"date_updated":"2024-10-24T08:09:13Z","file_name":"MASisak_source.zip","file_id":"18468","checksum":"1831b072e861a1e5481024ca9d02b036","content_type":"application/x-zip-compressed","file_size":617913,"creator":"msisak","access_level":"closed","date_created":"2024-10-23T14:43:56Z","relation":"source_file"}],"department":[{"_id":"GradSch"},{"_id":"TaHa"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","citation":{"ista":"Sisak MA. 2024. T-dual branes on hyperkähler manifolds. Institute of Science and Technology Austria.","chicago":"Sisak, Maria A. “T-Dual Branes on Hyperkähler Manifolds.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18443\">https://doi.org/10.15479/at:ista:18443</a>.","short":"M.A. Sisak, T-Dual Branes on Hyperkähler Manifolds, Institute of Science and Technology Austria, 2024.","mla":"Sisak, Maria A. <i>T-Dual Branes on Hyperkähler Manifolds</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18443\">10.15479/at:ista:18443</a>.","apa":"Sisak, M. A. (2024). <i>T-dual branes on hyperkähler manifolds</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18443\">https://doi.org/10.15479/at:ista:18443</a>","ieee":"M. A. Sisak, “T-dual branes on hyperkähler manifolds,” Institute of Science and Technology Austria, 2024.","ama":"Sisak MA. T-dual branes on hyperkähler manifolds. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18443\">10.15479/at:ista:18443</a>"},"keyword":["hyperkaehler geometry","branes","mirror symmetry","T-duality"],"title":"T-dual branes on hyperkähler manifolds","_id":"18443","OA_place":"publisher","supervisor":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9582-2634","full_name":"Hausel, Tamás","last_name":"Hausel","first_name":"Tamás"}],"OA_type":"free access","date_updated":"2026-04-07T12:42:44Z","day":"24","alternative_title":["ISTA Thesis"],"project":[{"_id":"6286e8c4-2b32-11ec-9570-f5297902f67f","grant_number":"26069","name":"Branes on hyperkähler manifolds"}],"author":[{"full_name":"Sisak, Maria A","id":"44A03D04-AEA4-11E9-B225-EA2DE6697425","first_name":"Maria A","last_name":"Sisak"}],"publication_status":"published","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"corr_author":"1","oa":1,"language":[{"iso":"eng"}],"date_created":"2024-10-19T12:00:37Z","date_published":"2024-10-24T00:00:00Z","file_date_updated":"2024-10-24T08:09:13Z","year":"2024","month":"10","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"}]},{"date_updated":"2026-04-07T13:21:56Z","day":"19","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","citation":{"short":"H.S.C. Chiossi, Adaptive Hierarchical Representations in the Hippocampus, Institute of Science and Technology Austria, 2024.","ista":"Chiossi HSC. 2024. Adaptive hierarchical representations in the hippocampus. Institute of Science and Technology Austria.","chicago":"Chiossi, Heloisa S. C. “Adaptive Hierarchical Representations in the Hippocampus.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:14821\">https://doi.org/10.15479/at:ista:14821</a>.","ama":"Chiossi HSC. Adaptive hierarchical representations in the hippocampus. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:14821\">10.15479/at:ista:14821</a>","apa":"Chiossi, H. S. C. (2024). <i>Adaptive hierarchical representations in the hippocampus</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:14821\">https://doi.org/10.15479/at:ista:14821</a>","mla":"Chiossi, Heloisa S. C. <i>Adaptive Hierarchical Representations in the Hippocampus</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:14821\">10.15479/at:ista:14821</a>.","ieee":"H. S. C. Chiossi, “Adaptive hierarchical representations in the hippocampus,” Institute of Science and Technology Austria, 2024."},"file":[{"file_id":"14838","checksum":"d3fa3de1abd5af5204c13e9d55375615","date_updated":"2025-01-19T23:30:04Z","file_name":"PhD_Thesis_190124.docx","access_level":"closed","relation":"source_file","date_created":"2024-01-19T11:04:05Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":8656268,"embargo_to":"open_access","creator":"hchiossi"},{"creator":"hchiossi","content_type":"application/pdf","file_size":6567275,"date_created":"2024-01-19T11:03:59Z","relation":"main_file","access_level":"open_access","file_name":"PhD_Thesis_190124.pdf","date_updated":"2025-01-19T23:30:04Z","embargo":"2025-01-19","file_id":"14839","checksum":"13adc8dcfb5b6b18107f89f0a98fa8bd"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"OA_place":"publisher","supervisor":[{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","first_name":"Jozsef L"}],"title":"Adaptive hierarchical representations in the hippocampus","_id":"14821","degree_awarded":"PhD","ddc":["570"],"type":"dissertation","article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/at:ista:14821","ec_funded":1,"status":"public","oa_version":"Published Version","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"89","abstract":[{"lang":"eng","text":"The hippocampus is central to memory formation, storage and retrieval over many\r\ntimescales. Neurons in this brain area are highly selective to spatial position as well as to many\r\nother variables of the environment. It is believed that the selectivity patterns of hippocampal\r\nneurons reflect the structure of tasks an animal performs. However, especially at timescales\r\nlonger than a few minutes or hours it is not fully known how these representations evolve, nor\r\nhow they map to behaviour in the process. In this thesis, I monitored the evolution of\r\nhippocampal representations in a novel spatial-associative memory task for rats. Reward\r\nlocations were associated with global sensory cues (i.e. context); animals had to remember the\r\nassociations and dig for food in those locations only. I used in vivo electrophysiology to record\r\nthe activity of the hippocampus dorsal CA1 neurons during the learning period of a few days.\r\nI report here a novel and simple method to classify behaviour performance to account\r\nfor individual variability in learning speed and spurious performance unrelated to true task rule\r\nlearning. Using this classification I was then able to investigate neural responses on different\r\nstages of learning matched across animals. On the first day of learning, I observed a fast\r\nformation of single-cell selectivity to task variables which remained stable over days. I also\r\nobserved that reward tuning was not a single process but dependent on task-related cognitive\r\nload. At the population level, a linear decoding approach revealed a hierarchy in the\r\nrepresentation of task variables that changed with learning. In the high-dimensional space of\r\npopulation activity, the representation of contexts was specific to each position in the maze, and\r\ncould thus be better decoded if the position was known. The decoding of position did not improve\r\nwith knowledge of other variables. As learning progressed, the hippocampal code underwent a\r\nreorganisation of high-variance directions in population activity, identified by principal\r\ncomponent analysis. I found that dominant dimensions started carrying increasing amounts of\r\ninformation about task context specifically at those positions where it mattered for task\r\nperformance. When I contrasted this with variables less relevant to task performance (e.g.\r\nmovement direction), I did not observe differences in decoding quality over positions nor a\r\nreduction of dimensionality with learning.\r\nOverall, the largest changes in CA1 neural response with task learning happened in a\r\nmatter of a few trials; over days, changes undetectable in single-cell statistics were responsible\r\nfor re-structuring the hierarchy of neural representations at the population level; these changes\r\nwere task-specific and reflected different stages of learning. This indicates that complex task\r\nlearning may involve different magnitudes of response modulation in CA1, which happen at\r\nspecific time scales linked to behaviour."}],"month":"01","oa":1,"language":[{"iso":"eng"}],"date_published":"2024-01-19T00:00:00Z","file_date_updated":"2025-01-19T23:30:04Z","year":"2024","date_created":"2024-01-16T14:25:21Z","author":[{"orcid":"0009-0004-2973-278X","full_name":"Chiossi, Heloisa","id":"2BBA502C-F248-11E8-B48F-1D18A9856A87","first_name":"Heloisa","last_name":"Chiossi"}],"corr_author":"1","publication_status":"published","project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}]}]