[{"oa":1,"doi":"10.1214/24-EJP1247","file_date_updated":"2025-01-08T08:44:03Z","type":"journal_article","corr_author":"1","has_accepted_license":"1","acknowledgement":"I am very grateful to László Erdős for suggesting the topic and many valuable discussions during my work on the project. I would also like to thank the two anonymous referees for their careful reading of the manuscript and detailed feedback.\r\nPartially supported by ERC Advanced Grants “RMTBeyond” No. 101020331 and “LDRaM” No. 884584.","article_number":"191","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"eissn":["1083-6489"]},"article_processing_charge":"Yes","citation":{"mla":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” <i>Electronic Journal of Probability</i>, vol. 29, 191, Institute of Mathematical Statistics, 2024, doi:<a href=\"https://doi.org/10.1214/24-EJP1247\">10.1214/24-EJP1247</a>.","chicago":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2024. <a href=\"https://doi.org/10.1214/24-EJP1247\">https://doi.org/10.1214/24-EJP1247</a>.","apa":"Reker, J. (2024). Multi-point functional central limit theorem for Wigner matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/24-EJP1247\">https://doi.org/10.1214/24-EJP1247</a>","ieee":"J. Reker, “Multi-point functional central limit theorem for Wigner matrices,” <i>Electronic Journal of Probability</i>, vol. 29. Institute of Mathematical Statistics, 2024.","ista":"Reker J. 2024. Multi-point functional central limit theorem for Wigner matrices. Electronic Journal of Probability. 29, 191.","ama":"Reker J. Multi-point functional central limit theorem for Wigner matrices. <i>Electronic Journal of Probability</i>. 2024;29. doi:<a href=\"https://doi.org/10.1214/24-EJP1247\">10.1214/24-EJP1247</a>","short":"J. Reker, Electronic Journal of Probability 29 (2024)."},"department":[{"_id":"LaEr"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Institute of Mathematical Statistics","date_published":"2024-12-20T00:00:00Z","intvolume":"        29","OA_place":"publisher","DOAJ_listed":"1","day":"20","arxiv":1,"quality_controlled":"1","isi":1,"volume":29,"project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","grant_number":"101020331"}],"year":"2024","ec_funded":1,"abstract":[{"lang":"eng","text":"Consider the random variable $\\mathrm{Tr}( f_1(W)A_1\\dots f_k(W)A_k)$ where $W$ is an $N\\times N$ Hermitian Wigner matrix, $k\\in\\mathbb{N}$, and choose (possibly $N$-dependent) regular functions $f_1,\\dots, f_k$ as well as bounded deterministic matrices $A_1,\\dots,A_k$. We give a functional central limit theorem showing that the fluctuations around the expectation are Gaussian. Moreover, we determine the limiting covariance structure and give explicit error bounds in terms of the scaling of $f_1,\\dots,f_k$ and the number of traceless matrices among $A_1,\\dots,A_k$, thus extending the results of [Cipolloni, Erdős, Schröder 2023] to products of arbitrary length $k\\geq2$. As an application, we consider the fluctuation of $\\mathrm{Tr}(\\mathrm{e}^{\\mathrm{i} tW}A_1\\mathrm{e}^{-\\mathrm{i} tW}A_2)$ around its thermal value $\\mathrm{Tr}(A_1)\\mathrm{Tr}(A_2)$ when $t$ is large and give an explicit formula for the variance."}],"oa_version":"Published Version","related_material":{"record":[{"id":"17173","relation":"earlier_version","status":"public"}]},"date_created":"2025-01-05T23:01:58Z","external_id":{"isi":["001381599200001"],"arxiv":["2307.11028"]},"article_type":"original","title":"Multi-point functional central limit theorem for Wigner matrices","file":[{"file_size":812428,"checksum":"67178feaa8630a332599d3037a3fe70e","date_created":"2025-01-08T08:44:03Z","success":1,"date_updated":"2025-01-08T08:44:03Z","file_id":"18773","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2024_ElectrJournProbability_Reker.pdf"}],"scopus_import":"1","status":"public","_id":"18762","language":[{"iso":"eng"}],"publication":"Electronic Journal of Probability","month":"12","author":[{"id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","last_name":"Reker","first_name":"Jana","full_name":"Reker, Jana"}],"ddc":["510"],"OA_type":"gold","date_updated":"2025-09-09T11:59:15Z","publication_status":"published"},{"article_processing_charge":"Yes","publication_identifier":{"issn":["2050-084X"]},"citation":{"ama":"Dávid C, Giber K, Szigeti MK, Köllő M, Nusser Z, Acsady L. A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus. <i>eLife</i>. 2024;12. doi:<a href=\"https://doi.org/10.7554/elife.89361\">10.7554/elife.89361</a>","short":"C. Dávid, K. Giber, M.K. Szigeti, M. Köllő, Z. Nusser, L. Acsady, ELife 12 (2024).","mla":"Dávid, Csaba, et al. “A Novel Image Segmentation Method Based on Spatial Autocorrelation Identifies A-Type Potassium Channel Clusters in the Thalamus.” <i>ELife</i>, vol. 12, 89361, eLife Sciences Publications, 2024, doi:<a href=\"https://doi.org/10.7554/elife.89361\">10.7554/elife.89361</a>.","ista":"Dávid C, Giber K, Szigeti MK, Köllő M, Nusser Z, Acsady L. 2024. A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus. eLife. 12, 89361.","chicago":"Dávid, Csaba, Kristóf Giber, Margit Katalin Szigeti, Mihály Köllő, Zoltan Nusser, and Laszlo Acsady. “A Novel Image Segmentation Method Based on Spatial Autocorrelation Identifies A-Type Potassium Channel Clusters in the Thalamus.” <i>ELife</i>. eLife Sciences Publications, 2024. <a href=\"https://doi.org/10.7554/elife.89361\">https://doi.org/10.7554/elife.89361</a>.","apa":"Dávid, C., Giber, K., Szigeti, M. K., Köllő, M., Nusser, Z., &#38; Acsady, L. (2024). A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.89361\">https://doi.org/10.7554/elife.89361</a>","ieee":"C. Dávid, K. Giber, M. K. Szigeti, M. Köllő, Z. Nusser, and L. Acsady, “A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus,” <i>eLife</i>, vol. 12. eLife Sciences Publications, 2024."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GaNo"}],"publisher":"eLife Sciences Publications","OA_place":"publisher","intvolume":"        12","date_published":"2024-12-10T00:00:00Z","quality_controlled":"1","DOAJ_listed":"1","day":"10","doi":"10.7554/elife.89361","oa":1,"file_date_updated":"2025-01-08T13:33:05Z","type":"journal_article","article_number":"89361","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","acknowledgement":"This research was supported by the Wellcome Trust (ZN, LA). In addition, LA was supported by an ERC Advanced Grant (FRONTHAL, 742595) and the European Union project RRF-2.3.1-\r\n21-2022-00004 within the framework of the Artificial Intelligence National Laboratory and Lendület_2023_90. ZN is the recipient of a Hungarian Academy of Sciences Momentum Grant (Lendület, LP2012-29) and an ERC Advanced Grant (293681). We thank the Light Microscopy Center at Institute of Experimental Medicine for kindly providing microscopy support. Authors would like to express their deepest gratitude to Prof Luc Anselin (Center for Spatial Data Science, University of Chicago) and Dr Szabolcs Káli (Instiute of Experimental Medicine, Budapest) for the valuable discussion about analysis of spatial association, and to Krisztina Faddi for the excellent technical assistance. ","title":"A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus","file":[{"date_updated":"2025-01-08T13:33:05Z","success":1,"date_created":"2025-01-08T13:33:05Z","file_size":9992462,"checksum":"1d64265f62a3bf14550b4f5c684f1782","file_name":"2024_eLife_David.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"18780"}],"status":"public","scopus_import":"1","article_type":"original","language":[{"iso":"eng"}],"publication":"eLife","_id":"18779","month":"12","author":[{"last_name":"Dávid","first_name":"Csaba","full_name":"Dávid, Csaba"},{"last_name":"Giber","first_name":"Kristóf","full_name":"Giber, Kristóf"},{"full_name":"Szigeti, Margit Katalin","orcid":"0000-0001-9500-8758","first_name":"Margit Katalin","last_name":"Szigeti","id":"44F4BDC0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Köllő","full_name":"Köllő, Mihály","first_name":"Mihály"},{"last_name":"Nusser","first_name":"Zoltan","full_name":"Nusser, Zoltan"},{"last_name":"Acsady","full_name":"Acsady, Laszlo","first_name":"Laszlo"}],"date_updated":"2025-01-08T13:37:04Z","publication_status":"published","ddc":["570"],"OA_type":"gold","volume":12,"year":"2024","abstract":[{"text":"Unsupervised segmentation in biological and non-biological images is only partially resolved. Segmentation either requires arbitrary thresholds or large teaching datasets. Here, we propose a spatial autocorrelation method based on Local Moran’s <jats:italic>I</jats:italic> coefficient to differentiate signal, background, and noise in any type of image. The method, originally described for geoinformatics, does not require a predefined intensity threshold or teaching algorithm for image segmentation and allows quantitative comparison of samples obtained in different conditions. It utilizes relative intensity as well as spatial information of neighboring elements to select spatially contiguous groups of pixels. We demonstrate that Moran’s method outperforms threshold-based method in both artificially generated as well as in natural images especially when background noise is substantial. This superior performance can be attributed to the exclusion of false positive pixels resulting from isolated, high intensity pixels in high noise conditions. To test the method’s power in real situation, we used high power confocal images of the somatosensory thalamus immunostained for Kv4.2 and Kv4.3 (A-type) voltage-gated potassium channels in mice. Moran’s method identified high-intensity Kv4.2 and Kv4.3 ion channel clusters in the thalamic neuropil. Spatial distribution of these clusters displayed strong correlation with large sensory axon terminals of subcortical origin. The unique association of the special presynaptic terminals and a postsynaptic voltage-gated ion channel cluster was confirmed with electron microscopy. These data demonstrate that Moran’s method is a rapid, simple image segmentation method optimal for variable and high noise conditions.","lang":"eng"}],"oa_version":"Published Version","date_created":"2025-01-08T13:25:45Z"},{"related_material":{"link":[{"url":"https://github.com/CausalLearningAI/ISTAnt","relation":"software"}],"record":[{"status":"public","relation":"research_data","id":"18895"},{"id":"19509","relation":"is_continued_by","status":"for_moderation"}]},"date_created":"2025-01-14T07:27:26Z","external_id":{"arxiv":["2405.17151"]},"oa_version":"Published Version","abstract":[{"text":"Machine Learning and AI have the potential to transform data-driven\r\nscientific discovery, enabling accurate predictions for several scientific\r\nphenomena. As many scientific questions are inherently causal, this paper looks\r\nat the causal inference task of treatment effect estimation, where the outcome\r\nof interest is recorded in high-dimensional observations in a Randomized\r\nControlled Trial (RCT). Despite being the simplest possible causal setting and\r\na perfect fit for deep learning, we theoretically find that many common choices\r\nin the literature may lead to biased estimates. To test the practical impact of\r\nthese considerations, we recorded ISTAnt, the first real-world benchmark for\r\ncausal inference downstream tasks on high-dimensional observations as an RCT\r\nstudying how garden ants (Lasius neglectus) respond to microparticles applied\r\nonto their colony members by hygienic grooming. Comparing 6 480 models\r\nfine-tuned from state-of-the-art visual backbones, we find that the sampling\r\nand modeling choices significantly affect the accuracy of the causal estimate,\r\nand that classification accuracy is not a proxy thereof. We further validated\r\nthe analysis, repeating it on a synthetically generated visual data set\r\ncontrolling the causal model. Our results suggest that future benchmarks should\r\ncarefully consider real downstream scientific questions, especially causal\r\nones. Further, we highlight guidelines for representation learning methods to\r\nhelp answer causal questions in the sciences.","lang":"eng"}],"volume":38,"year":"2024","date_updated":"2025-07-10T11:51:50Z","publication_status":"published","ddc":["000","570"],"OA_type":"gold","month":"09","author":[{"last_name":"Cadei","id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","full_name":"Cadei, Riccardo","first_name":"Riccardo"},{"full_name":"Lindorfer, Lukas","first_name":"Lukas","id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455","last_name":"Lindorfer"},{"first_name":"Sylvia","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer"},{"last_name":"Schmid","full_name":"Schmid, Cordelia","first_name":"Cordelia"},{"first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello"}],"publication":"ICML 2024 Workshop AI4Science","language":[{"iso":"eng"}],"_id":"18847","title":"Smoke and mirrors in causal downstream tasks","scopus_import":"1","status":"public","file":[{"date_updated":"2025-01-27T11:42:24Z","date_created":"2025-01-27T11:42:24Z","success":1,"checksum":"beedf05388bbdb7ddda81ec3d5ec7026","file_size":4453014,"file_name":"2024_ICML_Cadei.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"18896"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","acknowledgement":"We thank Piersilvio De Bartolomeis, and the full Causal Learning and Artificial Intelligence (CLAI) group at ISTA for the extremely helpful discussions. Riccardo Cadei was supported by a Google Research Scholar Award and a Google Initiated Gift to Francesco Locatello. We thank the Social Immunity team at ISTA particularly Michaela Hönigsberger and Wilfrid Jean Louis, for supporting the ecological experiment and Farnaz Beikzadeh Abbasi, Luisa Fiebig and Martin Estermann for annotating ant behavior in ISTAnt.","corr_author":"1","file_date_updated":"2025-01-27T11:42:24Z","type":"conference","conference":{"end_date":"2024-07-26","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-26"},"oa":1,"quality_controlled":"1","arxiv":1,"day":"25","OA_place":"publisher","intvolume":"        38","date_published":"2024-09-25T00:00:00Z","citation":{"mla":"Cadei, Riccardo, et al. “Smoke and Mirrors in Causal Downstream Tasks.” <i>ICML 2024 Workshop AI4Science</i>, vol. 38, Curran Associates, 2024.","ieee":"R. Cadei, L. Lindorfer, S. Cremer, C. Schmid, and F. Locatello, “Smoke and mirrors in causal downstream tasks,” in <i>ICML 2024 Workshop AI4Science</i>, 2024, vol. 38.","apa":"Cadei, R., Lindorfer, L., Cremer, S., Schmid, C., &#38; Locatello, F. (2024). Smoke and mirrors in causal downstream tasks. In <i>ICML 2024 Workshop AI4Science</i> (Vol. 38). Curran Associates.","chicago":"Cadei, Riccardo, Lukas Lindorfer, Sylvia Cremer, Cordelia Schmid, and Francesco Locatello. “Smoke and Mirrors in Causal Downstream Tasks.” In <i>ICML 2024 Workshop AI4Science</i>, Vol. 38. Curran Associates, 2024.","ista":"Cadei R, Lindorfer L, Cremer S, Schmid C, Locatello F. 2024. Smoke and mirrors in causal downstream tasks. ICML 2024 Workshop AI4Science. ICML: International Conference on Machine Learning vol. 38.","ama":"Cadei R, Lindorfer L, Cremer S, Schmid C, Locatello F. Smoke and mirrors in causal downstream tasks. In: <i>ICML 2024 Workshop AI4Science</i>. Vol 38. Curran Associates; 2024.","short":"R. Cadei, L. Lindorfer, S. Cremer, C. Schmid, F. Locatello, in:, ICML 2024 Workshop AI4Science, Curran Associates, 2024."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"SyCr"},{"_id":"FrLo"},{"_id":"GradSch"}],"publisher":"Curran Associates","article_processing_charge":"No"},{"author":[{"last_name":"Lutsai","full_name":"Lutsai, Kateryna","first_name":"Kateryna"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"month":"12","ddc":["500"],"OA_type":"gold","date_updated":"2025-06-05T13:47:12Z","publication_status":"published","article_type":"original","title":"Predicting the geolocation of tweets using transformer models on customized data","scopus_import":"1","status":"public","file":[{"file_name":"2024_JourSpatialInfoScience_Lutsai.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"18857","creator":"dernst","date_updated":"2025-01-20T08:41:10Z","success":1,"date_created":"2025-01-20T08:41:10Z","checksum":"b82413f00398ffb5168e8e747571a98d","file_size":7250655}],"_id":"18856","language":[{"iso":"eng"}],"publication":"Journal of Spatial Information Science","oa_version":"Published Version","date_created":"2025-01-19T23:01:53Z","related_material":{"link":[{"url":"https://github.com/K4TEL/geo-twitter.git","relation":"software"}]},"year":"2024","abstract":[{"lang":"eng","text":"This research is aimed to solve the tweet/user geolocation prediction task and provide a flexible methodology for the geo-tagging of textual big data. The suggested approach implements neural networks for natural language processing (NLP) to estimate the location as coordinate pairs (longitude, latitude) and two-dimensional Gaussian Mixture Models (GMMs). The scope of proposed models has been finetuned on a Twitter dataset using pretrained Bidirectional Encoder Representations from Transformers (BERT) as base models. Performance metrics show a median error of fewer than 30 km on a worldwide-level, and fewer than 15 km on the US-level datasets for the models trained and evaluated on text features of tweets' content and metadata context. Our source code and data are available at https://github.com/K4TEL/geo-twitter.git."}],"page":"69-99","date_published":"2024-12-26T00:00:00Z","OA_place":"publisher","DOAJ_listed":"1","day":"26","quality_controlled":"1","publication_identifier":{"eissn":["1948-660X"]},"article_processing_charge":"Yes","department":[{"_id":"ChLa"}],"citation":{"ama":"Lutsai K, Lampert C. Predicting the geolocation of tweets using transformer models on customized data. <i>Journal of Spatial Information Science</i>. 2024;(29):69-99. doi:<a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">10.5311/JOSIS.2024.29.295</a>","short":"K. Lutsai, C. Lampert, Journal of Spatial Information Science (2024) 69–99.","mla":"Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” <i>Journal of Spatial Information Science</i>, no. 29, University of Maine, 2024, pp. 69–99, doi:<a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">10.5311/JOSIS.2024.29.295</a>.","chicago":"Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” <i>Journal of Spatial Information Science</i>. University of Maine, 2024. <a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">https://doi.org/10.5311/JOSIS.2024.29.295</a>.","ieee":"K. Lutsai and C. Lampert, “Predicting the geolocation of tweets using transformer models on customized data,” <i>Journal of Spatial Information Science</i>, no. 29. University of Maine, pp. 69–99, 2024.","apa":"Lutsai, K., &#38; Lampert, C. (2024). Predicting the geolocation of tweets using transformer models on customized data. <i>Journal of Spatial Information Science</i>. University of Maine. <a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">https://doi.org/10.5311/JOSIS.2024.29.295</a>","ista":"Lutsai K, Lampert C. 2024. Predicting the geolocation of tweets using transformer models on customized data. Journal of Spatial Information Science. (29), 69–99."},"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","issue":"29","publisher":"University of Maine","corr_author":"1","has_accepted_license":"1","acknowledgement":"The authors acknowledge the Institute of Science and Technology (ISTA) for their material support and for granting access to the Twitter database archive, which was essential for the research.","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"license":"https://creativecommons.org/licenses/by/3.0/","oa":1,"doi":"10.5311/JOSIS.2024.29.295","file_date_updated":"2025-01-20T08:41:10Z","type":"journal_article"},{"publisher":"Neural Information Processing Systems Foundation","citation":{"ista":"Kalinin N, Lampert C. 2024. Banded square root matrix factorization for differentially private model training. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","apa":"Kalinin, N., &#38; Lampert, C. (2024). Banded square root matrix factorization for differentially private model training. In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","chicago":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","ieee":"N. Kalinin and C. Lampert, “Banded square root matrix factorization for differentially private model training,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","mla":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","short":"N. Kalinin, C. Lampert, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ama":"Kalinin N, Lampert C. Banded square root matrix factorization for differentially private model training. In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024."},"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"alternative_title":["Advances in Neural Information Processing Systems"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","publication_identifier":{"eissn":["1049-5258"]},"quality_controlled":"1","arxiv":1,"day":"01","OA_place":"publisher","intvolume":"        37","date_published":"2024-12-01T00:00:00Z","type":"conference","file_date_updated":"2025-01-27T09:52:15Z","conference":{"end_date":"2024-12-16","location":"Vancouver, Canada","start_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems"},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","corr_author":"1","language":[{"iso":"eng"}],"publication":"38th Annual Conference on Neural Information Processing Systems","_id":"18875","file":[{"date_updated":"2025-01-27T09:52:15Z","success":1,"date_created":"2025-01-27T09:52:15Z","checksum":"a216cab8eddc1fe7840aede0e2c0d41e","file_size":1144656,"file_name":"2024_NeurIPS_Nikita.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"18888","creator":"dernst"}],"status":"public","scopus_import":"1","title":"Banded square root matrix factorization for differentially private model training","publication_status":"published","date_updated":"2025-05-14T11:34:20Z","ddc":["000"],"OA_type":"gold","author":[{"id":"4b14526e-14d2-11ed-ba64-c14c9553d137","last_name":"Kalinin","full_name":"Kalinin, Nikita","first_name":"Nikita"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"month":"12","abstract":[{"lang":"eng","text":"Current state-of-the-art methods for differentially private model training are based on matrix factorization techniques. However, these methods suffer from high computational overhead because they require numerically solving a demanding optimization problem to determine an approximately optimal factorization prior to the actual model training. In this work, we present a new matrix factorization approach, BSR, which overcomes this computational bottleneck. By exploiting properties of the standard matrix square root, BSR allows to efficiently handle also large-scale problems. For the key scenario of stochastic gradient descent with momentum and weight decay, we even derive analytical expressions for BSR that render the computational overhead negligible. We prove bounds on the approximation quality that hold both in the centralized and in the federated learning setting. Our numerical experiments demonstrate that models trained using BSR perform on par with the best existing methods, while completely avoiding their computational overhead."}],"year":"2024","volume":37,"date_created":"2025-01-24T17:58:16Z","external_id":{"arxiv":["2405.13763"]},"oa_version":"Published Version"},{"oa_version":"Preprint","external_id":{"arxiv":["2402.13728"]},"date_created":"2025-01-27T11:11:40Z","year":"2024","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"volume":37,"abstract":[{"text":"Deep Neural Collapse (DNC) refers to the surprisingly rigid structure of the data representations in the final layers of Deep Neural Networks (DNNs). Though the phenomenon has been measured in a variety of settings, its emergence is typically explained via data-agnostic approaches, such as the unconstrained features model. In this work, we introduce a data-dependent setting where DNC forms due to feature learning through the average gradient outer product (AGOP). The AGOP is defined with respect to a learned predictor and is equal to the uncentered covariance matrix of its input-output gradients averaged over the training dataset. The Deep Recursive Feature Machine (Deep RFM) is a method that constructs a neural network by iteratively mapping the data with the AGOP and applying an untrained random feature map. We demonstrate empirically that DNC occurs in Deep RFM across standard settings as a consequence of the projection with the AGOP matrix computed at each layer. Further, we theoretically explain DNC in Deep RFM in an asymptotic setting and as a result of kernel learning. We then provide evidence that this mechanism holds for neural networks more generally. In particular, we show that the right singular vectors and values of the weights can be responsible for the majority of within-class variability collapse for DNNs trained in the feature learning regime. As observed in recent work, this singular structure is highly correlated with that of the AGOP.","lang":"eng"}],"month":"12","author":[{"first_name":"Daniel","full_name":"Beaglehole, Daniel","last_name":"Beaglehole"},{"first_name":"Peter","full_name":"Súkeník, Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","last_name":"Súkeník"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","full_name":"Mondelli, Marco","first_name":"Marco","orcid":"0000-0002-3242-7020"},{"last_name":"Belkin","first_name":"Mikhail","full_name":"Belkin, Mikhail"}],"OA_type":"green","publication_status":"published","date_updated":"2025-05-14T11:29:45Z","scopus_import":"1","status":"public","title":"Average gradient outer product as a mechanism for deep neural collapse","_id":"18890","language":[{"iso":"eng"}],"publication":"38th Annual Conference on Neural Information Processing Systems","corr_author":"1","acknowledgement":"We acknowledge support from the National Science Foundation (NSF) and the Simons Foundation for the Collaboration on the Theoretical Foundations of Deep Learning through awards DMS-2031883 and #814639 as well as the TILOS institute (NSF CCF-2112665). This work used the programs (1) XSEDE (Extreme science and engineering discovery environment) which is supported by NSF grant numbers ACI-1548562, and (2) ACCESS (Advanced cyberinfrastructure coordination ecosystem: services & support) which is supported by NSF grants numbers #2138259, #2138286, #2138307, #2137603, and #2138296. Specifically, we used the resources from SDSC Expanse GPU compute nodes, and NCSA Delta system, via allocations TG-CIS220009. Marco Mondelli is supported by the 2019 Lopez-Loreta prize. We also acknowledge useful feedback from anonymous reviewers. ","oa":1,"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-16","location":"Vancouver, Canada","end_date":"2024-12-16"},"main_file_link":[{"url":"https://openreview.net/forum?id=lJ1jdl2K9k","open_access":"1"}],"type":"conference","date_published":"2024-12-01T00:00:00Z","OA_place":"repository","intvolume":"        37","day":"01","arxiv":1,"quality_controlled":"1","publication_identifier":{"eissn":["1049-5258"]},"article_processing_charge":"No","publisher":"Neural Information Processing Systems Foundation","citation":{"short":"D. Beaglehole, P. Súkeník, M. Mondelli, M. Belkin, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ama":"Beaglehole D, Súkeník P, Mondelli M, Belkin M. Average gradient outer product as a mechanism for deep neural collapse. In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","ista":"Beaglehole D, Súkeník P, Mondelli M, Belkin M. 2024. Average gradient outer product as a mechanism for deep neural collapse. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","ieee":"D. Beaglehole, P. Súkeník, M. Mondelli, and M. Belkin, “Average gradient outer product as a mechanism for deep neural collapse,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","apa":"Beaglehole, D., Súkeník, P., Mondelli, M., &#38; Belkin, M. (2024). Average gradient outer product as a mechanism for deep neural collapse. In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","chicago":"Beaglehole, Daniel, Peter Súkeník, Marco Mondelli, and Mikhail Belkin. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","mla":"Beaglehole, Daniel, et al. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"MaMo"}],"alternative_title":["Advances in Neural Information Processing Systems"]},{"date_published":"2024-12-01T00:00:00Z","intvolume":"        37","OA_place":"publisher","arxiv":1,"day":"01","quality_controlled":"1","article_processing_charge":"No","alternative_title":["Advances in Neural Information Processing Systems"],"citation":{"short":"P. Súkeník, C. Lampert, M. Mondelli, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ama":"Súkeník P, Lampert C, Mondelli M. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","chicago":"Súkeník, Peter, Christoph Lampert, and Marco Mondelli. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","ieee":"P. Súkeník, C. Lampert, and M. Mondelli, “Neural collapse versus low-rank bias: Is deep neural collapse really optimal?,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","apa":"Súkeník, P., Lampert, C., &#38; Mondelli, M. (2024). Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","ista":"Súkeník P, Lampert C, Mondelli M. 2024. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","mla":"Súkeník, Peter, et al. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GradSch"},{"_id":"MaMo"},{"_id":"ChLa"}],"publisher":"Neural Information Processing Systems Foundation","corr_author":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"has_accepted_license":"1","acknowledgement":"Marco Mondelli is partially supported by the 2019 Lopez-Loreta prize. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"conference":{"location":"Vancouver, Canada","end_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-16"},"file_date_updated":"2025-02-04T08:11:25Z","type":"conference","author":[{"first_name":"Peter","full_name":"Súkeník, Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","last_name":"Súkeník"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","full_name":"Mondelli, Marco","first_name":"Marco","orcid":"0000-0002-3242-7020"}],"month":"12","ddc":["000"],"OA_type":"gold","date_updated":"2025-06-04T07:19:21Z","publication_status":"published","title":"Neural collapse versus low-rank bias: Is deep neural collapse really optimal?","file":[{"date_updated":"2025-02-04T08:11:25Z","success":1,"date_created":"2025-02-04T08:11:25Z","file_size":1784118,"checksum":"b7b79f1ea3ac1e9e11b3d91faaeb0780","file_name":"2024_NeurIPS_Sukenik.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"dernst","file_id":"18989"}],"status":"public","_id":"18891","publication":"38th Annual Conference on Neural Information Processing Systems","language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2025-01-27T11:15:18Z","external_id":{"arxiv":["2405.14468"]},"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"volume":37,"year":"2024","abstract":[{"text":"Deep neural networks (DNNs) exhibit a surprising structure in their final layer\r\nknown as neural collapse (NC), and a growing body of works has currently investigated the propagation of neural collapse to earlier layers of DNNs – a phenomenon\r\ncalled deep neural collapse (DNC). However, existing theoretical results are restricted to special cases: linear models, only two layers or binary classification.\r\nIn contrast, we focus on non-linear models of arbitrary depth in multi-class classification and reveal a surprising qualitative shift. As soon as we go beyond two\r\nlayers or two classes, DNC stops being optimal for the deep unconstrained features\r\nmodel (DUFM) – the standard theoretical framework for the analysis of collapse.\r\nThe main culprit is a low-rank bias of multi-layer regularization schemes: this bias\r\nleads to optimal solutions of even lower rank than the neural collapse. We support\r\nour theoretical findings with experiments on both DUFM and real data, which show\r\nthe emergence of the low-rank structure in the solution found by gradient descent.","lang":"eng"}]},{"day":"23","OA_type":"gold","ddc":["570"],"date_updated":"2025-01-27T11:58:38Z","date_published":"2024-10-23T00:00:00Z","OA_place":"repository","month":"10","author":[{"first_name":"Riccardo","full_name":"Cadei, Riccardo","id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","last_name":"Cadei"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"full_name":"Cremer, Sylvia M","orcid":"0000-0002-2193-3868","first_name":"Sylvia M","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lindorfer, Lukas","first_name":"Lukas","last_name":"Lindorfer","id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455"},{"last_name":"Schmid","full_name":"Schmid, Cordelia","first_name":"Cordelia"}],"_id":"18895","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Cadei, Riccardo, et al. <i>ISTAnt</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>.","ista":"Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. 2024. ISTAnt, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>.","apa":"Cadei, R., Locatello, F., Cremer, S., Lindorfer, L., &#38; Schmid, C. (2024). ISTAnt. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">https://doi.org/10.6084/M9.FIGSHARE.26484934.V2</a>","ieee":"R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, and C. Schmid, “ISTAnt.” Institute of Science and Technology Austria, 2024.","chicago":"Cadei, Riccardo, Francesco Locatello, Sylvia Cremer, Lukas Lindorfer, and Cordelia Schmid. “ISTAnt.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">https://doi.org/10.6084/M9.FIGSHARE.26484934.V2</a>.","ama":"Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. ISTAnt. 2024. doi:<a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>","short":"R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, C. Schmid, (2024)."},"department":[{"_id":"SyCr"},{"_id":"FrLo"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","title":"ISTAnt","status":"public","article_processing_charge":"No","related_material":{"record":[{"relation":"used_in_publication","id":"18847","status":"public"}]},"date_created":"2025-01-27T11:45:43Z","corr_author":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"ISTAnt is a new ecological dataset for social immunity and represents the first real-world benchmark for causal inference downstream tasks on high-dimensional observations. It analyzes grooming behavior in the ant Lasius neglectus in groups of three worker ants. The workers for the experiment were obtained from their laboratory stock colony, which had been collected from the field in 2022 in the Botanical Garden Jena, Germany. Ant collection and all experimental work were performed in compliance with international, national and institutional regulations and ethical guidelines. For the experiment, the body surface of one of the three ants was treated with a suspension of either of two microparticle types (diameter ~5 µm) to induce grooming by the two nestmates, which were individually color-coded by application of a dot of blue or orange paint, respectively. The three ants were housed in small plastic containers (diameter 28mm, height 30mm) with moistened, plastered ground and the interior walls covered with PTFE (polytetrafluoroethane) to hamper climbing by the ants. Filming occurred in a temperature- and humidity-controlled room at 23°C within a custom-made filming box with controlled lighting and ventilation conditions. We set up nine ant groups at a time (always containing both treatments) and placed them randomly on positions 1-9 marked on the floor in a 3x3 grid, about 3mm from each other. The experiment was performed on two consecutive days. Videos were acquired using a USB camera (FLIR blackfly S BFS-U3-120S4C, Teledyne FLIR) with a high-performance lens (HP Series 25mm Focal Length, Edmund optics 86-572) in OBS studio 29.0.0 \\citep{bailey2017obs} at a framerate of 30 FPS and a resolution of 2500x2500 pixels. From each original video (105x105 mm), we generated nine individual videos .mkv (each ~32x32 mm, 770x770 pixels) by determining exact coordinates per container from one frame in GIMP 2.10.36 and cropping of the videos with FFmpeg 6.1.1. Annotation was performed over two consecutive days by three observers who had not been involved in the experimental setup or recording and were unaware of the treatment assignments to ensure bias-free behavioral annotation. They annotated the behavior of the ants during video observations, using custom-made software that saves the start and end frames of behaviors marked in a .csv file (see 'annotations' folder). In one of the videos, one of the nestmates' legs got inadvertently stuck to its body surface during the color-coding, interfering with its behavior, so the video was discarded. This left 44 videos from 5 independent setups (n=24 of treatment 1 and n=20 of treatment 2) of 10 minutes each for a total of 792 000 annotated frames (see 'video' folder). For each video, we provide the following information: the number of the set to which it belongs (1-5); the number of the position within the set reflecting the position of the ant group under the camera (1-9), for which we also provide ‘coordinates’ in the 3x3 grid (taking values -1/0/1 for both X and Y axis); treatment (1 or 2); the hour of the day when the recording was started (in 24h CEST); experimental day (A or B); the top left coordinate of the cropping square from the original video (CropX/CropY); the person annotating the video (given as A, B, C); the date of annotation (1: first day, 2: second day) and in which order the videos were annotated by each person, both reflecting a possible training effect of the person (see 'experiments_settings.csv' file)."}],"main_file_link":[{"open_access":"1","url":"https://10.6084/M9.FIGSHARE.26484934.V2"}],"type":"research_data_reference","oa":1,"year":"2024","doi":"10.6084/M9.FIGSHARE.26484934.V2"},{"publication_identifier":{"issn":["2835-8856"]},"article_processing_charge":"No","citation":{"ista":"Pedrotti F, Maas J, Mondelli M. 2024. Improved convergence of score-based diffusion models via prediction-correction. Transactions on Machine Learning Research. , TMLR, .","chicago":"Pedrotti, Francesco, Jan Maas, and Marco Mondelli. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” In <i>Transactions on Machine Learning Research</i>, 2024.","ieee":"F. Pedrotti, J. Maas, and M. Mondelli, “Improved convergence of score-based diffusion models via prediction-correction,” in <i>Transactions on Machine Learning Research</i>, 2024.","apa":"Pedrotti, F., Maas, J., &#38; Mondelli, M. (2024). Improved convergence of score-based diffusion models via prediction-correction. In <i>Transactions on Machine Learning Research</i>.","mla":"Pedrotti, Francesco, et al. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” <i>Transactions on Machine Learning Research</i>, 2024.","short":"F. Pedrotti, J. Maas, M. Mondelli, in:, Transactions on Machine Learning Research, 2024.","ama":"Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. In: <i>Transactions on Machine Learning Research</i>. ; 2024."},"alternative_title":["TMLR"],"department":[{"_id":"JaMa"},{"_id":"MaMo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2024-06-01T00:00:00Z","OA_place":"publisher","arxiv":1,"day":"01","quality_controlled":"1","oa":1,"file_date_updated":"2025-01-27T12:19:44Z","type":"conference","corr_author":"1","has_accepted_license":"1","acknowledgement":"Francesco Pedrotti and Jan Maas acknowledge support by the Austrian Science Fund (FWF) project 10.55776/F65. Marco Mondelli acknowledges support by the 2019 Lopez-Loreta prize.\r\n","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Improved convergence of score-based diffusion models via prediction-correction","status":"public","file":[{"file_name":"2024_TMLR_Pedrotti.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"18898","creator":"dernst","date_updated":"2025-01-27T12:19:44Z","date_created":"2025-01-27T12:19:44Z","success":1,"checksum":"76a1fd5afd8ee6f7ae0e5912d7dbf6b4","file_size":780315}],"scopus_import":"1","_id":"18897","publication":"Transactions on Machine Learning Research","language":[{"iso":"eng"}],"author":[{"full_name":"Pedrotti, Francesco","first_name":"Francesco","last_name":"Pedrotti","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","first_name":"Jan"},{"full_name":"Mondelli, Marco","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli"}],"month":"06","ddc":["000"],"OA_type":"gold","date_updated":"2025-04-15T08:31:35Z","publication_status":"published","project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"year":"2024","abstract":[{"lang":"eng","text":"Score-based generative models (SGMs) are powerful tools to sample from complex data distributions. Their underlying idea is to (i) run a forward process for time T1 by adding noise to the data, (ii) estimate its score function, and (iii) use such estimate to run a reverse process. As the reverse process is initialized with the stationary distribution of the forward one, the existing analysis paradigm requires T1→∞. This is however problematic: from a theoretical viewpoint, for a given precision of the score approximation, the convergence guarantee fails as T1 diverges; from a practical viewpoint, a large T1 increases computational costs and leads to error propagation. This paper addresses the issue by considering a version of the popular predictor-corrector scheme: after running the forward process, we first estimate the final distribution via an inexact Langevin dynamics and then revert the process. Our key technical contribution is to provide convergence guarantees which require to run the forward process only for a fixed finite time T1. Our bounds exhibit a mild logarithmic dependence on the input dimension and the subgaussian norm of the target distribution, have minimal assumptions on the data, and require only to control the L2 loss on the score approximation, which is the quantity minimized in practice."}],"oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"17350","relation":"earlier_version"}]},"date_created":"2025-01-27T12:18:05Z","external_id":{"arxiv":["2305.14164"]}},{"date_created":"2025-01-27T12:26:03Z","oa_version":"None","abstract":[{"text":"The flourishing theory of classical optimal transport concerns mass transportation at minimal cost. This book introduces the reader to optimal transport on quantum structures, i.e., optimal transportation between quantum states and related non-commutative concepts of mass transportation. It contains lecture notes on\r\n\r\nclassical optimal transport and Wasserstein gradient flows\r\ndynamics and quantum optimal transport\r\nquantum couplings and many-body problems\r\nquantum channels and qubits\r\n\r\nThese notes are based on lectures given by the authors at the \"Optimal Transport on Quantum Structures\" School held at the Erdös Center in Budapest in the fall of 2022. The lecture notes are complemented by two survey chapters presenting the state of the art in different research areas of non-commutative optimal transport.","lang":"eng"}],"type":"book_editor","volume":29,"year":"2024","place":"Cham","doi":"10.1007/978-3-031-50466-2","day":"19","date_updated":"2025-02-17T12:22:18Z","series_title":"BSMS","editor":[{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","full_name":"Maas, Jan","first_name":"Jan","orcid":"0000-0002-0845-1338"},{"orcid":"0000-0001-5059-4466","first_name":"Simone Anna Elvira","full_name":"Rademacher, Simone Anna Elvira","last_name":"Rademacher","id":"856966FE-A408-11E9-977E-802DE6697425"},{"last_name":"Titkos","first_name":"Tamás","full_name":"Titkos, Tamás"},{"orcid":"0000-0003-1109-5511","first_name":"Daniel","full_name":"Virosztek, Daniel","last_name":"Virosztek","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","quality_controlled":"1","date_published":"2024-09-19T00:00:00Z","intvolume":"        29","month":"09","_id":"18899","citation":{"mla":"Maas, Jan, et al., editors. <i>Optimal Transport on Quantum Structures</i>. Vol. 29, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-50466-2\">10.1007/978-3-031-50466-2</a>.","chicago":"Maas, Jan, Simone Anna Elvira Rademacher, Tamás Titkos, and Daniel Virosztek, eds. <i>Optimal Transport on Quantum Structures</i>. Vol. 29. BSMS. Cham: Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-50466-2\">https://doi.org/10.1007/978-3-031-50466-2</a>.","ieee":"J. Maas, S. A. E. Rademacher, T. Titkos, and D. Virosztek, Eds., <i>Optimal Transport on Quantum Structures</i>, vol. 29. Cham: Springer Nature, 2024.","apa":"Maas, J., Rademacher, S. A. E., Titkos, T., &#38; Virosztek, D. (Eds.). (2024). <i>Optimal Transport on Quantum Structures</i> (Vol. 29). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-50466-2\">https://doi.org/10.1007/978-3-031-50466-2</a>","ista":"Maas J, Rademacher SAE, Titkos T, Virosztek D eds. 2024. Optimal Transport on Quantum Structures, Cham: Springer Nature,p.","ama":"Maas J, Rademacher SAE, Titkos T, Virosztek D, eds. <i>Optimal Transport on Quantum Structures</i>. Vol 29. Cham: Springer Nature; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-50466-2\">10.1007/978-3-031-50466-2</a>","short":"J. Maas, S.A.E. Rademacher, T. Titkos, D. Virosztek, eds., Optimal Transport on Quantum Structures, Springer Nature, Cham, 2024."},"department":[{"_id":"JaMa"}],"alternative_title":["Bolyai Society Mathematical Studies"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1217-4696"],"eisbn":["9783031504662"],"isbn":["9783031504655"],"eissn":["2947-9460"]},"title":"Optimal Transport on Quantum Structures","status":"public","article_processing_charge":"No","scopus_import":"1"},{"date_created":"2025-01-27T12:36:10Z","external_id":{"isi":["001222279400001"]},"oa_version":"Published Version","page":"10597-10614","abstract":[{"lang":"eng","text":"We prove that certain closable derivations on the GNS Hilbert space associated with a non-tracial weight on a von Neumann algebra give rise to GNS-symmetric semigroups of contractive completely positive maps on the von Neumann algebra."}],"year":"2024","isi":1,"project":[{"name":"Gradient flow techniques for quantum Markov semigroups","_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833","grant_number":"ESP156_N"}],"volume":2024,"publication_status":"published","date_updated":"2025-09-09T12:02:46Z","ddc":["510"],"OA_type":"hybrid","author":[{"last_name":"Wirth","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","full_name":"Wirth, Melchior","orcid":"0000-0002-0519-4241","first_name":"Melchior"}],"month":"07","publication":"International Mathematics Research Notices","language":[{"iso":"eng"}],"_id":"18900","scopus_import":"1","status":"public","file":[{"checksum":"3e1f80d58ada0c60a58f35df8080967e","file_size":689984,"date_created":"2025-01-27T12:38:10Z","success":1,"date_updated":"2025-01-27T12:38:10Z","file_id":"18901","creator":"dernst","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2024_IMRN_Wirth.pdf"}],"title":"Modular completely Dirichlet forms as squares of derivations","article_type":"original","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"The author was funded by the Austrian Science Fund under the Esprit Programme [ESP 156]. For the purpose of Open Access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. ","has_accepted_license":"1","corr_author":"1","type":"journal_article","file_date_updated":"2025-01-27T12:38:10Z","doi":"10.1093/imrn/rnae092","oa":1,"quality_controlled":"1","day":"01","intvolume":"      2024","OA_place":"publisher","date_published":"2024-07-01T00:00:00Z","publisher":"Oxford University Press","issue":"14","department":[{"_id":"JaMa"}],"citation":{"ista":"Wirth M. 2024. Modular completely Dirichlet forms as squares of derivations. International Mathematics Research Notices. 2024(14), 10597–10614.","apa":"Wirth, M. (2024). Modular completely Dirichlet forms as squares of derivations. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnae092\">https://doi.org/10.1093/imrn/rnae092</a>","chicago":"Wirth, Melchior. “Modular Completely Dirichlet Forms as Squares of Derivations.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/imrn/rnae092\">https://doi.org/10.1093/imrn/rnae092</a>.","ieee":"M. Wirth, “Modular completely Dirichlet forms as squares of derivations,” <i>International Mathematics Research Notices</i>, vol. 2024, no. 14. Oxford University Press, pp. 10597–10614, 2024.","mla":"Wirth, Melchior. “Modular Completely Dirichlet Forms as Squares of Derivations.” <i>International Mathematics Research Notices</i>, vol. 2024, no. 14, Oxford University Press, 2024, pp. 10597–614, doi:<a href=\"https://doi.org/10.1093/imrn/rnae092\">10.1093/imrn/rnae092</a>.","short":"M. Wirth, International Mathematics Research Notices 2024 (2024) 10597–10614.","ama":"Wirth M. Modular completely Dirichlet forms as squares of derivations. <i>International Mathematics Research Notices</i>. 2024;2024(14):10597-10614. doi:<a href=\"https://doi.org/10.1093/imrn/rnae092\">10.1093/imrn/rnae092</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]}},{"acknowledgement":"This work presents results from the European Space Agency (ESA) space mission PLATO. The PLATO payload, the PLATO Ground Segment and PLATO data processing are joint developments of ESA and the PLATO Mission Consortium (PMC). Funding for the PMC is provided at national levels, in particular by countries participating in the PLATO Multilateral Agreement (Austria, Belgium, Czech Republic, Denmark, France, Germany, Italy, Netherlands, Portugal, Spain, Sweden, Switzerland, Norway, and United Kingdom) and institutions from Brazil. Members of the PLATO Consortium can be found at https://platomission.com. The ESA PLATO mission website is https://www.cosmos.esa.int/plato. The authors thank the teams working for PLATO for all their work. They acknowledge the critical reading and the constructive comments from the anonymous referee that significantly allowed improving the original version of this paper. They finally thank R. Samadi for helpful advice and suggestions concerning the PSLS abilities. S.N.B, A.F.L, S.Me, I.P and E.C acknowledge support from PLATO ASI-INAF agreement no. 2022-28-HH.0 “PLATO Fase D”. S.N.B, L.A, A.S.B, Q.N, and A.S acknowledge financial support by ERC Whole Sun Synergy grant #810218. S.N.B, R.A.G, L.A, A.S.B, Q.N., D.B.P, E.P, and A.S acknowledge the support from PLATO CNES grant. R.A.G, D.B.P, and E.P acknowledge the support from SoHO/GOLF CNES grant. A.S.B, Q.N, and A.S acknowledge the support from INSU/PNST grant and Solar Orbiter CNES grant. A.S acknowledges funding from from the European Union’s Horizon-2020 research and innovation program (grant agreement no. 776403 ExoplANETS-A) and the Programme National de Planétologie (PNP). A.R.G.S acknowledges the support from the FCT through national funds and FEDER through COMPETE2020 (UIDB/04434/2020, UIDP/04434/2020, 2022.03993.PTDC) and the support from the FCT through the work contract No. 2020.02480.CEECIND/CP1631/CT0001. S.Ma acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the Ramón y Cajal fellowship no. RYC-2015-17697 and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023 (CEX2019-000920-S). S.Ma acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the grant no. PID2019-107187GB-I00. M.J.G., K.B., R.M.O, J.P, O.R., C.R. acknowledge support from CNES. The computations were performed with the IRFU/CEA Saclay server facilities, funded by ERC Synergy grant WholeSun No.810218, the P2IO Labex emergence project FlarePredict, and CNES PLATO funds. Software:star-privateer (this work), pyspot (Aigrain et al. 2015), PSLS (Samadi et al. 2019), numpy (Harris et al. 2020), matplotlib (Hunter 2007), scipy (Virtanen et al. 2020), astropy (Astropy Collaboration 2022), pandas (Wes McKinney 2010; The pandas development team 2020), scikit-learn (Pedregosa et al. 2011).","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"A229","type":"journal_article","file_date_updated":"2025-01-27T13:18:41Z","oa":1,"doi":"10.1051/0004-6361/202449893","arxiv":1,"day":"01","quality_controlled":"1","date_published":"2024-09-01T00:00:00Z","intvolume":"       689","OA_place":"publisher","publisher":"EDP Sciences","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ama":"Breton SN, Lanza AF, Messina S, et al. Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves. <i>Astronomy and Astrophysics</i>. 2024;689. doi:<a href=\"https://doi.org/10.1051/0004-6361/202449893\">10.1051/0004-6361/202449893</a>","short":"S.N. Breton, A.F. Lanza, S. Messina, I. Pagano, L.A. Bugnet, E. Corsaro, R.A. García, S. Mathur, A.R.G. Santos, S. Aigrain, L. Amard, A.S. Brun, L. Degott, Q. Noraz, D.B. Palakkatharappil, E. Panetier, A. Strugarek, K. Belkacem, M.-J. Goupil, R.M. Ouazzani, J. Philidet, C. Renié, O. Roth, Astronomy and Astrophysics 689 (2024).","mla":"Breton, S. N., et al. “Measuring Stellar Surface Rotation and Activity with the PLATO Mission. I. Strategy and Application to Simulated Light Curves.” <i>Astronomy and Astrophysics</i>, vol. 689, A229, EDP Sciences, 2024, doi:<a href=\"https://doi.org/10.1051/0004-6361/202449893\">10.1051/0004-6361/202449893</a>.","ista":"Breton SN, Lanza AF, Messina S, Pagano I, Bugnet LA, Corsaro E, García RA, Mathur S, Santos ARG, Aigrain S, Amard L, Brun AS, Degott L, Noraz Q, Palakkatharappil DB, Panetier E, Strugarek A, Belkacem K, Goupil M-J, Ouazzani RM, Philidet J, Renié C, Roth O. 2024. Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves. Astronomy and Astrophysics. 689, A229.","ieee":"S. N. Breton <i>et al.</i>, “Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves,” <i>Astronomy and Astrophysics</i>, vol. 689. EDP Sciences, 2024.","apa":"Breton, S. N., Lanza, A. F., Messina, S., Pagano, I., Bugnet, L. A., Corsaro, E., … Roth, O. (2024). Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves. <i>Astronomy and Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202449893\">https://doi.org/10.1051/0004-6361/202449893</a>","chicago":"Breton, S. N., A. F. Lanza, S. Messina, I. Pagano, Lisa Annabelle Bugnet, E. Corsaro, R. A. García, et al. “Measuring Stellar Surface Rotation and Activity with the PLATO Mission. I. Strategy and Application to Simulated Light Curves.” <i>Astronomy and Astrophysics</i>. EDP Sciences, 2024. <a href=\"https://doi.org/10.1051/0004-6361/202449893\">https://doi.org/10.1051/0004-6361/202449893</a>."},"department":[{"_id":"LiBu"}],"publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"article_processing_charge":"No","external_id":{"arxiv":["2407.03709"],"isi":["001366206400007"]},"date_created":"2025-01-27T13:12:44Z","oa_version":"Published Version","abstract":[{"text":"The Planetary Transits and Oscillations of stars mission (PLATO) will allow us to measure surface rotation and monitor photometric activity of tens of thousands of main sequence solar-type and subgiant stars. This paper is the first of a series dedicated to the preparation of the analysis of stellar surface rotation and photospheric activity with the near-future PLATO data. We describe in this work the strategy that will be implemented in the PLATO pipeline to measure stellar surface rotation, photometric activity, and long-term modulations. The algorithms are applied on both noise-free and noisy simulations of solar-type stars, which include activity cycles, latitudinal differential rotation, and spot evolution. PLATO simulated systematics are included in the noisy light curves. We show that surface rotation periods can be recovered with confidence for most of the stars with only six months of observations and that the recovery rate of the analysis significantly improves as additional observations are collected. This means that the first PLATO data release will already provide a substantial set of measurements for this quantity, with a significant refinement on their quality as the instrument obtains longer light curves. Measuring the Schwabe-like magnetic activity cycle during the mission will require that the same field be observed over a significant timescale (more than four years). Nevertheless, PLATO will provide a vast and robust sample of solar-type stars with constraints on the activity-cycle length. Such a sample is lacking from previous missions dedicated to space photometry.","lang":"eng"}],"year":"2024","volume":689,"isi":1,"OA_type":"hybrid","ddc":["520"],"publication_status":"published","date_updated":"2025-09-09T12:04:24Z","author":[{"first_name":"S. N.","full_name":"Breton, S. N.","last_name":"Breton"},{"first_name":"A. F.","full_name":"Lanza, A. F.","last_name":"Lanza"},{"first_name":"S.","full_name":"Messina, S.","last_name":"Messina"},{"last_name":"Pagano","first_name":"I.","full_name":"Pagano, I."},{"last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","first_name":"Lisa Annabelle"},{"last_name":"Corsaro","first_name":"E.","full_name":"Corsaro, E."},{"full_name":"García, R. A.","first_name":"R. A.","last_name":"García"},{"full_name":"Mathur, S.","first_name":"S.","last_name":"Mathur"},{"last_name":"Santos","full_name":"Santos, A. R. G.","first_name":"A. R. G."},{"first_name":"S.","full_name":"Aigrain, S.","last_name":"Aigrain"},{"first_name":"L.","full_name":"Amard, L.","last_name":"Amard"},{"full_name":"Brun, A. S.","first_name":"A. S.","last_name":"Brun"},{"full_name":"Degott, L.","first_name":"L.","last_name":"Degott"},{"last_name":"Noraz","first_name":"Q.","full_name":"Noraz, Q."},{"first_name":"D. B.","full_name":"Palakkatharappil, D. B.","last_name":"Palakkatharappil"},{"last_name":"Panetier","full_name":"Panetier, E.","first_name":"E."},{"last_name":"Strugarek","full_name":"Strugarek, A.","first_name":"A."},{"full_name":"Belkacem, K.","first_name":"K.","last_name":"Belkacem"},{"last_name":"Goupil","full_name":"Goupil, M.-J","first_name":"M.-J"},{"last_name":"Ouazzani","full_name":"Ouazzani, R. M.","first_name":"R. M."},{"first_name":"J.","full_name":"Philidet, J.","last_name":"Philidet"},{"last_name":"Renié","first_name":"C.","full_name":"Renié, C."},{"full_name":"Roth, O.","first_name":"O.","last_name":"Roth"}],"month":"09","_id":"18904","language":[{"iso":"eng"}],"publication":"Astronomy and Astrophysics","article_type":"original","file":[{"file_id":"18905","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2024_AstronomyAstrophysics_Breton.pdf","file_size":6212007,"checksum":"5c871ba7370a507ed6ea9fb2304d8263","success":1,"date_created":"2025-01-27T13:18:41Z","date_updated":"2025-01-27T13:18:41Z"}],"status":"public","scopus_import":"1","title":"Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"Monika Henzinger: This project has received funding from the European Research\r\nCouncil (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.\r\nHarald Räcke, Robin Münk: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389.","has_accepted_license":"1","doi":"10.1145/3637528.3671978","oa":1,"type":"conference","file_date_updated":"2025-01-27T13:25:23Z","conference":{"name":"KDD: Knowledge Discovery and Data Mining","start_date":"2024-08-05","location":"Barcelona, Spain","end_date":"2024-08-29"},"OA_place":"publisher","date_published":"2024-09-01T00:00:00Z","quality_controlled":"1","day":"01","article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"isbn":["9798400704901"]},"publisher":"ACM","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"MoHe"}],"citation":{"short":"K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–1027.","ama":"Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. Expander hierarchies for normalized cuts on graphs. In: <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>. ACM; 2024:1016-1027. doi:<a href=\"https://doi.org/10.1145/3637528.3671978\">10.1145/3637528.3671978</a>","ieee":"K. Hanauer, M. Henzinger, R. Münk, H. Räcke, and M. Vötsch, “Expander hierarchies for normalized cuts on graphs,” in <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, Barcelona, Spain, 2024, pp. 1016–1027.","chicago":"Hanauer, Kathrin, Monika Henzinger, Robin Münk, Harald Räcke, and Maximilian Vötsch. “Expander Hierarchies for Normalized Cuts on Graphs.” In <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, 1016–27. ACM, 2024. <a href=\"https://doi.org/10.1145/3637528.3671978\">https://doi.org/10.1145/3637528.3671978</a>.","apa":"Hanauer, K., Henzinger, M., Münk, R., Räcke, H., &#38; Vötsch, M. (2024). Expander hierarchies for normalized cuts on graphs. In <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i> (pp. 1016–1027). Barcelona, Spain: ACM. <a href=\"https://doi.org/10.1145/3637528.3671978\">https://doi.org/10.1145/3637528.3671978</a>","ista":"Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. 2024. Expander hierarchies for normalized cuts on graphs. Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Knowledge Discovery and Data Mining, 1016–1027.","mla":"Hanauer, Kathrin, et al. “Expander Hierarchies for Normalized Cuts on Graphs.” <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, ACM, 2024, pp. 1016–27, doi:<a href=\"https://doi.org/10.1145/3637528.3671978\">10.1145/3637528.3671978</a>."},"oa_version":"Published Version","external_id":{"isi":["001324524201013"]},"date_created":"2025-01-27T13:20:26Z","year":"2024","isi":1,"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}],"page":"1016-1027","ec_funded":1,"abstract":[{"lang":"eng","text":"Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their inherent intricacies and large hidden factors in their asymptotic running times. Here, we introduce the first practically efficient algorithm for computing expander decompositions and their hierarchies and demonstrate its effectiveness and utility by incorporating it as the core component in a novel solver for the normalized cut graph clustering objective.\r\nOur extensive experiments on a variety of large graphs show that our expander-based algorithm outperforms state-of-the-art solvers for normalized cut with respect to solution quality by a large margin on a variety of graph classes such as citation, e-mail, and social networks or web graphs while remaining competitive in running time."}],"month":"09","author":[{"last_name":"Hanauer","first_name":"Kathrin","full_name":"Hanauer, Kathrin"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Robin","full_name":"Münk, Robin","last_name":"Münk"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"last_name":"Vötsch","first_name":"Maximilian","full_name":"Vötsch, Maximilian"}],"publication_status":"published","date_updated":"2025-09-09T12:04:56Z","ddc":["000"],"OA_type":"hybrid","status":"public","scopus_import":"1","file":[{"file_size":1450331,"checksum":"1265d5cf6aa5f94157631651723c4a2b","success":1,"date_created":"2025-01-27T13:25:23Z","date_updated":"2025-01-27T13:25:23Z","creator":"dernst","file_id":"18907","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"2024_ACMKDD_Hanauer.pdf"}],"title":"Expander hierarchies for normalized cuts on graphs","language":[{"iso":"eng"}],"publication":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","_id":"18906"},{"publication_identifier":{"issn":["2056-3744"]},"article_processing_charge":"Yes","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"NiBa"}],"citation":{"mla":"Le Moan, Alan, et al. “Coupling of Twelve Putative Chromosomal Inversions Maintains a Strong Barrier to Gene Flow between Snail Ecotypes.” <i>Evolution Letters</i>, vol. 8, no. 4, Oxford University Press, 2024, pp. 575–86, doi:<a href=\"https://doi.org/10.1093/evlett/qrae014\">10.1093/evlett/qrae014</a>.","ista":"Le Moan A, Stankowski S, Rafajlović M, Ortega-Martinez O, Faria R, Butlin RK, Johannesson K. 2024. Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution Letters. 8(4), 575–586.","ieee":"A. Le Moan <i>et al.</i>, “Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes,” <i>Evolution Letters</i>, vol. 8, no. 4. Oxford University Press, pp. 575–586, 2024.","chicago":"Le Moan, Alan, Sean Stankowski, Marina Rafajlović, Olga Ortega-Martinez, Rui Faria, Roger K Butlin, and Kerstin Johannesson. “Coupling of Twelve Putative Chromosomal Inversions Maintains a Strong Barrier to Gene Flow between Snail Ecotypes.” <i>Evolution Letters</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/evlett/qrae014\">https://doi.org/10.1093/evlett/qrae014</a>.","apa":"Le Moan, A., Stankowski, S., Rafajlović, M., Ortega-Martinez, O., Faria, R., Butlin, R. K., &#38; Johannesson, K. (2024). Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. <i>Evolution Letters</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/evlett/qrae014\">https://doi.org/10.1093/evlett/qrae014</a>","ama":"Le Moan A, Stankowski S, Rafajlović M, et al. Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. <i>Evolution Letters</i>. 2024;8(4):575-586. doi:<a href=\"https://doi.org/10.1093/evlett/qrae014\">10.1093/evlett/qrae014</a>","short":"A. Le Moan, S. Stankowski, M. Rafajlović, O. Ortega-Martinez, R. Faria, R.K. Butlin, K. Johannesson, Evolution Letters 8 (2024) 575–586."},"publisher":"Oxford University Press","issue":"4","date_published":"2024-04-23T00:00:00Z","OA_place":"publisher","intvolume":"         8","day":"23","quality_controlled":"1","oa":1,"doi":"10.1093/evlett/qrae014","file_date_updated":"2025-01-27T13:33:14Z","pmid":1,"type":"journal_article","has_accepted_license":"1","acknowledgement":"The computations and data handling were enabled by resources provided by the Swedish National Infrastructure for Computing at UPPMAX partially funded by the Swedish Research Council through grant agreement no. 2018-05973. We thank all the member of the Littorina team for the stimulating discussions about the manuscripts, James Reeves for his help the implementation of Hsplit, and Thomas Broquet for his useful comments in the latter stage of manuscript revisions.","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"article_type":"letter_note","title":"Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2024_EvolutionLetter_Moan.pdf","creator":"dernst","file_id":"18909","success":1,"date_created":"2025-01-27T13:33:14Z","date_updated":"2025-01-27T13:33:14Z","file_size":24356661,"checksum":"2f7780b7b6b3489755f1815f476639c6"}],"status":"public","scopus_import":"1","_id":"18908","publication":"Evolution Letters","language":[{"iso":"eng"}],"author":[{"full_name":"Le Moan, Alan","first_name":"Alan","last_name":"Le Moan"},{"id":"43161670-5719-11EA-8025-FABC3DDC885E","last_name":"Stankowski","first_name":"Sean","full_name":"Stankowski, Sean"},{"full_name":"Rafajlović, Marina","first_name":"Marina","last_name":"Rafajlović"},{"full_name":"Ortega-Martinez, Olga","first_name":"Olga","last_name":"Ortega-Martinez"},{"last_name":"Faria","full_name":"Faria, Rui","first_name":"Rui"},{"first_name":"Roger K","full_name":"Butlin, Roger K","last_name":"Butlin"},{"last_name":"Johannesson","full_name":"Johannesson, Kerstin","first_name":"Kerstin"}],"month":"04","ddc":["570"],"OA_type":"gold","date_updated":"2025-09-09T12:05:51Z","publication_status":"published","isi":1,"volume":8,"year":"2024","abstract":[{"text":"Chromosomal rearrangements can lead to the coupling of reproductive barriers, but whether and how they contribute to the completion of speciation remains unclear. Marine snails of the genus Littorina repeatedly form hybrid zones between populations segregating for multiple inversion arrangements, providing opportunities to study their barrier effects. Here, we analyzed 2 adjacent transects across hybrid zones between 2 ecotypes of Littorina fabalis (“large” and “dwarf”) adapted to different wave exposure conditions on a Swedish island. Applying whole-genome sequencing, we found 12 putative inversions on 9 of 17 chromosomes. Nine of the putative inversions reached near differential fixation between the 2 ecotypes, and all were in strong linkage disequilibrium. These inversions cover 20% of the genome and carry 93% of divergent single nucleotide polymorphisms (SNPs). Bimodal hybrid zones in both transects indicated that the 2 ecotypes of Littorina fabalis maintain their genetic and phenotypic integrity following contact. The bimodality reflects the strong coupling between inversion clines and the extension of the barrier effect across the whole genome. Demographic inference suggests that coupling arose during a period of allopatry and has been maintained for &amp;gt; 1,000 generations after secondary contact. Overall, this study shows that the coupling of multiple chromosomal inversions contributes to strong reproductive isolation. Notably, 2 of the putative inversions overlap with inverted genomic regions associated with ecotype differences in a closely related species (Littorina saxatilis), suggesting the same regions, with similar structural variants, repeatedly contribute to ecotype evolution in distinct species.","lang":"eng"}],"page":"575-586","oa_version":"Published Version","date_created":"2025-01-27T13:30:27Z","external_id":{"pmid":["39479507"],"isi":["001206532900001"]}},{"corr_author":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","acknowledgement":"G.H. is the incumbent of the Hilda Pomeraniec Memorial Professorial Chair. He has been partially funded by the European Research Council under the European Union's Horizon 2020 research and innovation program (grant 742637, SMALLOSTERY), by National Science Foundation–US-Israel Binational Science Foundation grant 2021700, and by an Israel Science Foundation Breakthrough grant (1924/22). P.S. acknowledges funding from the Austrian Science Fund (project “AlloSpace,” I05812) and intramural funding from the Institute of Science and Technology Austria.","doi":"10.1146/annurev-biophys-070323-022428","oa":1,"file_date_updated":"2025-01-27T13:44:59Z","pmid":1,"type":"journal_article","intvolume":"        53","OA_place":"publisher","date_published":"2024-07-01T00:00:00Z","quality_controlled":"1","day":"01","article_processing_charge":"No","publication_identifier":{"eissn":["1936-1238"],"issn":["1936-122X"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"P. Schanda, G. Haran, Annual Review of Biophysics 53 (2024) 247–273.","ama":"Schanda P, Haran G. NMR and single-molecule FRET insights into fast protein motions and their relation to function. <i>Annual Review of Biophysics</i>. 2024;53:247-273. doi:<a href=\"https://doi.org/10.1146/annurev-biophys-070323-022428\">10.1146/annurev-biophys-070323-022428</a>","ieee":"P. Schanda and G. Haran, “NMR and single-molecule FRET insights into fast protein motions and their relation to function,” <i>Annual Review of Biophysics</i>, vol. 53. Annual Reviews, pp. 247–273, 2024.","chicago":"Schanda, Paul, and Gilad Haran. “NMR and Single-Molecule FRET Insights into Fast Protein Motions and Their Relation to Function.” <i>Annual Review of Biophysics</i>. Annual Reviews, 2024. <a href=\"https://doi.org/10.1146/annurev-biophys-070323-022428\">https://doi.org/10.1146/annurev-biophys-070323-022428</a>.","apa":"Schanda, P., &#38; Haran, G. (2024). NMR and single-molecule FRET insights into fast protein motions and their relation to function. <i>Annual Review of Biophysics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev-biophys-070323-022428\">https://doi.org/10.1146/annurev-biophys-070323-022428</a>","ista":"Schanda P, Haran G. 2024. NMR and single-molecule FRET insights into fast protein motions and their relation to function. Annual Review of Biophysics. 53, 247–273.","mla":"Schanda, Paul, and Gilad Haran. “NMR and Single-Molecule FRET Insights into Fast Protein Motions and Their Relation to Function.” <i>Annual Review of Biophysics</i>, vol. 53, Annual Reviews, 2024, pp. 247–73, doi:<a href=\"https://doi.org/10.1146/annurev-biophys-070323-022428\">10.1146/annurev-biophys-070323-022428</a>."},"department":[{"_id":"PaSc"}],"publisher":"Annual Reviews","oa_version":"Published Version","date_created":"2025-01-27T13:40:34Z","external_id":{"pmid":["38346243"],"isi":["001278237500012"]},"isi":1,"volume":53,"project":[{"_id":"eb9c82eb-77a9-11ec-83b8-aadd536561cf","name":"AlloSpace. The emergence and mechanisms of allostery","grant_number":"I05812"}],"year":"2024","page":"247-273","abstract":[{"text":"Proteins often undergo large-scale conformational transitions, in which secondary and tertiary structure elements (loops, helices, and domains) change their structures or their positions with respect to each other. Simple considerations suggest that such dynamics should be relatively fast, but the functional cycles of many proteins are often relatively slow. Sophisticated experimental methods are starting to tackle this dichotomy and shed light on the contribution of large-scale conformational dynamics to protein function. In this review, we focus on the contribution of single-molecule Förster resonance energy transfer and nuclear magnetic resonance (NMR) spectroscopies to the study of conformational dynamics. We briefly describe the state of the art in each of these techniques and then point out their similarities and differences, as well as the relative strengths and weaknesses of each. Several case studies, in which the connection between fast conformational dynamics and slower function has been demonstrated, are then introduced and discussed. These examples include both enzymes and large protein machines, some of which have been studied by both NMR and fluorescence spectroscopies.","lang":"eng"}],"author":[{"full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","first_name":"Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"},{"full_name":"Haran, Gilad","first_name":"Gilad","last_name":"Haran"}],"month":"07","date_updated":"2025-09-09T12:06:24Z","publication_status":"published","OA_type":"hybrid","ddc":["570"],"title":"NMR and single-molecule FRET insights into fast protein motions and their relation to function","scopus_import":"1","file":[{"checksum":"c90861542ae3f9147939030d5bafed3c","file_size":3025589,"date_created":"2025-01-27T13:44:59Z","success":1,"date_updated":"2025-01-27T13:44:59Z","file_id":"18911","creator":"dernst","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2024_AnnualReviews_Schanda.pdf"}],"status":"public","article_type":"original","publication":"Annual Review of Biophysics","language":[{"iso":"eng"}],"_id":"18910"},{"oa_version":"None","external_id":{"isi":["001282218200059"]},"date_created":"2025-01-27T13:47:35Z","year":"2024","isi":1,"abstract":[{"text":"This paper presents a computational method for automatically creating fabricable 3D wire sculptures from various input modalities, including 3D models, images, and even text. There are several challenges to wire art creation. For example, artists must express the desired visual as a sparse wire representation. It is also difficult to manually bend wires in the air without guidance to fabricate the designed 3D curves. Our workflow solves these challenges by using two core techniques. First, we present an algorithm that automatically generates a fabricable 3D curve representation of the target based on a loss function that measures the semantic distance between the rendered curve and the target. The loss function can be defined using different pre-trained vision-language neural networks to generate wire art from different input types. The loss function is then optimized using differentiable rendering specifically targeting 3D parametric curves. Our method can incorporate various fabrication constraints on the wire as additional regularization terms in the optimization process. Second, we present an algorithm to generate a 3D printable jig structure that can be used to fabricate the generated wire path. The major challenge in the jig generation stems from the design of an intersection-free surface mesh for 3D printing, which we address with our inflation algorithm. The experimental results indicate that our method can handle a wider range of input types and can produce physically fabricable wire shapes compared to previous wire generation methods. Various wire arts have been fabricated using our 3D-printed jig to demonstrate its effectiveness in 3D wire bending.","lang":"eng"}],"month":"07","author":[{"full_name":"Tojo, Kenji","first_name":"Kenji","last_name":"Tojo"},{"last_name":"Shamir","full_name":"Shamir, Ariel","first_name":"Ariel"},{"orcid":"0000-0001-6511-9385","first_name":"Bernd","full_name":"Bickel, Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nobuyuki","full_name":"Umetani, Nobuyuki","last_name":"Umetani"}],"OA_type":"closed access","publication_status":"published","date_updated":"2025-09-09T12:06:57Z","status":"public","scopus_import":"1","title":"Fabricable 3D wire art","_id":"18912","language":[{"iso":"eng"}],"publication":"SIGGRAPH '24: ACM SIGGRAPH 2024 Conference Papers","corr_author":"1","acknowledgement":"The authors thank the anonymous reviewers for their valuable comments and suggestions for improving the paper. This work was supported by JSPS KAKENHI Grant Numbers JP21K11910, 23KJ0699 and JST AdCORP, Grant Number JPMJKB2302, Japan. This work was partially supported by Israel Science Foundation Grant number 1390/19 and Joint NSFC-ISF Research Grant no. 3077/23. We thank Riku Toyota for his useful advice on wire selection and Takeo Igarashi for his assistance in arranging the collaboration of the authors.","article_number":"134","doi":"10.1145/3641519.3657453","conference":{"end_date":"2024-08-01","location":"Denver, CO, United States","start_date":"2024-07-28","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference"},"type":"conference","date_published":"2024-07-01T00:00:00Z","day":"01","quality_controlled":"1","publication_identifier":{"isbn":["9798400705250"]},"article_processing_charge":"No","publisher":"ACM","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"BeBi"}],"citation":{"ama":"Tojo K, Shamir A, Bickel B, Umetani N. Fabricable 3D wire art. In: <i>SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers</i>. ACM; 2024. doi:<a href=\"https://doi.org/10.1145/3641519.3657453\">10.1145/3641519.3657453</a>","short":"K. Tojo, A. Shamir, B. Bickel, N. Umetani, in:, SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers, ACM, 2024.","mla":"Tojo, Kenji, et al. “Fabricable 3D Wire Art.” <i>SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers</i>, 134, ACM, 2024, doi:<a href=\"https://doi.org/10.1145/3641519.3657453\">10.1145/3641519.3657453</a>.","chicago":"Tojo, Kenji, Ariel Shamir, Bernd Bickel, and Nobuyuki Umetani. “Fabricable 3D Wire Art.” In <i>SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers</i>. ACM, 2024. <a href=\"https://doi.org/10.1145/3641519.3657453\">https://doi.org/10.1145/3641519.3657453</a>.","apa":"Tojo, K., Shamir, A., Bickel, B., &#38; Umetani, N. (2024). Fabricable 3D wire art. In <i>SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers</i>. Denver, CO, United States: ACM. <a href=\"https://doi.org/10.1145/3641519.3657453\">https://doi.org/10.1145/3641519.3657453</a>","ieee":"K. Tojo, A. Shamir, B. Bickel, and N. Umetani, “Fabricable 3D wire art,” in <i>SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers</i>, Denver, CO, United States, 2024.","ista":"Tojo K, Shamir A, Bickel B, Umetani N. 2024. Fabricable 3D wire art. SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers. SIGGRAPH: Computer Graphics and Interactive Techniques Conference, 134."}},{"author":[{"full_name":"Giuliari, Giacomo","first_name":"Giacomo","last_name":"Giuliari"},{"full_name":"Sonnino, Alberto","first_name":"Alberto","last_name":"Sonnino"},{"full_name":"Frei, Marc","first_name":"Marc","last_name":"Frei"},{"last_name":"Streun","full_name":"Streun, Fabio","first_name":"Fabio"},{"full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"first_name":"Adrian","full_name":"Perrig, Adrian","last_name":"Perrig"}],"month":"07","date_updated":"2025-09-09T12:07:28Z","publication_status":"published","OA_type":"hybrid","ddc":["000"],"title":"An empirical study of consensus protocols’ DoS resilience","scopus_import":"1","file":[{"file_name":"2024_ACMAsiaCCS_Giuliari.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"18914","date_updated":"2025-01-27T14:04:12Z","success":1,"date_created":"2025-01-27T14:04:12Z","checksum":"1e743ddf49d35390eb56e11eb0759150","file_size":951940}],"status":"public","language":[{"iso":"eng"}],"publication":"Proceedings of the 19th ACM Asia Conference on Computer and Communications Security","_id":"18913","oa_version":"Published Version","date_created":"2025-01-27T13:57:00Z","external_id":{"isi":["001283918100095"]},"isi":1,"year":"2024","page":"1345-1360","abstract":[{"lang":"eng","text":"With the proliferation of blockchain technology in high-value sectors, consensus protocols are becoming critical infrastructures. The rapid innovation cycle in Byzantine fault tolerant (BFT) consensus protocols has culminated in HotStuff, which provides linear message complexity in the partially synchronous setting. To achieve this, HotStuff leverages a leader that collects, aggregates, and broadcasts the messages of other validators. This paper analyzes the security implications of such approaches in practice, from the perspective of liveness and availability.\r\nBy implementing attacks in a globally-distributed testbed, we show that state-of-the-art leader-based protocols are vulnerable to denial-of-service (DoS) attacks on the leader. Our attacks, demonstrated on committees of up to 64 validators, manage to disrupt liveness within seconds, using only a few tens of Mbps of attack bandwidth per validator. Crucially, the cost and effectiveness of the attacks are independent of the committee size. Based on the outcome of these experiments, we then propose and test effective mitigations. Our findings show that advancements in both protocol design and network-layer defenses can greatly improve the practical resilience of BFT consensus protocols."}],"OA_place":"publisher","date_published":"2024-07-01T00:00:00Z","quality_controlled":"1","day":"01","article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"isbn":["9798400704826"]},"citation":{"ista":"Giuliari G, Sonnino A, Frei M, Streun F, Kokoris Kogias E, Perrig A. 2024. An empirical study of consensus protocols’ DoS resilience. Proceedings of the 19th ACM Asia Conference on Computer and Communications Security. ASIACCS: Asia Conference on Computer and Communications Security, 1345–1360.","chicago":"Giuliari, Giacomo, Alberto Sonnino, Marc Frei, Fabio Streun, Eleftherios Kokoris Kogias, and Adrian Perrig. “An Empirical Study of Consensus Protocols’ DoS Resilience.” In <i>Proceedings of the 19th ACM Asia Conference on Computer and Communications Security</i>, 1345–60. ACM, 2024. <a href=\"https://doi.org/10.1145/3634737.3656997\">https://doi.org/10.1145/3634737.3656997</a>.","apa":"Giuliari, G., Sonnino, A., Frei, M., Streun, F., Kokoris Kogias, E., &#38; Perrig, A. (2024). An empirical study of consensus protocols’ DoS resilience. In <i>Proceedings of the 19th ACM Asia Conference on Computer and Communications Security</i> (pp. 1345–1360). Singapore, Singapore: ACM. <a href=\"https://doi.org/10.1145/3634737.3656997\">https://doi.org/10.1145/3634737.3656997</a>","ieee":"G. Giuliari, A. Sonnino, M. Frei, F. Streun, E. Kokoris Kogias, and A. Perrig, “An empirical study of consensus protocols’ DoS resilience,” in <i>Proceedings of the 19th ACM Asia Conference on Computer and Communications Security</i>, Singapore, Singapore, 2024, pp. 1345–1360.","mla":"Giuliari, Giacomo, et al. “An Empirical Study of Consensus Protocols’ DoS Resilience.” <i>Proceedings of the 19th ACM Asia Conference on Computer and Communications Security</i>, ACM, 2024, pp. 1345–60, doi:<a href=\"https://doi.org/10.1145/3634737.3656997\">10.1145/3634737.3656997</a>.","short":"G. Giuliari, A. Sonnino, M. Frei, F. Streun, E. Kokoris Kogias, A. Perrig, in:, Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, ACM, 2024, pp. 1345–1360.","ama":"Giuliari G, Sonnino A, Frei M, Streun F, Kokoris Kogias E, Perrig A. An empirical study of consensus protocols’ DoS resilience. In: <i>Proceedings of the 19th ACM Asia Conference on Computer and Communications Security</i>. ACM; 2024:1345-1360. doi:<a href=\"https://doi.org/10.1145/3634737.3656997\">10.1145/3634737.3656997</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ElKo"}],"publisher":"ACM","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","acknowledgement":"This work was mostly realized while Alberto Sonnino and Lefteris Kokoris-Kogias were employed at Meta. We gratefully acknowledge support for this project from ETH Zurich and Mysten Labs.","doi":"10.1145/3634737.3656997","oa":1,"file_date_updated":"2025-01-27T14:04:12Z","type":"conference","conference":{"location":"Singapore, Singapore","end_date":"2024-07-05","name":"ASIACCS: Asia Conference on Computer and Communications Security","start_date":"2024-07-01"}},{"file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2024_LIPICs_Aronov.pdf","file_id":"18918","creator":"dernst","success":1,"date_created":"2025-01-27T14:17:37Z","date_updated":"2025-01-27T14:17:37Z","file_size":880725,"checksum":"443aa29ea5d948e917cfccd681dcf176"}],"scopus_import":"1","status":"public","title":"Eight-partitioning points in 3D, and efficiently too","publication":"40th International Symposium on Computational Geometry","language":[{"iso":"eng"}],"_id":"18917","author":[{"first_name":"Boris","full_name":"Aronov, Boris","last_name":"Aronov"},{"first_name":"Abdul","full_name":"Basit, Abdul","last_name":"Basit"},{"last_name":"Ramesh","full_name":"Ramesh, Indu","first_name":"Indu"},{"first_name":"Gianluca","full_name":"Tasinato, Gianluca","id":"0433290C-AF8F-11E9-A4C7-F729E6697425","last_name":"Tasinato"},{"full_name":"Wagner, Uli","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"month":"06","publication_status":"published","date_updated":"2026-02-16T12:19:08Z","ddc":["510"],"OA_type":"gold","year":"2024","volume":293,"page":"8:1-8:15","abstract":[{"lang":"eng","text":"An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in ℝ³ consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits an eight-partition; moreover, one can prescribe the normal direction of one of the three planes. The analogous result for finite point sets follows by a standard limit argument.\r\nWe prove the following variant of this result: Any mass distribution (or point set) in ℝ³ admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction.\r\nMoreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2})."}],"oa_version":"Published Version","date_created":"2025-01-27T14:19:17Z","related_material":{"record":[{"relation":"later_version","id":"19860","status":"public"}]},"external_id":{"arxiv":["2403.02627"]},"article_processing_charge":"Yes","publication_identifier":{"isbn":["9783959773164"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.","chicago":"Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In <i>40th International Symposium on Computational Geometry</i>, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>.","apa":"Aronov, B., Basit, A., Ramesh, I., Tasinato, G., &#38; Wagner, U. (2024). Eight-partitioning points in 3D, and efficiently too. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293, p. 8:1-8:15). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>","ieee":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.","mla":"Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>.","short":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15.","ama":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>"},"department":[{"_id":"UlWa"},{"_id":"GradSch"}],"intvolume":"       293","OA_place":"publisher","date_published":"2024-06-06T00:00:00Z","quality_controlled":"1","day":"06","arxiv":1,"doi":"10.4230/LIPIcs.SoCG.2024.8","oa":1,"type":"conference","file_date_updated":"2025-01-27T14:17:37Z","conference":{"start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry","end_date":"2024-06-14","location":"Athens, Greece"},"corr_author":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"Aronov, Boris: Work has been supported by NSF grants CCF 15-40656 and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation. Part of this research was conducted while BA was visiting ISTA in the summers of 2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an ISTA Visiting Professorship.\r\nBasit, Abdul: Work has been supported by Australian Research Council grant DP220102212.\r\nRamesh, Indu: Work supported by a Tandon School of Engineering Fellowship and by NSF Grant CCF-20-08551.\r\nBA and AB would like to thank William Steiger for insightful initial discussions of the problems addressed in this work.","has_accepted_license":"1"},{"issue":"5","publisher":"Springer Nature","citation":{"mla":"Baykusheva, Denitsa Rangelova. “Through the Slopes of a Light-Induced Phase Transition.” <i>Nature Physics</i>, vol. 20, no. 5, Springer Nature, 2024, pp. 684–85, doi:<a href=\"https://doi.org/10.1038/s41567-024-02401-7\">10.1038/s41567-024-02401-7</a>.","apa":"Baykusheva, D. R. (2024). Through the slopes of a light-induced phase transition. <i>Nature Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41567-024-02401-7\">https://doi.org/10.1038/s41567-024-02401-7</a>","chicago":"Baykusheva, Denitsa Rangelova. “Through the Slopes of a Light-Induced Phase Transition.” <i>Nature Physics</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41567-024-02401-7\">https://doi.org/10.1038/s41567-024-02401-7</a>.","ieee":"D. R. Baykusheva, “Through the slopes of a light-induced phase transition,” <i>Nature Physics</i>, vol. 20, no. 5. Springer Nature, pp. 684–685, 2024.","ista":"Baykusheva DR. 2024. Through the slopes of a light-induced phase transition. Nature Physics. 20(5), 684–685.","ama":"Baykusheva DR. Through the slopes of a light-induced phase transition. <i>Nature Physics</i>. 2024;20(5):684-685. doi:<a href=\"https://doi.org/10.1038/s41567-024-02401-7\">10.1038/s41567-024-02401-7</a>","short":"D.R. Baykusheva, Nature Physics 20 (2024) 684–685."},"department":[{"_id":"DeBa"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["1745-2473"],"eissn":["1745-2481"]},"article_processing_charge":"No","day":"01","quality_controlled":"1","date_published":"2024-05-01T00:00:00Z","intvolume":"        20","type":"journal_article","doi":"10.1038/s41567-024-02401-7","corr_author":"1","_id":"18919","language":[{"iso":"eng"}],"publication":"Nature Physics","article_type":"letter_note","scopus_import":"1","status":"public","title":"Through the slopes of a light-induced phase transition","OA_type":"closed access","publication_status":"published","date_updated":"2025-09-09T12:08:10Z","author":[{"id":"71b4d059-2a03-11ee-914d-dfa3beed6530","last_name":"Baykusheva","full_name":"Baykusheva, Denitsa Rangelova","first_name":"Denitsa Rangelova"}],"month":"05","abstract":[{"text":"The integration of theory and experiment makes possible tracking the slow evolution of a photodoped Mott insulator to a distinct non-equilibrium metallic phase under the influence of electron-lattice coupling.","lang":"eng"}],"page":"684-685","year":"2024","volume":20,"isi":1,"date_created":"2025-01-27T14:29:20Z","external_id":{"isi":["001162208200002"]},"oa_version":"None"},{"oa_version":"None","external_id":{"isi":["001419526400005"]},"date_created":"2025-01-27T14:50:23Z","year":"2024","isi":1,"abstract":[{"lang":"eng","text":"Let G be a directed graph with m edges and n vertices. We present a deterministic linear-time algorithm for computing the 3-edge-connected components of G. This is a significant improvement over the previous best bound by Georgiadis et al. [SODA 2023], which is Õ(m√{m}) and randomized. Our result is based on a novel characterization of 2-edge cuts in directed graphs and on a new technique that exploits the concept of divergent spanning trees and 2-connectivity-light graphs, and requires a careful modification of the minset-poset technique of Gabow [TALG 2016]. As a side result, our new technique yields also an oracle for providing in constant time a minimum edge-cut for any two vertices that are not 3-edge-connected. The oracle uses space O(n) and can be built in O(mlog n) time: given two query vertices, it determines in constant time whether they are 3-edge-connected, or provides a k-edge cut, with k≤ 2, that separates them."}],"page":"62-85","author":[{"full_name":"Georgiadis, Loukas","first_name":"Loukas","last_name":"Georgiadis"},{"last_name":"Italiano","full_name":"Italiano, Giuseppe F.","first_name":"Giuseppe F."},{"last_name":"Kosinas","id":"4c7f9625-dbbc-11ee-9d86-bdcc2db5a949","first_name":"Evangelos","full_name":"Kosinas, Evangelos"}],"month":"10","OA_type":"closed access","publication_status":"published","date_updated":"2025-09-09T12:08:47Z","scopus_import":"1","status":"public","title":"Computing the 3-edge-connected components of directed graphs in linear time","_id":"18922","language":[{"iso":"eng"}],"publication":"65th Annual Symposium on Foundations of Computer Science","corr_author":"1","acknowledgement":"Giuseppe F. Italiano was partially supported by the Italian Ministry of\r\nUniversity and Reseach under PRIN Project n. 2022TS4Y3N - EXPAND: scalable algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data.\r\n","doi":"10.1109/focs61266.2024.00015","conference":{"start_date":"2024-10-27","name":"FOCS: Foundations of Computer Science","end_date":"2024-10-30","location":"Chicago, IL, United States"},"type":"conference","date_published":"2024-10-01T00:00:00Z","day":"01","quality_controlled":"1","publication_identifier":{"isbn":["9798331516741"]},"article_processing_charge":"No","publisher":"IEEE","department":[{"_id":"MoHe"}],"citation":{"ieee":"L. Georgiadis, G. F. Italiano, and E. Kosinas, “Computing the 3-edge-connected components of directed graphs in linear time,” in <i>65th Annual Symposium on Foundations of Computer Science</i>, Chicago, IL, United States, 2024, pp. 62–85.","apa":"Georgiadis, L., Italiano, G. F., &#38; Kosinas, E. (2024). Computing the 3-edge-connected components of directed graphs in linear time. In <i>65th Annual Symposium on Foundations of Computer Science</i> (pp. 62–85). Chicago, IL, United States: IEEE. <a href=\"https://doi.org/10.1109/focs61266.2024.00015\">https://doi.org/10.1109/focs61266.2024.00015</a>","chicago":"Georgiadis, Loukas, Giuseppe F. Italiano, and Evangelos Kosinas. “Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.” In <i>65th Annual Symposium on Foundations of Computer Science</i>, 62–85. IEEE, 2024. <a href=\"https://doi.org/10.1109/focs61266.2024.00015\">https://doi.org/10.1109/focs61266.2024.00015</a>.","ista":"Georgiadis L, Italiano GF, Kosinas E. 2024. Computing the 3-edge-connected components of directed graphs in linear time. 65th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 62–85.","mla":"Georgiadis, Loukas, et al. “Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.” <i>65th Annual Symposium on Foundations of Computer Science</i>, IEEE, 2024, pp. 62–85, doi:<a href=\"https://doi.org/10.1109/focs61266.2024.00015\">10.1109/focs61266.2024.00015</a>.","short":"L. Georgiadis, G.F. Italiano, E. Kosinas, in:, 65th Annual Symposium on Foundations of Computer Science, IEEE, 2024, pp. 62–85.","ama":"Georgiadis L, Italiano GF, Kosinas E. Computing the 3-edge-connected components of directed graphs in linear time. In: <i>65th Annual Symposium on Foundations of Computer Science</i>. IEEE; 2024:62-85. doi:<a href=\"https://doi.org/10.1109/focs61266.2024.00015\">10.1109/focs61266.2024.00015</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"}]