--- _id: '18086' abstract: - lang: eng text: "Abstract. Continuous group key agreement (CGKA) allows a group of\r\nusers to maintain a continuously updated shared key in an asynchronous\r\nsetting where parties only come online sporadically and their messages\r\nare relayed by an untrusted server. CGKA captures the basic primitive\r\nunderlying group messaging schemes.\r\nCurrent solutions including TreeKEM (“Messaging Layer Security”\r\n(MLS) IETF RFC 9420) cannot handle concurrent requests while retaining low communication complexity. The exception being CoCoA, which\r\nis concurrent while having extremely low communication complexity (in\r\ngroups of size n and for m concurrent updates the communication per\r\nuser is log(n), i.e., independent of m). The main downside of CoCoA\r\nis that in groups of size n, users might have to do up to log(n) update\r\nrequests to the server to ensure their (potentially corrupted) key material has been refreshed.\r\nIn this work we present a “fast healing” concurrent CGKA protocol,\r\nnamed DeCAF, where users will heal after at most log(t) requests, with\r\nt being the number of corrupted users. While also suitable for the standard central-server setting, our protocol is particularly interesting for\r\nrealizing decentralized group messaging, where protocol messages (add,\r\nremove, update) are being posted on some append-only data structure\r\nrather than sent to a server. In this setting, concurrency is crucial once\r\nthe rate of requests exceeds, say, the rate at which new blocks are added\r\nto a blockchain.\r\nIn the central-server setting, CoCoA (the only alternative with concurrency, sub-linear communication and basic post-compromise security)\r\nenjoys much lower download communication. However, in the decentralized setting – where there is no server which can craft specific messages\r\nfor different users to reduce their download communication – our protocol\r\nsignificantly outperforms CoCoA. DeCAF heals in fewer epochs (log(t)\r\nvs. log(n)) while incurring a similar per epoch per user communication\r\ncost." alternative_title: - LNCS article_processing_charge: No author: - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Benedikt full_name: Auerbach, Benedikt id: D33D2B18-E445-11E9-ABB7-15F4E5697425 last_name: Auerbach orcid: 0000-0002-7553-6606 - first_name: Miguel full_name: Cueto Noval, Miguel id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc last_name: Cueto Noval orcid: 0000-0002-2505-4246 - first_name: Karen full_name: Klein, Karen id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87 last_name: Klein - first_name: Guillermo full_name: Pascual Perez, Guillermo id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87 last_name: Pascual Perez orcid: 0000-0001-8630-415X - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. DeCAF: Decentralizable CGKA with fast healing. In: Galdi C, Phan DH, eds. Security and Cryptography for Networks: 14th International Conference. Vol 14974. Cham: Springer Nature; 2024:294–313. doi:10.1007/978-3-031-71073-5_14' apa: 'Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., & Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In C. Galdi & D. H. Phan (Eds.), Security and Cryptography for Networks: 14th International Conference (Vol. 14974, pp. 294–313). Cham: Springer Nature. https://doi.org/10.1007/978-3-031-71073-5_14' chicago: 'Alwen, Joel F, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “DeCAF: Decentralizable CGKA with Fast Healing.” In Security and Cryptography for Networks: 14th International Conference, edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature, 2024. https://doi.org/10.1007/978-3-031-71073-5_14.' ieee: 'J. F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, and K. Z. Pietrzak, “DeCAF: Decentralizable CGKA with fast healing,” in Security and Cryptography for Networks: 14th International Conference, Amalfi, Italy, 2024, vol. 14974, pp. 294–313.' ista: 'Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. 2024. DeCAF: Decentralizable CGKA with fast healing. Security and Cryptography for Networks: 14th International Conference. SCN: Security and Cryptography for Networks, LNCS, vol. 14974, 294–313.' mla: 'Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” Security and Cryptography for Networks: 14th International Conference, edited by Clemente Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:10.1007/978-3-031-71073-5_14.' short: 'J.F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, in:, C. Galdi, D.H. Phan (Eds.), Security and Cryptography for Networks: 14th International Conference, Springer Nature, Cham, 2024, pp. 294–313.' conference: end_date: 2024-09-13 location: Amalfi, Italy name: 'SCN: Security and Cryptography for Networks' start_date: 2024-09-11 corr_author: '1' date_created: 2024-09-18T11:35:14Z date_published: 2024-09-10T00:00:00Z date_updated: 2026-04-07T13:01:26Z day: '10' department: - _id: GradSch - _id: KrPi doi: 10.1007/978-3-031-71073-5_14 editor: - first_name: Clemente full_name: Galdi, Clemente last_name: Galdi - first_name: Duong Hieu full_name: Phan, Duong Hieu last_name: Phan external_id: isi: - '001330408000014' intvolume: ' 14974' isi: 1 language: - iso: eng month: '09' oa_version: None page: 294–313 place: Cham publication: 'Security and Cryptography for Networks: 14th International Conference' publication_identifier: eisbn: - '9783031710735' eissn: - 1611-3349 isbn: - '9783031710728' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '18088' relation: dissertation_contains status: public status: public title: 'DeCAF: Decentralizable CGKA with fast healing' type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 14974 year: '2024' ... --- APC_amount: 3028,31 EUR DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '18087' abstract: - lang: eng text: We present a theory describing the interaction of structured light, such as light carrying orbital angular momentum, with molecules. The light-matter interaction Hamiltonian we derive is expressed through couplings between spherical gradients of the electric field and the (transition) electric multipole moments of a particle of any nontrivial rotation point group. Our model can therefore accommodate an arbitrary complexity of the molecular and electric field structure, and it can be straightforwardly extended to atoms or nanostructures. Applying this framework to rovibrational spectroscopy of molecules, we uncover the general mechanism of angular momentum exchange between the spin and orbital angular momenta of light, molecular rotation, and its center-of-mass motion. We show that the nonzero vorticity of Laguerre-Gaussian beams can strongly enhance certain rovibrational transitions that are considered forbidden in the case of nonhelical light. We discuss the experimental requirements for the observation of these forbidden transitions in state-of-the-art spatially resolved spectroscopy measurements. acknowledgement: We are grateful to Emilio Pisanty and Philipp Lunt for valuable discussions. This research was funded wholly or in part by the Austrian Science Fund (FWF) [10.55776/F1004]. G.M.K. gratefully acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). O.H.H. acknowledges support by the Austrian Science Fund (FWF) [10.55776/P36040]. Furthermore, the financial support by the Austrian Federal Ministry for Digital and Economic Affairs, the National Foundation for Research, Technology and Development, and the Christian Doppler Research Association is gratefully acknowledged. article_number: '033277' article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Mikhail full_name: Maslov, Mikhail id: 2E65BB0E-F248-11E8-B48F-1D18A9856A87 last_name: Maslov orcid: 0000-0003-4074-2570 - first_name: Georgios full_name: Koutentakis, Georgios id: d7b23d3a-9e21-11ec-b482-f76739596b95 last_name: Koutentakis - first_name: Mateja full_name: Hrast, Mateja id: 48dbb294-2a9c-11ef-905d-f56be71f0e5d last_name: Hrast - first_name: Oliver H. full_name: Heckl, Oliver H. last_name: Heckl - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 citation: ama: Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. Theory of angular momentum transfer from light to molecules. Physical Review Research. 2024;6(3). doi:10.1103/physrevresearch.6.033277 apa: Maslov, M., Koutentakis, G., Hrast, M., Heckl, O. H., & Lemeshko, M. (2024). Theory of angular momentum transfer from light to molecules. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.6.033277 chicago: Maslov, Mikhail, Georgios Koutentakis, Mateja Hrast, Oliver H. Heckl, and Mikhail Lemeshko. “Theory of Angular Momentum Transfer from Light to Molecules.” Physical Review Research. American Physical Society, 2024. https://doi.org/10.1103/physrevresearch.6.033277. ieee: M. Maslov, G. Koutentakis, M. Hrast, O. H. Heckl, and M. Lemeshko, “Theory of angular momentum transfer from light to molecules,” Physical Review Research, vol. 6, no. 3. American Physical Society, 2024. ista: Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. 2024. Theory of angular momentum transfer from light to molecules. Physical Review Research. 6(3), 033277. mla: Maslov, Mikhail, et al. “Theory of Angular Momentum Transfer from Light to Molecules.” Physical Review Research, vol. 6, no. 3, 033277, American Physical Society, 2024, doi:10.1103/physrevresearch.6.033277. short: M. Maslov, G. Koutentakis, M. Hrast, O.H. Heckl, M. Lemeshko, Physical Review Research 6 (2024). corr_author: '1' date_created: 2024-09-18T11:43:16Z date_published: 2024-09-10T00:00:00Z date_updated: 2026-04-07T11:52:53Z day: '10' ddc: - '530' department: - _id: GradSch - _id: MiLe doi: 10.1103/physrevresearch.6.033277 ec_funded: 1 external_id: arxiv: - '2310.00095' file: - access_level: open_access checksum: 8f744d94956a1683b473b1cf9b411a37 content_type: application/pdf creator: dernst date_created: 2024-09-23T09:46:20Z date_updated: 2024-09-23T09:46:20Z file_id: '18125' file_name: 2024_PhysicalReviewResearch_Maslov.pdf file_size: 1563824 relation: main_file success: 1 file_date_updated: 2024-09-23T09:46:20Z has_accepted_license: '1' intvolume: ' 6' issue: '3' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '09' oa: 1 oa_version: Published Version project: - _id: 7c040762-9f16-11ee-852c-dd79eeee4ab3 grant_number: F100403 name: Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' - _id: 2688CF98-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '801770' name: 'Angulon: physics and applications of a new quasiparticle' - _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1 call_identifier: FWF name: FWF Open Access Fund publication: Physical Review Research publication_identifier: eissn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' related_material: record: - id: '19048' relation: dissertation_contains status: public scopus_import: '1' status: public title: Theory of angular momentum transfer from light to molecules tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2024' ... --- OA_place: publisher _id: '18088' abstract: - lang: eng text: "Instant messaging applications like Whatsapp, Signal or Telegram have become ubiquitous in today's society.\r\nMany of them provide not only end-to-end encryption, but also security guarantees even when the key material gets compromised.\r\nThese are achieved through frequent key update performed by users.\r\nIn particular, the compromise of a group key should preserve confidentiality of previously exchanged messages (forward secrecy), and a subsequent key update will ensure security for future ones (post-compromise security).\r\nThough great protocols for one-on-one communication have been known for some time, the design of ones that scale efficiently for larger groups while achieving akin security guarantees is a hard problem.\r\nA great deal of research has been aimed at this topic, much of it under the umbrella of the Messaging Layer Security (MLS) working group at the IETF. \r\nStarted in 2018, this joint effort by academics and industry culminated in 2023 with the publication of the first standard for secure group messaging [IETF, RFC9420].\r\n\r\nAt the core of secure group messaging is a cryptographic primitive termed Continuous Group Key Agreement, or CGKA [Alwen et al. 2021], that essentially allows a changing group of users to agree on a common key with the added functionality security against compromises is achieved by users asynchronously issuing a key update. In this thesis we contribute to the understanding of CGKA across different angles.\r\nFirst, we present a new technique to effect dynamic operations in groups, i.e., add or remove members, that can be more efficient that the one employed by MLS in certain settings.\r\nConsidering the setting of users belonging to multiple overlapping groups, we then show lowerbounds on the communication cost of constructions that leverage said overlap, at the same time showing protocols that are asymptotically optimal and efficient for practical settings, respectively. Along the way, we show that the communication cost of key updates in MLS is average-cost optimal.\r\nAn important feature in CGKA protocols, particularly for big groups, is the possibility of executing several group operations concurrently. While later versions of MLS support this, they do at the cost of worsening the communication efficiency of future group operations.\r\nIn this thesis we introduce two new protocols that permit concurrency without any negative effect on efficiency. Our protocols circumvent previously existing lower bounds by satisfying a new notion of post-compromise security that only asks for security to be re-established after a certain number of key updates have taken place. While this can be slower than MLS in terms of rounds of communication, we show that it leads to more efficient overall communication. \r\nAdditionally, we introduce a new technique that allows group members to decrease the information they need to store and download, which makes one of our protocols enjoy much lower download cost than any other existing CGKA constructions. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Guillermo full_name: Pascual Perez, Guillermo id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87 last_name: Pascual Perez orcid: 0000-0001-8630-415X citation: ama: Pascual Perez G. On the efficiency and security of secure group messaging. 2024. doi:10.15479/at:ista:18088 apa: Pascual Perez, G. (2024). On the efficiency and security of secure group messaging. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18088 chicago: Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group Messaging.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18088. ieee: G. Pascual Perez, “On the efficiency and security of secure group messaging,” Institute of Science and Technology Austria, 2024. ista: Pascual Perez G. 2024. On the efficiency and security of secure group messaging. Institute of Science and Technology Austria. mla: Pascual Perez, Guillermo. On the Efficiency and Security of Secure Group Messaging. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18088. short: G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-09-18T12:59:49Z date_published: 2024-09-18T00:00:00Z date_updated: 2026-04-07T13:01:26Z day: '18' ddc: - '000' degree_awarded: PhD department: - _id: KrPi - _id: GradSch doi: 10.15479/at:ista:18088 ec_funded: 1 file: - access_level: closed checksum: ce0dca715b3df48e52e2e891b6ac1bc5 content_type: application/x-zip-compressed creator: gpascual date_created: 2024-09-19T12:35:38Z date_updated: 2024-09-19T12:35:38Z file_id: '18099' file_name: thesis_bundle.zip file_size: 11917734 relation: source_file - access_level: open_access checksum: 4a2c72e90f1a0ef2a13cff800f8d1265 content_type: application/pdf creator: gpascual date_created: 2024-09-19T12:36:08Z date_updated: 2024-09-19T12:36:08Z file_id: '18100' file_name: thesis_gpasper.pdf file_size: 2729427 relation: main_file file_date_updated: 2024-09-19T12:36:08Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '09' oa: 1 oa_version: Published Version page: '239' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10408' relation: part_of_dissertation status: public - id: '11476' relation: part_of_dissertation status: public - id: '18086' relation: part_of_dissertation status: public - id: '10049' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: On the efficiency and security of secure group messaging tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- _id: '18097' 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 \U0001D4AE (either manifold or general set with positive reach) such that one can infer the homotopy of \U0001D4AE 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." 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." alternative_title: - LIPIcs article_number: '87' article_processing_charge: Yes author: - first_name: Dominique full_name: Attali, Dominique last_name: Attali - first_name: Hana full_name: Kourimska, Hana id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E last_name: Kourimska orcid: 0000-0001-7841-0091 - first_name: Christopher D full_name: Fillmore, Christopher D id: 35638A5C-AAC7-11E9-B0BF-5503E6697425 last_name: Fillmore - first_name: Ishika full_name: Ghosh, Ishika id: ee449b28-344d-11ef-a6d5-9ca430e9e9ff last_name: Ghosh - first_name: Andre full_name: Lieutier, Andre last_name: Lieutier - first_name: Elizabeth R full_name: Stephenson, Elizabeth R id: 2D04F932-F248-11E8-B48F-1D18A9856A87 last_name: Stephenson orcid: 0000-0002-6862-208X - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: 'Attali D, Kourimska H, Fillmore CD, et al. The ultimate frontier: An optimality construction for homotopy inference (media exposition). In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.87' apa: 'Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., & Wintraecken, M. (2024). The ultimate frontier: An optimality construction for homotopy inference (media exposition). In 40th International Symposium on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.87' 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 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.87.' ieee: 'D. Attali et al., “The ultimate frontier: An optimality construction for homotopy inference (media exposition),” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293.' 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).” 40th International Symposium on Computational Geometry, vol. 293, 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.87.' 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. conference: end_date: 2024-06-14 location: Athens, Greece name: 'SoCG: Symposium on Computational Geometry' start_date: 2024-06-11 corr_author: '1' date_created: 2024-09-19T10:29:48Z date_published: 2024-06-06T00:00:00Z date_updated: 2025-04-15T07:16:58Z day: '06' ddc: - '000' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2024.87 ec_funded: 1 file: - access_level: open_access checksum: 9355c2e60b8ec285e1b22719c5b73f1a content_type: application/pdf creator: dernst date_created: 2024-09-19T10:30:37Z date_updated: 2024-09-19T10:30:37Z file_id: '18098' file_name: 2024_LIPICs_Attali.pdf file_size: 3507177 relation: main_file success: 1 file_date_updated: 2024-09-19T10:30:37Z has_accepted_license: '1' intvolume: ' 293' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses publication: 40th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959773164' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' status: public title: 'The ultimate frontier: An optimality construction for homotopy inference (media exposition)' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 293 year: '2024' ... --- _id: '18107' abstract: - lang: eng text: We consider a dilute fully spin-polarized Fermi gas at positive temperature in dimensions d∈{1,2,3} . We show that the pressure of the interacting gas is bounded from below by that of the free gas plus, to leading order, an explicit term of order adρ2+2/d, where a is the p-wave scattering length of the repulsive interaction and ρ is the particle density. The results are valid for a wide range of repulsive interactions, including that of a hard core, and uniform in temperatures at most of the order of the Fermi temperature. A central ingredient in the proof is a rigorous implementation of the fermionic cluster expansion of Gaudin, Gillespie and Ripka (Nucl. Phys. A, 176.2 (1971), pp. 237–260). acknowledgement: 'Financial support by the Austrian Science Fund (FWF) through grant DOI: 10.55776/I6427 (as part of the SFB/TRR 352) is gratefully acknowledged.' article_number: e78 article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Asbjørn Bækgaard full_name: Lauritsen, Asbjørn Bækgaard id: e1a2682f-dc8d-11ea-abe3-81da9ac728f1 last_name: Lauritsen orcid: 0000-0003-4476-2288 - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: 'Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 2024;12. doi:10.1017/fms.2024.56' apa: 'Lauritsen, A. B., & Seiringer, R. (2024). Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2024.56' chicago: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” Forum of Mathematics, Sigma. Cambridge University Press, 2024. https://doi.org/10.1017/fms.2024.56.' ieee: 'A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi gas: Lower bound,” Forum of Mathematics, Sigma, vol. 12. Cambridge University Press, 2024.' ista: 'Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.' mla: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” Forum of Mathematics, Sigma, vol. 12, e78, Cambridge University Press, 2024, doi:10.1017/fms.2024.56.' short: A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024). corr_author: '1' date_created: 2024-09-20T12:25:25Z date_published: 2024-09-09T00:00:00Z date_updated: 2026-04-07T13:01:40Z day: '09' ddc: - '510' department: - _id: GradSch - _id: RoSe doi: 10.1017/fms.2024.56 external_id: arxiv: - '2407.05990' isi: - '001307817400001' file: - access_level: open_access checksum: 330b881240013213a8e08538fec13d29 content_type: application/pdf creator: dernst date_created: 2024-09-23T09:56:17Z date_updated: 2024-09-23T09:56:17Z file_id: '18126' file_name: 2024_ForumMath_Lauritsen.pdf file_size: 599886 relation: main_file success: 1 file_date_updated: 2024-09-23T09:56:17Z has_accepted_license: '1' intvolume: ' 12' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b grant_number: I06427 name: Mathematical Challenges in BCS Theory of Superconductivity publication: Forum of Mathematics, Sigma publication_identifier: issn: - 2050-5094 publication_status: published publisher: Cambridge University Press quality_controlled: '1' related_material: record: - id: '18135' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Pressure of a dilute spin-polarized Fermi gas: Lower bound' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 12 year: '2024' ... --- APC_amount: 2742,92 EUR OA_place: publisher OA_type: hybrid _id: '18108' abstract: - lang: eng 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. 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." article_number: e2319341121 article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Tamás full_name: Hausel, Tamás id: 4A0666D8-F248-11E8-B48F-1D18A9856A87 last_name: Hausel orcid: 0000-0002-9582-2634 citation: ama: Hausel T. Commutative avatars of representations of semisimple Lie groups. Proceedings of the National Academy of Sciences of the United States of America. 2024;121(38). doi:10.1073/pnas.2319341121 apa: Hausel, T. (2024). Commutative avatars of representations of semisimple Lie groups. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2319341121 chicago: Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie Groups.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2319341121. ieee: T. Hausel, “Commutative avatars of representations of semisimple Lie groups,” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 38. National Academy of Sciences, 2024. 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.” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 38, e2319341121, National Academy of Sciences, 2024, doi:10.1073/pnas.2319341121. short: T. Hausel, Proceedings of the National Academy of Sciences of the United States of America 121 (2024). corr_author: '1' date_created: 2024-09-22T22:01:41Z date_published: 2024-09-17T00:00:00Z date_updated: 2025-05-08T09:57:59Z day: '17' ddc: - '510' department: - _id: TaHa doi: 10.1073/pnas.2319341121 external_id: pmid: - '39259592' file: - access_level: open_access checksum: df80c873633c6734d2e324841e69db58 content_type: application/pdf creator: dernst date_created: 2024-09-23T11:22:56Z date_updated: 2024-09-23T11:22:56Z file_id: '18127' file_name: 2024_PNAS_Hausel.pdf file_size: 3764695 relation: main_file success: 1 file_date_updated: 2024-09-23T11:22:56Z has_accepted_license: '1' intvolume: ' 121' issue: '38' language: - iso: eng month: '09' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 34b2c9cb-11ca-11ed-8bc3-a50ba74ca4a3 grant_number: P35847 name: Geometry of the tip of the global nilpotent cone publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' related_material: link: - relation: press_release url: https://ista.ac.at/en/news/big-algebras-a-dictionary-of-abstract-math/ scopus_import: '1' status: public title: Commutative avatars of representations of semisimple Lie groups tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 121 year: '2024' ... --- _id: '18109' 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. 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." article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Konstantin full_name: Stark, Konstantin last_name: Stark - first_name: Badr full_name: Kilani, Badr last_name: Kilani - first_name: Sven full_name: Stockhausen, Sven last_name: Stockhausen - first_name: Johanna full_name: Busse, Johanna last_name: Busse - first_name: Irene full_name: Schubert, Irene last_name: Schubert - first_name: Thuy Duong full_name: Tran, Thuy Duong last_name: Tran - first_name: Florian R full_name: Gärtner, Florian R id: 397A88EE-F248-11E8-B48F-1D18A9856A87 last_name: Gärtner orcid: 0000-0001-6120-3723 - first_name: Alexander full_name: Leunig, Alexander last_name: Leunig - first_name: Kami full_name: Pekayvaz, Kami last_name: Pekayvaz - first_name: Leo full_name: Nicolai, Leo last_name: Nicolai - first_name: Valeria full_name: Fumagalli, Valeria last_name: Fumagalli - first_name: Julia full_name: Stermann, Julia last_name: Stermann - first_name: Felix full_name: Stephan, Felix last_name: Stephan - first_name: Christian full_name: David, Christian last_name: David - first_name: Martin B. full_name: Müller, Martin B. last_name: Müller - first_name: Birgitta full_name: Heyman, Birgitta last_name: Heyman - first_name: Anja full_name: Lux, Anja last_name: Lux - first_name: Alexandra full_name: Da Palma Guerreiro, Alexandra last_name: Da Palma Guerreiro - first_name: Lukas P. full_name: Frenzel, Lukas P. last_name: Frenzel - first_name: Christoph Q. full_name: Schmidt, Christoph Q. last_name: Schmidt - first_name: Arthur full_name: Dopler, Arthur last_name: Dopler - first_name: Markus full_name: Moser, Markus last_name: Moser - first_name: Sue full_name: Chandraratne, Sue last_name: Chandraratne - first_name: Marie Luise full_name: Von Brühl, Marie Luise last_name: Von Brühl - first_name: Michael full_name: Lorenz, Michael last_name: Lorenz - first_name: Thomas full_name: Korff, Thomas last_name: Korff - first_name: Martina full_name: Rudelius, Martina last_name: Rudelius - first_name: Oliver full_name: Popp, Oliver last_name: Popp - first_name: Marieluise full_name: Kirchner, Marieluise last_name: Kirchner - first_name: Philipp full_name: Mertins, Philipp last_name: Mertins - first_name: Falk full_name: Nimmerjahn, Falk last_name: Nimmerjahn - first_name: Matteo full_name: Iannacone, Matteo last_name: Iannacone - first_name: Markus full_name: Sperandio, Markus last_name: Sperandio - first_name: Bernd full_name: Engelmann, Bernd last_name: Engelmann - first_name: Admar full_name: Verschoor, Admar last_name: Verschoor - first_name: Steffen full_name: Massberg, Steffen last_name: Massberg citation: ama: Stark K, Kilani B, Stockhausen S, et al. Antibodies and complement are key drivers of thrombosis. Immunity. 2024;57(9):2140-2156. doi:10.1016/j.immuni.2024.08.007 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. Immunity. Elsevier. https://doi.org/10.1016/j.immuni.2024.08.007 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.” Immunity. Elsevier, 2024. https://doi.org/10.1016/j.immuni.2024.08.007. ieee: K. Stark et al., “Antibodies and complement are key drivers of thrombosis,” Immunity, vol. 57, no. 9. Elsevier, pp. 2140–2156, 2024. 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. mla: Stark, Konstantin, et al. “Antibodies and Complement Are Key Drivers of Thrombosis.” Immunity, vol. 57, no. 9, Elsevier, 2024, pp. 2140–56, doi:10.1016/j.immuni.2024.08.007. 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. date_created: 2024-09-22T22:01:42Z date_published: 2024-09-10T00:00:00Z date_updated: 2025-09-08T09:50:13Z day: '10' ddc: - '570' department: - _id: MiSi doi: 10.1016/j.immuni.2024.08.007 external_id: isi: - '001317438500001' pmid: - '39226900' file: - access_level: open_access checksum: 4683de43d06a8fd8e3fc91af4ddc1ba2 content_type: application/pdf creator: dernst date_created: 2024-09-30T09:16:03Z date_updated: 2024-09-30T09:16:03Z file_id: '18162' file_name: 2024_Immunity_Stark.pdf file_size: 6892750 relation: main_file success: 1 file_date_updated: 2024-09-30T09:16:03Z has_accepted_license: '1' intvolume: ' 57' isi: 1 issue: '9' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 2140-2156 pmid: 1 publication: Immunity publication_identifier: eissn: - 1097-4180 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Antibodies and complement are key drivers of thrombosis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 57 year: '2024' ... --- _id: '18110' abstract: - lang: eng 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. 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)." article_number: L100304 article_processing_charge: No article_type: letter_note arxiv: 1 author: - first_name: Pietro full_name: Brighi, Pietro id: 4115AF5C-F248-11E8-B48F-1D18A9856A87 last_name: Brighi orcid: 0000-0002-7969-2729 - first_name: Marko full_name: Ljubotina, Marko id: F75EE9BE-5C90-11EA-905D-16643DDC885E last_name: Ljubotina orcid: 0000-0003-0038-7068 citation: ama: Brighi P, Ljubotina M. Anomalous transport in the kinetically constrained quantum East-West model. Physical Review B. 2024;110(10). doi:10.1103/PhysRevB.110.L100304 apa: Brighi, P., & Ljubotina, M. (2024). Anomalous transport in the kinetically constrained quantum East-West model. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.110.L100304 chicago: Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically Constrained Quantum East-West Model.” Physical Review B. American Physical Society, 2024. https://doi.org/10.1103/PhysRevB.110.L100304. ieee: P. Brighi and M. Ljubotina, “Anomalous transport in the kinetically constrained quantum East-West model,” Physical Review B, vol. 110, no. 10. American Physical Society, 2024. ista: Brighi P, Ljubotina M. 2024. Anomalous transport in the kinetically constrained quantum East-West model. Physical Review B. 110(10), L100304. mla: Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically Constrained Quantum East-West Model.” Physical Review B, vol. 110, no. 10, L100304, American Physical Society, 2024, doi:10.1103/PhysRevB.110.L100304. short: P. Brighi, M. Ljubotina, Physical Review B 110 (2024). corr_author: '1' date_created: 2024-09-22T22:01:42Z date_published: 2024-09-11T00:00:00Z date_updated: 2025-09-08T09:49:29Z day: '11' department: - _id: MaSe doi: 10.1103/PhysRevB.110.L100304 ec_funded: 1 external_id: arxiv: - '2405.02102' isi: - '001361617100003' intvolume: ' 110' isi: 1 issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2405.02102 month: '09' oa: 1 oa_version: Preprint project: - _id: 23841C26-32DE-11EA-91FC-C7463DDC885E call_identifier: H2020 grant_number: '850899' name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control' publication: Physical Review B publication_identifier: eissn: - 2469-9969 issn: - 2469-9950 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Anomalous transport in the kinetically constrained quantum East-West model type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 110 year: '2024' ... --- DOAJ_listed: '1' _id: '18111' abstract: - lang: eng text: Observations of tidal disruption events (TDEs) show signs of nitrogen enrichment reminiscent of other astrophysical sources such as active galactic nuclei and star-forming galaxies. Given that TDEs probe the gas from a single star, it is possible to test whether the observed enrichment is consistent with expectations from the CNO cycle by looking at the observed nitrogen/carbon (N/C) abundance ratios. Given that ≈20% of solar-mass stars (and an even larger fraction of more massive stars) live in close binaries, it is worthwhile to also consider what TDEs from stars influenced by binary evolution would look like. We show here that TDEs from stars stripped of their hydrogen-rich (and nitrogen-poor) envelopes through previous binary-induced mass loss can produce much higher observable N/C enhancements than even TDEs from massive stars. Additionally, we predict that the time dependence of the N/C abundance ratio in the mass fallback rate of stripped stars will follow the inverse behavior of main-sequence stars, enabling a more accurate characterization of the disrupted star. acknowledgement: "This work was performed in part at Aspen Center for Physics, which is supported by National Science Foundation grant PHY-2210452. We thank the participants and organizers of the summer Aspen 2023 workshop on “Stellar Interactions and the Transients They Cause” for fruitful discussions. B.M. is grateful for support from the Carnegie Theoretical Astrophysics\r\nCenter. M.G.-G. is grateful for the support from Northwestern University’s Presidential Fellowship. E.R.-R. thanks the Heising-Simons Foundation, NSF (AST-2150255 and AST2307710), Swift (80NSSC21K1409, 80NSSC19K1391), and Chandra (22-0142) for support. " article_number: L9 article_processing_charge: Yes article_type: original author: - first_name: Brenna full_name: Mockler, Brenna last_name: Mockler - first_name: Monica full_name: Gallegos-Garcia, Monica last_name: Gallegos-Garcia - first_name: Ylva Louise Linsdotter full_name: Götberg, Ylva Louise Linsdotter id: d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d last_name: Götberg orcid: 0000-0002-6960-6911 - first_name: Jon M. full_name: Miller, Jon M. last_name: Miller - first_name: Enrico full_name: Ramirez-Ruiz, Enrico last_name: Ramirez-Ruiz citation: ama: Mockler B, Gallegos-Garcia M, Götberg YLL, Miller JM, Ramirez-Ruiz E. Tidal disruption events from stripped stars. Astrophysical Journal Letters. 2024;973(1). doi:10.3847/2041-8213/ad6c34 apa: Mockler, B., Gallegos-Garcia, M., Götberg, Y. L. L., Miller, J. M., & Ramirez-Ruiz, E. (2024). Tidal disruption events from stripped stars. Astrophysical Journal Letters. IOP Publishing. https://doi.org/10.3847/2041-8213/ad6c34 chicago: Mockler, Brenna, Monica Gallegos-Garcia, Ylva Louise Linsdotter Götberg, Jon M. Miller, and Enrico Ramirez-Ruiz. “Tidal Disruption Events from Stripped Stars.” Astrophysical Journal Letters. IOP Publishing, 2024. https://doi.org/10.3847/2041-8213/ad6c34. ieee: B. Mockler, M. Gallegos-Garcia, Y. L. L. Götberg, J. M. Miller, and E. Ramirez-Ruiz, “Tidal disruption events from stripped stars,” Astrophysical Journal Letters, vol. 973, no. 1. IOP Publishing, 2024. ista: Mockler B, Gallegos-Garcia M, Götberg YLL, Miller JM, Ramirez-Ruiz E. 2024. Tidal disruption events from stripped stars. Astrophysical Journal Letters. 973(1), L9. mla: Mockler, Brenna, et al. “Tidal Disruption Events from Stripped Stars.” Astrophysical Journal Letters, vol. 973, no. 1, L9, IOP Publishing, 2024, doi:10.3847/2041-8213/ad6c34. short: B. Mockler, M. Gallegos-Garcia, Y.L.L. Götberg, J.M. Miller, E. Ramirez-Ruiz, Astrophysical Journal Letters 973 (2024). date_created: 2024-09-22T22:01:42Z date_published: 2024-09-12T00:00:00Z date_updated: 2025-09-08T09:48:50Z day: '12' ddc: - '520' department: - _id: YlGo doi: 10.3847/2041-8213/ad6c34 external_id: isi: - '001310592900001' file: - access_level: open_access checksum: 050ddf873244839825714cca42b5d857 content_type: application/pdf creator: dernst date_created: 2024-09-30T08:54:26Z date_updated: 2024-09-30T08:54:26Z file_id: '18161' file_name: 2024_AstrophysicalJourn_Mockler.pdf file_size: 844227 relation: main_file success: 1 file_date_updated: 2024-09-30T08:54:26Z has_accepted_license: '1' intvolume: ' 973' isi: 1 issue: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version publication: Astrophysical Journal Letters publication_identifier: eissn: - 2041-8213 issn: - 2041-8205 publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: Tidal disruption events from stripped stars tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 973 year: '2024' ... --- _id: '18113' abstract: - lang: eng text: 'The emergence of accurate open large language models (LLMs) has led to a race towards performant quantization techniques which can enable their execution on end-user devices. In this paper, we revisit the problem of “extreme” LLM compression—defined as targeting extremely low bit counts, such as 2 to 3 bits per parameter—from the point of view of classic methods in Multi-Codebook Quantization (MCQ). Our algorithm, called AQLM, generalizes the classic Additive Quantization (AQ) approach for information retrieval to advance the state-of-the-art in LLM compression, via two innovations: 1) learned additive quantization of weight matrices in input-adaptive fashion, and 2) joint optimization of codebook parameters across each transformer blocks. Broadly, AQLM is the first scheme that is Pareto optimal in terms of accuracy-vs-model-size when compressing to less than 3 bits per parameter, and significantly improves upon all known schemes in the extreme compression (2bit) regime. In addition, AQLM is practical: we provide fast GPU and CPU implementations of AQLM for token generation, which enable us to match or outperform optimized FP16 implementations for speed, while executing in a much smaller memory footprint.' acknowledgement: "Authors would like to thank Ruslan Svirschevski for his help in solving technical issues with AQLM and baselines. We also thank Tim Dettmers for helpful discussions on the structure of weights in modern LLMs and size-accuracy trade-offs. The authors would also like to thank Daniil Pavlov for his assistance with CPU benchmarking. Finally, authors would like to thank the communities of ML enthusiasts known as LocalLLaMA5 and Petals community on discord6\r\nfor the crowd wisdom about running LLMs on consumer devices. Egiazarian Vage and Denis Kuznedelev and Andrei Panferov were supported by the grant for research centers in the field of AI provided by the Analytical Center for the Government of the Russian Federation (ACRF) in\r\naccordance with the agreement on the provision of subsidies (identifier of the agreement 000000D730321P5Q0002) and the agreement with HSE University No. 70-2021-00139." alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Vage full_name: Egiazarian, Vage last_name: Egiazarian - first_name: Andrei full_name: Panferov, Andrei id: 2c18daae-4dbe-11ef-8491-98ce2d960f09 last_name: Panferov - first_name: Denis full_name: Kuznedelev, Denis last_name: Kuznedelev - first_name: Elias full_name: Frantar, Elias id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f last_name: Frantar - first_name: Artem full_name: Babenko, Artem last_name: Babenko - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A. Extreme compression of large language models via additive quantization. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:12284-12303.' apa: 'Egiazarian, V., Panferov, A., Kuznedelev, D., Frantar, E., Babenko, A., & Alistarh, D.-A. (2024). Extreme compression of large language models via additive quantization. In Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 12284–12303). Vienna, Austria: ML Research Press.' chicago: Egiazarian, Vage, Andrei Panferov, Denis Kuznedelev, Elias Frantar, Artem Babenko, and Dan-Adrian Alistarh. “Extreme Compression of Large Language Models via Additive Quantization.” In Proceedings of the 41st International Conference on Machine Learning, 235:12284–303. ML Research Press, 2024. ieee: V. Egiazarian, A. Panferov, D. Kuznedelev, E. Frantar, A. Babenko, and D.-A. Alistarh, “Extreme compression of large language models via additive quantization,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 12284–12303. ista: 'Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A. 2024. Extreme compression of large language models via additive quantization. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 12284–12303.' mla: Egiazarian, Vage, et al. “Extreme Compression of Large Language Models via Additive Quantization.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 12284–303. short: V. Egiazarian, A. Panferov, D. Kuznedelev, E. Frantar, A. Babenko, D.-A. Alistarh, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12284–12303. conference: end_date: 2024-07-27 location: Vienna, Austria name: 'ICML: International Conference on Machine Learning' start_date: 2024-07-21 corr_author: '1' date_created: 2024-09-22T22:01:43Z date_published: 2024-09-01T00:00:00Z date_updated: 2024-10-01T08:13:05Z day: '01' department: - _id: DaAl - _id: GradSch external_id: arxiv: - '2401.06118' intvolume: ' 235' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2401.06118' month: '09' oa: 1 oa_version: Preprint page: 12284-12303 publication: Proceedings of the 41st International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Extreme compression of large language models via additive quantization type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 235 year: '2024' ... --- OA_place: publisher OA_type: diamond _id: '18114' 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. alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Adeel A full_name: Pervez, Adeel A id: fca6d90c-d47f-11ee-bc87-93ff51604981 last_name: Pervez - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Efstratios full_name: Gavves, Efstratios last_name: Gavves citation: ama: 'Pervez AA, Locatello F, Gavves E. Mechanistic neural networks for scientific machine learning. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:40484-40501.' apa: 'Pervez, A. A., Locatello, F., & Gavves, E. (2024). Mechanistic neural networks for scientific machine learning. In Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 40484–40501). Vienna, Austria: ML Research Press.' chicago: Pervez, Adeel A, Francesco Locatello, and Efstratios Gavves. “Mechanistic Neural Networks for Scientific Machine Learning.” In Proceedings of the 41st International Conference on Machine Learning, 235:40484–501. ML Research Press, 2024. ieee: A. A. Pervez, F. Locatello, and E. Gavves, “Mechanistic neural networks for scientific machine learning,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 40484–40501. 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.' mla: Pervez, Adeel A., et al. “Mechanistic Neural Networks for Scientific Machine Learning.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 40484–501. 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. conference: end_date: 2024-07-27 location: Vienna, Austria name: 'ICML: International Conference on Machine Learning' start_date: 2024-07-21 date_created: 2024-09-22T22:01:43Z date_published: 2024-09-01T00:00:00Z date_updated: 2026-06-18T17:59:46Z day: '01' ddc: - '000' department: - _id: FrLo external_id: arxiv: - '2402.13077' intvolume: ' 235' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2402.13077 month: '09' oa: 1 oa_version: Published Version page: 40484-40501 publication: Proceedings of the 41st International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' related_material: link: - relation: software url: https://github.com/alpz/mech-nn scopus_import: '1' status: public title: Mechanistic neural networks for scientific machine learning type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 235 year: '2024' ... --- _id: '18115' 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." 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." alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Kyriakos full_name: Axiotis, Kyriakos last_name: Axiotis - first_name: Vincent full_name: Cohen-Addad, Vincent last_name: Cohen-Addad - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Sammy full_name: Jerome, Sammy last_name: Jerome - first_name: Vahab full_name: Mirrokni, Vahab last_name: Mirrokni - first_name: David full_name: Saulpic, David id: f8e48cf0-b0ff-11ed-b0e9-b4c35598f964 last_name: Saulpic - first_name: David P. full_name: Woodruff, David P. last_name: Woodruff - first_name: Michael full_name: Wunder, Michael last_name: Wunder citation: ama: 'Axiotis K, Cohen-Addad V, Henzinger M, et al. Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:2086-2107.' 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 Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 2086–2107). Vienna, Austria: ML Research Press.' 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 Proceedings of the 41st International Conference on Machine Learning, 235:2086–2107. ML Research Press, 2024.' ieee: 'K. Axiotis et al., “Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 2086–2107.' 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.' mla: 'Axiotis, Kyriakos, et al. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 2086–107.' 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. conference: end_date: 2024-07-27 location: Vienna, Austria name: 'ICML: International Conference on Machine Learning' start_date: 2024-07-21 date_created: 2024-09-22T22:01:44Z date_published: 2024-09-01T00:00:00Z date_updated: 2026-06-18T18:00:19Z day: '01' ddc: - '000' department: - _id: MoHe ec_funded: 1 external_id: arxiv: - '2402.17327' intvolume: ' 235' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2402.17327 month: '09' oa: 1 oa_version: Published Version page: 2086-2107 project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: 34def286-11ca-11ed-8bc3-da5948e1613c grant_number: Z00422 name: Efficient algorithms - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions - _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: P33775 name: Fast Algorithms for a Reactive Network Layer - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Proceedings of the 41st International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: 'Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 235 year: '2024' ... --- _id: '18116' 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.' 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.' alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Max Dupré full_name: La Tour, Max Dupré last_name: La Tour - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: David full_name: Saulpic, David id: f8e48cf0-b0ff-11ed-b0e9-b4c35598f964 last_name: Saulpic citation: ama: 'La Tour MD, Henzinger M, Saulpic D. Making old things new: A unified algorithm for differentially private clustering. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:12046-12086.' apa: 'La Tour, M. D., Henzinger, M., & Saulpic, D. (2024). Making old things new: A unified algorithm for differentially private clustering. In Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 12046–12086). Vienna, Austria: ML Research Press.' chicago: 'La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” In Proceedings of the 41st International Conference on Machine Learning, 235:12046–86. ML Research Press, 2024.' ieee: 'M. D. La Tour, M. Henzinger, and D. Saulpic, “Making old things new: A unified algorithm for differentially private clustering,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 12046–12086.' 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.' mla: 'La Tour, Max Dupré, et al. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 12046–86.' 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. conference: end_date: 2024-07-27 location: Vienna, Austria name: 'ICML: International Conference on Machine Learning' start_date: 2024-07-21 corr_author: '1' date_created: 2024-09-22T22:01:44Z date_published: 2024-09-01T00:00:00Z date_updated: 2026-06-18T18:01:02Z day: '01' ddc: - '000' department: - _id: MoHe ec_funded: 1 external_id: arxiv: - '2406.11649' intvolume: ' 235' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2406.11649 month: '09' oa: 1 oa_version: Published Version page: 12046-12086 project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: 34def286-11ca-11ed-8bc3-da5948e1613c grant_number: Z00422 name: Efficient algorithms - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions - _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: P33775 name: Fast Algorithms for a Reactive Network Layer - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Proceedings of the 41st International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: 'Making old things new: A unified algorithm for differentially private clustering' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 235 year: '2024' ... --- _id: '18117' abstract: - lang: eng text: "We investigate parameter-efficient fine-tuning (PEFT) methods that can provide good accuracy under limited computational and memory budgets in the context of large language models (LLMs). We present a new PEFT method called Robust Adaptation (RoSA) inspired by robust principal component analysis that jointly trains low-rank\r\n and highly-sparse components on top of a set of fixed pretrained weights to efficiently approximate the performance of a full-fine-tuning (FFT) solution. Across a series of challenging generative tasks such as grade-school math and SQL query generation, which require fine-tuning for good performance, we show that RoSA outperforms LoRA, pure sparse fine-tuning, and alternative hybrid methods at the same parameter budget, and can even recover the performance of FFT on some tasks. We provide system support for RoSA to complement the training algorithm, specifically in the form of sparse GPU kernels which enable memory- and computationally-efficient training, and show that it is also compatible with low-precision base weights, resulting in the first joint representation combining quantization, low-rank and sparse approximations. Our code is available at https://github.com/IST-DASLab/RoSA." acknowledgement: The authors would like to thank Eldar Kurtic for experimental support and useful suggestions throughout the project article_processing_charge: No arxiv: 1 author: - first_name: Mahdi full_name: Nikdan, Mahdi id: 66374281-f394-11eb-9cf6-869147deecc0 last_name: Nikdan - first_name: Soroush full_name: Tabesh, Soroush id: 06000900-6068-11ef-8d61-c2472ef2e752 last_name: Tabesh orcid: 0009-0003-4119-6281 - first_name: Elvir full_name: Crncevic, Elvir id: 41888001-440d-11ef-8299-d0e838b8185e last_name: Crncevic - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Nikdan M, Tabesh S, Crncevic E, Alistarh D-A. RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:38187-38206.' apa: 'Nikdan, M., Tabesh, S., Crncevic, E., & Alistarh, D.-A. (2024). RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. In Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 38187–38206). Vienna, Austria: ML Research Press.' chicago: 'Nikdan, Mahdi, Soroush Tabesh, Elvir Crncevic, and Dan-Adrian Alistarh. “RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation.” In Proceedings of the 41st International Conference on Machine Learning, 235:38187–206. ML Research Press, 2024.' ieee: 'M. Nikdan, S. Tabesh, E. Crncevic, and D.-A. Alistarh, “RoSA: Accurate parameter-efficient fine-tuning via robust adaptation,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 38187–38206.' ista: 'Nikdan M, Tabesh S, Crncevic E, Alistarh D-A. 2024. RoSA: Accurate parameter-efficient fine-tuning via robust adaptation. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 235, 38187–38206.' mla: 'Nikdan, Mahdi, et al. “RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 38187–206.' short: M. Nikdan, S. Tabesh, E. Crncevic, D.-A. Alistarh, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 38187–38206. conference: end_date: 2024-07-27 location: Vienna, Austria name: 'ICML: International Conference on Machine Learning' start_date: 2024-07-21 corr_author: '1' date_created: 2024-09-22T22:01:44Z date_published: 2024-09-01T00:00:00Z date_updated: 2024-10-01T08:22:01Z day: '01' department: - _id: DaAl - _id: GradSch external_id: arxiv: - '2401.04679' intvolume: ' 235' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2401.04679 month: '09' oa: 1 oa_version: Preprint page: 38187-38206 publication: Proceedings of the 41st International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' related_material: link: - relation: software url: https://github.com/IST-DASLab/RoSA scopus_import: '1' status: public title: 'RoSA: Accurate parameter-efficient fine-tuning via robust adaptation' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 235 year: '2024' ... --- _id: '18118' abstract: - lang: eng 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. alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Hossein full_name: Zakerinia, Hossein id: 653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4 last_name: Zakerinia orcid: 0009-0007-3977-6462 - first_name: Amin full_name: Behjati, Amin last_name: Behjati - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Zakerinia H, Behjati A, Lampert C. More flexible PAC-Bayesian meta-learning by learning learning algorithms. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:58122-58139.' apa: 'Zakerinia, H., Behjati, A., & Lampert, C. (2024). More flexible PAC-Bayesian meta-learning by learning learning algorithms. In Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 58122–58139). Vienna, Austria: ML Research Press.' chicago: Zakerinia, Hossein, Amin Behjati, and Christoph Lampert. “More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms.” In Proceedings of the 41st International Conference on Machine Learning, 235:58122–39. ML Research Press, 2024. ieee: H. Zakerinia, A. Behjati, and C. Lampert, “More flexible PAC-Bayesian meta-learning by learning learning algorithms,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 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.” Proceedings of the 41st International Conference on Machine Learning, 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. conference: end_date: 2024-07-27 location: Vienna, Austria name: 'ICML: International Conference on Machine Learning' start_date: 2024-07-21 corr_author: '1' date_created: 2024-09-22T22:01:45Z date_published: 2024-09-01T00:00:00Z date_updated: 2026-06-18T18:01:36Z day: '01' ddc: - '000' department: - _id: ChLa external_id: arxiv: - '2402.04054' intvolume: ' 235' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2402.04054' month: '09' oa: 1 oa_version: Published Version page: 58122-58139 publication: Proceedings of the 41st International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: More flexible PAC-Bayesian meta-learning by learning learning algorithms type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 235 year: '2024' ... --- _id: '18120' abstract: - lang: eng text: In practice, training using federated learning can be orders of magnitude slower than standard centralized training. This severely limits the amount of experimentation and tuning that can be done, making it challenging to obtain good performance on a given task. Server-side proxy data can be used to run training simulations, for instance for hyperparameter tuning. This can greatly speed up the training pipeline by reducing the number of tuning runs to be performed overall on the true clients. However, it is challenging to ensure that these simulations accurately reflect the dynamics of the real federated training. In particular, the proxy data used for simulations often comes as a single centralized dataset without a partition into distinct clients, and partitioning this data in a naive way can lead to simulations that poorly reflect real federated training. In this paper we address the challenge of how to partition centralized data in a way that reflects the statistical heterogeneity of the true federated clients. We propose a fully federated, theoretically justified, algorithm that efficiently learns the distribution of the true clients and observe improved server-side simulations when using the inferred distribution to create simulated clients from the centralized data. acknowledgement: 'We would like to thank: Mona Chitnis and everyone in the Private Federated Learning team at Apple for their help and support throughout the entire project; Audra McMillan, Martin Pelikan, Anosh Raj and Barry Theobold for feedback on the initial versions of the paper; and Christoph Lampert for valuable feedback on the paper structure and suggestions for additional experiments.' alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Jonathan A full_name: Scott, Jonathan A id: e499926b-f6e0-11ea-865d-9c63db0031e8 last_name: Scott - first_name: Áine full_name: Cahill, Áine last_name: Cahill citation: ama: 'Scott JA, Cahill Á. Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials. In: Proceedings of the 41st International Conference on Machine Learning. Vol 235. ML Research Press; 2024:44012-44037.' apa: 'Scott, J. A., & Cahill, Á. (2024). Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials. In Proceedings of the 41st International Conference on Machine Learning (Vol. 235, pp. 44012–44037). Vienna, Austria: ML Research Press.' chicago: Scott, Jonathan A, and Áine Cahill. “Improved Modelling of Federated Datasets Using Mixtures-of-Dirichlet-Multinomials.” In Proceedings of the 41st International Conference on Machine Learning, 235:44012–37. ML Research Press, 2024. ieee: J. A. Scott and Á. Cahill, “Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials,” in Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 44012–44037. ista: 'Scott JA, Cahill Á. 2024. Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 44012–44037.' mla: Scott, Jonathan A., and Áine Cahill. “Improved Modelling of Federated Datasets Using Mixtures-of-Dirichlet-Multinomials.” Proceedings of the 41st International Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 44012–37. short: J.A. Scott, Á. Cahill, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 44012–44037. conference: end_date: 2024-07-27 location: Vienna, Austria name: 'ICML: International Conference on Machine Learning' start_date: 2024-07-21 corr_author: '1' date_created: 2024-09-22T22:01:45Z date_published: 2024-09-01T00:00:00Z date_updated: 2026-04-07T11:46:11Z day: '01' department: - _id: ChLa external_id: arxiv: - '2406.02416' intvolume: ' 235' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2406.02416 month: '09' oa: 1 oa_version: Preprint page: 44012-44037 publication: Proceedings of the 41st International Conference on Machine Learning publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' related_material: record: - id: '21198' relation: dissertation_contains status: public scopus_import: '1' status: public title: Improved modelling of federated datasets using mixtures-of-Dirichlet-multinomials type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 235 year: '2024' ... --- OA_place: publisher _id: '18135' abstract: - lang: eng text: "This thesis consists of two separate parts. In the first part we consider a dilute Fermi gas interacting through a repulsive interaction in dimensions $d=1,2,3$. Our focus is mostly on the physically most relevant dimension $d=3$ \r\nand the setting of a spin-polarized (equivalently spinless) gas, where the Pauli exclusion principle plays a key role. We show that, at zero temperature, the ground state energy density of the interacting spin-polarized gas differs (to leading order) from that of the free (i.e. non-interacting) gas by a term of order $a_p^d\\rho^{2+2/d}$ \ with $a_p$ the $p$-wave scattering length of the repulsive interaction and $\\rho$ the density. Further, we extend this to positive temperature and show that the pressure of an interacting spin-polarized gas differs from that of the free gas by a now temperature dependent term, again of order $a_p^d\\rho^{2+2/d}$. Lastly, we consider the setting of a spin-$\\frac{1}{2}$ Fermi gas in $d=3$ dimensions and show that here, as an upper bound, the ground state energy density differs from that of the free system by a term of order $a_s \\rho^2$ with an error smaller than $a_s \\rho^2 (a_s\\rho^{1/3})^{1-\\eps}$ for any $\\eps > 0$, where $a_s$ is the $s$-wave scattering length of the repulsive interaction. \r\n\r\nThese asymptotic formulas complement the similar formulas in the literature for the dilute Bose and spin-$\\frac{1}{2}$ Fermi gas, where the ground state energies or pressures differ from that of the corresponding free systems by a term of order $a_s \\rho^2$ in dimension $d=3$. In the spin-polarized setting, the corrections, of order $a_p^3\\rho^{8/3}$ in dimension $d=3$, are thus much smaller and requires a more delicate analysis.\r\n\r\nIn the second part of the thesis we consider the Bardeen--Cooper--Schrieffer (BCS) theory of superconductivity and in particular its associated critical temperature and energy gap. We prove that the ratio of the zero-temperature energy gap and critical temperature $\\Xi(T=0)/T_c$ approaches a universal constant $\\pi e^{-\\gamma}\\approx 1.76$ in both the limit of high density in dimension $d=3$ and in the limit of weak coupling in dimensions $d=1,2$. This complements the proofs in the literature of this universal behaviour in the limit of weak coupling or low density in dimension $d=3$. Secondly, we prove that the ratio of the energy gap at positive temperature and critical temperature $\\Xi(T)/T_c$ approaches a universal function of the relative temperature $T/T_c$ in the limit of weak coupling in dimensions $d=1,2,3$." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Asbjørn Bækgaard full_name: Lauritsen, Asbjørn Bækgaard id: e1a2682f-dc8d-11ea-abe3-81da9ac728f1 last_name: Lauritsen orcid: 0000-0003-4476-2288 citation: ama: Lauritsen AB. Energies of dilute Fermi gases and universalities in BCS theory. 2024. doi:10.15479/at:ista:18135 apa: Lauritsen, A. B. (2024). Energies of dilute Fermi gases and universalities in BCS theory. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18135 chicago: Lauritsen, Asbjørn Bækgaard. “Energies of Dilute Fermi Gases and Universalities in BCS Theory.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18135. ieee: A. B. Lauritsen, “Energies of dilute Fermi gases and universalities in BCS theory,” Institute of Science and Technology Austria, 2024. ista: Lauritsen AB. 2024. Energies of dilute Fermi gases and universalities in BCS theory. Institute of Science and Technology Austria. mla: Lauritsen, Asbjørn Bækgaard. Energies of Dilute Fermi Gases and Universalities in BCS Theory. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18135. short: A.B. Lauritsen, Energies of Dilute Fermi Gases and Universalities in BCS Theory, Institute of Science and Technology Austria, 2024. corr_author: '1' date_created: 2024-09-24T10:56:25Z date_published: 2024-09-23T00:00:00Z date_updated: 2026-04-16T08:17:55Z day: '23' ddc: - '515' - '539' degree_awarded: PhD department: - _id: GradSch - _id: RoSe doi: 10.15479/at:ista:18135 ec_funded: 1 file: - access_level: open_access checksum: c7bc3b31e430d57c65393051ca439575 content_type: application/pdf creator: alaurits date_created: 2024-09-26T13:11:24Z date_updated: 2024-09-26T13:11:24Z file_id: '18147' file_name: Lauritsen-thesis-final.pdf file_size: 3648831 relation: main_file success: 1 - access_level: closed checksum: 39f6b1b7f83e25a3bf9f933f1ea0bc06 content_type: application/x-zip-compressed creator: alaurits date_created: 2024-09-26T13:12:55Z date_updated: 2024-09-26T13:12:55Z file_id: '18148' file_name: Lauritsen-thesis-source.zip file_size: 1625888 relation: source_file file_date_updated: 2024-09-26T13:12:55Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '353' project: - _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b grant_number: I06427 name: Mathematical Challenges in BCS Theory of Superconductivity - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication_identifier: isbn: - 978-3-99078-042-8 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '11732' relation: part_of_dissertation status: public - id: '14542' relation: part_of_dissertation status: public - id: '18107' relation: part_of_dissertation status: public - id: '17240' relation: part_of_dissertation status: public - id: '14931' relation: part_of_dissertation status: public status: public supervisor: - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 title: Energies of dilute Fermi gases and universalities in BCS theory tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2024' ... --- _id: '18153' abstract: - lang: eng 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. article_number: '5559' article_processing_charge: Yes article_type: original author: - first_name: Márton Albert full_name: Hajnal, Márton Albert last_name: Hajnal - first_name: Duy full_name: Tran, Duy last_name: Tran - first_name: Zsombor full_name: Szabó, Zsombor id: 47757b1e-3f56-11ef-9908-8ddefb4d05eb last_name: Szabó orcid: 0009-0003-8524-4994 - first_name: Andrea full_name: Albert, Andrea last_name: Albert - first_name: Karen full_name: Safaryan, Karen last_name: Safaryan - first_name: Michael full_name: Einstein, Michael last_name: Einstein - first_name: Mauricio full_name: Vallejo Martelo, Mauricio last_name: Vallejo Martelo - first_name: Pierre-Olivier full_name: Polack, Pierre-Olivier last_name: Polack - first_name: Peyman full_name: Golshani, Peyman last_name: Golshani - first_name: Gergő full_name: Orbán, Gergő last_name: Orbán citation: 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. Nature Communications. 2024;15. doi:10.1038/s41467-024-49845-2 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. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-024-49845-2 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.” Nature Communications. Springer Nature, 2024. https://doi.org/10.1038/s41467-024-49845-2. ieee: M. A. Hajnal et al., “Shifts in attention drive context-dependent subspace encoding in anterior cingulate cortex in mice during decision making,” Nature Communications, vol. 15. Springer Nature, 2024. 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.” Nature Communications, vol. 15, 5559, Springer Nature, 2024, doi:10.1038/s41467-024-49845-2. 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). date_created: 2024-09-28T06:59:03Z date_published: 2024-07-02T00:00:00Z date_updated: 2024-10-01T07:14:56Z day: '02' ddc: - '570' doi: 10.1038/s41467-024-49845-2 extern: '1' external_id: pmid: - '37873364' file: - access_level: open_access checksum: 22caa17a6691884c66c650c61227e903 content_type: application/pdf creator: dernst date_created: 2024-10-01T07:13:36Z date_updated: 2024-10-01T07:13:36Z file_id: '18163' file_name: 2024_NatureComm_Hajnal.pdf file_size: 4346510 relation: main_file success: 1 file_date_updated: 2024-10-01T07:13:36Z has_accepted_license: '1' intvolume: ' 15' language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Shifts in attention drive context-dependent subspace encoding in anterior cingulate cortex in mice during decision making tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2024' ... --- _id: '18155' abstract: - lang: eng text: We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our witnesses are applicable to both verification (proving) and refutation (finding bugs) settings. We then consider LTL formulas in which atomic propositions can be polynomial constraints and turn our focus to polynomial arithmetic programs, i.e. programs in which every assignment and guard consists only of polynomial expressions. For this setting, we provide an efficient algorithm to automatically synthesize such LTL witnesses. Our synthesis procedure is both sound and semi-complete. Finally, we present experimental results demonstrating the effectiveness of our approach and that it can handle programs which were beyond the reach of previous state-of-the-art tools. acknowledgement: This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt) and the Hong Kong Research Grants Council ECS Project Number 26208122. alternative_title: - LNCS article_processing_charge: Yes (in subscription journal) arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Ehsan full_name: Goharshady, Ehsan last_name: Goharshady - first_name: Mehrdad full_name: Karrabi, Mehrdad id: 67638922-f394-11eb-9cf6-f20423e08757 last_name: Karrabi - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic orcid: 0000-0002-4681-1699 citation: ama: 'Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 14933. Springer Nature; 2024:600-619. doi:10.1007/978-3-031-71162-6_31' apa: 'Chatterjee, K., Goharshady, A. K., Goharshady, E., Karrabi, M., & Zikelic, D. (2024). Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14933, pp. 600–619). Milan, Italy: Springer Nature. https://doi.org/10.1007/978-3-031-71162-6_31' chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Ehsan Goharshady, Mehrdad Karrabi, and Dorde Zikelic. “Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14933:600–619. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-71162-6_31. ieee: K. Chatterjee, A. K. Goharshady, E. Goharshady, M. Karrabi, and D. Zikelic, “Sound and complete witnesses for template-based verification of LTL properties on polynomial programs,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Milan, Italy, 2024, vol. 14933, pp. 600–619. ista: 'Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. 2024. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). FM: Formal Methods, LNCS, vol. 14933, 600–619.' mla: Chatterjee, Krishnendu, et al. “Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14933, Springer Nature, 2024, pp. 600–19, doi:10.1007/978-3-031-71162-6_31. short: K. Chatterjee, A.K. Goharshady, E. Goharshady, M. Karrabi, D. Zikelic, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2024, pp. 600–619. conference: end_date: 2024-09-13 location: Milan, Italy name: 'FM: Formal Methods' start_date: 2024-09-09 corr_author: '1' date_created: 2024-09-29T22:01:37Z date_published: 2024-09-11T00:00:00Z date_updated: 2025-09-08T09:51:34Z day: '11' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-031-71162-6_31 ec_funded: 1 external_id: arxiv: - '2403.05386' isi: - '001336893300031' file: - access_level: open_access checksum: 223845be9e754681ee218866827c95e7 content_type: application/pdf creator: dernst date_created: 2024-10-01T09:56:54Z date_updated: 2024-10-01T09:56:54Z file_id: '18165' file_name: 2024_LNCS_Chatterjee.pdf file_size: 650495 relation: main_file success: 1 file_date_updated: 2024-10-01T09:56:54Z has_accepted_license: '1' intvolume: ' 14933' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 600-619 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) publication_identifier: eissn: - 1611-3349 isbn: - '9783031711619' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Sound and complete witnesses for template-based verification of LTL properties on polynomial programs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 14933 year: '2024' ... --- _id: '18156' abstract: - lang: eng 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]. 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." alternative_title: - LIPIcs article_number: '40' article_processing_charge: No arxiv: 1 author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: A. R. full_name: Sricharan, A. R. last_name: Sricharan - first_name: Teresa Anna full_name: Steiner, Teresa Anna last_name: Steiner citation: ama: 'Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements in the turnstile model and extensions. In: International Conference on Approximation Algorithms for Combinatorial Optimization Problems . Vol 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40' apa: 'Henzinger, M., Sricharan, A. R., & Steiner, T. A. (2024). Private counting of distinct elements in the turnstile model and extensions. In International Conference on Approximation Algorithms for Combinatorial Optimization Problems (Vol. 317). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40' chicago: Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” In International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Vol. 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40. ieee: M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Private counting of distinct elements in the turnstile model and extensions,” in International Conference on Approximation Algorithms for Combinatorial Optimization Problems , London, United Kingdom, 2024, vol. 317. 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.” International Conference on Approximation Algorithms for Combinatorial Optimization Problems , vol. 317, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40. 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. conference: end_date: 2024-08-30 location: London, United Kingdom name: 'APPROX: Conference on Approximation Algorithms for Combinatorial Optimization Problems' start_date: 2024-08-27 corr_author: '1' date_created: 2024-09-29T22:01:38Z date_published: 2024-09-16T00:00:00Z date_updated: 2025-12-02T13:47:16Z day: '16' ddc: - '000' department: - _id: MoHe doi: 10.4230/LIPIcs.APPROX/RANDOM.2024.40 ec_funded: 1 external_id: arxiv: - '2408.11637' isi: - '001545634500040' file: - access_level: open_access checksum: c08b41c896e4d8c69570044808b40e0b content_type: application/pdf creator: dernst date_created: 2024-10-01T10:07:14Z date_updated: 2024-10-01T10:07:14Z file_id: '18166' file_name: 2024_LIPICs_HenzingerM.pdf file_size: 973917 relation: main_file success: 1 file_date_updated: 2024-10-01T10:07:14Z has_accepted_license: '1' intvolume: ' 317' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: 34def286-11ca-11ed-8bc3-da5948e1613c grant_number: Z00422 name: Efficient algorithms - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions - _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: P33775 name: Fast Algorithms for a Reactive Network Layer publication: 'International Conference on Approximation Algorithms for Combinatorial Optimization Problems ' publication_identifier: isbn: - '9783959773485' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Private counting of distinct elements in the turnstile model and extensions tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 317 year: '2024' ...