[{"department":[{"_id":"ElKo"}],"month":"07","main_file_link":[{"url":"https://arxiv.org/abs/2309.12713","open_access":"1"}],"isi":1,"date_updated":"2025-09-08T09:42:36Z","acknowledgement":"This work is supported by Mysten Labs. We thank the Mysten Labs Engineering teams for valuable feedback broadly, and specifically to Laura Makdah for helping implementing the early reputation score system for validators and Dmitry Perelman for managing the overall implementation effort.","author":[{"full_name":"Tsimos, Giorgos","last_name":"Tsimos","first_name":"Giorgos"},{"last_name":"Kichidis","full_name":"Kichidis, Anastasios","first_name":"Anastasios"},{"full_name":"Sonnino, Alberto","last_name":"Sonnino","first_name":"Alberto"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios"}],"oa_version":"Preprint","year":"2024","title":"HammerHead: Leader reputation for dynamic scheduling","oa":1,"status":"public","arxiv":1,"publisher":"IEEE","date_created":"2024-09-15T22:01:41Z","article_processing_charge":"No","citation":{"ista":"Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. 2024. HammerHead: Leader reputation for dynamic scheduling. Proceedings - International Conference on Distributed Computing Systems. ICDCS: International Conference on Distributed Computing Systems, 1377–1387.","mla":"Tsimos, Giorgos, et al. “HammerHead: Leader Reputation for Dynamic Scheduling.” <i>Proceedings - International Conference on Distributed Computing Systems</i>, IEEE, 2024, pp. 1377–87, doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">10.1109/ICDCS60910.2024.00129</a>.","ama":"Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. HammerHead: Leader reputation for dynamic scheduling. In: <i>Proceedings - International Conference on Distributed Computing Systems</i>. IEEE; 2024:1377-1387. doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">10.1109/ICDCS60910.2024.00129</a>","apa":"Tsimos, G., Kichidis, A., Sonnino, A., &#38; Kokoris Kogias, E. (2024). HammerHead: Leader reputation for dynamic scheduling. In <i>Proceedings - International Conference on Distributed Computing Systems</i> (pp. 1377–1387). Jersey City, NJ, United States: IEEE. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">https://doi.org/10.1109/ICDCS60910.2024.00129</a>","short":"G. Tsimos, A. Kichidis, A. Sonnino, E. Kokoris Kogias, in:, Proceedings - International Conference on Distributed Computing Systems, IEEE, 2024, pp. 1377–1387.","ieee":"G. Tsimos, A. Kichidis, A. Sonnino, and E. Kokoris Kogias, “HammerHead: Leader reputation for dynamic scheduling,” in <i>Proceedings - International Conference on Distributed Computing Systems</i>, Jersey City, NJ, United States, 2024, pp. 1377–1387.","chicago":"Tsimos, Giorgos, Anastasios Kichidis, Alberto Sonnino, and Eleftherios Kokoris Kogias. “HammerHead: Leader Reputation for Dynamic Scheduling.” In <i>Proceedings - International Conference on Distributed Computing Systems</i>, 1377–87. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">https://doi.org/10.1109/ICDCS60910.2024.00129</a>."},"external_id":{"arxiv":["2309.12713"],"isi":["001304430200120"]},"_id":"18071","doi":"10.1109/ICDCS60910.2024.00129","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"conference","quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"publication":"Proceedings - International Conference on Distributed Computing Systems","publication_identifier":{"isbn":["9798350386059"],"eissn":["2575-8411"],"issn":["1063-6927"]},"fulldoi":"https://doi.org/10.1109/ICDCS60910.2024.00129","day":"26","conference":{"location":"Jersey City, NJ, United States","name":"ICDCS: International Conference on Distributed Computing Systems","end_date":"2024-07-26","start_date":"2024-07-23"},"abstract":[{"text":"Recent advancements on DAG-based consensus protocols allow for blockchains with improved metrics and properties, such as throughput and censorship-resistance. Variants of the Bullshark [18] consensus protocol are adopted for practical use by the Sui blockchain, for improved latency. However, the protocol is leader-based, and is strongly affected by crashed leaders that can lead to various performance issues, for example, decreased transaction throughput. In this paper, we propose HammerHead, a DAG-based consensus protocol, that is inspired by Carousel [8] and provides Leader-Utilization. Our proposal differs from Carousel, which is built for a chained consensus protocol; in HammerHead chain quality is inherited by the DAG. HammerHead needs to preserve safety and liveness, despite validators committing leader vertices asynchronously. The key idea is to update leader schedules dynamically, based on the validators' scores during the previous schedule. We implement HammerHead and show a minor improvement in performance for cases without faults. The major improvements in comparison to Bullshark appear in faulty settings. Specifically, we show a drastic, 2x-latency improvement and up to 40% increased throughput when crash faults occur (100 validators, 33 faults).","lang":"eng"}],"date_published":"2024-07-26T00:00:00Z","page":"1377-1387"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","doi":"10.1038/s44318-024-00207-0","publication_status":"published","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"tmp":{"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)","image":"/images/cc_by.png"},"publication":"EMBO Journal","publication_identifier":{"issn":["0261-4189"],"eissn":["1460-2075"]},"fulldoi":"https://doi.org/10.1038/s44318-024-00207-0","abstract":[{"text":"Conserved signaling cascades monitor protein-folding homeostasis to ensure proper cellular function. One of the evolutionary conserved key players is IRE1, which maintains endoplasmic reticulum (ER) homeostasis through the unfolded protein response (UPR). Upon accumulation of misfolded proteins in the ER, IRE1 forms clusters on the ER membrane to initiate UPR signaling. What regulates IRE1 cluster formation is not fully understood. Here, we show that the ER lumenal domain (LD) of human IRE1α forms biomolecular condensates in vitro. IRE1α LD condensates were stabilized both by binding to unfolded polypeptides as well as by tethering to model membranes, suggesting their role in assembling IRE1α into signaling-competent stable clusters. Molecular dynamics simulations indicated that weak multivalent interactions drive IRE1α LD clustering. Mutagenesis experiments identified disordered regions in IRE1α LD to control its clustering in vitro and in cells. Importantly, dysregulated clustering of IRE1α mutants led to defects in IRE1α signaling. Our results revealed that disordered regions in IRE1α LD control its clustering and suggest their role as a common strategy in regulating protein assembly on membranes.","lang":"eng"}],"OA_place":"publisher","day":"15","page":"4668-4698","file":[{"file_name":"2024_Embo_Kettel.pdf","relation":"main_file","content_type":"application/pdf","file_size":10080854,"success":1,"creator":"dernst","date_created":"2025-01-13T08:43:20Z","date_updated":"2025-01-13T08:43:20Z","checksum":"04f4df1a561083f2846676442fc4eb3c","file_id":"18827","access_level":"open_access"}],"date_published":"2024-10-15T00:00:00Z","OA_type":"gold","has_accepted_license":"1","issue":"20","isi":1,"month":"10","department":[{"_id":"MaLo"},{"_id":"JiFr"}],"date_updated":"2025-09-08T09:22:11Z","ddc":["570"],"year":"2024","oa_version":"Published Version","author":[{"first_name":"Paulina","last_name":"Kettel","full_name":"Kettel, Paulina"},{"first_name":"Laura","full_name":"Marosits, Laura","last_name":"Marosits"},{"last_name":"Spinetti","full_name":"Spinetti, Elena","first_name":"Elena"},{"full_name":"Rechberger, Michael","last_name":"Rechberger","first_name":"Michael"},{"last_name":"Giannini","id":"e3fdddd5-f6e0-11ea-865d-ca99ee6367f4","full_name":"Giannini, Caterina","first_name":"Caterina"},{"orcid":"0000-0001-9198-2182 ","first_name":"Philipp","last_name":"Radler","id":"40136C2A-F248-11E8-B48F-1D18A9856A87","full_name":"Radler, Philipp"},{"first_name":"Isabell","last_name":"Niedermoser","full_name":"Niedermoser, Isabell"},{"first_name":"Irmgard","full_name":"Fischer, Irmgard","last_name":"Fischer"},{"full_name":"Versteeg, Gijs A.","last_name":"Versteeg","first_name":"Gijs A."},{"first_name":"Martin","orcid":"0000-0001-7309-9724","last_name":"Loose","id":"462D4284-F248-11E8-B48F-1D18A9856A87","full_name":"Loose, Martin"},{"full_name":"Covino, Roberto","last_name":"Covino","first_name":"Roberto"},{"last_name":"Karagöz","full_name":"Karagöz, G. Elif","first_name":"G. Elif"}],"acknowledgement":"We thank late Thomas Peterbauer at the Max Perutz Labs Biooptics Light Microscopy Facility for his help and support. We are grateful to Kitti Csalyi and Thomas Sauer at Max Perutz Labs Biooptics FACS facility for their help. We thank Grzegorz Scibisz and Sertan Atilla for their support with the expression and purification of mCherry-IRE1α LD-10His. We are grateful to Aleksandra S Anisimova with her help in the generation of stable cell lines and the statistical analyses of the data. We thank Venja Vieweger for her help with the characterization of the WLLI and D123P IRE1 mutants in cells. We are thankful to Monika Kubickova for the help with the AUC experiments. We acknowledge CF BIC of CIISB, Instruct-CZ Centre, supported by MEYS CR (LM2023042)) and European Regional Development Fund-Project, UP CIISB“ (No. CZ.02.1.01/0.0/0.0/18_046/0015974). We thank the members of the Karagöz lab for the critical reading and editing of the manuscript. We are thankful to our colleagues Diego Acosta-Alvear, Vladislav Belyy, Jirka Peschek, Yasin Dagdas, Javier Martinez, Sascha Martens and Alwin Köhler for their invaluable input on the manuscript. We are grateful to Life Science Editors, especially Katrina Woolcock for her useful edits and comments on the manuscript. We acknowledge funding from Austrian Science Fund (FWF-SFB F79 and FWF-W 1261) to GEK. PK acknowledges the support of the Max Perutz PhD fellowship. GAV is funded by Stand-Alone grants (P30231-B, P30415-B, P36572), Special Research Grant (SFB grant F79), and Doctoral School grant (DK grant W1261) from the Austrian Science Fund (FWF). ES and RC acknowledge support and funding by the Frankfurt Institute of Advanced Studies, the LOEWE Center for Multiscale Modelling in Life Sciences of the state of Hesse, the Collaborative Research Center 1507 “Membrane-associated Protein Assemblies, Machineries, and Supercomplexes” (Project ID 450648163), and the International Max Planck Research School on Cellular Biophysics (to RC), the Center for Scientific Computing of the Goethe University and the Jülich Supercomputing Centre for computational resources and support.","oa":1,"title":"Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering","intvolume":"        43","pmid":1,"file_date_updated":"2025-01-13T08:43:20Z","status":"public","date_created":"2024-09-15T22:01:42Z","citation":{"apa":"Kettel, P., Marosits, L., Spinetti, E., Rechberger, M., Giannini, C., Radler, P., … Karagöz, G. E. (2024). Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. <i>EMBO Journal</i>. Embo Press. <a href=\"https://doi.org/10.1038/s44318-024-00207-0\">https://doi.org/10.1038/s44318-024-00207-0</a>","short":"P. Kettel, L. Marosits, E. Spinetti, M. Rechberger, C. Giannini, P. Radler, I. Niedermoser, I. Fischer, G.A. Versteeg, M. Loose, R. Covino, G.E. Karagöz, EMBO Journal 43 (2024) 4668–4698.","ama":"Kettel P, Marosits L, Spinetti E, et al. Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. <i>EMBO Journal</i>. 2024;43(20):4668-4698. doi:<a href=\"https://doi.org/10.1038/s44318-024-00207-0\">10.1038/s44318-024-00207-0</a>","mla":"Kettel, Paulina, et al. “Disordered Regions in the IRE1α ER Lumenal Domain Mediate Its Stress-Induced Clustering.” <i>EMBO Journal</i>, vol. 43, no. 20, Embo Press, 2024, pp. 4668–98, doi:<a href=\"https://doi.org/10.1038/s44318-024-00207-0\">10.1038/s44318-024-00207-0</a>.","ista":"Kettel P, Marosits L, Spinetti E, Rechberger M, Giannini C, Radler P, Niedermoser I, Fischer I, Versteeg GA, Loose M, Covino R, Karagöz GE. 2024. Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. EMBO Journal. 43(20), 4668–4698.","chicago":"Kettel, Paulina, Laura Marosits, Elena Spinetti, Michael Rechberger, Caterina Giannini, Philipp Radler, Isabell Niedermoser, et al. “Disordered Regions in the IRE1α ER Lumenal Domain Mediate Its Stress-Induced Clustering.” <i>EMBO Journal</i>. Embo Press, 2024. <a href=\"https://doi.org/10.1038/s44318-024-00207-0\">https://doi.org/10.1038/s44318-024-00207-0</a>.","ieee":"P. Kettel <i>et al.</i>, “Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering,” <i>EMBO Journal</i>, vol. 43, no. 20. Embo Press, pp. 4668–4698, 2024."},"volume":43,"article_processing_charge":"Yes","publisher":"Embo Press","_id":"18073","article_type":"original","external_id":{"isi":["001306286100002"],"pmid":["39232130"]}},{"oa":1,"title":"Hybrid circuits on planar Germanium","status":"public","file_date_updated":"2024-09-19T09:20:33Z","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","date_created":"2024-09-16T12:58:36Z","citation":{"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>.","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.","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>","ista":"Sagi O. 2024. Hybrid circuits on planar Germanium. Institute of Science and Technology Austria.","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>","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>."},"_id":"18076","degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"GeKa"}],"month":"09","ddc":["539"],"date_updated":"2026-04-16T12:20:39Z","author":[{"last_name":"Sagi","id":"71616374-A8E9-11E9-A7CA-09ECE5697425","full_name":"Sagi, Oliver","first_name":"Oliver"}],"year":"2024","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"project":[{"grant_number":"P36507","name":"Merging spin and superconducting qubits in planar Ge","_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a"},{"_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1","name":"High impedance circuit quantum electrodynamics with hole spins","grant_number":"I05060"},{"_id":"262116AA-B435-11E9-9278-68D0E5697425","name":"Hybrid Semiconductor - Superconductor Quantum Devices"},{"_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","grant_number":"862046","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","call_identifier":"H2020"}],"ec_funded":1,"fulldoi":"https://doi.org/10.15479/at:ista:18076","corr_author":"1","supervisor":[{"orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios"}],"OA_place":"publisher","day":"18","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"}],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"date_published":"2024-09-18T00:00:00Z","file":[{"file_name":"OliverSagi_Thesis_pdfa.pdf","relation":"main_file","file_size":86679095,"content_type":"application/pdf","success":1,"creator":"osagi","date_updated":"2024-09-18T14:13:01Z","date_created":"2024-09-18T14:13:01Z","checksum":"d01d0e2846c2f3ac5bb14d321554a4cd","access_level":"open_access","file_id":"18093"},{"access_level":"local","file_id":"18094","checksum":"0543f473d509ee545f4ed3a56f742f4b","date_updated":"2024-09-19T09:20:33Z","date_created":"2024-09-18T14:14:02Z","creator":"osagi","file_size":172098524,"content_type":"application/x-zip-compressed","file_name":"Thesis_OliverSagi.zip","relation":"source_file"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","page":"111","doi":"10.15479/at:ista:18076","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","type":"dissertation","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"17202"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png"},"language":[{"iso":"eng"}]},{"fulldoi":"https://doi.org/10.1103/physrevresearch.6.033277","ec_funded":1,"corr_author":"1","project":[{"grant_number":"F100403","name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions","_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3"},{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"}],"publication_identifier":{"eissn":["2643-1564"]},"file":[{"success":1,"creator":"dernst","file_name":"2024_PhysicalReviewResearch_Maslov.pdf","relation":"main_file","content_type":"application/pdf","file_size":1563824,"checksum":"8f744d94956a1683b473b1cf9b411a37","file_id":"18125","access_level":"open_access","date_created":"2024-09-23T09:46:20Z","date_updated":"2024-09-23T09:46:20Z"}],"date_published":"2024-09-10T00:00:00Z","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."}],"OA_place":"publisher","day":"10","publication_status":"published","type":"journal_article","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","doi":"10.1103/physrevresearch.6.033277","publication":"Physical Review Research","tmp":{"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)","image":"/images/cc_by.png"},"related_material":{"record":[{"relation":"dissertation_contains","id":"19048","status":"public"}]},"language":[{"iso":"eng"}],"file_date_updated":"2024-09-23T09:46:20Z","arxiv":1,"status":"public","oa":1,"title":"Theory of angular momentum transfer from light to molecules","DOAJ_listed":"1","intvolume":"         6","_id":"18087","article_type":"original","external_id":{"arxiv":["2310.00095"]},"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.","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>.","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>.","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>","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.","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>","short":"M. Maslov, G. Koutentakis, M. Hrast, O.H. Heckl, M. Lemeshko, Physical Review Research 6 (2024)."},"article_processing_charge":"Yes","date_created":"2024-09-18T11:43:16Z","volume":6,"APC_amount":"3028,31 EUR","publisher":"American Physical Society","month":"09","department":[{"_id":"GradSch"},{"_id":"MiLe"}],"OA_type":"gold","has_accepted_license":"1","issue":"3","oa_version":"Published Version","year":"2024","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.","author":[{"full_name":"Maslov, Mikhail","last_name":"Maslov","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0003-4074-2570"},{"first_name":"Georgios","full_name":"Koutentakis, Georgios","last_name":"Koutentakis","id":"d7b23d3a-9e21-11ec-b482-f76739596b95"},{"first_name":"Mateja","full_name":"Hrast, Mateja","last_name":"Hrast","id":"48dbb294-2a9c-11ef-905d-f56be71f0e5d"},{"full_name":"Heckl, Oliver H.","last_name":"Heckl","first_name":"Oliver H."},{"first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"}],"article_number":"033277","date_updated":"2026-04-07T11:52:53Z","ddc":["530"]},{"publication":"40th International Symposium on Computational Geometry","language":[{"iso":"eng"}],"tmp":{"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)","image":"/images/cc_by.png"},"publication_status":"published","type":"conference","quality_controlled":"1","doi":"10.4230/LIPIcs.SoCG.2024.87","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2024-09-19T10:30:37Z","date_updated":"2024-09-19T10:30:37Z","checksum":"9355c2e60b8ec285e1b22719c5b73f1a","file_id":"18098","access_level":"open_access","relation":"main_file","file_name":"2024_LIPICs_Attali.pdf","content_type":"application/pdf","file_size":3507177,"success":1,"creator":"dernst"}],"date_published":"2024-06-06T00:00:00Z","conference":{"start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry","end_date":"2024-06-14","location":"Athens, Greece"},"day":"06","abstract":[{"lang":"eng","text":"In our companion paper \"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds\" we gave optimal bounds (in terms of the two one-sided Hausdorff distances) on a sample P of an input shape 𝒮 (either manifold or general set with positive reach) such that one can infer the homotopy of 𝒮 from the union of balls with some radius centred at P, both in Euclidean space and in a Riemannian manifold of bounded curvature. The construction showing the optimality of the bounds is not straightforward. The purpose of this video is to visualize and thus elucidate said construction in the Euclidean setting."}],"fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2024.87","corr_author":"1","ec_funded":1,"publication_identifier":{"isbn":["9783959773164"]},"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I02979-N35. Mathijs Wintraecken: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d’Azur.\r\nWe thank Jean-Daniel Boissonnat, Herbert Edelsbrunner, and Mariette Yvinec for discussion.","author":[{"last_name":"Attali","full_name":"Attali, Dominique","first_name":"Dominique"},{"first_name":"Hana","orcid":"0000-0001-7841-0091","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","last_name":"Kourimska","full_name":"Kourimska, Hana"},{"first_name":"Christopher D","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","last_name":"Fillmore","full_name":"Fillmore, Christopher D"},{"first_name":"Ishika","full_name":"Ghosh, Ishika","id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff","last_name":"Ghosh"},{"last_name":"Lieutier","full_name":"Lieutier, Andre","first_name":"Andre"},{"full_name":"Stephenson, Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","last_name":"Stephenson","first_name":"Elizabeth R","orcid":"0000-0002-6862-208X"},{"full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","orcid":"0000-0002-7472-2220"}],"oa_version":"Published Version","year":"2024","ddc":["000"],"article_number":"87","date_updated":"2025-04-15T07:16:58Z","department":[{"_id":"HeEd"}],"month":"06","alternative_title":["LIPIcs"],"has_accepted_license":"1","_id":"18097","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":293,"article_processing_charge":"Yes","date_created":"2024-09-19T10:29:48Z","citation":{"ista":"Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. The ultimate frontier: An optimality construction for homotopy inference (media exposition). 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 87.","mla":"Attali, Dominique, et al. “The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">10.4230/LIPIcs.SoCG.2024.87</a>.","ama":"Attali D, Kourimska H, Fillmore CD, et al. The ultimate frontier: An optimality construction for homotopy inference (media exposition). In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">10.4230/LIPIcs.SoCG.2024.87</a>","short":"D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","apa":"Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., &#38; Wintraecken, M. (2024). The ultimate frontier: An optimality construction for homotopy inference (media exposition). In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">https://doi.org/10.4230/LIPIcs.SoCG.2024.87</a>","ieee":"D. Attali <i>et al.</i>, “The ultimate frontier: An optimality construction for homotopy inference (media exposition),” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","chicago":"Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, Andre Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">https://doi.org/10.4230/LIPIcs.SoCG.2024.87</a>."},"status":"public","file_date_updated":"2024-09-19T10:30:37Z","oa":1,"title":"The ultimate frontier: An optimality construction for homotopy inference (media exposition)","intvolume":"       293"},{"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.","author":[{"full_name":"Lauritsen, Asbjørn Bækgaard","last_name":"Lauritsen","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","orcid":"0000-0003-4476-2288","first_name":"Asbjørn Bækgaard"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"oa_version":"Published Version","year":"2024","ddc":["510"],"date_updated":"2026-04-07T13:01:40Z","article_number":"e78","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"month":"09","isi":1,"has_accepted_license":"1","external_id":{"arxiv":["2407.05990"],"isi":["001307817400001"]},"article_type":"original","_id":"18107","publisher":"Cambridge University Press","citation":{"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>","short":"A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024).","ista":"Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.","mla":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <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>","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>.","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."},"volume":12,"date_created":"2024-09-20T12:25:25Z","article_processing_charge":"Yes","status":"public","arxiv":1,"file_date_updated":"2024-09-23T09:56:17Z","title":"Pressure of a dilute spin-polarized Fermi gas: Lower bound","intvolume":"        12","oa":1,"publication":"Forum of Mathematics, Sigma","tmp":{"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)","image":"/images/cc_by.png"},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"18135"}]},"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","publication_status":"published","doi":"10.1017/fms.2024.56","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2024-09-09T00:00:00Z","file":[{"creator":"dernst","success":1,"file_size":599886,"content_type":"application/pdf","file_name":"2024_ForumMath_Lauritsen.pdf","relation":"main_file","access_level":"open_access","file_id":"18126","checksum":"330b881240013213a8e08538fec13d29","date_updated":"2024-09-23T09:56:17Z","date_created":"2024-09-23T09:56:17Z"}],"day":"09","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"}],"corr_author":"1","fulldoi":"https://doi.org/10.1017/fms.2024.56","publication_identifier":{"issn":["2050-5094"]},"project":[{"name":"Mathematical Challenges in BCS Theory of Superconductivity","grant_number":"I06427","_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b"}]},{"author":[{"full_name":"Hausel, Tamás","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamás","orcid":"0000-0002-9582-2634"}],"acknowledgement":"We thank Nigel Hitchin for discussions and the joint projects this paper has grown out from. We thank Vladyslav Zveryk for collaboration on Theorem 2.3 and on the corresponding Magma code which implements big algebras. We thank Hiraku Nakajima for discussions and pointing out Theorem 3.1.2, a result generalizing our original observation in the= = 0 case. Special thanks go to Leonid Rybnikov for patiently explaining his works, in particular crucial to Theorem 2.1. We thank Michel Brion, Michael Finkelberg, Oscar García-Prada, Jakub Löwit, Joel Kamnitzer, Friedrich Knop, Michael McBreen, Anton Mellit, Takuro Mochizuki, Shon Ngô, Kamil Rychlewicz, Shiyu Shen, Leslie Spencer, Balázs Szendr ˝ oi, András Szenes, and Oksana\r\nYakimova for comments and discussions. Kamil Rychlewicz and Daniel Bedats helped with the Mathematica files for the figures, and we used the SM_isospin Tikz package of Izaak Neutelings for drawing the baryon multiplets. We thank the referees for many useful comments. We acknowledge funding from FWF grant “Geometry of the tip of the global nilpotent cone” no. P 35847.","year":"2024","oa_version":"Published Version","ddc":["510"],"article_number":"e2319341121","date_updated":"2025-05-08T09:57:59Z","department":[{"_id":"TaHa"}],"month":"09","issue":"38","OA_type":"hybrid","has_accepted_license":"1","external_id":{"pmid":["39259592"]},"_id":"18108","article_type":"original","publisher":"National Academy of Sciences","APC_amount":"2742,92 EUR","article_processing_charge":"Yes (in subscription journal)","volume":121,"citation":{"chicago":"Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie Groups.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2024. <a href=\"https://doi.org/10.1073/pnas.2319341121\">https://doi.org/10.1073/pnas.2319341121</a>.","ieee":"T. Hausel, “Commutative avatars of representations of semisimple Lie groups,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 38. National Academy of Sciences, 2024.","apa":"Hausel, T. (2024). Commutative avatars of representations of semisimple Lie groups. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2319341121\">https://doi.org/10.1073/pnas.2319341121</a>","short":"T. Hausel, Proceedings of the National Academy of Sciences of the United States of America 121 (2024).","ama":"Hausel T. Commutative avatars of representations of semisimple Lie groups. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2024;121(38). doi:<a href=\"https://doi.org/10.1073/pnas.2319341121\">10.1073/pnas.2319341121</a>","ista":"Hausel T. 2024. Commutative avatars of representations of semisimple Lie groups. Proceedings of the National Academy of Sciences of the United States of America. 121(38), e2319341121.","mla":"Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie Groups.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 38, e2319341121, National Academy of Sciences, 2024, doi:<a href=\"https://doi.org/10.1073/pnas.2319341121\">10.1073/pnas.2319341121</a>."},"date_created":"2024-09-22T22:01:41Z","status":"public","file_date_updated":"2024-09-23T11:22:56Z","pmid":1,"oa":1,"intvolume":"       121","title":"Commutative avatars of representations of semisimple Lie groups","publication":"Proceedings of the National Academy of Sciences of the United States of America","language":[{"iso":"eng"}],"tmp":{"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)","image":"/images/cc_by.png"},"related_material":{"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/big-algebras-a-dictionary-of-abstract-math/"}]},"publication_status":"published","quality_controlled":"1","type":"journal_article","scopus_import":"1","doi":"10.1073/pnas.2319341121","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2024-09-23T11:22:56Z","date_updated":"2024-09-23T11:22:56Z","checksum":"df80c873633c6734d2e324841e69db58","file_id":"18127","access_level":"open_access","file_name":"2024_PNAS_Hausel.pdf","relation":"main_file","content_type":"application/pdf","file_size":3764695,"success":1,"creator":"dernst"}],"date_published":"2024-09-17T00:00:00Z","OA_place":"publisher","day":"17","abstract":[{"text":"Here we announce the construction and properties of a big commutative subalgebra of the Kirillov algebra attached to a finite dimensional irreducible representation of a complex semisimple Lie group. They are commutative finite flat algebras over the cohomology of the classifying space of the group. They are isomorphic with the equivariant intersection cohomology of affine Schubert varieties, endowing the latter with a new ring structure. Study of the finer aspects of the structure of the big algebras will also furnish the stalks of the intersection cohomology with ring structure, thus ringifying Lusztig’s q-weight multiplicity polynomials i.e., certain affine Kazhdan–Lusztig polynomials.","lang":"eng"}],"fulldoi":"https://doi.org/10.1073/pnas.2319341121","corr_author":"1","publication_identifier":{"eissn":["1091-6490"]},"project":[{"grant_number":"P35847","name":"Geometry of the tip of the global nilpotent cone","_id":"34b2c9cb-11ca-11ed-8bc3-a50ba74ca4a3"}]},{"publication_identifier":{"eissn":["1097-4180"]},"fulldoi":"https://doi.org/10.1016/j.immuni.2024.08.007","day":"10","abstract":[{"lang":"eng","text":"Venous thromboembolism (VTE) is a common, deadly disease with an increasing incidence despite preventive efforts. Clinical observations have associated elevated antibody concentrations or antibody-based therapies with thrombotic events. However, how antibodies contribute to thrombosis is unknown. Here, we show that reduced blood flow enabled immunoglobulin M (IgM) to bind to FcμR and the polymeric immunoglobulin receptor (pIgR), initiating endothelial activation and platelet recruitment. Subsequently, the procoagulant surface of activated platelets accommodated antigen- and FcγR-independent IgG deposition. This leads to classical complement activation, setting in motion a prothrombotic vicious circle. Key elements of this mechanism were present in humans in the setting of venous stasis as well as in the dysregulated immunothrombosis of COVID-19. This antibody-driven thrombosis can be prevented by pharmacologically targeting complement. Hence, our results uncover antibodies as previously unrecognized central regulators of thrombosis. These findings carry relevance for therapeutic application of antibodies and open innovative avenues to target thrombosis without compromising hemostasis."}],"file":[{"file_id":"18162","access_level":"open_access","checksum":"4683de43d06a8fd8e3fc91af4ddc1ba2","date_created":"2024-09-30T09:16:03Z","date_updated":"2024-09-30T09:16:03Z","creator":"dernst","success":1,"content_type":"application/pdf","file_size":6892750,"relation":"main_file","file_name":"2024_Immunity_Stark.pdf"}],"date_published":"2024-09-10T00:00:00Z","page":"2140-2156","scopus_import":"1","doi":"10.1016/j.immuni.2024.08.007","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"tmp":{"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)","image":"/images/cc_by.png"},"publication":"Immunity","oa":1,"title":"Antibodies and complement are key drivers of thrombosis","intvolume":"        57","status":"public","pmid":1,"file_date_updated":"2024-09-30T09:16:03Z","publisher":"Elsevier","article_processing_charge":"Yes (in subscription journal)","citation":{"ieee":"K. Stark <i>et al.</i>, “Antibodies and complement are key drivers of thrombosis,” <i>Immunity</i>, vol. 57, no. 9. Elsevier, pp. 2140–2156, 2024.","chicago":"Stark, Konstantin, Badr Kilani, Sven Stockhausen, Johanna Busse, Irene Schubert, Thuy Duong Tran, Florian R Gärtner, et al. “Antibodies and Complement Are Key Drivers of Thrombosis.” <i>Immunity</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.immuni.2024.08.007\">https://doi.org/10.1016/j.immuni.2024.08.007</a>.","mla":"Stark, Konstantin, et al. “Antibodies and Complement Are Key Drivers of Thrombosis.” <i>Immunity</i>, vol. 57, no. 9, Elsevier, 2024, pp. 2140–56, doi:<a href=\"https://doi.org/10.1016/j.immuni.2024.08.007\">10.1016/j.immuni.2024.08.007</a>.","ista":"Stark K, Kilani B, Stockhausen S, Busse J, Schubert I, Tran TD, Gärtner FR, Leunig A, Pekayvaz K, Nicolai L, Fumagalli V, Stermann J, Stephan F, David C, Müller MB, Heyman B, Lux A, Da Palma Guerreiro A, Frenzel LP, Schmidt CQ, Dopler A, Moser M, Chandraratne S, Von Brühl ML, Lorenz M, Korff T, Rudelius M, Popp O, Kirchner M, Mertins P, Nimmerjahn F, Iannacone M, Sperandio M, Engelmann B, Verschoor A, Massberg S. 2024. Antibodies and complement are key drivers of thrombosis. Immunity. 57(9), 2140–2156.","ama":"Stark K, Kilani B, Stockhausen S, et al. Antibodies and complement are key drivers of thrombosis. <i>Immunity</i>. 2024;57(9):2140-2156. doi:<a href=\"https://doi.org/10.1016/j.immuni.2024.08.007\">10.1016/j.immuni.2024.08.007</a>","short":"K. Stark, B. Kilani, S. Stockhausen, J. Busse, I. Schubert, T.D. Tran, F.R. Gärtner, A. Leunig, K. Pekayvaz, L. Nicolai, V. Fumagalli, J. Stermann, F. Stephan, C. David, M.B. Müller, B. Heyman, A. Lux, A. Da Palma Guerreiro, L.P. Frenzel, C.Q. Schmidt, A. Dopler, M. Moser, S. Chandraratne, M.L. Von Brühl, M. Lorenz, T. Korff, M. Rudelius, O. Popp, M. Kirchner, P. Mertins, F. Nimmerjahn, M. Iannacone, M. Sperandio, B. Engelmann, A. Verschoor, S. Massberg, Immunity 57 (2024) 2140–2156.","apa":"Stark, K., Kilani, B., Stockhausen, S., Busse, J., Schubert, I., Tran, T. D., … Massberg, S. (2024). Antibodies and complement are key drivers of thrombosis. <i>Immunity</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.immuni.2024.08.007\">https://doi.org/10.1016/j.immuni.2024.08.007</a>"},"volume":57,"date_created":"2024-09-22T22:01:42Z","external_id":{"pmid":["39226900"],"isi":["001317438500001"]},"_id":"18109","article_type":"original","issue":"9","has_accepted_license":"1","department":[{"_id":"MiSi"}],"isi":1,"month":"09","ddc":["570"],"date_updated":"2025-09-08T09:50:13Z","acknowledgement":"We thank Michael Carroll (Harvard Medical School, Boston) for providing Ighmtm1Che, C4−/−, and C3−/− mice; Mark Suter (University of Zurich, Zurich) for providing Aicda−/− mice; Marina Botto (Imperial College London, London) for providing C1q−/− and fB−/− mice; Craig Gerard (Harvard Medical School, Boston) for providing C3aR−/− mice; Falk Nimmerjahn (University Erlangen-Nuernberg, Erlangen) for providing Fcgr−/−Fcgr2b−/− mice; Karl Lang (University of Duisburg-Essen, Essen) for providing Fcmr−/− mice; Hans Hengartner and Rolf Zinkernagel (ETH Zurich, Zurich) for providing KL25 mice; Mark Zabel (University Hospital of Zurich, Zurich) for providing CR2−/− mice; Christie Ballantyne (Baylor College of Medicine, Houston) for providing CD11c−/− mice; and Siamon Gordon (University of Oxford, Oxford) for providing CD11b−/− mice. A.V. wishes to thank Michael Grünaug and dedicates this work to Annette, Rita, and Hans.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. \r\n947611) (K.S.). This study was supported by the Deutsche Forschungsgemeinschaft through the collaborative research center 914 project B02 (K.S. and S.M.), project B04 (A.V.), project A01 (M.M.), project B01 (M.S.), the collaborative research center 1123 project B07 (K.S. and S.M.), the collaborative research center 359 (project A03 [K.S.] and B02 [M.S.]), the international research training group 1911 project B09 (A.V.), the clinical research unit 303 project 7 (A.V.), cluster of excellence 2167 (A.V.), collaborative research center 1526 project 05 (A.V.), the ANR-DFG project JAKPOT (K.S.), LMUexcellent (K.S.), and the Deutsche Zentrum für Herz-Kreislauf-Forschung (PostDoc Grant and partner site project [K.S. and S.M.]). M.I. is supported by the European Research Council (ERC) Advanced Grant 101141363, ERC Proof of Concept Grant 101138728, Italian Association for Cancer Research (AIRC) Grants 19891 and \r\n22737, Italian Ministry for University and Research Grants PE00000007 (INF-ACT) and PRIN \r\n2022FMESXL, Funded Research Agreement from Asher Biotherapeutics, VIR Biotechnology, and BlueJay Therapeutics. V.F. is supported by the Italian Ministry for University and Research Grants PE00000007 (INF-ACT) and Fondazione Prossimo Mio.","author":[{"last_name":"Stark","full_name":"Stark, Konstantin","first_name":"Konstantin"},{"first_name":"Badr","last_name":"Kilani","full_name":"Kilani, Badr"},{"full_name":"Stockhausen, Sven","last_name":"Stockhausen","first_name":"Sven"},{"first_name":"Johanna","last_name":"Busse","full_name":"Busse, Johanna"},{"last_name":"Schubert","full_name":"Schubert, Irene","first_name":"Irene"},{"first_name":"Thuy Duong","last_name":"Tran","full_name":"Tran, Thuy Duong"},{"first_name":"Florian R","orcid":"0000-0001-6120-3723","last_name":"Gärtner","id":"397A88EE-F248-11E8-B48F-1D18A9856A87","full_name":"Gärtner, Florian R"},{"first_name":"Alexander","full_name":"Leunig, Alexander","last_name":"Leunig"},{"first_name":"Kami","full_name":"Pekayvaz, Kami","last_name":"Pekayvaz"},{"first_name":"Leo","last_name":"Nicolai","full_name":"Nicolai, Leo"},{"first_name":"Valeria","full_name":"Fumagalli, Valeria","last_name":"Fumagalli"},{"full_name":"Stermann, Julia","last_name":"Stermann","first_name":"Julia"},{"first_name":"Felix","last_name":"Stephan","full_name":"Stephan, Felix"},{"last_name":"David","full_name":"David, Christian","first_name":"Christian"},{"first_name":"Martin B.","full_name":"Müller, Martin B.","last_name":"Müller"},{"full_name":"Heyman, Birgitta","last_name":"Heyman","first_name":"Birgitta"},{"full_name":"Lux, Anja","last_name":"Lux","first_name":"Anja"},{"first_name":"Alexandra","full_name":"Da Palma Guerreiro, Alexandra","last_name":"Da Palma Guerreiro"},{"last_name":"Frenzel","full_name":"Frenzel, Lukas P.","first_name":"Lukas P."},{"first_name":"Christoph Q.","last_name":"Schmidt","full_name":"Schmidt, Christoph Q."},{"full_name":"Dopler, Arthur","last_name":"Dopler","first_name":"Arthur"},{"full_name":"Moser, Markus","last_name":"Moser","first_name":"Markus"},{"full_name":"Chandraratne, Sue","last_name":"Chandraratne","first_name":"Sue"},{"first_name":"Marie Luise","last_name":"Von Brühl","full_name":"Von Brühl, Marie Luise"},{"first_name":"Michael","full_name":"Lorenz, Michael","last_name":"Lorenz"},{"first_name":"Thomas","last_name":"Korff","full_name":"Korff, Thomas"},{"first_name":"Martina","last_name":"Rudelius","full_name":"Rudelius, Martina"},{"first_name":"Oliver","full_name":"Popp, Oliver","last_name":"Popp"},{"last_name":"Kirchner","full_name":"Kirchner, Marieluise","first_name":"Marieluise"},{"last_name":"Mertins","full_name":"Mertins, Philipp","first_name":"Philipp"},{"last_name":"Nimmerjahn","full_name":"Nimmerjahn, Falk","first_name":"Falk"},{"first_name":"Matteo","full_name":"Iannacone, Matteo","last_name":"Iannacone"},{"first_name":"Markus","last_name":"Sperandio","full_name":"Sperandio, Markus"},{"first_name":"Bernd","last_name":"Engelmann","full_name":"Engelmann, Bernd"},{"first_name":"Admar","last_name":"Verschoor","full_name":"Verschoor, Admar"},{"last_name":"Massberg","full_name":"Massberg, Steffen","first_name":"Steffen"}],"oa_version":"Published Version","year":"2024"},{"issue":"10","department":[{"_id":"MaSe"}],"month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.02102"}],"isi":1,"date_updated":"2025-09-08T09:49:29Z","article_number":"L100304","acknowledgement":"The authors acknowledge useful discussions with M. Serbyn, Z. Papic, and A. Nunnenkamp. ´\r\nP.B. is supported by the Erwin Schrödinger Center for Quantum Science & Technology (ESQ) of the Österreichische Akademie der Wissenschaften (ÖAW) under the Discovery Grant. M.L. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement\r\nNo. 850899). The numerical simulations were performed using the ITensor library [68] on the Vienna Scientific Cluster (VSC).","author":[{"last_name":"Brighi","id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","full_name":"Brighi, Pietro","first_name":"Pietro","orcid":"0000-0002-7969-2729"},{"orcid":"0000-0003-0038-7068","first_name":"Marko","last_name":"Ljubotina","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","full_name":"Ljubotina, Marko"}],"year":"2024","oa_version":"Preprint","title":"Anomalous transport in the kinetically constrained quantum East-West model","intvolume":"       110","oa":1,"status":"public","arxiv":1,"publisher":"American Physical Society","volume":110,"citation":{"chicago":"Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically Constrained Quantum East-West Model.” <i>Physical Review B</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">https://doi.org/10.1103/PhysRevB.110.L100304</a>.","ieee":"P. Brighi and M. Ljubotina, “Anomalous transport in the kinetically constrained quantum East-West model,” <i>Physical Review B</i>, vol. 110, no. 10. American Physical Society, 2024.","short":"P. Brighi, M. Ljubotina, Physical Review B 110 (2024).","apa":"Brighi, P., &#38; Ljubotina, M. (2024). Anomalous transport in the kinetically constrained quantum East-West model. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">https://doi.org/10.1103/PhysRevB.110.L100304</a>","ista":"Brighi P, Ljubotina M. 2024. Anomalous transport in the kinetically constrained quantum East-West model. Physical Review B. 110(10), L100304.","ama":"Brighi P, Ljubotina M. Anomalous transport in the kinetically constrained quantum East-West model. <i>Physical Review B</i>. 2024;110(10). doi:<a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">10.1103/PhysRevB.110.L100304</a>","mla":"Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically Constrained Quantum East-West Model.” <i>Physical Review B</i>, vol. 110, no. 10, L100304, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">10.1103/PhysRevB.110.L100304</a>."},"article_processing_charge":"No","date_created":"2024-09-22T22:01:42Z","external_id":{"isi":["001361617100003"],"arxiv":["2405.02102"]},"article_type":"letter_note","_id":"18110","doi":"10.1103/PhysRevB.110.L100304","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"publication":"Physical Review B","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"project":[{"_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","grant_number":"850899","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","call_identifier":"H2020"}],"fulldoi":"https://doi.org/10.1103/PhysRevB.110.L100304","ec_funded":1,"corr_author":"1","day":"11","abstract":[{"text":"We study a chaotic particle-conserving kinetically constrained model, with a single parameter which allows us to break reflection symmetry. Through extensive numerical simulations we find that the domain wall state shows a variety of dynamical behaviors from localization all the way to ballistic transport, depending on the value of the reflection breaking parameter. Surprisingly, such anomalous behavior is not mirrored in infinite-temperature dynamics, which appear to scale diffusively, in line with expectations for generic interacting models. However, studying the particle density gradient, we show that the lack of reflection symmetry affects infinite-temperature dynamics, resulting in an asymmetric dynamical structure factor. This is in disagreement with normal diffusion and suggests that the model may also exhibit anomalous dynamics at infinite temperature in the thermodynamic limit. Finally, we observe low-entangled eigenstates in the spectrum of the model, a telltale sign of quantum many-body scars.","lang":"eng"}],"date_published":"2024-09-11T00:00:00Z"},{"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"publication":"Proceedings of the 41st International Conference on Machine Learning","publication_identifier":{"eissn":["2640-3498"]},"corr_author":"1","conference":{"start_date":"2024-07-21","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","location":"Vienna, Austria"},"day":"01","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"}],"date_published":"2024-09-01T00:00:00Z","page":"12284-12303","alternative_title":["PMLR"],"department":[{"_id":"DaAl"},{"_id":"GradSch"}],"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2401.06118"}],"month":"09","date_updated":"2024-10-01T08:13:05Z","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.","author":[{"first_name":"Vage","last_name":"Egiazarian","full_name":"Egiazarian, Vage"},{"first_name":"Andrei","full_name":"Panferov, Andrei","last_name":"Panferov","id":"2c18daae-4dbe-11ef-8491-98ce2d960f09"},{"first_name":"Denis","full_name":"Kuznedelev, Denis","last_name":"Kuznedelev"},{"first_name":"Elias","full_name":"Frantar, Elias","last_name":"Frantar","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f"},{"first_name":"Artem","full_name":"Babenko, Artem","last_name":"Babenko"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Preprint","year":"2024","oa":1,"title":"Extreme compression of large language models via additive quantization","intvolume":"       235","arxiv":1,"status":"public","publisher":"ML Research Press","volume":235,"date_created":"2024-09-22T22:01:43Z","citation":{"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.","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.","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.","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.","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.","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.","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."},"article_processing_charge":"No","external_id":{"arxiv":["2401.06118"]},"_id":"18113"},{"type":"conference","quality_controlled":"1","publication_status":"published","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the 41st International Conference on Machine Learning","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://github.com/alpz/mech-nn","relation":"software"}]},"publication_identifier":{"eissn":["2640-3498"]},"date_published":"2024-09-01T00:00:00Z","page":"40484-40501","day":"01","conference":{"end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-21","location":"Vienna, Austria"},"OA_place":"publisher","abstract":[{"lang":"eng","text":"This paper presents Mechanistic Neural Networks, a neural network design for machine learning applications in the sciences. It incorporates a new Mechanistic Block in standard architectures to explicitly learn governing differential equations as representations, revealing the underlying dynamics of data and enhancing interpretability and efficiency in data modeling. Central to our approach is a novel Relaxed Linear Programming Solver (NeuRLP) inspired by a technique that reduces solving linear ODEs to solving linear programs. This integrates well with neural networks and surpasses the limitations of traditional ODE solvers enabling scalable GPU parallel processing. Overall, Mechanistic Neural Networks demonstrate their versatility for scientific machine learning applications, adeptly managing tasks from equation discovery to dynamic systems modeling. We prove their comprehensive capabilities in analyzing and interpreting complex scientific data across various applications, showing significant performance against specialized state-of-the-art methods. Source code is available at https://github.com/alpz/mech-nn."}],"department":[{"_id":"FrLo"}],"month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.13077"}],"OA_type":"diamond","alternative_title":["PMLR"],"author":[{"first_name":"Adeel A","id":"fca6d90c-d47f-11ee-bc87-93ff51604981","last_name":"Pervez","full_name":"Pervez, Adeel A"},{"full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683"},{"full_name":"Gavves, Efstratios","last_name":"Gavves","first_name":"Efstratios"}],"oa_version":"Published Version","year":"2024","ddc":["000"],"date_updated":"2026-06-18T17:59:46Z","status":"public","arxiv":1,"title":"Mechanistic neural networks for scientific machine learning","intvolume":"       235","oa":1,"external_id":{"arxiv":["2402.13077"]},"_id":"18114","publisher":"ML Research Press","volume":235,"citation":{"ieee":"A. A. Pervez, F. Locatello, and E. Gavves, “Mechanistic neural networks for scientific machine learning,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 40484–40501.","chicago":"Pervez, Adeel A, Francesco Locatello, and Efstratios Gavves. “Mechanistic Neural Networks for Scientific Machine Learning.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:40484–501. ML Research Press, 2024.","mla":"Pervez, Adeel A., et al. “Mechanistic Neural Networks for Scientific Machine Learning.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 40484–501.","ista":"Pervez AA, Locatello F, Gavves E. 2024. Mechanistic neural networks for scientific machine learning. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 40484–40501.","ama":"Pervez AA, Locatello F, Gavves E. Mechanistic neural networks for scientific machine learning. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:40484-40501.","apa":"Pervez, A. A., Locatello, F., &#38; Gavves, E. (2024). Mechanistic neural networks for scientific machine learning. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 40484–40501). Vienna, Austria: ML Research Press.","short":"A.A. Pervez, F. Locatello, E. Gavves, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 40484–40501."},"article_processing_charge":"No","date_created":"2024-09-22T22:01:43Z"},{"date_updated":"2026-06-18T18:00:19Z","ddc":["000"],"oa_version":"Published Version","year":"2024","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. This work was partially done while David Saulpic was at the Institute for Science and Technology, Austria (ISTA). David Sauplic has received funding from the European Union’s Horizon 2020 research and innovation programme under the\r\nMarie Sklodowska-Curie grant agreement No 101034413. Work was done while David Woodruff was visiting Google Research.","author":[{"first_name":"Kyriakos","last_name":"Axiotis","full_name":"Axiotis, Kyriakos"},{"first_name":"Vincent","full_name":"Cohen-Addad, Vincent","last_name":"Cohen-Addad"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Sammy","full_name":"Jerome, Sammy","last_name":"Jerome"},{"full_name":"Mirrokni, Vahab","last_name":"Mirrokni","first_name":"Vahab"},{"full_name":"Saulpic, David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","last_name":"Saulpic","first_name":"David"},{"first_name":"David P.","full_name":"Woodruff, David P.","last_name":"Woodruff"},{"last_name":"Wunder","full_name":"Wunder, Michael","first_name":"Michael"}],"alternative_title":["PMLR"],"month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.17327"}],"department":[{"_id":"MoHe"}],"citation":{"apa":"Axiotis, K., Cohen-Addad, V., Henzinger, M., Jerome, S., Mirrokni, V., Saulpic, D., … Wunder, M. (2024). Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 2086–2107). Vienna, Austria: ML Research Press.","short":"K. Axiotis, V. Cohen-Addad, M. Henzinger, S. Jerome, V. Mirrokni, D. Saulpic, D.P. Woodruff, M. Wunder, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 2086–2107.","ama":"Axiotis K, Cohen-Addad V, Henzinger M, et al. Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:2086-2107.","mla":"Axiotis, Kyriakos, et al. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 2086–107.","ista":"Axiotis K, Cohen-Addad V, Henzinger M, Jerome S, Mirrokni V, Saulpic D, Woodruff DP, Wunder M. 2024. Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 2086–2107.","chicago":"Axiotis, Kyriakos, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, and Michael Wunder. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:2086–2107. ML Research Press, 2024.","ieee":"K. Axiotis <i>et al.</i>, “Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 2086–2107."},"article_processing_charge":"No","date_created":"2024-09-22T22:01:44Z","volume":235,"publisher":"ML Research Press","_id":"18115","external_id":{"arxiv":["2402.17327"]},"intvolume":"       235","title":"Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond","oa":1,"status":"public","arxiv":1,"language":[{"iso":"eng"}],"publication":"Proceedings of the 41st International Conference on Machine Learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","quality_controlled":"1","type":"conference","publication_status":"published","abstract":[{"lang":"eng","text":"We study the data selection problem, whose aim is to select a small representative subset of data that can be used to efficiently train a machine learning model. We present a new data selection approach based on k-means clustering and sensitivity sampling. Assuming access to an embedding representation of the data with respect to which the model loss is Holder continuous, our approach provably allows selecting a set of “typical” k+1/ε2 elements whose average loss corresponds to the average loss of the whole dataset, up to a multiplicative (1±ε)\r\n factor and an additive ελΦk, where Φk represents the k-means cost for the input embeddings and λ is the Holder constant. We furthermore demonstrate the performance and scalability of our approach on fine-tuning foundation models and show that it outperforms state-of-the-art methods. We also show how it can be applied on linear regression, leading to a new sampling strategy that surprisingly matches the performance of leverage score sampling, while being conceptually simpler and more scalable."}],"day":"01","conference":{"location":"Vienna, Austria","start_date":"2024-07-21","name":"ICML: International Conference on Machine Learning","end_date":"2024-07-27"},"page":"2086-2107","date_published":"2024-09-01T00:00:00Z","project":[{"call_identifier":"H2020","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"},{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"publication_identifier":{"eissn":["2640-3498"]},"ec_funded":1},{"publication":"Proceedings of the 41st International Conference on Machine Learning","language":[{"iso":"eng"}],"publication_status":"published","type":"conference","quality_controlled":"1","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2024-09-01T00:00:00Z","page":"12046-12086","conference":{"start_date":"2024-07-21","name":"ICML: International Conference on Machine Learning","end_date":"2024-07-27","location":"Vienna, Austria"},"day":"01","abstract":[{"lang":"eng","text":"As a staple of data analysis and unsupervised learning, the problem of private clustering has been widely studied, under various privacy models. Centralized differential privacy is the first of them, and the problem has also been studied for the local and the shuffle variation. In each case, the goal is to design an algorithm that computes privately a clustering, with the smallest possible error. The study of each variation gave rise to new algorithm: the landscape of private clustering algorithm is therefore quite intricate. In this paper, we show that a 20 year-old algorithm can be slightly modified to work for any of those models. This provides a unified picture: while matching almost all previously known results, it allows us to improve some of them, and extend to a new privacy model, the continual observation setting, where the input is changing over time and the algorithm must output a new solution at each time step."}],"ec_funded":1,"corr_author":"1","publication_identifier":{"eissn":["2640-3498"]},"project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422","name":"Efficient algorithms"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"},{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.This work was partially done while David Saulpic was at the Institute for Science and Technology, Austria (ISTA). David Sauplic has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413.","author":[{"full_name":"La Tour, Max Dupré","last_name":"La Tour","first_name":"Max Dupré"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"first_name":"David","full_name":"Saulpic, David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","last_name":"Saulpic"}],"oa_version":"Published Version","year":"2024","ddc":["000"],"date_updated":"2026-06-18T18:01:02Z","department":[{"_id":"MoHe"}],"month":"09","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2406.11649","open_access":"1"}],"alternative_title":["PMLR"],"external_id":{"arxiv":["2406.11649"]},"_id":"18116","publisher":"ML Research Press","article_processing_charge":"No","citation":{"ieee":"M. D. La Tour, M. Henzinger, and D. Saulpic, “Making old things new: A unified algorithm for differentially private clustering,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 12046–12086.","chicago":"La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:12046–86. ML Research Press, 2024.","ama":"La Tour MD, Henzinger M, Saulpic D. Making old things new: A unified algorithm for differentially private clustering. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:12046-12086.","mla":"La Tour, Max Dupré, et al. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 12046–86.","ista":"La Tour MD, Henzinger M, Saulpic D. 2024. Making old things new: A unified algorithm for differentially private clustering. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 12046–12086.","short":"M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.","apa":"La Tour, M. D., Henzinger, M., &#38; Saulpic, D. (2024). Making old things new: A unified algorithm for differentially private clustering. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 12046–12086). Vienna, Austria: ML Research Press."},"volume":235,"date_created":"2024-09-22T22:01:44Z","arxiv":1,"status":"public","oa":1,"title":"Making old things new: A unified algorithm for differentially private clustering","intvolume":"       235"},{"department":[{"_id":"DaAl"},{"_id":"GradSch"}],"month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2401.04679"}],"date_updated":"2024-10-01T08:22:01Z","author":[{"full_name":"Nikdan, Mahdi","id":"66374281-f394-11eb-9cf6-869147deecc0","last_name":"Nikdan","first_name":"Mahdi"},{"id":"06000900-6068-11ef-8d61-c2472ef2e752","last_name":"Tabesh","full_name":"Tabesh, Soroush","orcid":"0009-0003-4119-6281","first_name":"Soroush"},{"first_name":"Elvir","full_name":"Crncevic, Elvir","id":"41888001-440d-11ef-8299-d0e838b8185e","last_name":"Crncevic"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"acknowledgement":"The authors would like to thank Eldar Kurtic for experimental support and useful suggestions throughout the project","year":"2024","oa_version":"Preprint","oa":1,"intvolume":"       235","title":"RoSA: Accurate parameter-efficient fine-tuning via robust adaptation","arxiv":1,"status":"public","publisher":"ML Research Press","article_processing_charge":"No","volume":235,"date_created":"2024-09-22T22:01:44Z","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.","ista":"Nikdan M, Tabesh S, Crncevic E, Alistarh D-A. 2024. RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 235, 38187–38206.","mla":"Nikdan, Mahdi, et al. “RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 38187–206.","short":"M. Nikdan, S. Tabesh, E. Crncevic, D.-A. Alistarh, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 38187–38206.","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.","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.","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."},"external_id":{"arxiv":["2401.04679"]},"_id":"18117","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://github.com/IST-DASLab/RoSA","relation":"software"}]},"publication":"Proceedings of the 41st International Conference on Machine Learning","publication_identifier":{"eissn":["2640-3498"]},"corr_author":"1","conference":{"end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-21","location":"Vienna, Austria"},"day":"01","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"}],"date_published":"2024-09-01T00:00:00Z","page":"38187-38206"},{"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2402.04054"}],"month":"09","department":[{"_id":"ChLa"}],"alternative_title":["PMLR"],"oa_version":"Published Version","year":"2024","author":[{"first_name":"Hossein","orcid":"0009-0007-3977-6462","last_name":"Zakerinia","id":"653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4","full_name":"Zakerinia, Hossein"},{"full_name":"Behjati, Amin","last_name":"Behjati","first_name":"Amin"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Lampert, Christoph"}],"date_updated":"2026-06-18T18:01:36Z","ddc":["000"],"arxiv":1,"status":"public","oa":1,"intvolume":"       235","title":"More flexible PAC-Bayesian meta-learning by learning learning algorithms","_id":"18118","external_id":{"arxiv":["2402.04054"]},"article_processing_charge":"No","volume":235,"date_created":"2024-09-22T22:01:45Z","citation":{"ama":"Zakerinia H, Behjati A, Lampert C. More flexible PAC-Bayesian meta-learning by learning learning algorithms. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:58122-58139.","ista":"Zakerinia H, Behjati A, Lampert C. 2024. More flexible PAC-Bayesian meta-learning by learning learning algorithms. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 58122–58139.","mla":"Zakerinia, Hossein, et al. “More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 58122–39.","short":"H. Zakerinia, A. Behjati, C. Lampert, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 58122–58139.","apa":"Zakerinia, H., Behjati, A., &#38; Lampert, C. (2024). More flexible PAC-Bayesian meta-learning by learning learning algorithms. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 58122–58139). Vienna, Austria: ML Research Press.","ieee":"H. Zakerinia, A. Behjati, and C. Lampert, “More flexible PAC-Bayesian meta-learning by learning learning algorithms,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 58122–58139.","chicago":"Zakerinia, Hossein, Amin Behjati, and Christoph Lampert. “More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:58122–39. ML Research Press, 2024."},"publisher":"ML Research Press","publication_status":"published","type":"conference","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","publication":"Proceedings of the 41st International Conference on Machine Learning","language":[{"iso":"eng"}],"corr_author":"1","publication_identifier":{"eissn":["2640-3498"]},"page":"58122-58139","date_published":"2024-09-01T00:00:00Z","abstract":[{"text":"We introduce a new framework for studying meta-learning methods using PAC-Bayesian theory. Its main advantage over previous work is that it allows for more flexibility in how the transfer of knowledge between tasks is realized. For previous approaches, this could only happen indirectly, by means of learning prior distributions over models. In contrast, the new generalization bounds that we prove express the process of meta-learning much more directly as learning the learning algorithm that should be used for future tasks. The flexibility of our framework makes it suitable to analyze a wide range of meta-learning mechanisms and even design new mechanisms. Other than our theoretical contributions we also show empirically that our framework improves the prediction quality in practical meta-learning mechanisms.","lang":"eng"}],"conference":{"location":"Vienna, Austria","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-21"},"day":"01"},{"external_id":{"pmid":["37873364"]},"article_type":"original","_id":"18153","publisher":"Springer Nature","article_processing_charge":"Yes","citation":{"short":"M.A. Hajnal, D. Tran, Z. Szabó, A. Albert, K. Safaryan, M. Einstein, M. Vallejo Martelo, P.-O. Polack, P. Golshani, G. Orbán, Nature Communications 15 (2024).","apa":"Hajnal, M. A., Tran, D., Szabó, Z., Albert, A., Safaryan, K., Einstein, M., … Orbán, G. (2024). Shifts in attention drive context-dependent subspace encoding in anterior cingulate cortex in mice during decision making. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-024-49845-2\">https://doi.org/10.1038/s41467-024-49845-2</a>","ama":"Hajnal MA, Tran D, Szabó Z, et al. Shifts in attention drive context-dependent subspace encoding in anterior cingulate cortex in mice during decision making. <i>Nature Communications</i>. 2024;15. doi:<a href=\"https://doi.org/10.1038/s41467-024-49845-2\">10.1038/s41467-024-49845-2</a>","ista":"Hajnal MA, Tran D, Szabó Z, Albert A, Safaryan K, Einstein M, Vallejo Martelo M, Polack P-O, Golshani P, Orbán G. 2024. Shifts in attention drive context-dependent subspace encoding in anterior cingulate cortex in mice during decision making. Nature Communications. 15, 5559.","mla":"Hajnal, Márton Albert, et al. “Shifts in Attention Drive Context-Dependent Subspace Encoding in Anterior Cingulate Cortex in Mice during Decision Making.” <i>Nature Communications</i>, vol. 15, 5559, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1038/s41467-024-49845-2\">10.1038/s41467-024-49845-2</a>.","chicago":"Hajnal, Márton Albert, Duy Tran, Zsombor Szabó, Andrea Albert, Karen Safaryan, Michael Einstein, Mauricio Vallejo Martelo, Pierre-Olivier Polack, Peyman Golshani, and Gergő Orbán. “Shifts in Attention Drive Context-Dependent Subspace Encoding in Anterior Cingulate Cortex in Mice during Decision Making.” <i>Nature Communications</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41467-024-49845-2\">https://doi.org/10.1038/s41467-024-49845-2</a>.","ieee":"M. A. Hajnal <i>et al.</i>, “Shifts in attention drive context-dependent subspace encoding in anterior cingulate cortex in mice during decision making,” <i>Nature Communications</i>, vol. 15. Springer Nature, 2024."},"volume":15,"date_created":"2024-09-28T06:59:03Z","status":"public","pmid":1,"file_date_updated":"2024-10-01T07:13:36Z","intvolume":"        15","title":"Shifts in attention drive context-dependent subspace encoding in anterior cingulate cortex in mice during decision making","oa":1,"author":[{"last_name":"Hajnal","full_name":"Hajnal, Márton Albert","first_name":"Márton Albert"},{"first_name":"Duy","full_name":"Tran, Duy","last_name":"Tran"},{"orcid":"0009-0003-8524-4994","first_name":"Zsombor","last_name":"Szabó","id":"47757b1e-3f56-11ef-9908-8ddefb4d05eb","full_name":"Szabó, Zsombor"},{"first_name":"Andrea","full_name":"Albert, Andrea","last_name":"Albert"},{"first_name":"Karen","full_name":"Safaryan, Karen","last_name":"Safaryan"},{"full_name":"Einstein, Michael","last_name":"Einstein","first_name":"Michael"},{"first_name":"Mauricio","last_name":"Vallejo Martelo","full_name":"Vallejo Martelo, Mauricio"},{"last_name":"Polack","full_name":"Polack, Pierre-Olivier","first_name":"Pierre-Olivier"},{"full_name":"Golshani, Peyman","last_name":"Golshani","first_name":"Peyman"},{"last_name":"Orbán","full_name":"Orbán, Gergő","first_name":"Gergő"}],"year":"2024","oa_version":"Published Version","ddc":["570"],"date_updated":"2024-10-01T07:14:56Z","article_number":"5559","extern":"1","month":"07","has_accepted_license":"1","file":[{"date_updated":"2024-10-01T07:13:36Z","date_created":"2024-10-01T07:13:36Z","checksum":"22caa17a6691884c66c650c61227e903","access_level":"open_access","file_id":"18163","file_name":"2024_NatureComm_Hajnal.pdf","relation":"main_file","file_size":4346510,"content_type":"application/pdf","success":1,"creator":"dernst"}],"date_published":"2024-07-02T00:00:00Z","day":"02","abstract":[{"text":"Attention supports decision making by selecting the features that are relevant for decisions. Selective enhancement of the relevant features and inhibition of distractors has been proposed as potential neural mechanisms driving this selection process. Yet, how attention operates when relevance cannot be directly determined, and the attention signal needs to be internally constructed is less understood. Here we recorded from populations of neurons in the anterior cingulate cortex (ACC) of mice in an attention-shifting task where relevance of stimulus modalities changed across blocks of trials. In contrast with V1 recordings, decoding of the irrelevant modality gradually declined in ACC after an initial transient. Our analytical proof and a recurrent neural network model of the task revealed mutually inhibiting connections that produced context-gated suppression as observed in mice. Using this RNN model we predicted a correlation between contextual modulation of individual neurons and their stimulus drive, which we confirmed in ACC but not in V1.","lang":"eng"}],"fulldoi":"https://doi.org/10.1038/s41467-024-49845-2","publication_identifier":{"issn":["2041-1723"]},"publication":"Nature Communications","language":[{"iso":"eng"}],"tmp":{"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)","image":"/images/cc_by.png"},"type":"journal_article","quality_controlled":"1","publication_status":"published","doi":"10.1038/s41467-024-49845-2","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"department":[{"_id":"MoHe"}],"month":"09","isi":1,"has_accepted_license":"1","alternative_title":["LIPIcs"],"author":[{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Sricharan, A. R.","last_name":"Sricharan","first_name":"A. R."},{"first_name":"Teresa Anna","last_name":"Steiner","full_name":"Steiner, Teresa Anna"}],"acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nTeresa Anna Steiner: Supported by a research grant (VIL51463) from VILLUM FONDEN.","oa_version":"Published Version","year":"2024","ddc":["000"],"date_updated":"2025-12-02T13:47:16Z","article_number":"40","status":"public","arxiv":1,"file_date_updated":"2024-10-01T10:07:14Z","intvolume":"       317","title":"Private counting of distinct elements in the turnstile model and extensions","oa":1,"external_id":{"isi":["001545634500040"],"arxiv":["2408.11637"]},"_id":"18156","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":317,"citation":{"ieee":"M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Private counting of distinct elements in the turnstile model and extensions,” in <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, London, United Kingdom, 2024, vol. 317.","chicago":"Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” In <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, Vol. 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>.","ama":"Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements in the turnstile model and extensions. In: <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>. Vol 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>","ista":"Henzinger M, Sricharan AR, Steiner TA. 2024. Private counting of distinct elements in the turnstile model and extensions. International Conference on Approximation Algorithms for Combinatorial Optimization Problems . APPROX: Conference on Approximation Algorithms for Combinatorial Optimization Problems, LIPIcs, vol. 317, 40.","mla":"Henzinger, Monika, et al. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, vol. 317, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>.","apa":"Henzinger, M., Sricharan, A. R., &#38; Steiner, T. A. (2024). Private counting of distinct elements in the turnstile model and extensions. In <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i> (Vol. 317). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>","short":"M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024."},"date_created":"2024-09-29T22:01:38Z","article_processing_charge":"No","quality_controlled":"1","type":"conference","publication_status":"published","doi":"10.4230/LIPIcs.APPROX/RANDOM.2024.40","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"International Conference on Approximation Algorithms for Combinatorial Optimization Problems ","tmp":{"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)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40","ec_funded":1,"corr_author":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773485"]},"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"date_published":"2024-09-16T00:00:00Z","file":[{"creator":"dernst","success":1,"content_type":"application/pdf","file_size":973917,"relation":"main_file","file_name":"2024_LIPICs_HenzingerM.pdf","file_id":"18166","access_level":"open_access","checksum":"c08b41c896e4d8c69570044808b40e0b","date_created":"2024-10-01T10:07:14Z","date_updated":"2024-10-01T10:07:14Z"}],"day":"16","conference":{"location":"London, United Kingdom","name":"APPROX: Conference on Approximation Algorithms for Combinatorial Optimization Problems","end_date":"2024-08-30","start_date":"2024-08-27"},"abstract":[{"text":"Privately counting distinct elements in a stream is a fundamental data analysis problem with many applications in machine learning. In the turnstile model, Jain et al. [NeurIPS2023] initiated the study of this problem parameterized by the maximum flippancy of any element, i.e., the number of times that the count of an element changes from 0 to above 0 or vice versa. They give an item-level (ε,δ)-differentially private algorithm whose additive error is tight with respect to that parameterization. In this work, we show that a very simple algorithm based on the sparse vector technique achieves a tight additive error for item-level (ε,δ)-differential privacy and item-level ε-differential privacy with regards to a different parameterization, namely the sum of all flippancies. Our second result is a bound which shows that for a large class of algorithms, including all existing differentially private algorithms for this problem, the lower bound from item-level differential privacy extends to event-level differential privacy. This partially answers an open question by Jain et al. [NeurIPS2023].","lang":"eng"}]},{"date_updated":"2025-09-08T09:50:50Z","ddc":["510"],"oa_version":"Published Version","year":"2024","author":[{"orcid":"0000-0002-9881-6870","first_name":"Lorenzo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","last_name":"Dello Schiavo","full_name":"Dello Schiavo, Lorenzo"},{"first_name":"Ronan","last_name":"Herry","full_name":"Herry, Ronan"},{"first_name":"Kohei","full_name":"Suzuki, Kohei","last_name":"Suzuki"}],"has_accepted_license":"1","isi":1,"month":"01","department":[{"_id":"JaMa"}],"date_created":"2024-09-29T22:01:38Z","article_processing_charge":"Yes","citation":{"apa":"Dello Schiavo, L., Herry, R., &#38; Suzuki, K. (2024). Wasserstein geometry and Ricci curvature bounds for Poisson spaces. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.270\">https://doi.org/10.5802/jep.270</a>","short":"L. Dello Schiavo, R. Herry, K. Suzuki, Journal de l’Ecole Polytechnique - Mathematiques 11 (2024) 957–1010.","mla":"Dello Schiavo, Lorenzo, et al. “Wasserstein Geometry and Ricci Curvature Bounds for Poisson Spaces.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 11, Ecole Polytechnique, 2024, pp. 957–1010, doi:<a href=\"https://doi.org/10.5802/jep.270\">10.5802/jep.270</a>.","ista":"Dello Schiavo L, Herry R, Suzuki K. 2024. Wasserstein geometry and Ricci curvature bounds for Poisson spaces. Journal de l’Ecole Polytechnique - Mathematiques. 11, 957–1010.","ama":"Dello Schiavo L, Herry R, Suzuki K. Wasserstein geometry and Ricci curvature bounds for Poisson spaces. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2024;11:957-1010. doi:<a href=\"https://doi.org/10.5802/jep.270\">10.5802/jep.270</a>","chicago":"Dello Schiavo, Lorenzo, Ronan Herry, and Kohei Suzuki. “Wasserstein Geometry and Ricci Curvature Bounds for Poisson Spaces.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2024. <a href=\"https://doi.org/10.5802/jep.270\">https://doi.org/10.5802/jep.270</a>.","ieee":"L. Dello Schiavo, R. Herry, and K. Suzuki, “Wasserstein geometry and Ricci curvature bounds for Poisson spaces,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 11. Ecole Polytechnique, pp. 957–1010, 2024."},"volume":11,"publisher":"Ecole Polytechnique","_id":"18158","article_type":"original","external_id":{"arxiv":["2303.00398"],"isi":["001367254000003"]},"oa":1,"intvolume":"        11","title":"Wasserstein geometry and Ricci curvature bounds for Poisson spaces","file_date_updated":"2024-10-01T07:31:56Z","arxiv":1,"status":"public","language":[{"iso":"eng"}],"tmp":{"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)","image":"/images/cc_by.png"},"publication":"Journal de l'Ecole Polytechnique - Mathematiques","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","doi":"10.5802/jep.270","publication_status":"published","quality_controlled":"1","type":"journal_article","abstract":[{"text":"We study the geometry of Poisson point processes from the point of view of optimal transport and Ricci lower bounds. We construct a Riemannian structure on the space of point processes and the associated distance W that corresponds to the Benamou–Brenier variational formula. Our main tool is a non-local continuity equation formulated with the difference operator. The closure of the domain of the relative entropy is a complete geodesic space, when endowed with \r\nW. The geometry of this non-local infinite-dimensional space is analogous to that of spaces with positive Ricci curvature. Among others: (a) the Ornstein–Uhlenbeck semi-group is the gradient flow of the relative entropy; (b) the Poisson space has an entropic Ricci curvature bounded from below by 1; (c) W satisfies an HWI inequality.","lang":"eng"},{"lang":"fre","text":"Nous étudions la géométrie des processus ponctuels de Poisson à travers le prisme du transport optimal et de la minoration de la courbure de Ricci. Nous construisons une structure\r\nriemannienne sur l’espace des processus ponctuels et la distance associée W qui concorde avec la formulation variationnelle de Benamou–Brenier. Notre analyse repose sur une équation de continuité non locale définie à l’aide de l’opérateur de différence. La fermeture du domaine de l’entropie relative, équipé de W, est un espace géodésique complet. La géométrie de cet espace non local et de dimension infinie est analogue à celle des espaces à courbure de Ricci strictement positive. Entre autres : (a) le semi-groupe d’Ornstein–Uhlenbeck est le flot du gradient de l’entropie relative ; (b) l’espace de Poisson a une courbure de Ricci entropique minorée par 1 ; (c) W satisfait une inégalité HWI."}],"day":"01","page":"957-1010","date_published":"2024-01-01T00:00:00Z","file":[{"creator":"dernst","success":1,"content_type":"application/pdf","file_size":1250553,"relation":"main_file","file_name":"2024_JourEcolePolytechniqueMath_DelloSchiavo.pdf","file_id":"18164","access_level":"open_access","checksum":"5a51da5fb5f7fcaada378d43444cced8","date_created":"2024-10-01T07:31:56Z","date_updated":"2024-10-01T07:31:56Z"}],"publication_identifier":{"eissn":["2270-518X"],"issn":["2429-7100"]},"fulldoi":"https://doi.org/10.5802/jep.270","corr_author":"1"},{"scopus_import":"1","doi":"10.24963/ijcai.2024/1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"publication":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","publication_identifier":{"issn":["1045-0823"],"isbn":["9781956792041"]},"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"corr_author":"1","fulldoi":"https://doi.org/10.24963/ijcai.2024/1","ec_funded":1,"conference":{"location":"Jeju, Korea","start_date":"2024-08-03","name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2024-08-09"},"day":"01","abstract":[{"lang":"eng","text":"Markov Decision Processes (MDPs) are a classical model for decision making in the presence of uncertainty. Often they are viewed as state transformers with planning objectives defned with respect to paths over MDP states. An increasingly\r\npopular alternative is to view them as distribution transformers, giving rise to a sequence of probability distributions over MDP states. For instance, reachability and safety properties in modeling robot swarms or chemical reaction networks are naturally defned in terms of probability distributions over states. Verifying such distributional properties is known to be hard and often beyond the reach of classical state-based verifcation techniques. In this work, we consider the problems of certifed policy (i.e. controller) verifcation and synthesis in MDPs under distributional reach-avoidance specifcations. By certifed we mean that, along with a policy, we also aim to synthesize a (checkable) certifcate ensuring that the MDP indeed satisfes the property. Thus, given the target set of distributions and an unsafe set of distributions over MDP states, our goal is to either synthesize a certifcate for a given policy or synthesize a policy along with a certifcate, proving that the target distribution can be reached while avoiding unsafe distributions. To solve this problem, we introduce the novel notion of distributional reach-avoid certifcates and present automated procedures for (1) synthesizing a certifcate for a given policy, and (2) synthesizing a policy together with the certifcate, both providing formal guarantees on certifcate correctness. Our experimental evaluation demonstrates the ability of our method to solve several non-trivial examples, including a multi-agent robot-swarm model, to synthesize certifed policies and to certify existing policies. "}],"date_published":"2024-09-01T00:00:00Z","page":"3-12","department":[{"_id":"KrCh"}],"month":"09","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.04015","open_access":"1"}],"date_updated":"2025-04-14T07:52:46Z","acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt), the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 1 grant, Google Research Award 2023 and the SBI Foundation Hub for Data and Analytics.","author":[{"last_name":"Akshay","full_name":"Akshay, S","first_name":"S"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-1712-2165","first_name":"Tobias","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","first_name":"Dorde"}],"oa_version":"Preprint","year":"2024","oa":1,"title":"Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties","arxiv":1,"status":"public","publisher":"International Joint Conferences on Artificial Intelligence","article_processing_charge":"No","citation":{"mla":"Akshay, S., et al. “Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties.” <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2024, pp. 3–12, doi:<a href=\"https://doi.org/10.24963/ijcai.2024/1\">10.24963/ijcai.2024/1</a>.","ista":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2024. Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 3–12.","ama":"Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. In: <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2024:3-12. doi:<a href=\"https://doi.org/10.24963/ijcai.2024/1\">10.24963/ijcai.2024/1</a>","apa":"Akshay, S., Chatterjee, K., Meggendorfer, T., &#38; Zikelic, D. (2024). Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. In <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i> (pp. 3–12). Jeju, Korea: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2024/1\">https://doi.org/10.24963/ijcai.2024/1</a>","short":"S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 3–12.","ieee":"S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties,” in <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i>, Jeju, Korea, 2024, pp. 3–12.","chicago":"Akshay, S, Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties.” In <i>Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence</i>, 3–12. International Joint Conferences on Artificial Intelligence, 2024. <a href=\"https://doi.org/10.24963/ijcai.2024/1\">https://doi.org/10.24963/ijcai.2024/1</a>."},"date_created":"2024-09-29T22:01:38Z","external_id":{"arxiv":["2405.04015"]},"_id":"18159"},{"doi":"10.24963/ijcai.2024/741","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","type":"conference","publication_status":"published","language":[{"iso":"eng"}],"publication":"33rd International Joint Conference on Artificial Intelligence","publication_identifier":{"isbn":["9781956792041"],"issn":["1045-0823"]},"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"fulldoi":"https://doi.org/10.24963/ijcai.2024/741","corr_author":"1","ec_funded":1,"day":"01","conference":{"location":"Jeju, South Korea","start_date":"2024-08-03","end_date":"2024-08-09","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"OA_place":"repository","abstract":[{"lang":"eng","text":"Markov decision processes (MDPs) provide a standard framework for sequential decision making under uncertainty. However, MDPs do not take uncertainty in transition probabilities into account. Robust Markov decision processes (RMDPs) address this shortcoming of MDPs by assigning to each transition an uncertainty set rather than a single probability value. In this work, we consider polytopic RMDPs in which all uncertainty sets are polytopes and study the problem of solving long-run average reward polytopic RMDPs. We present a novel perspective on this problem and show that it can be reduced to solving long-run average reward turn-based stochastic games with finite state and action spaces. This reduction allows us to derive several important consequences that were hitherto not known to hold for polytopic RMDPs. First, we derive new computational complexity bounds for solving long-run average reward polytopic RMDPs, showing for the first time that the threshold decision problem for them is in NP∩CONP and that they admit a randomized algorithm with sub-exponential expected runtime. Second, we present Robust Polytopic Policy Iteration (RPPI), a novel policy iteration algorithm for solving long-run average reward polytopic RMDPs. Our experimental evaluation shows that RPPI is much more efficient in solving long-run average reward polytopic RMDPs compared to state-of-the-art methods based on value iteration. "}],"date_published":"2024-09-01T00:00:00Z","page":"6707-6715","OA_type":"green","department":[{"_id":"KrCh"}],"month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2312.13912"}],"date_updated":"2025-04-14T07:52:46Z","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-8595-0587","first_name":"Ehsan","last_name":"Kafshdar Goharshadi","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","full_name":"Kafshdar Goharshadi, Ehsan"},{"id":"67638922-f394-11eb-9cf6-f20423e08757","last_name":"Karrabi","full_name":"Karrabi, Mehrdad","first_name":"Mehrdad"},{"full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotný","first_name":"Petr"},{"first_name":"Dorde","orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt) and the Czech Science Foundation\r\ngrant no. GA23-06963S.","oa_version":"Preprint","year":"2024","title":"Solving long-run average reward robust MDPs via stochastic games","oa":1,"status":"public","arxiv":1,"publisher":"International Joint Conferences on Artificial Intelligence","article_processing_charge":"No","date_created":"2024-09-29T22:01:39Z","citation":{"ieee":"K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, and D. Zikelic, “Solving long-run average reward robust MDPs via stochastic games,” in <i>33rd International Joint Conference on Artificial Intelligence</i>, Jeju, South Korea, 2024, pp. 6707–6715.","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Mehrdad Karrabi, Petr Novotný, and Dorde Zikelic. “Solving Long-Run Average Reward Robust MDPs via Stochastic Games.” In <i>33rd International Joint Conference on Artificial Intelligence</i>, 6707–15. International Joint Conferences on Artificial Intelligence, 2024. <a href=\"https://doi.org/10.24963/ijcai.2024/741\">https://doi.org/10.24963/ijcai.2024/741</a>.","ista":"Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. 2024. Solving long-run average reward robust MDPs via stochastic games. 33rd International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 6707–6715.","ama":"Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. Solving long-run average reward robust MDPs via stochastic games. In: <i>33rd International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2024:6707-6715. doi:<a href=\"https://doi.org/10.24963/ijcai.2024/741\">10.24963/ijcai.2024/741</a>","mla":"Chatterjee, Krishnendu, et al. “Solving Long-Run Average Reward Robust MDPs via Stochastic Games.” <i>33rd International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–15, doi:<a href=\"https://doi.org/10.24963/ijcai.2024/741\">10.24963/ijcai.2024/741</a>.","short":"K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, D. Zikelic, in:, 33rd International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–6715.","apa":"Chatterjee, K., Goharshady, E., Karrabi, M., Novotný, P., &#38; Zikelic, D. (2024). Solving long-run average reward robust MDPs via stochastic games. In <i>33rd International Joint Conference on Artificial Intelligence</i> (pp. 6707–6715). Jeju, South Korea: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2024/741\">https://doi.org/10.24963/ijcai.2024/741</a>"},"external_id":{"arxiv":["2312.13912"]},"_id":"18160"}]