[{"article_processing_charge":"No","date_updated":"2025-12-01T12:36:52Z","publication":"36th International Conference on Concurrency Theory","type":"conference","ddc":["000"],"scopus_import":"1","ec_funded":1,"file_date_updated":"2025-09-03T10:01:53Z","publication_status":"published","doi":"10.4230/LIPIcs.CONCUR.2025.21","volume":348,"title":"Quantitative language automata","year":"2025","alternative_title":["LIPIcs"],"OA_type":"gold","conference":{"end_date":"2025-08-29","location":"Aarhus, Denmark","name":"CONCUR: Conference on Concurrency Theory","start_date":"2025-08-26"},"day":"18","oa":1,"corr_author":"1","abstract":[{"text":"A quantitative word automaton (QWA) defines a function from infinite words to values. For example, every infinite run of a limit-average QWA 𝒜 obtains a mean payoff, and every word w ∈ ÎŁ^ω is assigned the maximal mean payoff obtained by nondeterministic runs of 𝒜 over w. We introduce quantitative language automata (QLAs) that define functions from language generators (i.e., implementations) to values, where a language generator can be nonprobabilistic, defining a set of infinite words, or probabilistic, defining a probability measure over infinite words. A QLA consists of a QWA and an aggregator function. For example, given a QWA 𝒜, the infimum aggregator maps each language L ⊆ ÎŁ^ω to the greatest lower bound assigned by 𝒜 to any word in L. For boolean value sets, QWAs define boolean properties of traces, and QLAs define boolean properties of sets of traces, i.e., hyperproperties. For more general value sets, QLAs serve as a specification language for a generalization of hyperproperties, called quantitative hyperproperties. A nonprobabilistic (resp. probabilistic) quantitative hyperproperty assigns a value to each set (resp. distribution) G of traces, e.g., the minimal (resp. expected) average response time exhibited by the traces in G. We give several examples of quantitative hyperproperties and investigate three paradigmatic problems for QLAs: evaluation, nonemptiness, and universality. In the evaluation problem, given a QLA 𝔾 and an implementation G, we ask for the value that 𝔾 assigns to G. In the nonemptiness (resp. universality) problem, given a QLA 𝔾 and a value k, we ask whether 𝔾 assigns at least k to some (resp. every) language. We provide a comprehensive picture of decidability for these problems for QLAs with common aggregators as well as their restrictions to ω-regular languages and trace distributions generated by finite-state Markov chains.","lang":"eng"}],"article_number":"21","language":[{"iso":"eng"}],"citation":{"chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Language Automata.” In 36th International Conference on Concurrency Theory, Vol. 348. Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025. https://doi.org/10.4230/LIPIcs.CONCUR.2025.21.","mla":"Henzinger, Thomas A., et al. “Quantitative Language Automata.” 36th International Conference on Concurrency Theory, vol. 348, 21, Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025, doi:10.4230/LIPIcs.CONCUR.2025.21.","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 36th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025.","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2025. Quantitative language automata. 36th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 348, 21.","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Quantitative language automata,” in 36th International Conference on Concurrency Theory, Aarhus, Denmark, 2025, vol. 348.","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Quantitative language automata. In: 36th International Conference on Concurrency Theory. Vol 348. Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik; 2025. doi:10.4230/LIPIcs.CONCUR.2025.21","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2025). Quantitative language automata. In 36th International Conference on Concurrency Theory (Vol. 348). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2025.21"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik","department":[{"_id":"ToHe"}],"date_created":"2025-08-31T22:01:32Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","month":"08","date_published":"2025-08-18T00:00:00Z","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}],"quality_controlled":"1","intvolume":" 348","publication_identifier":{"isbn":["9783959773898"],"issn":["1868-8969"]},"_id":"20253","author":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kebis","first_name":"Pavol","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","full_name":"Kebis, Pavol"},{"first_name":"Nicolas Adrien","last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E","last_name":"Sarac","first_name":"Naci E"}],"external_id":{"isi":["001570540800021"],"arxiv":["2506.0515"]},"arxiv":1,"OA_place":"publisher","isi":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.","has_accepted_license":"1","file":[{"date_updated":"2025-09-03T10:01:53Z","file_id":"20282","creator":"dernst","content_type":"application/pdf","date_created":"2025-09-03T10:01:53Z","access_level":"open_access","relation":"main_file","file_name":"2025_CONCUR_HenzingerT.pdf","file_size":1257397,"success":1,"checksum":"9d4054058757a73477e6015b10ed6996"}]},{"month":"08","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_created":"2025-08-31T22:01:32Z","department":[{"_id":"KrCh"}],"citation":{"short":"D.A. Brewster, J. Svoboda, D. Roscow, K. Chatterjee, J. Tkadlec, M.A. Nowak, PNAS Nexus 4 (2025).","mla":"Brewster, David A., et al. “Maintaining Diversity in Structured Populations.” PNAS Nexus, vol. 4, no. 8, pgaf252, Oxford University Press, 2025, doi:10.1093/pnasnexus/pgaf252.","ista":"Brewster DA, Svoboda J, Roscow D, Chatterjee K, Tkadlec J, Nowak MA. 2025. Maintaining diversity in structured populations. PNAS Nexus. 4(8), pgaf252.","chicago":"Brewster, David A., Jakub Svoboda, Dylan Roscow, Krishnendu Chatterjee, Josef Tkadlec, and Martin A. Nowak. “Maintaining Diversity in Structured Populations.” PNAS Nexus. Oxford University Press, 2025. https://doi.org/10.1093/pnasnexus/pgaf252.","apa":"Brewster, D. A., Svoboda, J., Roscow, D., Chatterjee, K., Tkadlec, J., & Nowak, M. A. (2025). Maintaining diversity in structured populations. PNAS Nexus. Oxford University Press. https://doi.org/10.1093/pnasnexus/pgaf252","ieee":"D. A. Brewster, J. Svoboda, D. Roscow, K. Chatterjee, J. Tkadlec, and M. A. Nowak, “Maintaining diversity in structured populations,” PNAS Nexus, vol. 4, no. 8. Oxford University Press, 2025.","ama":"Brewster DA, Svoboda J, Roscow D, Chatterjee K, Tkadlec J, Nowak MA. Maintaining diversity in structured populations. PNAS Nexus. 2025;4(8). doi:10.1093/pnasnexus/pgaf252"},"publisher":"Oxford University Press","_id":"20254","publication_identifier":{"eissn":["2752-6542"]},"intvolume":" 4","issue":"8","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"quality_controlled":"1","date_published":"2025-08-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_place":"publisher","external_id":{"arxiv":["2503.09841"]},"DOAJ_listed":"1","arxiv":1,"author":[{"full_name":"Brewster, David A.","first_name":"David A.","last_name":"Brewster"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub"},{"full_name":"Roscow, Dylan","first_name":"Dylan","last_name":"Roscow"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"full_name":"Nowak, Martin A.","last_name":"Nowak","first_name":"Martin A."}],"file":[{"file_id":"20280","date_updated":"2025-09-03T06:20:08Z","content_type":"application/pdf","creator":"dernst","relation":"main_file","access_level":"open_access","date_created":"2025-09-03T06:20:08Z","checksum":"8a5e82c6f842e3220ec96028c9374b69","file_size":1086419,"success":1,"file_name":"2025_PNASNexus_Brewster.pdf"}],"acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12. J.T. was supported by GAČR grant 25-17377S and by Charles Univ. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012.","has_accepted_license":"1","article_processing_charge":"Yes","article_type":"original","scopus_import":"1","ddc":["000"],"publication":"PNAS Nexus","type":"journal_article","date_updated":"2026-02-16T12:23:19Z","PlanS_conform":"1","doi":"10.1093/pnasnexus/pgaf252","publication_status":"published","file_date_updated":"2025-09-03T06:20:08Z","ec_funded":1,"article_number":"pgaf252","language":[{"iso":"eng"}],"abstract":[{"text":"We examine population structures for their ability to maintain diversity in neutral evolution. We use the general framework of evolutionary graph theory and consider birth–death (bd) and death–birth (db) updating. The population is of size N. Initially all individuals represent different types. The basic question is: what is the time TN until one type takes over the population? This time is known as consensus time in computer science and as total coalescent time in evolutionary biology. For the complete graph, it is known that TN is quadratic in N for db and bd. For the cycle, we prove that TN is cubic in N for db and bd. For the star, we prove that TN is cubic for bd and quasilinear (N log N) for db. For the double star, we show that TN is quartic for bd. We derive upper and lower bounds for all undirected graphs for bd and db. We also show the Pareto front of graphs (of size N = 8) that maintain diversity the longest for bd and db. Further, we show that some graphs that quickly homogenize can maintain high levels of diversity longer than graphs that slowly homogenize. For directed graphs, we give simple contracting star-like structures that have superexponential time scales for maintaining diversity.","lang":"eng"}],"oa":1,"OA_type":"gold","day":"01","year":"2025","title":"Maintaining diversity in structured populations","volume":4},{"abstract":[{"text":"With stunning clarity, the JWST has revealed the Universe’s first billion years. The scientific community is analysing a wealth of JWST imaging and spectroscopic data from that era, and is in the process of rewriting the astronomy textbooks. Here, as a result of the 2024 ISSI Breakthrough Workshop, we provide a snapshot of the great progress made towards understanding the initial chapters of our cosmic history 1.5 years into the JWST science mission. We present the current census of early galaxies, their luminosities, appearance, chemical composition, masses and formation histories as revealed by JWST. We relate the discovery of massive black holes in early galaxies and discuss their demographics and implications for their formations and growth. We conclude by describing the potential sources of reionization and our current understanding of how the Universe became fully ionized. Throughout the Perspective, we highlight discoveries and breakthroughs, topics and issues that are not yet understood, and questions that will be addressed in the coming years, as JWST continues its revolutionary observations of the early Universe.","lang":"eng"}],"language":[{"iso":"eng"}],"title":"The first billion years according to JWST","volume":9,"year":"2025","OA_type":"green","day":"01","oa":1,"publication_status":"published","doi":"10.1038/s41550-025-02624-5","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.21054","open_access":"1"}],"scopus_import":"1","date_updated":"2025-09-30T14:28:42Z","type":"journal_article","publication":"Nature Astronomy","article_type":"original","article_processing_charge":"No","acknowledgement":"While this Perspective is written by a small number of authors, invited to ISSI Bern in March 2024 as part of the 2024 ISSI Breakthrough Workshop, we acknowledge the work of a large community that is advancing our collective understanding of the evolution of the early Universe. We thank ISSI for sponsoring the 2024 Breakthrough Workshop, and the ISSI staff for their wonderful welcome and support. We are grateful to the author collaborators, who made this paper possible. Collectively, we are grateful to the large group of committed scientists and engineers, worldwide, who designed, built and commissioned the JWST and made a decades-long astronomer dream a reality. R.P.N. is a NASA Hubble Fellow. We are grateful to M. Dickinson for a careful read of the final paper and to F. Crameri (ISSI) for his expert help designing the very best figures. We dedicate this paper to the 20,000 people who spent decades to make JWST an incredible discovery machine.","oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Adamo, Angela","last_name":"Adamo","first_name":"Angela"},{"first_name":"Hakim","last_name":"Atek","full_name":"Atek, Hakim"},{"full_name":"Bagley, Micaela B.","first_name":"Micaela B.","last_name":"Bagley"},{"last_name":"Bañados","first_name":"Eduardo","full_name":"Bañados, Eduardo"},{"full_name":"Barrow, Kirk S.S.","first_name":"Kirk S.S.","last_name":"Barrow"},{"first_name":"Danielle A.","last_name":"Berg","full_name":"Berg, Danielle A."},{"last_name":"Bezanson","first_name":"Rachel","full_name":"Bezanson, Rachel"},{"full_name":"Bradač, MaruĆĄa","last_name":"Bradač","first_name":"MaruĆĄa"},{"last_name":"Brammer","first_name":"Gabriel","full_name":"Brammer, Gabriel"},{"full_name":"Carnall, Adam C.","last_name":"Carnall","first_name":"Adam C."},{"last_name":"Chisholm","first_name":"John","full_name":"Chisholm, John"},{"full_name":"Coe, Dan","first_name":"Dan","last_name":"Coe"},{"first_name":"Pratika","last_name":"Dayal","full_name":"Dayal, Pratika"},{"last_name":"Eisenstein","first_name":"Daniel J.","full_name":"Eisenstein, Daniel J."},{"first_name":"Jan J.","last_name":"Eldridge","full_name":"Eldridge, Jan J."},{"full_name":"Ferrara, Andrea","last_name":"Ferrara","first_name":"Andrea"},{"first_name":"Seiji","last_name":"Fujimoto","full_name":"Fujimoto, Seiji"},{"last_name":"Graaff","first_name":"Anna De","full_name":"Graaff, Anna De"},{"first_name":"Melanie","last_name":"Habouzit","full_name":"Habouzit, Melanie"},{"full_name":"Hutchison, Taylor A.","first_name":"Taylor A.","last_name":"Hutchison"},{"full_name":"Kartaltepe, Jeyhan S.","first_name":"Jeyhan S.","last_name":"Kartaltepe"},{"full_name":"Kassin, Susan A.","last_name":"Kassin","first_name":"Susan A."},{"full_name":"Kriek, Mariska","first_name":"Mariska","last_name":"Kriek"},{"last_name":"LabbĂ©","first_name":"Ivo","full_name":"LabbĂ©, Ivo"},{"full_name":"Maiolino, Roberto","last_name":"Maiolino","first_name":"Roberto"},{"last_name":"Marques-Chaves","first_name":"Rui","full_name":"Marques-Chaves, Rui"},{"last_name":"Maseda","first_name":"Michael V.","full_name":"Maseda, Michael V."},{"first_name":"Charlotte","last_name":"Mason","full_name":"Mason, Charlotte"},{"last_name":"Matthee","first_name":"Jorryt J","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"full_name":"Mcquinn, Kristen B.W.","first_name":"Kristen B.W.","last_name":"Mcquinn"},{"first_name":"Georges","last_name":"Meynet","full_name":"Meynet, Georges"},{"full_name":"Naidu, Rohan P.","last_name":"Naidu","first_name":"Rohan P."},{"full_name":"Oesch, Pascal A.","last_name":"Oesch","first_name":"Pascal A."},{"first_name":"Laura","last_name":"Pentericci","full_name":"Pentericci, Laura"},{"full_name":"PĂ©rez-GonzĂĄlez, Pablo G.","last_name":"PĂ©rez-GonzĂĄlez","first_name":"Pablo G."},{"full_name":"Rigby, Jane R.","first_name":"Jane R.","last_name":"Rigby"},{"full_name":"Roberts-Borsani, Guido","last_name":"Roberts-Borsani","first_name":"Guido"},{"first_name":"Daniel","last_name":"Schaerer","full_name":"Schaerer, Daniel"},{"full_name":"Shapley, Alice E.","last_name":"Shapley","first_name":"Alice E."},{"first_name":"Daniel P.","last_name":"Stark","full_name":"Stark, Daniel P."},{"last_name":"Stiavelli","first_name":"Massimo","full_name":"Stiavelli, Massimo"},{"last_name":"Strom","first_name":"Allison L.","full_name":"Strom, Allison L."},{"full_name":"Vanzella, Eros","last_name":"Vanzella","first_name":"Eros"},{"first_name":"Feige","last_name":"Wang","full_name":"Wang, Feige"},{"full_name":"Wilkins, Stephen M.","first_name":"Stephen M.","last_name":"Wilkins"},{"last_name":"Williams","first_name":"Christina C.","full_name":"Williams, Christina C."},{"full_name":"Willott, Chris J.","last_name":"Willott","first_name":"Chris J."},{"full_name":"Wylezalek, Dominika","first_name":"Dominika","last_name":"Wylezalek"},{"first_name":"Antonella","last_name":"Nota","full_name":"Nota, Antonella"}],"arxiv":1,"external_id":{"isi":["001547681400001"],"arxiv":["2405.21054"]},"OA_place":"repository","isi":1,"issue":"8","intvolume":" 9","publication_identifier":{"eissn":["2397-3366"]},"_id":"20255","date_published":"2025-08-01T00:00:00Z","quality_controlled":"1","page":"1134-1147","status":"public","month":"08","publisher":"Springer Nature","citation":{"ieee":"A. Adamo et al., “The first billion years according to JWST,” Nature Astronomy, vol. 9, no. 8. Springer Nature, pp. 1134–1147, 2025.","ama":"Adamo A, Atek H, Bagley MB, et al. The first billion years according to JWST. Nature Astronomy. 2025;9(8):1134-1147. doi:10.1038/s41550-025-02624-5","apa":"Adamo, A., Atek, H., Bagley, M. B., Bañados, E., Barrow, K. S. S., Berg, D. A., 
 Nota, A. (2025). The first billion years according to JWST. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-025-02624-5","ista":"Adamo A, Atek H, Bagley MB, Bañados E, Barrow KSS, Berg DA, Bezanson R, Bradač M, Brammer G, Carnall AC, Chisholm J, Coe D, Dayal P, Eisenstein DJ, Eldridge JJ, Ferrara A, Fujimoto S, Graaff AD, Habouzit M, Hutchison TA, Kartaltepe JS, Kassin SA, Kriek M, LabbĂ© I, Maiolino R, Marques-Chaves R, Maseda MV, Mason C, Matthee JJ, Mcquinn KBW, Meynet G, Naidu RP, Oesch PA, Pentericci L, PĂ©rez-GonzĂĄlez PG, Rigby JR, Roberts-Borsani G, Schaerer D, Shapley AE, Stark DP, Stiavelli M, Strom AL, Vanzella E, Wang F, Wilkins SM, Williams CC, Willott CJ, Wylezalek D, Nota A. 2025. The first billion years according to JWST. Nature Astronomy. 9(8), 1134–1147.","mla":"Adamo, Angela, et al. “The First Billion Years According to JWST.” Nature Astronomy, vol. 9, no. 8, Springer Nature, 2025, pp. 1134–47, doi:10.1038/s41550-025-02624-5.","short":"A. Adamo, H. Atek, M.B. Bagley, E. Bañados, K.S.S. Barrow, D.A. Berg, R. Bezanson, M. Bradač, G. Brammer, A.C. Carnall, J. Chisholm, D. Coe, P. Dayal, D.J. Eisenstein, J.J. Eldridge, A. Ferrara, S. Fujimoto, A.D. Graaff, M. Habouzit, T.A. Hutchison, J.S. Kartaltepe, S.A. Kassin, M. Kriek, I. LabbĂ©, R. Maiolino, R. Marques-Chaves, M.V. Maseda, C. Mason, J.J. Matthee, K.B.W. Mcquinn, G. Meynet, R.P. Naidu, P.A. Oesch, L. Pentericci, P.G. PĂ©rez-GonzĂĄlez, J.R. Rigby, G. Roberts-Borsani, D. Schaerer, A.E. Shapley, D.P. Stark, M. Stiavelli, A.L. Strom, E. Vanzella, F. Wang, S.M. Wilkins, C.C. Williams, C.J. Willott, D. Wylezalek, A. Nota, Nature Astronomy 9 (2025) 1134–1147.","chicago":"Adamo, Angela, Hakim Atek, Micaela B. Bagley, Eduardo Bañados, Kirk S.S. Barrow, Danielle A. Berg, Rachel Bezanson, et al. “The First Billion Years According to JWST.” Nature Astronomy. Springer Nature, 2025. https://doi.org/10.1038/s41550-025-02624-5."},"date_created":"2025-08-31T22:01:32Z","department":[{"_id":"JoMa"}]},{"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Fabian","last_name":"Kresse","full_name":"Kresse, Fabian","id":"faff3c84-23f6-11ef-9085-e5187b51c604"},{"first_name":"Kaushik","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik"},{"first_name":"Zhengqi","last_name":"Yu","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","full_name":"Yu, Zhengqi"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","last_name":"Zikelic","first_name":"Dorde"}],"arxiv":1,"external_id":{"arxiv":["2412.16564"]},"OA_place":"publisher","has_accepted_license":"1","acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093.\r\n","file":[{"file_name":"2025_L4DC_HenzingerT.pdf","success":1,"checksum":"d5236e561560635f5ae1d17de4903033","file_size":489639,"date_created":"2025-09-03T10:32:12Z","access_level":"open_access","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_id":"20283","date_updated":"2025-09-03T10:32:12Z"}],"page":"804-816","status":"public","month":"06","citation":{"short":"T.A. Henzinger, F. Kresse, K. Mallik, E. Yu, D. Zikelic, in:, 7th Annual Learning for Dynamics & Control Conference, ML Research Press, 2025, pp. 804–816.","mla":"Henzinger, Thomas A., et al. “Predictive Monitoring of Black-Box Dynamical Systems.” 7th Annual Learning for Dynamics & Control Conference, vol. 283, ML Research Press, 2025, pp. 804–16.","ista":"Henzinger TA, Kresse F, Mallik K, Yu E, Zikelic D. 2025. Predictive monitoring of black-box dynamical systems. 7th Annual Learning for Dynamics & Control Conference. L4DC: Learning for Dynamics & Control, PMLR, vol. 283, 804–816.","chicago":"Henzinger, Thomas A, Fabian Kresse, Kaushik Mallik, Emily Yu, and Dorde Zikelic. “Predictive Monitoring of Black-Box Dynamical Systems.” In 7th Annual Learning for Dynamics & Control Conference, 283:804–16. ML Research Press, 2025.","ama":"Henzinger TA, Kresse F, Mallik K, Yu E, Zikelic D. Predictive monitoring of black-box dynamical systems. In: 7th Annual Learning for Dynamics & Control Conference. Vol 283. ML Research Press; 2025:804-816.","ieee":"T. A. Henzinger, F. Kresse, K. Mallik, E. Yu, and D. Zikelic, “Predictive monitoring of black-box dynamical systems,” in 7th Annual Learning for Dynamics & Control Conference, Ann Arbor, MI, United States, 2025, vol. 283, pp. 804–816.","apa":"Henzinger, T. A., Kresse, F., Mallik, K., Yu, E., & Zikelic, D. (2025). Predictive monitoring of black-box dynamical systems. In 7th Annual Learning for Dynamics & Control Conference (Vol. 283, pp. 804–816). Ann Arbor, MI, United States: ML Research Press."},"publisher":"ML Research Press","department":[{"_id":"ToHe"},{"_id":"ChLa"}],"date_created":"2025-08-31T22:01:32Z","intvolume":" 283","publication_identifier":{"eissn":["2640-3498"]},"_id":"20256","date_published":"2025-06-01T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2025-09-03T10:32:12Z","abstract":[{"text":"We study the problem of predictive runtime monitoring of black-box dynamical systems with quantitative safety properties. The black-box setting stipulates that the exact semantics of the dynamical system and the controller are unknown, and that we are only able to observe the state of the controlled (aka, closed-loop) system at finitely many time points. We present a novel framework for predicting future states of the system based on the states observed in the past. The numbers of past states and of predicted future states are parameters provided by the user. Our method is based on a combination of Taylor’s expansion and the backward difference operator for numerical differentiation. We also derive an upper bound on the prediction error under the assumption that the system dynamics and the controller are smooth. The predicted states are then used to predict safety violations ahead in time. Our experiments demonstrate practical applicability of our method for complex black-box systems, showing that it is computationally lightweight and yet significantly more accurate than the state-of-the-art predictive safety monitoring techniques.","lang":"eng"}],"corr_author":"1","language":[{"iso":"eng"}],"volume":283,"title":"Predictive monitoring of black-box dynamical systems","alternative_title":["PMLR"],"year":"2025","conference":{"start_date":"2025-06-04","end_date":"2025-06-06","name":"L4DC: Learning for Dynamics & Control","location":"Ann Arbor, MI, United States"},"day":"01","OA_type":"gold","oa":1,"article_processing_charge":"No","ddc":["000"],"scopus_import":"1","date_updated":"2025-09-03T10:37:59Z","type":"conference","publication":"7th Annual Learning for Dynamics & Control Conference"},{"title":"Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme","volume":437,"year":"2025","OA_type":"hybrid","day":"01","oa":1,"acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"abstract":[{"lang":"eng","text":"The specific introduction of ^1H-^13C or ^1H-^15N moieties into otherwise deuterated proteins holds great potential for high-resolution solution and magic-angle spinning (MAS) NMR studies of protein structure and dynamics. Arginine residues play key roles for example at active sites of enzymes. Taking advantage of a chemically synthesized Arg with a ^13C-^1H2 group in an otherwise deuterated backbone, we demonstrate here the usefulness of proton-detected MAS NMR approaches to probe arginine dynamics. In experiments with crystalline ubiquitin and the 134 kDa tetrameric enzyme malate dehydrogenase we detected a wide range of motions, from sites that are rigid on time scales of at least tens of milliseconds to residues undergoing predominantly nanosecond motions. Spin-relaxation and dipolar-coupling measurements enabled quantitative determination of these dynamics. We observed microsecond dynamics of residue Arg54 in crystalline ubiquitin, whose backbone is known to sample different ÎČ-turn conformations on this time scale. The labeling scheme and experiments presented here expand the toolkit for high-resolution proton-detected MAS NMR."}],"corr_author":"1","language":[{"iso":"eng"}],"article_number":"169379","file_date_updated":"2025-12-29T14:51:40Z","publication_status":"published","doi":"10.1016/j.jmb.2025.169379","PlanS_conform":"1","date_updated":"2025-12-29T14:52:17Z","type":"journal_article","publication":"Journal of Molecular Biology","ddc":["540"],"scopus_import":"1","article_type":"original","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","acknowledgement":"This work was supported financially by the Austrian Science Fund (FWF, Grant No. I5812-B, “AlloSpace”). This research was supported by the Scientific Service Units (SSU) of Institute of Science and Technology Austria (ISTA) through resources provided by the Nuclear Magnetic Resonance Facility and the Lab Support Facility (LSF). We thank Petra RovĂČ and Margarita Valhondo FalcĂłn for excellent support of the NMR facility.","file":[{"access_level":"open_access","relation":"main_file","date_created":"2025-12-29T14:51:40Z","file_name":"2025_JourMolecularBiology_Rohden.pdf","checksum":"90d50594d8ea9860ac5da41297992847","success":1,"file_size":2270555,"file_id":"20876","date_updated":"2025-12-29T14:51:40Z","content_type":"application/pdf","creator":"dernst"}],"author":[{"first_name":"Darja","last_name":"Rohden","id":"81dc668a-19fa-11f0-bf31-d56534059ef3","full_name":"Rohden, Darja"},{"last_name":"Napoli","first_name":"Federico","id":"d42e08e7-f4fc-11eb-af0a-d71e26138f1b","full_name":"Napoli, Federico","orcid":"0000-0002-9043-136X"},{"id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","full_name":"Kapitonova, Anna","first_name":"Anna","last_name":"Kapitonova"},{"full_name":"Tatman, Benjamin","id":"71cda2f3-e604-11ee-a1df-da10587eda3f","first_name":"Benjamin","last_name":"Tatman"},{"last_name":"Lichtenecker","first_name":"Roman J.","full_name":"Lichtenecker, Roman J."},{"first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"}],"external_id":{"isi":["001618289100020"]},"isi":1,"OA_place":"publisher","related_material":{"record":[{"relation":"research_data","status":"public","id":"19956"}]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-12-01T00:00:00Z","project":[{"grant_number":"I05812","name":"AlloSpace. The emergence and mechanisms of allostery","_id":"eb9c82eb-77a9-11ec-83b8-aadd536561cf"}],"quality_controlled":"1","publication_identifier":{"eissn":["1089-8638"],"issn":["0022-2836"]},"issue":"23","intvolume":" 437","_id":"20258","publisher":"Elsevier","citation":{"chicago":"Rohden, Darja, Federico Napoli, Anna Kapitonova, Benjamin Tatman, Roman J. Lichtenecker, and Paul Schanda. “Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling Scheme.” Journal of Molecular Biology. Elsevier, 2025. https://doi.org/10.1016/j.jmb.2025.169379.","mla":"Rohden, Darja, et al. “Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling Scheme.” Journal of Molecular Biology, vol. 437, no. 23, 169379, Elsevier, 2025, doi:10.1016/j.jmb.2025.169379.","short":"D. Rohden, F. Napoli, A. Kapitonova, B. Tatman, R.J. Lichtenecker, P. Schanda, Journal of Molecular Biology 437 (2025).","ista":"Rohden D, Napoli F, Kapitonova A, Tatman B, Lichtenecker RJ, Schanda P. 2025. Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. 437(23), 169379.","ama":"Rohden D, Napoli F, Kapitonova A, Tatman B, Lichtenecker RJ, Schanda P. Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. 2025;437(23). doi:10.1016/j.jmb.2025.169379","apa":"Rohden, D., Napoli, F., Kapitonova, A., Tatman, B., Lichtenecker, R. J., & Schanda, P. (2025). Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2025.169379","ieee":"D. Rohden, F. Napoli, A. Kapitonova, B. Tatman, R. J. Lichtenecker, and P. Schanda, “Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme,” Journal of Molecular Biology, vol. 437, no. 23. Elsevier, 2025."},"department":[{"_id":"PaSc"}],"date_created":"2025-08-31T22:01:33Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","month":"12"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","isi":1,"external_id":{"isi":["001556019400001"]},"author":[{"first_name":"Yohalie","last_name":"Kalukula","full_name":"Kalukula, Yohalie"},{"full_name":"Luciano, Marine","first_name":"Marine","last_name":"Luciano"},{"last_name":"Simanov","first_name":"Gleb","full_name":"Simanov, Gleb"},{"full_name":"Charras, Guillaume","last_name":"Charras","first_name":"Guillaume"},{"first_name":"David","last_name":"BrĂŒckner","full_name":"BrĂŒckner, David","id":"e1e86031-6537-11eb-953a-f7ab92be508d","orcid":"0000-0001-7205-2975"},{"last_name":"Gabriele","first_name":"Sylvain","full_name":"Gabriele, Sylvain"}],"acknowledgement":"We are grateful to members of S.G.’s laboratory for feedback and suggestions. We thank E. Hannezo, J. O. RĂ€dler, M. Piel, O. du Roure and J. Heuvingh for inspiring discussions. Y.K. and S.G. acknowledge J. B. Braquenier from Nikon Instruments Belux and the Nikon BioImaging Lab in Leiden (the Netherlands) for their support with the Nikon Spatial Array Confocal enhanced-resolution confocal microscopy. We thank D. S. Herrador and M. Balland for their help in improving the microprinting method. D.B.B. was supported by the NOMIS Foundation as a NOMIS Fellow and by an EMBO Postdoctoral Fellowship (ALTF 343-2022). Y.K., M.L. and S.G. acknowledge funding from the University of Mons (FEDER Prostem Research Project no. 1510614, Wallonia DG06), the F.R.S.-FNRS (Epiforce Project no. T.0092.21, Cellsqueezer Project no. J.0061.23 and Optopattern Project no. U.NO26.22) and the Interreg projects ANTIRESI and MICROPLAITE, which are financially supported by Interreg France-Wallonie-Vlaanderen (Fonds EuropĂ©en de DĂ©veloppement RĂ©gional). Y.K. and M.L. are financially supported by F.R.S.-FNRS as FRIA Grantee FNRS and Postdoctoral Fellow (ChargĂ© de Recherches), respectively. Y.K. and S.G. acknowledge le Fonds pour la Recherche MĂ©dicale dans le Hainaut (FRMH). G.C. was supported by a grant from the Biotechnology and Biological Sciences Research Council (grant no. BB/V007483/1).","month":"09","status":"public","page":"1451-1461","department":[{"_id":"EdHa"}],"date_created":"2025-08-31T22:01:33Z","publisher":"Springer Nature","citation":{"ista":"Kalukula Y, Luciano M, Simanov G, Charras G, BrĂŒckner D, Gabriele S. 2025. The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. 21, 1451–1461.","mla":"Kalukula, Yohalie, et al. “The Actin Cortex Acts as a Mechanical Memory of Morphology in Confined Migrating Cells.” Nature Physics, vol. 21, Springer Nature, 2025, pp. 1451–61, doi:10.1038/s41567-025-02980-z.","short":"Y. Kalukula, M. Luciano, G. Simanov, G. Charras, D. BrĂŒckner, S. Gabriele, Nature Physics 21 (2025) 1451–1461.","chicago":"Kalukula, Yohalie, Marine Luciano, Gleb Simanov, Guillaume Charras, David BrĂŒckner, and Sylvain Gabriele. “The Actin Cortex Acts as a Mechanical Memory of Morphology in Confined Migrating Cells.” Nature Physics. Springer Nature, 2025. https://doi.org/10.1038/s41567-025-02980-z.","ieee":"Y. Kalukula, M. Luciano, G. Simanov, G. Charras, D. BrĂŒckner, and S. Gabriele, “The actin cortex acts as a mechanical memory of morphology in confined migrating cells,” Nature Physics, vol. 21. Springer Nature, pp. 1451–1461, 2025.","apa":"Kalukula, Y., Luciano, M., Simanov, G., Charras, G., BrĂŒckner, D., & Gabriele, S. (2025). The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-02980-z","ama":"Kalukula Y, Luciano M, Simanov G, Charras G, BrĂŒckner D, Gabriele S. The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. 2025;21:1451-1461. doi:10.1038/s41567-025-02980-z"},"_id":"20259","publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"intvolume":" 21","quality_controlled":"1","project":[{"_id":"34e2a5b5-11ca-11ed-8bc3-b2265616ef0b","name":"A mechano-chemical theory for stem cell fate decisions in organoid development","grant_number":"ALTF 343-2022"}],"date_published":"2025-09-01T00:00:00Z","doi":"10.1038/s41567-025-02980-z","publication_status":"published","language":[{"iso":"eng"}],"corr_author":"1","abstract":[{"text":"Cell migration in narrow microenvironments occurs in numerous physiological processes. It involves successive cycles of confinement and release that drive important morphological changes. However, it remains unclear whether migrating cells can retain a memory of their past morphological states that could potentially facilitate their navigation through confined spaces. We demonstrate that local geometry governs a switch between two cell morphologies, thereby facilitating cell passage through long and narrow gaps. We combined cell migration assays on standardized microsystems with biophysical modelling and biochemical perturbations to show that migrating cells have a long-term memory of past confinement events. The morphological cell states correlate across transitions through actin cortex remodelling. These findings indicate that mechanical memory in migrating cells plays an active role in their migratory potential in confined environments.","lang":"eng"}],"OA_type":"closed access","day":"01","year":"2025","title":"The actin cortex acts as a mechanical memory of morphology in confined migrating cells","volume":21,"article_processing_charge":"No","article_type":"original","scopus_import":"1","publication":"Nature Physics","type":"journal_article","date_updated":"2025-12-30T09:34:11Z"},{"_id":"20289","issue":"34","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"intvolume":" 122","project":[{"grant_number":"851288","name":"Design Principles of Branching Morphogenesis","_id":"05943252-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"quality_controlled":"1","date_published":"2025-08-26T00:00:00Z","month":"08","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"department":[{"_id":"EdHa"},{"_id":"MiSi"}],"date_created":"2025-09-07T22:01:32Z","citation":{"apa":"Ucar, M. C., Zane, A., Alanko, J. H., Sixt, M. K., & Hannezo, E. B. (2025). Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.2504064122","ama":"Ucar MC, Zane A, Alanko JH, Sixt MK, Hannezo EB. Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. 2025;122(34). doi:10.1073/pnas.2504064122","ieee":"M. C. Ucar, A. Zane, J. H. Alanko, M. K. Sixt, and E. B. Hannezo, “Self-generated chemotaxis of mixed cell populations,” Proceedings of the National Academy of Sciences, vol. 122, no. 34. National Academy of Sciences, 2025.","ista":"Ucar MC, Zane A, Alanko JH, Sixt MK, Hannezo EB. 2025. Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. 122(34), e2504064122.","mla":"Ucar, Mehmet C., et al. “Self-Generated Chemotaxis of Mixed Cell Populations.” Proceedings of the National Academy of Sciences, vol. 122, no. 34, e2504064122, National Academy of Sciences, 2025, doi:10.1073/pnas.2504064122.","short":"M.C. Ucar, A. Zane, J.H. Alanko, M.K. Sixt, E.B. Hannezo, Proceedings of the National Academy of Sciences 122 (2025).","chicago":"Ucar, Mehmet C, Alsberga Zane, Jonna H Alanko, Michael K Sixt, and Edouard B Hannezo. “Self-Generated Chemotaxis of Mixed Cell Populations.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2025. https://doi.org/10.1073/pnas.2504064122."},"publisher":"National Academy of Sciences","file":[{"checksum":"b36abd92673b6d76376fc9434bad52cc","file_size":16069140,"success":1,"file_name":"2025_PNAS_Ucar.pdf","date_created":"2025-09-08T07:23:29Z","relation":"main_file","access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_updated":"2025-09-08T07:23:29Z","file_id":"20307"}],"acknowledgement":"We thank all members of the M.S. and E.H. groups for stimulating discussions.We thank the Imaging and Optics facility, the Pre-clinical and Lab Support facility of the Institute of Science and Technology Austria for their excellent support and provided resources for the experimental research. In particular, we thank Jack Merrin from the Nanofabrication facility who generated the microfabricated channel used in this study. This work received funding fromt he European Research Council under the European Union’s Horizon 2020 research and innovation program (grant agreement No. 851288 to E.H.). M.C.U.is funded by a University of ShefïŹeld Strategic Research Fellowship in the Physics of Life and Quantitative Biology.","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","related_material":{"link":[{"url":"https://github.com/mehmetcanucar/Self-generated-chemotaxis","relation":"software"}]},"OA_place":"publisher","isi":1,"external_id":{"pmid":["40838890"],"isi":["001562181600001"]},"pmid":1,"author":[{"last_name":"Ucar","first_name":"Mehmet C","id":"50B2A802-6007-11E9-A42B-EB23E6697425","full_name":"Ucar, Mehmet C","orcid":"0000-0003-0506-4217"},{"last_name":"Zane","first_name":"Alsberga","id":"60f7509a-f652-11ea-9d86-b963d6490d7c","full_name":"Zane, Alsberga","orcid":"0009-0003-0415-7603"},{"id":"2CC12E8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alanko, Jonna H","orcid":"0000-0002-7698-3061","last_name":"Alanko","first_name":"Jonna H"},{"first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6005-1561","first_name":"Edouard B","last_name":"Hannezo"}],"scopus_import":"1","ddc":["570"],"type":"journal_article","publication":"Proceedings of the National Academy of Sciences","date_updated":"2026-02-16T12:31:05Z","PlanS_conform":"1","article_processing_charge":"Yes (in subscription journal)","article_type":"original","language":[{"iso":"eng"}],"article_number":"e2504064122","abstract":[{"lang":"eng","text":"Cell and tissue movement in development, cancer invasion, and immune response relies on chemical or mechanical guidance cues. In many systems, this behavior is locally directed by self-generated signaling gradients rather than long-range, prepatterned cues. However, how heterogeneous mixtures of cells interact nonreciprocally and navigate through self-generated gradients remains largely unexplored. Here, we introduce a theoretical framework for the self-organized chemotaxis of heterogeneous cell populations. We find that the relative chemotactic sensitivities of different cell populations control their long-time coupling and comigration dynamics, with boundary conditions such as external cell and attractant reservoirs substantially influencing the migration patterns. Our model predicts an optimal parameter regime that enables robust and colocalized migration. We test our theoretical predictions with in vitro experiments demonstrating the comigration of distinct immune cell populations, and quantitatively reproduce observed migration patterns under wild-type and perturbed conditions. Interestingly, immune cell comigration occurs close to the predicted optimal regime. Finally, we incorporate mechanical interactions into our framework, revealing a nontrivial interplay between chemotactic and mechanical nonreciprocity in driving collective migration. Together, our findings suggest that self-generated chemotaxis is a robust strategy for the navigation of mixed cell populations."}],"corr_author":"1","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"},{"_id":"NanoFab"}],"oa":1,"OA_type":"hybrid","day":"26","year":"2025","title":"Self-generated chemotaxis of mixed cell populations","volume":122,"doi":"10.1073/pnas.2504064122","publication_status":"published","file_date_updated":"2025-09-08T07:23:29Z","ec_funded":1},{"ddc":["000"],"scopus_import":"1","date_updated":"2025-09-08T07:15:40Z","publication":"50th International Symposium on Mathematical Foundations of Computer Science","type":"conference","article_processing_charge":"Yes","abstract":[{"text":"We consider equilibria in multiplayer stochastic graph games with terminal-node rewards. In such games, Nash equilibria are defined assuming that each player seeks to maximise their expected payoff, ignoring their aversion or tolerance to risk. We therefore study risk-sensitive equilibria (RSEs), where the expected payoff is replaced by a risk measure. A classical risk measure in the literature is the entropic risk measure, where each player has a real valued parameter capturing their risk-averseness. We introduce the extreme risk measure, which corresponds to extreme cases of entropic risk measure, where players are either extreme optimists or extreme pessimists. Under extreme risk measure, every player is an extremist: an extreme optimist perceives their reward as the maximum payoff that can be achieved with positive probability, while an extreme pessimist expects the minimum payoff achievable with positive probability. We argue that the extreme risk measure, especially in multi-player graph based settings, is particularly relevant as they can model several real life instances such as interactions between secure systems and potential security threats, or distributed controls for safety critical systems. We prove that RSEs defined with the extreme risk measure are guaranteed to exist when all rewards are non-negative. Furthermore, we prove that the problem of deciding whether a given game contains an RSE that generates risk measures within specified intervals is decidable and NP-complete for our extreme risk measure, and even PTIME-complete when all players are extreme optimists, while that same problem is undecidable using the entropic risk measure or even the classical expected payoff. This establishes, to our knowledge, the first decidable fragment for equilibria in simple stochastic games without restrictions on strategy types or number of players.","lang":"eng"}],"corr_author":"1","language":[{"iso":"eng"}],"article_number":"30","title":"Finding equilibria: Simpler for pessimists, simplest for optimists","volume":345,"year":"2025","alternative_title":["LIPIcs"],"day":"20","conference":{"location":"Warsaw, Poland","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2025-08-29","start_date":"2025-08-25"},"OA_type":"gold","oa":1,"publication_status":"published","doi":"10.4230/LIPIcs.MFCS.2025.30","ec_funded":1,"file_date_updated":"2025-09-08T07:11:12Z","publication_identifier":{"isbn":["9783959773881"],"issn":["1868-8969"]},"intvolume":" 345","_id":"20290","date_published":"2025-08-20T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","month":"08","citation":{"chicago":"Brice, LĂ©onard, Thomas A Henzinger, and K. S. Thejaswini. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.30.","ista":"Brice L, Henzinger TA, Thejaswini KS. 2025. Finding equilibria: Simpler for pessimists, simplest for optimists. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 30.","short":"L. Brice, T.A. Henzinger, K.S. Thejaswini, in:, 50th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025.","mla":"Brice, LĂ©onard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.30.","ieee":"L. Brice, T. A. Henzinger, and K. S. Thejaswini, “Finding equilibria: Simpler for pessimists, simplest for optimists,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.","ama":"Brice L, Henzinger TA, Thejaswini KS. Finding equilibria: Simpler for pessimists, simplest for optimists. In: 50th International Symposium on Mathematical Foundations of Computer Science. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik; 2025. doi:10.4230/LIPIcs.MFCS.2025.30","apa":"Brice, L., Henzinger, T. A., & Thejaswini, K. S. (2025). Finding equilibria: Simpler for pessimists, simplest for optimists. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.30"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik","department":[{"_id":"ToHe"}],"date_created":"2025-09-07T22:01:32Z","acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093. We thank anonymous reviewers for pointing us to the Hurwicz criterion and to the work of Gallego-HernĂĄndez and Mansutti [13]. We thank Marie van den Bogaard for her valuable feedback on the first author’s PhD dissertation, which helped improve the quality of this work. ","has_accepted_license":"1","file":[{"file_id":"20306","date_updated":"2025-09-08T07:11:12Z","creator":"dernst","content_type":"application/pdf","date_created":"2025-09-08T07:11:12Z","relation":"main_file","access_level":"open_access","checksum":"9bc6b8e537662d371d2a27444cbc0b75","success":1,"file_size":1149694,"file_name":"2025_MFCS_Brice.pdf"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Brice, LĂ©onard","first_name":"LĂ©onard","last_name":"Brice"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Thejaswini, K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","first_name":"K. S.","last_name":"Thejaswini"}],"external_id":{"arxiv":["2502.0531"]},"arxiv":1,"OA_place":"publisher"},{"_id":"20291","intvolume":" 345","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773881"]},"quality_controlled":"1","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}],"date_published":"2025-08-20T00:00:00Z","month":"08","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"department":[{"_id":"ToHe"}],"date_created":"2025-09-07T22:01:32Z","citation":{"mla":"Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.57.","short":"T.A. Henzinger, A. Prakash, K.S. Thejaswini, in:, 50th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025.","ista":"Henzinger TA, Prakash A, Thejaswini KS. 2025. Resolving nondeterminism with randomness. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 57.","chicago":"Henzinger, Thomas A, Aditya Prakash, and K. S. Thejaswini. “Resolving Nondeterminism with Randomness.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.57.","ieee":"T. A. Henzinger, A. Prakash, and K. S. Thejaswini, “Resolving nondeterminism with randomness,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.","ama":"Henzinger TA, Prakash A, Thejaswini KS. Resolving nondeterminism with randomness. In: 50th International Symposium on Mathematical Foundations of Computer Science. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik; 2025. doi:10.4230/LIPIcs.MFCS.2025.57","apa":"Henzinger, T. A., Prakash, A., & Thejaswini, K. S. (2025). Resolving nondeterminism with randomness. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.57"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik","file":[{"content_type":"application/pdf","creator":"dernst","file_id":"20305","date_updated":"2025-09-08T06:56:56Z","checksum":"6068b772aba6cb0d01f3e5a90abed973","success":1,"file_size":1009644,"file_name":"2025_MFCS_HenzingerT.pdf","relation":"main_file","access_level":"open_access","date_created":"2025-09-08T06:56:56Z"}],"acknowledgement":"This work is a part of project VAMOS that has received funding from the European Research Council (ERC), grant agreement No 101020093.","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_place":"publisher","external_id":{"arxiv":["2502.12872"]},"arxiv":1,"author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Prakash","first_name":"Aditya","full_name":"Prakash, Aditya"},{"id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","full_name":"Thejaswini, K. S.","first_name":"K. S.","last_name":"Thejaswini"}],"scopus_import":"1","ddc":["000"],"type":"conference","publication":"50th International Symposium on Mathematical Foundations of Computer Science","date_updated":"2025-09-08T07:06:11Z","article_processing_charge":"No","language":[{"iso":"eng"}],"article_number":"57","corr_author":"1","abstract":[{"lang":"eng","text":"We define and study classes of ω-regular automata for which the nondeterminism can be resolved by a policy that uses a combination of memory and randomness on any input word, based solely on the prefix read so far. We examine two settings for providing the input word to an automaton. In the first setting, called adversarial resolvability, the input word is constructed letter-by-letter by an adversary, dependent on the resolver’s previous decisions. In the second setting, called stochastic resolvability, the adversary pre-commits to an infinite word and reveals it letter-by-letter. In each setting, we require the existence of an almost-sure resolver, i.e., a policy that ensures that as long as the adversary provides a word in the language of the underlying nondeterministic automaton, the run constructed by the policy is accepting with probability 1.\r\nThe class of automata that are adversarially resolvable is the well-studied class of history-deterministic automata. The case of stochastically resolvable automata, on the other hand, defines a novel class. Restricting the class of resolvers in both settings to stochastic policies without memory introduces two additional new classes of automata. We show that the new automata classes offer interesting trade-offs between succinctness, expressivity, and computational complexity, providing a fine gradation between deterministic automata and nondeterministic automata."}],"oa":1,"day":"20","OA_type":"gold","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2025-08-29","location":"Warsaw, Poland","start_date":"2025-08-25"},"alternative_title":["LIPIcs"],"year":"2025","title":"Resolving nondeterminism with randomness","volume":345,"doi":"10.4230/LIPIcs.MFCS.2025.57","publication_status":"published","file_date_updated":"2025-09-08T06:56:56Z","ec_funded":1},{"oa":1,"conference":{"start_date":"2025-08-03","end_date":"2025-08-07","location":"Toronto, Canada","name":"KDD: Conference on Knowledge Discovery and Data Mining"},"day":"03","year":"2025","title":"Monitoring robustness and individual fairness","volume":2,"language":[{"iso":"eng"}],"corr_author":"1","abstract":[{"text":"In automated decision-making, it is desirable that outputs of decision-makers be robust to slight perturbations in their inputs, a property that may be called input-output robustness. Input-output robustness appears in various different forms in the literature, such as robustness of AI models to adversarial or semantic perturbations and individual fairness of AI models that make decisions about humans. We propose runtime monitoring of input-output robustness of deployed, black-box AI models, where the goal is to design monitors that would observe one long execution sequence of the model, and would raise an alarm whenever it is detected that two similar inputs from the past led to dissimilar outputs. This way, monitoring will complement existing offline ''robustification'' approaches to increase the trustworthiness of AI decision-makers. We show that the monitoring problem can be cast as the fixed-radius nearest neighbor (FRNN) search problem, which, despite being well-studied, lacks suitable online solutions. We present our tool Clemont, which offers a number of lightweight monitors, some of which use upgraded online variants of existing FRNN algorithms, and one uses a novel algorithm based on binary decision diagrams--a data-structure commonly used in software and hardware verification. We have also developed an efficient parallelization technique that can substantially cut down the computation time of monitors for which the distance between input-output pairs is measured using the L∞norm. Using standard benchmarks from the literature of adversarial and semantic robustness and individual fairness, we perform a comparative study of different monitors in Clemont, and demonstrate their effectiveness in correctly detecting robustness violations at runtime.","lang":"eng"}],"file_date_updated":"2025-09-08T08:46:31Z","ec_funded":1,"doi":"10.1145/3711896.3737054","publication_status":"published","publication":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","type":"conference","date_updated":"2025-09-08T08:54:24Z","scopus_import":"1","ddc":["000"],"article_processing_charge":"No","file":[{"creator":"dernst","content_type":"application/pdf","date_updated":"2025-09-08T08:46:31Z","file_id":"20310","file_name":"2025_KDD_Gupta.pdf","success":1,"file_size":7745940,"checksum":"81e18cdf9ca5f6dfa79425b326ea9725","date_created":"2025-09-08T08:46:31Z","access_level":"open_access","relation":"main_file"}],"acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093 and the SBI Foundation Hub for Data Science &Analytics, IIT Bombay.","has_accepted_license":"1","OA_place":"publisher","external_id":{"arxiv":["2506.00496"]},"arxiv":1,"author":[{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"last_name":"Kueffner","first_name":"Konstantin","full_name":"Kueffner, Konstantin","orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"},{"first_name":"Kaushik","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475"},{"first_name":"David","last_name":"Pape","full_name":"Pape, David"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","related_material":{"link":[{"url":"https://github.com/ariez-xyz/clemont","relation":"software"}]},"project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"quality_controlled":"1","date_published":"2025-08-03T00:00:00Z","_id":"20292","publication_identifier":{"isbn":["9798400714542"],"issn":["2154-817X"]},"intvolume":" 2","department":[{"_id":"ToHe"}],"date_created":"2025-09-07T22:01:33Z","publisher":"Association for Computing Machinery","citation":{"ama":"Gupta A, Henzinger TA, Kueffner K, Mallik K, Pape D. Monitoring robustness and individual fairness. In: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining. Vol 2. Association for Computing Machinery; 2025:790-801. doi:10.1145/3711896.3737054","ieee":"A. Gupta, T. A. Henzinger, K. Kueffner, K. Mallik, and D. Pape, “Monitoring robustness and individual fairness,” in Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Toronto, Canada, 2025, vol. 2, pp. 790–801.","apa":"Gupta, A., Henzinger, T. A., Kueffner, K., Mallik, K., & Pape, D. (2025). Monitoring robustness and individual fairness. In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining (Vol. 2, pp. 790–801). Toronto, Canada: Association for Computing Machinery. https://doi.org/10.1145/3711896.3737054","ista":"Gupta A, Henzinger TA, Kueffner K, Mallik K, Pape D. 2025. Monitoring robustness and individual fairness. Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Conference on Knowledge Discovery and Data Mining vol. 2, 790–801.","mla":"Gupta, Ashutosh, et al. “Monitoring Robustness and Individual Fairness.” Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, vol. 2, Association for Computing Machinery, 2025, pp. 790–801, doi:10.1145/3711896.3737054.","short":"A. Gupta, T.A. Henzinger, K. Kueffner, K. Mallik, D. Pape, in:, Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery, 2025, pp. 790–801.","chicago":"Gupta, Ashutosh, Thomas A Henzinger, Konstantin Kueffner, Kaushik Mallik, and David Pape. “Monitoring Robustness and Individual Fairness.” In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2:790–801. Association for Computing Machinery, 2025. https://doi.org/10.1145/3711896.3737054."},"month":"08","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"page":"790-801"},{"date_published":"2025-08-01T00:00:00Z","project":[{"grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"quality_controlled":"1","_id":"20293","intvolume":" 27","publication_identifier":{"eissn":["1099-4300"]},"issue":"8","publisher":"MDPI","citation":{"mla":"Akopyan, Arseniy, et al. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” Entropy, vol. 27, no. 8, 854, MDPI, 2025, doi:10.3390/e27080854.","short":"A. Akopyan, H. Edelsbrunner, Z. Virk, H. Wagner, Entropy 27 (2025).","ista":"Akopyan A, Edelsbrunner H, Virk Z, Wagner H. 2025. Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. 27(8), 854.","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, Ziga Virk, and Hubert Wagner. “Tight Bounds between the Jensen–Shannon Divergence and the Minmax Divergence.” Entropy. MDPI, 2025. https://doi.org/10.3390/e27080854.","ieee":"A. Akopyan, H. Edelsbrunner, Z. Virk, and H. Wagner, “Tight bounds between the Jensen–Shannon divergence and the minmax divergence,” Entropy, vol. 27, no. 8. MDPI, 2025.","apa":"Akopyan, A., Edelsbrunner, H., Virk, Z., & Wagner, H. (2025). Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. MDPI. https://doi.org/10.3390/e27080854","ama":"Akopyan A, Edelsbrunner H, Virk Z, Wagner H. Tight bounds between the Jensen–Shannon divergence and the minmax divergence. Entropy. 2025;27(8). doi:10.3390/e27080854"},"date_created":"2025-09-07T22:01:33Z","department":[{"_id":"HeEd"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"month":"08","status":"public","file":[{"date_updated":"2025-09-08T07:55:48Z","file_id":"20309","content_type":"application/pdf","creator":"dernst","relation":"main_file","access_level":"open_access","date_created":"2025-09-08T07:55:48Z","success":1,"file_size":379340,"checksum":"65c5399c4015d9c8abb8c7a96f3d7836","file_name":"2025_Entropy_Akopyan.pdf"}],"acknowledgement":"This research received partial funding from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, the\r\nWittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, the DFG Collaborative\r\nResearch Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35, and the 2022 Google Research Scholar Award for project ‘Algorithms for Topological Analysis of Neural Networks’. The APC was waived.","has_accepted_license":"1","external_id":{"isi":["001557476000001"],"pmid":["40870326"]},"DOAJ_listed":"1","pmid":1,"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan","first_name":"Arseniy"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"Ziga","last_name":"Virk","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","full_name":"Virk, Ziga"},{"full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Hubert"}],"OA_place":"publisher","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","publication":"Entropy","type":"journal_article","PlanS_conform":"1","date_updated":"2025-09-30T14:32:31Z","scopus_import":"1","ddc":["500"],"article_type":"original","article_processing_charge":"Yes","year":"2025","title":"Tight bounds between the Jensen–Shannon divergence and the minmax divergence","volume":27,"oa":1,"OA_type":"gold","day":"01","corr_author":"1","abstract":[{"text":"Motivated by questions arising at the intersection of information theory and geometry, we compare two dissimilarity measures between finite categorical distributions. One is the well-known Jensen–Shannon divergence, which is easy to compute and whose square root is a proper metric. The other is what we call the minmax divergence, which is harder to compute. Just like the Jensen–Shannon divergence, it arises naturally from the Kullback–Leibler divergence. The main contribution of this paper is a proof showing that the minmax divergence can be tightly approximated by the Jensen–Shannon divergence. The bounds suggest that the square root of the minmax divergence is a metric, and we prove that this is indeed true in the one-dimensional case. The general case remains open. Finally, we consider analogous questions in the context of another Bregman divergence and the corresponding Burbea–Rao (Jensen–Bregman) divergence.","lang":"eng"}],"article_number":"854","language":[{"iso":"eng"}],"ec_funded":1,"file_date_updated":"2025-09-08T07:55:48Z","publication_status":"published","doi":"10.3390/e27080854"},{"has_accepted_license":"1","acknowledgement":"We are very grateful to the anonymous referee for instructive comments, which helped improve the overall quality and strengthen the analysis of this work. We thank Andrea Weibel for assistance with the HST and JWST photometric measurements used in this paper. This work is based on observations carried out under project number S23CY with the IRAM NOEMA Interferometer. IRAM is supported by INSU/CNRS (France), MPG (Germany) and IGN (Spain). This work is based in part on observations made with the NASA/ESA/CSA James Webb Space Telescope. The data were obtained from the Mikulski Archive for Space Telescopes at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127 for JWST. These observations are associated with programs #1895 and #4762. Support for programs #1895 and #4762 was provided by NASA through a grant from the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127. This work has received funding from the Swiss State Secretariat for Education, Research and Innovation (SERI) under contract number MB22.00072, as well as from the Swiss National Science Foundation (SNSF) through project grant 200020_207349. The Cosmic Dawn Center (DAWN) is funded by the Danish National Research Foundation under grant DNRF140. This work is partially supported from the National Natural Science Foundation of China (12073003, 11721303, 11991052), and the China Manned Space Project (CMS-CSST-2021-A04 and CMS-CSST-2021-A06). Y.F. is supported by JSPS KAKENHI Grant Numbers JP22K21349 and JP23K13149. M.V. gratefully acknowledges financial support from the Independent Research Fund Denmark via grant numbers DFF 8021-00130 and 3103-00146 and from the Carlsberg Foundation via grant CF23-0417. VK acknowledges support from the University of Texas at Austin Cosmic Frontier Center. S.F. acknowledges support from NASA through the NASA Hubble Fellowship grant HST-HF2-51505.001-A awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Incorporated, under NASA contract NAS5-26555. Support for this work for RPN was provided by NASA through the NASA Hubble Fellowship grant HST-HF2-51515.001-A awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Incorporated, under NASA contract NAS5-26555.","file":[{"date_created":"2025-09-08T07:40:53Z","relation":"main_file","access_level":"open_access","success":1,"checksum":"fab2168609078b8336be01ef13b3238e","file_size":3648334,"file_name":"2025_AstronomyAstrophysics_Xiao.pdf","date_updated":"2025-09-08T07:40:53Z","file_id":"20308","creator":"dernst","content_type":"application/pdf"}],"OA_place":"publisher","isi":1,"author":[{"last_name":"Xiao","first_name":"Mengyuan","full_name":"Xiao, Mengyuan"},{"full_name":"Oesch, Pascal A.","last_name":"Oesch","first_name":"Pascal A."},{"first_name":"Longji","last_name":"Bing","full_name":"Bing, Longji"},{"last_name":"Elbaz","first_name":"David","full_name":"Elbaz, David"},{"orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J"},{"full_name":"Fudamoto, Yoshinobu","first_name":"Yoshinobu","last_name":"Fudamoto"},{"last_name":"Fujimoto","first_name":"Seiji","full_name":"Fujimoto, Seiji"},{"full_name":"Marques-Chaves, Rui","first_name":"Rui","last_name":"Marques-Chaves"},{"last_name":"Williams","first_name":"Christina C.","full_name":"Williams, Christina C."},{"last_name":"Dessauges-Zavadsky","first_name":"Miroslava","full_name":"Dessauges-Zavadsky, Miroslava"},{"full_name":"Valentino, Francesco","first_name":"Francesco","last_name":"Valentino"},{"last_name":"Brammer","first_name":"Gabriel","full_name":"Brammer, Gabriel"},{"last_name":"Covelo-Paz","first_name":"Alba","full_name":"Covelo-Paz, Alba"},{"first_name":"Emanuele","last_name":"Daddi","full_name":"Daddi, Emanuele"},{"full_name":"Fynbo, Johan P.U.","last_name":"Fynbo","first_name":"Johan P.U."},{"first_name":"Steven","last_name":"Gillman","full_name":"Gillman, Steven"},{"last_name":"Ginolfi","first_name":"Michele","full_name":"Ginolfi, Michele"},{"full_name":"Giovinazzo, Emma","last_name":"Giovinazzo","first_name":"Emma"},{"full_name":"Greene, Jenny E.","last_name":"Greene","first_name":"Jenny E."},{"last_name":"Gu","first_name":"Qiusheng","full_name":"Gu, Qiusheng"},{"full_name":"Illingworth, Garth","first_name":"Garth","last_name":"Illingworth"},{"full_name":"Inayoshi, Kohei","first_name":"Kohei","last_name":"Inayoshi"},{"full_name":"Kokorev, Vasily","last_name":"Kokorev","first_name":"Vasily"},{"first_name":"Romain A.","last_name":"Meyer","full_name":"Meyer, Romain A."},{"first_name":"Rohan P.","last_name":"Naidu","full_name":"Naidu, Rohan P."},{"full_name":"Reddy, Naveen A.","first_name":"Naveen A.","last_name":"Reddy"},{"full_name":"Schaerer, Daniel","last_name":"Schaerer","first_name":"Daniel"},{"last_name":"Shapley","first_name":"Alice","full_name":"Shapley, Alice"},{"full_name":"Stefanon, Mauro","last_name":"Stefanon","first_name":"Mauro"},{"full_name":"Steinhardt, Charles L.","last_name":"Steinhardt","first_name":"Charles L."},{"full_name":"Setton, David J.","last_name":"Setton","first_name":"David J."},{"last_name":"Vestergaard","first_name":"Marianne","full_name":"Vestergaard, Marianne"},{"full_name":"Wang, Tao","last_name":"Wang","first_name":"Tao"}],"arxiv":1,"external_id":{"arxiv":["2503.01945"],"isi":["001559174700004"]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","date_published":"2025-08-01T00:00:00Z","intvolume":" 700","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"_id":"20294","department":[{"_id":"JoMa"}],"date_created":"2025-09-07T22:01:33Z","citation":{"ista":"Xiao M, Oesch PA, Bing L, Elbaz D, Matthee JJ, Fudamoto Y, Fujimoto S, Marques-Chaves R, Williams CC, Dessauges-Zavadsky M, Valentino F, Brammer G, Covelo-Paz A, Daddi E, Fynbo JPU, Gillman S, Ginolfi M, Giovinazzo E, Greene JE, Gu Q, Illingworth G, Inayoshi K, Kokorev V, Meyer RA, Naidu RP, Reddy NA, Schaerer D, Shapley A, Stefanon M, Steinhardt CL, Setton DJ, Vestergaard M, Wang T. 2025. No [C II] or dust detection in two Little Red Dots at zspec > 7. Astronomy & Astrophysics. 700, A231.","mla":"Xiao, Mengyuan, et al. “No [C II] or Dust Detection in Two Little Red Dots at Zspec > 7.” Astronomy & Astrophysics, vol. 700, A231, EDP Sciences, 2025, doi:10.1051/0004-6361/202554361.","short":"M. Xiao, P.A. Oesch, L. Bing, D. Elbaz, J.J. Matthee, Y. Fudamoto, S. Fujimoto, R. Marques-Chaves, C.C. Williams, M. Dessauges-Zavadsky, F. Valentino, G. Brammer, A. Covelo-Paz, E. Daddi, J.P.U. Fynbo, S. Gillman, M. Ginolfi, E. Giovinazzo, J.E. Greene, Q. Gu, G. Illingworth, K. Inayoshi, V. Kokorev, R.A. Meyer, R.P. Naidu, N.A. Reddy, D. Schaerer, A. Shapley, M. Stefanon, C.L. Steinhardt, D.J. Setton, M. Vestergaard, T. Wang, Astronomy & Astrophysics 700 (2025).","chicago":"Xiao, Mengyuan, Pascal A. Oesch, Longji Bing, David Elbaz, Jorryt J Matthee, Yoshinobu Fudamoto, Seiji Fujimoto, et al. “No [C II] or Dust Detection in Two Little Red Dots at Zspec > 7.” Astronomy & Astrophysics. EDP Sciences, 2025. https://doi.org/10.1051/0004-6361/202554361.","ieee":"M. Xiao et al., “No [C II] or dust detection in two Little Red Dots at zspec > 7,” Astronomy & Astrophysics, vol. 700. EDP Sciences, 2025.","ama":"Xiao M, Oesch PA, Bing L, et al. No [C II] or dust detection in two Little Red Dots at zspec > 7. Astronomy & Astrophysics. 2025;700. doi:10.1051/0004-6361/202554361","apa":"Xiao, M., Oesch, P. A., Bing, L., Elbaz, D., Matthee, J. J., Fudamoto, Y., 
 Wang, T. (2025). No [C II] or dust detection in two Little Red Dots at zspec > 7. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202554361"},"publisher":"EDP Sciences","status":"public","month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"day":"01","OA_type":"diamond","oa":1,"title":"No [C II] or dust detection in two Little Red Dots at zspec > 7","volume":700,"year":"2025","article_number":"A231","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Little Red Dots (LRDs) are compact, point-like sources characterized by their red color and broad Balmer lines; it is a matter of debate whether they are dominated by active galactic nuclei (AGNs) or dusty star-forming galaxies (DSFGs). Here we report two LRDs (ID9094 and ID2756) at zspec > 7 recently discovered in the JWST FRESCO GOODS-North field. Both satisfy the “v-shaped” color and compactness criteria for LRDs and are identified as Type-I AGN candidates based on their broad HÎČ emission lines (full width at half maximum: 2280 ± 490 km s−1 for ID9094 and 1070 ± 240 km s−1 for ID2756) and narrow [O III] lines (≃300 − 400 km s−1). To investigate their nature, we conducted deep NOEMA follow-up observations targeting the [C II] 158 Όm emission line and the 1.3 mm dust continuum. We do not detect [C II] or 1.3 mm continuum emission for either source. If the two LRDs were DSFGs, we would expect significant detections: > 16σ for [C II] and > 3σ for the 1.3 mm continuum of ID9094, and > 5σ for the [C II] of ID2756. Using the 3σ upper limits of [C II] and 1.3 mm, we performed two analyses: (1) UV-to-far-infrared spectral energy distribution fitting with and without AGN components, and (2) comparison of their properties with the L[C II]–SFRtot empirical relation. Both analyses are consistent with a scenario in which AGN activity contributes to the observed properties, though a dusty star-forming origin cannot be fully ruled out. Our results highlight the importance of far-infrared observations for studying LRDs, a regime that remains largely unexplored."}],"file_date_updated":"2025-09-08T07:40:53Z","doi":"10.1051/0004-6361/202554361","publication_status":"published","date_updated":"2026-02-16T12:12:36Z","PlanS_conform":"1","type":"journal_article","publication":"Astronomy & Astrophysics","ddc":["520"],"scopus_import":"1","article_processing_charge":"No","article_type":"original"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"month":"10","status":"public","citation":{"ama":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. A duality between surface charge and work function in scanning Kelvin probe microscopy. Advanced Materials Interfaces. 2025;12(19). doi:10.1002/admi.202500521","ieee":"I. C. Lenton, F. Pertl, L. B. Shafeek, and S. R. Waitukaitis, “A duality between surface charge and work function in scanning Kelvin probe microscopy,” Advanced Materials Interfaces, vol. 12, no. 19. Wiley, 2025.","apa":"Lenton, I. C., Pertl, F., Shafeek, L. B., & Waitukaitis, S. R. (2025). A duality between surface charge and work function in scanning Kelvin probe microscopy. Advanced Materials Interfaces. Wiley. https://doi.org/10.1002/admi.202500521","ista":"Lenton IC, Pertl F, Shafeek LB, Waitukaitis SR. 2025. A duality between surface charge and work function in scanning Kelvin probe microscopy. Advanced Materials Interfaces. 12(19), e00521.","short":"I.C. Lenton, F. Pertl, L.B. Shafeek, S.R. Waitukaitis, Advanced Materials Interfaces 12 (2025).","mla":"Lenton, Isaac C., et al. “A Duality between Surface Charge and Work Function in Scanning Kelvin Probe Microscopy.” Advanced Materials Interfaces, vol. 12, no. 19, e00521, Wiley, 2025, doi:10.1002/admi.202500521.","chicago":"Lenton, Isaac C, Felix Pertl, Lubuna B Shafeek, and Scott R Waitukaitis. “A Duality between Surface Charge and Work Function in Scanning Kelvin Probe Microscopy.” Advanced Materials Interfaces. Wiley, 2025. https://doi.org/10.1002/admi.202500521."},"publisher":"Wiley","date_created":"2025-09-07T22:01:33Z","department":[{"_id":"ScWa"},{"_id":"NanoFab"}],"_id":"20295","publication_identifier":{"eissn":["2196-7350"]},"issue":"19","intvolume":" 12","date_published":"2025-10-01T00:00:00Z","project":[{"grant_number":"949120","call_identifier":"H2020","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","arxiv":1,"DOAJ_listed":"1","external_id":{"arxiv":["2506.07187"],"isi":["001560163400001"]},"author":[{"last_name":"Lenton","first_name":"Isaac C","id":"a550210f-223c-11ec-8182-e2d45e817efb","orcid":"0000-0002-5010-6984","full_name":"Lenton, Isaac C"},{"full_name":"Pertl, Felix","id":"6313aec0-15b2-11ec-abd3-ed67d16139af","orcid":"0000-0003-0463-5794","last_name":"Pertl","first_name":"Felix"},{"last_name":"Shafeek","first_name":"Lubuna B","full_name":"Shafeek, Lubuna B","orcid":"0000-0001-7180-6050","id":"3CD37A82-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","first_name":"Scott R"}],"isi":1,"OA_place":"publisher","file":[{"date_updated":"2025-12-30T09:31:11Z","file_id":"20908","content_type":"application/pdf","creator":"dernst","access_level":"open_access","relation":"main_file","date_created":"2025-12-30T09:31:11Z","file_name":"2025_AdvMaterialsInterfaces_Lenton.pdf","file_size":1830117,"success":1,"checksum":"906fcc7733be8ce8a83600427b82cd5a"}],"acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant agreement No. 949120). This research was supported by the Scientific Service Units of The Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility, Scientific Computing Facility, and Lab Support Facility. The authors wish to thank Dmytro Rak and Juan Carlos Sobarzo for letting us use their equipment. The authors wish to thank Evgeniia Volobueva for advice in preparing PFIB samples. The authors wish to thank the contributions of the whole Waitukaitis group for useful discussions and feedback.","has_accepted_license":"1","article_type":"original","article_processing_charge":"Yes","scopus_import":"1","ddc":["530"],"type":"journal_article","publication":"Advanced Materials Interfaces","date_updated":"2025-12-30T09:31:25Z","PlanS_conform":"1","publication_status":"published","doi":"10.1002/admi.202500521","ec_funded":1,"file_date_updated":"2025-12-30T09:31:11Z","corr_author":"1","abstract":[{"text":"Scanning Kelvin probe microscopy (SKPM) is a powerful technique for macroscopic imaging of the electrostatic potential above a surface. Though most often used to image work-function variations of conductive surfaces, it can also be used to probe the surface charge on insulating surfaces. In both cases, relating the measured potential to the underlying signal is non-trivial. Here, general relationships are derived between the measured SKPM voltage and the underlying source, revealing either can be cast as a convolution with an appropriately scaled point spread function (PSF). For charge that exists on a thin insulating layer above a conductor, the PSF has the same shape as what would occur from a work-function variation alone, differing by a simple scaling factor. This relationship is confirmed by: (1) backing it out from finite-element simulations of work-function and charge signals, and (2) experimentally comparing the measured PSF from a small work-function target to that from a small charge spot. This scaling factor is further validated by comparing SKPM charge measurements with Faraday cup measurements for highly charged samples from contact-charging experiments. These results highlight a heretofore unappreciated connection between SKPM voltage and charge signals, offering a rigorous recipe to extract either from experimental data.","lang":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"article_number":"e00521","year":"2025","volume":12,"title":"A duality between surface charge and work function in scanning Kelvin probe microscopy","oa":1,"day":"01","OA_type":"gold"},{"author":[{"first_name":"Fabian","last_name":"Kresse","full_name":"Kresse, Fabian","id":"faff3c84-23f6-11ef-9085-e5187b51c604"},{"last_name":"Yu","first_name":"Zhengqi","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","full_name":"Yu, Zhengqi"},{"first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"arxiv":1,"external_id":{"arxiv":["2505.19932"]},"OA_place":"publisher","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","acknowledgement":"This work is supported in part by the ERC grant under Grant No. ERC-2020-AdG 101020093 and\r\nthe Austrian Science Fund (FWF) [10.55776/COE12]. This research was supported by the Scientific\r\nService Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","file":[{"file_name":"2025_NeuS_Kresse.pdf","checksum":"90a32defed34787e771a5c1623b6b0d2","success":1,"file_size":295466,"access_level":"open_access","relation":"main_file","date_created":"2025-09-09T08:10:13Z","content_type":"application/pdf","creator":"dernst","date_updated":"2025-09-09T08:10:13Z","file_id":"20314"}],"citation":{"short":"F. Kresse, E. Yu, C. Lampert, T.A. Henzinger, in:, 2nd International Conferenceon Neuro-Symbolic Systems, ML Research Press, 2025.","mla":"Kresse, Fabian, et al. “Logic Gate Neural Networks Are Good for Verification.” 2nd International Conferenceon Neuro-Symbolic Systems, vol. 288, 26, ML Research Press, 2025.","ista":"Kresse F, Yu E, Lampert C, Henzinger TA. 2025. Logic gate neural networks are good for verification. 2nd International Conferenceon Neuro-Symbolic Systems. NeuS: International Conferenceon Neuro-Symbolic Systems, PMLR, vol. 288, 26.","chicago":"Kresse, Fabian, Emily Yu, Christoph Lampert, and Thomas A Henzinger. “Logic Gate Neural Networks Are Good for Verification.” In 2nd International Conferenceon Neuro-Symbolic Systems, Vol. 288. ML Research Press, 2025.","ama":"Kresse F, Yu E, Lampert C, Henzinger TA. Logic gate neural networks are good for verification. In: 2nd International Conferenceon Neuro-Symbolic Systems. Vol 288. ML Research Press; 2025.","ieee":"F. Kresse, E. Yu, C. Lampert, and T. A. Henzinger, “Logic gate neural networks are good for verification,” in 2nd International Conferenceon Neuro-Symbolic Systems, Philadephia, PA, United States, 2025, vol. 288.","apa":"Kresse, F., Yu, E., Lampert, C., & Henzinger, T. A. (2025). Logic gate neural networks are good for verification. In 2nd International Conferenceon Neuro-Symbolic Systems (Vol. 288). Philadephia, PA, United States: ML Research Press."},"publisher":"ML Research Press","department":[{"_id":"ChLa"},{"_id":"ToHe"}],"date_created":"2025-09-07T22:01:34Z","status":"public","month":"06","date_published":"2025-06-01T00:00:00Z","quality_controlled":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"intvolume":" 288","publication_identifier":{"eissn":["2640-3498"]},"_id":"20296","ec_funded":1,"file_date_updated":"2025-09-09T08:10:13Z","publication_status":"published","volume":288,"title":"Logic gate neural networks are good for verification","alternative_title":["PMLR"],"year":"2025","OA_type":"diamond","day":"01","conference":{"start_date":"2025-05-28","name":"NeuS: International Conferenceon Neuro-Symbolic Systems","end_date":"2025-05-30","location":"Philadephia, PA, United States"},"oa":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"corr_author":"1","abstract":[{"text":"Learning-based systems are increasingly deployed across various domains, yet the complexity of traditional neural networks poses significant challenges for formal verification. Unlike conventional neural networks, learned Logic Gate Networks (LGNs) replace multiplications with Boolean logic gates, yielding a sparse, netlist-like architecture that is inherently more amenable to symbolic verification, while still delivering promising performance. In this paper, we introduce a SAT encoding for verifying global robustness and fairness in LGNs. We evaluate our method on five benchmark datasets, including a newly constructed 5-class variant, and find that LGNs are both verification-friendly and maintain strong predictive performance.","lang":"eng"}],"article_number":"26","language":[{"iso":"eng"}],"article_processing_charge":"No","date_updated":"2025-09-09T08:12:44Z","type":"conference","publication":"2nd International Conferenceon Neuro-Symbolic Systems","ddc":["000"],"scopus_import":"1"},{"date_published":"2025-07-01T00:00:00Z","quality_controlled":"1","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"_id":"20297","intvolume":" 286","publication_identifier":{"eissn":["2640-3498"]},"publisher":"ML Research Press","citation":{"ama":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. Limit-sure reachability for small memory policies in POMDPs is NP-complete. In: The 41st Conference on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:238-247.","apa":"Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.","ieee":"A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and A. Shafiee, “Limit-sure reachability for small memory policies in POMDPs is NP-complete,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 238–247.","short":"A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, A. Shafiee, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 238–247.","mla":"Asadi, Ali, et al. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” The 41st Conference on Uncertainty in Artificial Intelligence, vol. 286, ML Research Press, 2025, pp. 238–47.","ista":"Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. 2025. Limit-sure reachability for small memory policies in POMDPs is NP-complete. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 238–247.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Ali Shafiee. “Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:238–47. ML Research Press, 2025."},"date_created":"2025-09-07T22:01:34Z","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"page":"238-247","month":"07","status":"public","file":[{"content_type":"application/pdf","creator":"dernst","date_updated":"2025-09-09T08:19:41Z","file_id":"20315","file_name":"2025_UAI_AsadiAli.pdf","file_size":307458,"checksum":"1a37ebe7ba73ab6985765bf0d17a0acc","success":1,"access_level":"open_access","relation":"main_file","date_created":"2025-09-09T08:19:41Z"}],"has_accepted_license":"1","acknowledgement":"This research was partially supported by Austrian Science Fund (FWF) 10.55776/COE12, the support of the French Agence Nationale de la Recherche (ANR) under reference ANR-21-CE40-0020 (CONVERGENCE project), and the ERC CoG 863818 (ForM-SMArt) grant.","external_id":{"arxiv":["2412.00941"]},"arxiv":1,"author":[{"full_name":"Asadi, Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","first_name":"Ali"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Raimundo J","last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J"},{"id":"2783031a-7378-11f0-b2d0-f17f1db2ebad","full_name":"Shafiee, Ali","first_name":"Ali","last_name":"Shafiee"}],"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","publication":"The 41st Conference on Uncertainty in Artificial Intelligence","type":"conference","date_updated":"2025-09-09T08:21:45Z","scopus_import":"1","ddc":["000"],"article_processing_charge":"No","year":"2025","alternative_title":["PMLR"],"title":"Limit-sure reachability for small memory policies in POMDPs is NP-complete","volume":286,"oa":1,"OA_type":"diamond","conference":{"start_date":"2025-07-21","end_date":"2025-07-25","location":"Rio de Janeiro, Brazil","name":"UAI: Conference on Uncertainty in Artificial Intelligence"},"day":"01","abstract":[{"text":"A standard model that arises in several applications in sequential decision-making is partially observable Markov decision processes (POMDPs) where a decision-making agent interacts with an uncertain environment. A basic objective in POMDPs is the reachability objective, where given a target set of states, the goal is to eventually arrive at one of them.\r\n\r\nThe limit-sure problem asks whether reachability can be ensured with probability arbitrarily close to 1. In general, the limit-sure reachability problem for POMDPs is undecidable. However, in many practical cases, the most relevant question is the existence of policies with a small amount of memory. In this work, we study the limit-sure reachability problem for POMDPs with a fixed amount of memory. We establish that the computational complexity of the problem is NP-complete.","lang":"eng"}],"corr_author":"1","language":[{"iso":"eng"}],"ec_funded":1,"file_date_updated":"2025-09-09T08:19:41Z","publication_status":"published"},{"publication_identifier":{"eissn":["2640-3498"]},"intvolume":" 258","_id":"20298","quality_controlled":"1","date_published":"2025-05-01T00:00:00Z","status":"public","month":"05","page":"118-126","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_created":"2025-09-07T22:01:34Z","department":[{"_id":"ChLa"}],"publisher":"ML Research Press","citation":{"short":"N. Kalinin, L. Steinberger, in:, Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 118–126.","mla":"Kalinin, Nikita, and Lukas Steinberger. “Efficient Estimation of a Gaussian Mean with Local Differential Privacy.” Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 118–26.","ista":"Kalinin N, Steinberger L. 2025. Efficient estimation of a Gaussian mean with local differential privacy. Proceedings of the 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 118–126.","chicago":"Kalinin, Nikita, and Lukas Steinberger. “Efficient Estimation of a Gaussian Mean with Local Differential Privacy.” In Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, 258:118–26. ML Research Press, 2025.","ieee":"N. Kalinin and L. Steinberger, “Efficient estimation of a Gaussian mean with local differential privacy,” in Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 118–126.","apa":"Kalinin, N., & Steinberger, L. (2025). Efficient estimation of a Gaussian mean with local differential privacy. In Proceedings of the 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 118–126). Mai Khao, Thailand: ML Research Press.","ama":"Kalinin N, Steinberger L. Efficient estimation of a Gaussian mean with local differential privacy. In: Proceedings of the 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:118-126."},"has_accepted_license":"1","acknowledgement":"We would like to express our gratitude to Christoph Lampert for his valuable insights and fruitful discussions that significantly contributed to the development of this paper.\r\nWe also thank Salil Vadhan for his constructive feedback on an earlier version of this draft.\r\nThe second author gratefully acknowledges support by the Austrian Science Fund (FWF): I 5484-N, as part of the Research Unit 5381 of the German Research Foundation.","file":[{"file_name":"2025_AISTATS_Kalinin.pdf","file_size":395864,"success":1,"checksum":"3dcd59988ca974b98662ba09a516e616","date_created":"2025-09-09T08:26:44Z","access_level":"open_access","relation":"main_file","creator":"dernst","content_type":"application/pdf","date_updated":"2025-09-09T08:26:44Z","file_id":"20316"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","author":[{"last_name":"Kalinin","first_name":"Nikita","full_name":"Kalinin, Nikita","id":"4b14526e-14d2-11ed-ba64-c14c9553d137"},{"full_name":"Steinberger, Lukas","last_name":"Steinberger","first_name":"Lukas"}],"arxiv":1,"external_id":{"arxiv":["2402.04840"]},"ddc":["000"],"scopus_import":"1","date_updated":"2025-09-09T08:28:41Z","type":"conference","publication":"Proceedings of the 28th International Conference on Artificial Intelligence and Statistics","article_processing_charge":"No","language":[{"iso":"eng"}],"corr_author":"1","abstract":[{"lang":"eng","text":"In this paper, we study the problem of estimating the unknown mean Ξ of a unit variance Gaussian distribution in a locally differentially private (LDP) way. In the high-privacy regime (ϔ≀1\r\n), we identify an optimal privacy mechanism that minimizes the variance of the estimator asymptotically. Our main technical contribution is the maximization of the Fisher-Information of the sanitized data with respect to the local privacy mechanism Q. We find that the exact solution QΞ,Ï” of this maximization is the sign mechanism that applies randomized response to the sign of Xi−ξ, where X1,
,Xn are the confidential iid original samples. However, since this optimal local mechanism depends on the unknown mean Ξ, we employ a two-stage LDP parameter estimation procedure which requires splitting agents into two groups. The first n1 observations are used to consistently but not necessarily efficiently estimate the parameter Ξ by Ξn1~\r\n. Then this estimate is updated by applying the sign mechanism with Ξ~n1 instead of Ξ\r\n to the remaining n−n1 observations, to obtain an LDP and efficient estimator of the unknown mean."}],"OA_type":"diamond","day":"01","conference":{"start_date":"2025-05-03","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2025-05-05","location":"Mai Khao, Thailand"},"oa":1,"volume":258,"title":"Efficient estimation of a Gaussian mean with local differential privacy","year":"2025","alternative_title":["PMLR"],"publication_status":"published","file_date_updated":"2025-09-09T08:26:44Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","arxiv":1,"external_id":{"arxiv":["2506.12254"]},"author":[{"id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","full_name":"Asadi, Ali","first_name":"Ali","last_name":"Asadi"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"De Raaij, Jakob","first_name":"Jakob","last_name":"De Raaij"}],"OA_place":"publisher","file":[{"file_name":"2025_UAI_Asadi.pdf","checksum":"4180c81bb6ed3b4f5c7a8e48d06520c6","success":1,"file_size":317097,"date_created":"2025-09-09T06:27:59Z","access_level":"open_access","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_id":"20313","date_updated":"2025-09-09T06:27:59Z"}],"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12.\r\n","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"page":"223-232","month":"01","status":"public","publisher":"ML Research Press","citation":{"ama":"Asadi A, Chatterjee K, De Raaij J. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In: The 41st Conference on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:223-232.","apa":"Asadi, A., Chatterjee, K., & De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press.","ieee":"A. Asadi, K. Chatterjee, and J. De Raaij, “Lower bound on Howard policy iteration for deterministic Markov Decision Processes,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 223–232.","chicago":"Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” In The 41st Conference on Uncertainty in Artificial Intelligence, 286:223–32. ML Research Press, 2025.","ista":"Asadi A, Chatterjee K, De Raaij J. 2025. Lower bound on Howard policy iteration for deterministic Markov Decision Processes. The 41st Conference on Uncertainty in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 286, 223–232.","short":"A. Asadi, K. Chatterjee, J. De Raaij, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 223–232.","mla":"Asadi, Ali, et al. “Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes.” The 41st Conference on Uncertainty in Artificial Intelligence, vol. 286, ML Research Press, 2025, pp. 223–32."},"date_created":"2025-09-07T22:01:34Z","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"_id":"20299","intvolume":" 286","publication_identifier":{"eissn":["2640-3498"]},"date_published":"2025-01-01T00:00:00Z","project":[{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"quality_controlled":"1","publication_status":"published","ec_funded":1,"file_date_updated":"2025-09-09T06:27:59Z","corr_author":"1","abstract":[{"lang":"eng","text":"Deterministic Markov Decision Processes (DMDPs) are a mathematical framework for decision-making where the outcomes and future possible actions are deterministically determined by the current action taken. DMDPs can be viewed as a finite directed weighted graph, where in each step, the controller chooses an outgoing edge. An objective is a measurable function on runs (or infinite trajectories) of the DMDP, and the value for an objective is the maximal cumulative reward (or weight) that the controller can guarantee. We consider the classical mean-payoff (aka limit-average) objective, which is a basic and fundamental objective.\r\n\r\nHoward's policy iteration algorithm is a popular method for solving DMDPs with mean-payoff objectives. Although Howard's algorithm performs well in practice, as experimental studies suggested, the best known upper bound is exponential and the current known lower bound is as follows: For the input size I, the algorithm requires (math formular) iterations, where (math formular) hides the poly-logarithmic factors, i.e., the current lower bound on iterations is sub-linear with respect to the input size. Our main result is an improved lower bound for this fundamental algorithm where we show that for the input size I, the algorithm requires (math formular) iterations."}],"language":[{"iso":"eng"}],"alternative_title":["PMLR"],"year":"2025","volume":286,"title":"Lower bound on Howard policy iteration for deterministic Markov Decision Processes","oa":1,"day":"01","OA_type":"diamond","conference":{"name":"UAI: Conference on Uncertainty in Artificial Intelligence","location":"Rio de Janeiro, Brazil","end_date":"2025-07-25","start_date":"2025-07-21"},"article_processing_charge":"No","scopus_import":"1","ddc":["000"],"type":"conference","publication":"The 41st Conference on Uncertainty in Artificial Intelligence","date_updated":"2025-09-09T06:31:20Z"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2503.08849","open_access":"1"}],"publication_status":"published","year":"2025","alternative_title":["PMLR"],"volume":258,"title":"Learning Pareto manifolds in high dimensions: How can regularization help?","oa":1,"OA_type":"green","conference":{"start_date":"2025-05-03","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2025-05-05","location":"Mai Khao, Thailand"},"day":"01","abstract":[{"lang":"eng","text":"Simultaneously addressing multiple objectives is becoming increasingly important in modern machine learning. At the same time, data is often high-dimensional and costly to label. For a single objective such as prediction risk, conventional regularization techniques are known to improve generalization when the data exhibits low-dimensional structure like sparsity. However, it is largely unexplored how to leverage this structure in the context of multi-objective learning (MOL) with multiple competing objectives. In this work, we discuss how the application of vanilla regularization approaches can fail, and propose a two-stage MOL framework that can successfully leverage low-dimensional structure. We demonstrate its effectiveness experimentally for multi-distribution learning and fairness-risk trade-offs."}],"language":[{"iso":"eng"}],"article_processing_charge":"No","type":"conference","publication":"The 28th International Conference on Artificial Intelligence and Statistics","date_updated":"2025-09-09T07:00:34Z","scopus_import":"1","external_id":{"arxiv":["2503.08849"]},"arxiv":1,"author":[{"full_name":"Wegel, Tobias","first_name":"Tobias","last_name":"Wegel"},{"first_name":"Filip","last_name":"Kovačević","full_name":"Kovačević, Filip","id":"d0258e7b-50b8-11ef-ad56-8b9f537b6b1b"},{"last_name":"Ćąifrea","first_name":"Alexandru","full_name":"Ćąifrea, Alexandru"},{"first_name":"Fanny","last_name":"Yang","full_name":"Yang, Fanny"}],"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","acknowledgement":"We thank Junhyung Park for valuable feedback on the manuscript. AT was supported by a PhD fellowship from the Swiss Data Science Center. TW was supported by the SNF Grant 204439. This work was done in part while TW and FY were visiting the Simons Institute for the Theory of\r\nComputing.","publisher":"ML Research Press","citation":{"ista":"Wegel T, Kovačević F, Ćąifrea A, Yang F. 2025. Learning Pareto manifolds in high dimensions: How can regularization help? The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 4591–4599.","mla":"Wegel, Tobias, et al. “Learning Pareto Manifolds in High Dimensions: How Can Regularization Help?” The 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 4591–99.","short":"T. Wegel, F. Kovačević, A. Ćąifrea, F. Yang, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 4591–4599.","chicago":"Wegel, Tobias, Filip Kovačević, Alexandru Ćąifrea, and Fanny Yang. “Learning Pareto Manifolds in High Dimensions: How Can Regularization Help?” In The 28th International Conference on Artificial Intelligence and Statistics, 258:4591–99. ML Research Press, 2025.","ieee":"T. Wegel, F. Kovačević, A. Ćąifrea, and F. Yang, “Learning Pareto manifolds in high dimensions: How can regularization help?,” in The 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 4591–4599.","apa":"Wegel, T., Kovačević, F., Ćąifrea, A., & Yang, F. (2025). Learning Pareto manifolds in high dimensions: How can regularization help? In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 4591–4599). Mai Khao, Thailand: ML Research Press.","ama":"Wegel T, Kovačević F, Ćąifrea A, Yang F. Learning Pareto manifolds in high dimensions: How can regularization help? In: The 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:4591-4599."},"date_created":"2025-09-07T22:01:35Z","department":[{"_id":"MaMo"}],"page":"4591-4599","month":"05","status":"public","date_published":"2025-05-01T00:00:00Z","quality_controlled":"1","_id":"20300","intvolume":" 258","publication_identifier":{"eissn":["2640-3498"]}},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.11341","open_access":"1"}],"ec_funded":1,"publication_status":"published","title":"Differentially private continual release of histograms and related queries","volume":258,"year":"2025","alternative_title":["PMLR"],"conference":{"start_date":"2025-05-03","end_date":"2025-05-05","location":"Mai Khao, Thailand","name":"AISTATS: Conference on Artificial Intelligence and Statistics"},"OA_type":"green","day":"01","oa":1,"abstract":[{"text":"We study privately releasing column sums of a d-dimensional table with entries from a universe χ undergoing T row updates, called histogram under continual release. Our mechanisms give better additive ℓ∞-error than existing mechanisms for a large class of queries and input streams. Our first contribution is an output-sensitive mechanism in the insertions-only model (χ = {0, 1}) for maintaining (i) the histogram or (ii) queries that do not require maintaining the entire histogram, such as the maximum or minimum column sum, the median, or any quantiles. The mechanism has an additive error of O(d log2 (dq∗) + log T) whp, where q∗ is the maximum output value over all time steps on this dataset. The mechanism does not require q∗ as input. This breaks the ℩(d log T) bound of prior work when q∗ â‰Ș T. Our second contribution is a mechanism for the turnstile model that admits negative entry updates (χ = {−1, 0, 1}). This mechanism has an additive error of O(d log2(dK) + log T) whp, where K is the number of times two consecutive data rows differ, and the mechanism does not require K as input. This is useful when monitoring inputs that only vary under unusual circumstances. For d = 1 this gives the first\r\nprivate mechanism with error O(log2 K + log T) for continual counting in the turnstile model, improving on the O(log2 n + log T) error bound by Dwork et al. (2015), where n is the number of ones in the stream, as well as allowing negative entries, while Dwork et al. (2015) can only handle nonnegative entries (χ = {0, 1}). ","lang":"eng"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","date_updated":"2025-09-09T07:09:22Z","type":"conference","publication":"The 28th International Conference on Artificial Intelligence and Statistics","scopus_import":"1","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Sricharan, A. R.","last_name":"Sricharan","first_name":"A. R."},{"full_name":"Steiner, Teresa Anna","first_name":"Teresa Anna","last_name":"Steiner"}],"external_id":{"arxiv":["2302.11341"]},"arxiv":1,"OA_place":"repository","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"MH: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. TAS: This work was supported by a research grant (VIL51463)\r\nfrom VILLUM FONDEN.","publisher":"ML Research Press","citation":{"chicago":"Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Differentially Private Continual Release of Histograms and Related Queries.” In The 28th International Conference on Artificial Intelligence and Statistics, 258:1990–98. ML Research Press, 2025.","ista":"Henzinger M, Sricharan AR, Steiner TA. 2025. Differentially private continual release of histograms and related queries. The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 1990–1998.","short":"M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 1990–1998.","mla":"Henzinger, Monika, et al. “Differentially Private Continual Release of Histograms and Related Queries.” The 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 1990–98.","apa":"Henzinger, M., Sricharan, A. R., & Steiner, T. A. (2025). Differentially private continual release of histograms and related queries. In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 1990–1998). Mai Khao, Thailand: ML Research Press.","ieee":"M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Differentially private continual release of histograms and related queries,” in The 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 1990–1998.","ama":"Henzinger M, Sricharan AR, Steiner TA. Differentially private continual release of histograms and related queries. In: The 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:1990-1998."},"date_created":"2025-09-07T22:01:35Z","department":[{"_id":"MoHe"}],"page":"1990-1998","status":"public","month":"05","date_published":"2025-05-01T00:00:00Z","quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775"}],"publication_identifier":{"eissn":["2640-3498"]},"intvolume":" 258","_id":"20301"},{"quality_controlled":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"date_published":"2025-05-01T00:00:00Z","intvolume":" 258","publication_identifier":{"eissn":["2640-3498"]},"_id":"20302","department":[{"_id":"KrCh"}],"date_created":"2025-09-07T22:01:35Z","citation":{"apa":"Luo, R., Stich, S. U., HorvĂĄth, S., & Takáč, M. (2025). Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 2539–2547). Mai Khao, Thailand: ML Research Press.","ieee":"R. Luo, S. U. Stich, S. HorvĂĄth, and M. Takáč, “Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis,” in The 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 2539–2547.","ama":"Luo R, Stich SU, HorvĂĄth S, Takáč M. Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In: The 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:2539-2547.","mla":"Luo, Ruichen, et al. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” The 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 2539–47.","short":"R. Luo, S.U. Stich, S. HorvĂĄth, M. Takáč, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 2539–2547.","ista":"Luo R, Stich SU, HorvĂĄth S, Takáč M. 2025. Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 2539–2547.","chicago":"Luo, Ruichen, Sebastian U. Stich, Samuel HorvĂĄth, and Martin Takáč. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” In The 28th International Conference on Artificial Intelligence and Statistics, 258:2539–47. ML Research Press, 2025."},"publisher":"ML Research Press","status":"public","month":"05","page":"2539-2547","acknowledgement":"The authors thank for the helpful discussions with Eduard Gorbunov, Kumar Kshitij Patel, Anton\r\nRodomanov, and Ali Zindari during the preparation of this work. This work was partially done during the first author’s stays at CISPA and at MBZUAI. The first author also acknowledges ERC CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12.","OA_place":"repository","author":[{"id":"b391db08-1ffe-11ee-8b67-d18ddcfb5a14","full_name":"Luo, Ruichen","first_name":"Ruichen","last_name":"Luo"},{"first_name":"Sebastian U.","last_name":"Stich","full_name":"Stich, Sebastian U."},{"first_name":"Samuel","last_name":"HorvĂĄth","full_name":"HorvĂĄth, Samuel"},{"full_name":"Takáč, Martin","first_name":"Martin","last_name":"Takáč"}],"external_id":{"arxiv":["2501.04443"]},"arxiv":1,"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-09-09T07:17:08Z","type":"conference","publication":"The 28th International Conference on Artificial Intelligence and Statistics","scopus_import":"1","article_processing_charge":"No","conference":{"end_date":"2025-05-05","location":"Mai Khao, Thailand","name":"AISTATS: Conference on Artificial Intelligence and Statistics","start_date":"2025-05-03"},"day":"01","OA_type":"green","oa":1,"title":"Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis","volume":258,"alternative_title":["PMLR"],"year":"2025","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"LocalSGD and SCAFFOLD are widely used methods in distributed stochastic optimization, with numerous applications in machine learning, large-scale data processing, and federated learning. However, rigorously establishing their theoretical advantages over simpler methods, such as minibatch SGD (MbSGD), has proven challenging, as existing analyses often rely on strong assumptions, unrealistic premises, or overly restrictive scenarios.\r\n\r\nIn this work, we revisit the convergence properties of LocalSGD and SCAFFOLD under a variety of existing or weaker conditions, including gradient similarity, Hessian similarity, weak convexity, and Lipschitz continuity of the Hessian. Our analysis shows that (i) LocalSGD achieves faster convergence compared to MbSGD for weakly convex functions without requiring stronger gradient similarity assumptions; (ii) LocalSGD benefits significantly from higher-order similarity and smoothness; and (iii) SCAFFOLD demonstrates faster convergence than MbSGD for a broader class of non-quadratic functions. These theoretical insights provide a clearer understanding of the conditions under which LocalSGD and SCAFFOLD outperform MbSGD."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2501.04443"}],"ec_funded":1,"publication_status":"published"}]