--- OA_place: publisher OA_type: diamond _id: '20668' abstract: - lang: eng text: "The Message Layer Security (MLS) protocol has recently been standardized by the IETF. MLS is a scalable secure group messaging protocol expected to run more efficiently compared to the Signal protocol at scale, while offering a similar level of strong security. Even though MLS has undergone extensive examination by researchers, the majority of the works have focused on confidentiality.\r\n\r\nIn this work, we focus on the authenticity of the application messages exchanged in MLS. Currently, MLS authenticates every application message with an EdDSA signature and while manageable, the overhead is greatly amplified in the post-quantum setting as the NIST-recommended Dilithium signature results in a 40x increase in size. We view this as an invitation to explore new authentication modes that can be used instead. We start by taking a systematic view on how application messages are authenticated in MLS and categorize authenticity into four different security notions. We then propose several authentication modes, offering a range of different efficiency and security profiles. For instance, in one of our modes, COSMOS++, we replace signatures with one-time tokens and a MAC tag, offering roughly a 75x savings in the post-quantum communication overhead. While this comes at the cost of weakening security compared to the authentication mode used by MLS, the lower communication overhead seems to make it a worthwhile trade-off with security." acknowledgement: This research was partially supported by JST CREST JPMJCR22M1, Japan and funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385. article_processing_charge: No author: - first_name: Keitaro full_name: Hashimoto, Keitaro last_name: Hashimoto - first_name: Shuichi full_name: Katsumata, Shuichi last_name: Katsumata - first_name: Guillermo full_name: Pascual Perez, Guillermo id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87 last_name: Pascual Perez orcid: 0000-0001-8630-415X citation: ama: 'Hashimoto K, Katsumata S, Pascual Perez G. Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable. In: 34th Usenix Security Symposium. Usenix Association; 2025:6699-6716.' apa: 'Hashimoto, K., Katsumata, S., & Pascual Perez, G. (2025). Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable. In 34th Usenix Security Symposium (pp. 6699–6716). Seattle, WA, USA: Usenix Association.' chicago: 'Hashimoto, Keitaro, Shuichi Katsumata, and Guillermo Pascual Perez. “Exploring How to Authenticate Application Messages in MLS: More Efficient, Post-Quantum, and Anonymous Blocklistable.” In 34th Usenix Security Symposium, 6699–6716. Usenix Association, 2025.' ieee: 'K. Hashimoto, S. Katsumata, and G. Pascual Perez, “Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable,” in 34th Usenix Security Symposium, Seattle, WA, USA, 2025, pp. 6699–6716.' ista: 'Hashimoto K, Katsumata S, Pascual Perez G. 2025. Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable. 34th Usenix Security Symposium. USENIX: Security Symposium, 6699–6716.' mla: 'Hashimoto, Keitaro, et al. “Exploring How to Authenticate Application Messages in MLS: More Efficient, Post-Quantum, and Anonymous Blocklistable.” 34th Usenix Security Symposium, Usenix Association, 2025, pp. 6699–716.' short: K. Hashimoto, S. Katsumata, G. Pascual Perez, in:, 34th Usenix Security Symposium, Usenix Association, 2025, pp. 6699–6716. conference: end_date: 2025-08-15 location: Seattle, WA, USA name: 'USENIX: Security Symposium' start_date: 2025-08-13 corr_author: '1' cryptoeprintid: 1 das_tickbox: '1' date_created: 2025-11-23T23:01:40Z date_published: 2025-01-01T00:00:00Z date_updated: 2026-09-07T11:37:56Z day: '01' ddc: - '000' ec_funded: 1 external_id: cryptoeprintid: - 2025/426 file: - access_level: open_access checksum: fcfe8851aeb751af98c0b1335a0ef149 content_type: application/pdf creator: dernst date_created: 2025-11-24T07:44:08Z date_updated: 2025-11-24T07:44:08Z file_id: '20671' file_name: 2025_Usenix_Hashimoto.pdf file_size: 710733 relation: main_file success: 1 file_date_updated: 2025-11-24T07:44:08Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2025/426 month: '01' oa: 1 oa_version: Published Version page: 6699-6716 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: 34th Usenix Security Symposium publication_identifier: isbn: - '9781939133526' publication_status: published publisher: Usenix Association quality_controlled: '1' scopus_import: '1' status: public title: 'Exploring how to authenticate application messages in MLS: More efficient, post-quantum, and anonymous blocklistable' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher OA_type: free access _id: '22774' abstract: - lang: eng text: We consider the problem of certifying the feasibility of a (possibly degenerate) semidefinite programming problem represented by rational input data together with a numerical solution that is guaranteed to be sufficiently close to an exact solution of maximal rank. Our method constructs a polynomial system whose set of real solutions has an isolated point that satisfies the input program. An experimental comparison between the corresponding symbolic-numerical algorithm and the purely symbolic algorithm from [3, 5] shows that the hybrid algorithm is able to certify instances where the exact method fails. acknowledgement: "This extended abstract is based on the paper [7], accepted for publication at SIAM\r\nJ. Opt. on April 22, 2025, to which we refer for technical details and complete proofs. This work has been\r\nsupported by the Doctoral Programme Vienna Graduate School on Computational Optimization (VGSCO)\r\nwhich was funded by FWF (Austrian Science Fund), project W 1260-N35, and partially supported by the\r\nANR JCJC project ANR-21-CE48-0006-01 “HYPERSPACE”.\r\n" article_processing_charge: No article_type: original author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Simone full_name: Naldi, Simone last_name: Naldi - first_name: Jeferson full_name: Zapata, Jeferson id: 00223538-AF8F-11E9-A4C7-F729E6697425 last_name: Zapata citation: ama: Kolmogorov V, Naldi S, Zapata J. Certifying solutions of degenerate semidefinite programs. ACM Communications in Computer Algebra. 2025;59(4):147-152. doi:10.1145/3832046.3832063 apa: Kolmogorov, V., Naldi, S., & Zapata, J. (2025). Certifying solutions of degenerate semidefinite programs. ACM Communications in Computer Algebra. ACM. https://doi.org/10.1145/3832046.3832063 chicago: Kolmogorov, Vladimir, Simone Naldi, and Jeferson Zapata. “Certifying Solutions of Degenerate Semidefinite Programs.” ACM Communications in Computer Algebra. ACM, 2025. https://doi.org/10.1145/3832046.3832063. ieee: V. Kolmogorov, S. Naldi, and J. Zapata, “Certifying solutions of degenerate semidefinite programs,” ACM Communications in Computer Algebra, vol. 59, no. 4. ACM, pp. 147–152, 2025. ista: Kolmogorov V, Naldi S, Zapata J. 2025. Certifying solutions of degenerate semidefinite programs. ACM Communications in Computer Algebra. 59(4), 147–152. mla: Kolmogorov, Vladimir, et al. “Certifying Solutions of Degenerate Semidefinite Programs.” ACM Communications in Computer Algebra, vol. 59, no. 4, ACM, 2025, pp. 147–52, doi:10.1145/3832046.3832063. short: V. Kolmogorov, S. Naldi, J. Zapata, ACM Communications in Computer Algebra 59 (2025) 147–152. corr_author: '1' date_created: 2026-08-30T22:01:44Z date_published: 2025-12-01T00:00:00Z date_updated: 2026-09-09T08:17:05Z day: '01' department: - _id: VlKo doi: 10.1145/3832046.3832063 external_id: unknown: - '2405.13625' fulldoi: https://doi.org/10.1145/3832046.3832063 intvolume: ' 59' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1145/3832046.3832063 month: '12' oa: 1 oa_version: Published Version page: 147-152 project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: W1260-N35 name: Vienna Graduate School on Computational Optimization publication: ACM Communications in Computer Algebra publication_identifier: eissn: - 1932-2240 issn: - 1932-2232 publication_status: published publisher: ACM scopus_import: '1' status: public title: Certifying solutions of degenerate semidefinite programs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 59 year: '2025' ... --- OA_place: publisher OA_type: gold _id: '22826' abstract: - lang: eng text: "Large Language Models (LLMs) have demonstrated the ability to tackle increasingly complex tasks through advanced reasoning, long-form content generation,\r\nand tool use. Solving these tasks often involves long inference-time computations.\r\nIn human problem solving, a common strategy to expedite work is collaboration: by\r\ndividing the problem into sub-tasks, exploring different strategies concurrently, etc.\r\nRecent research has shown that LLMs can also operate in parallel by implementing\r\nexplicit cooperation frameworks, such as voting mechanisms or the explicit creation of independent sub-tasks that can be executed in parallel. However, each of\r\nthese frameworks may not be suitable for all types of tasks, which can hinder their\r\napplicability. In this work, we propose a different design approach: we run LLM\r\n“workers” in parallel , allowing them to synchronize via a concurrently-updated\r\nattention cache and prompt these workers to decide how best to collaborate. Our\r\napproach allows the LLM instances to come up with their own collaboration strategy for the problem at hand, all the while “seeing” each other’s memory in the\r\nconcurrent KV cache. We implement this approach via Hogwild! Inference: a\r\nparallel LLM inference engine where multiple instances of the same LLM run in\r\nparallel with the same attention cache, with “instant” access to each other’s memory.1 Hogwild! Inference takes advantage of Rotary Position Embeddings (RoPE)\r\nto avoid recomputation while improving parallel hardware utilization. We find that\r\nmodern reasoning-capable LLMs can perform inference with shared Key-Value\r\ncache out of the box, without additional fine-tuning." acknowledgement: "We thank Vladimir Malinovskii for his help with brainstorming, helpful\r\nfeedback and suggesting future work directions. We also thank Philip Zmushko for proofreading." alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No author: - first_name: Gleb full_name: Rodionov, Gleb last_name: Rodionov - first_name: Roman full_name: Garipov, Roman last_name: Garipov - first_name: Alina full_name: Shutova, Alina last_name: Shutova - first_name: George full_name: Yakushev, George last_name: Yakushev - first_name: Erik full_name: Schultheis, Erik id: 2786b299-e6b0-11f0-91da-9243fe3ef96b last_name: Schultheis - first_name: Vage full_name: Egiazarian, Vage id: 77451e76-92b2-11ef-a4d1-8dbaa06e16ad last_name: Egiazarian - first_name: Anton full_name: Sinitsin, Anton last_name: Sinitsin - first_name: Denis full_name: Kuznedelev, Denis last_name: Kuznedelev - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Rodionov G, Garipov R, Shutova A, et al. Hogwild! Inference: Parallel LLM generation via concurrent attention. In: 39th Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025:52014-52055. doi:10.52202/085713-1551' apa: 'Rodionov, G., Garipov, R., Shutova, A., Yakushev, G., Schultheis, E., Egiazarian, V., … Alistarh, D.-A. (2025). Hogwild! Inference: Parallel LLM generation via concurrent attention. In 39th Conference on Neural Information Processing Systems (Vol. 38, pp. 52014–52055). San Diego, CA, United States: Neural Information Processing Systems Foundation. https://doi.org/10.52202/085713-1551' chicago: 'Rodionov, Gleb, Roman Garipov, Alina Shutova, George Yakushev, Erik Schultheis, Vage Egiazarian, Anton Sinitsin, Denis Kuznedelev, and Dan-Adrian Alistarh. “Hogwild! Inference: Parallel LLM Generation via Concurrent Attention.” In 39th Conference on Neural Information Processing Systems, 38:52014–55. Neural Information Processing Systems Foundation, 2025. https://doi.org/10.52202/085713-1551.' ieee: 'G. Rodionov et al., “Hogwild! Inference: Parallel LLM generation via concurrent attention,” in 39th Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38, pp. 52014–52055.' ista: 'Rodionov G, Garipov R, Shutova A, Yakushev G, Schultheis E, Egiazarian V, Sinitsin A, Kuznedelev D, Alistarh D-A. 2025. Hogwild! Inference: Parallel LLM generation via concurrent attention. 39th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 52014–52055.' mla: 'Rodionov, Gleb, et al. “Hogwild! Inference: Parallel LLM Generation via Concurrent Attention.” 39th Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 52014–55, doi:10.52202/085713-1551.' short: G. Rodionov, R. Garipov, A. Shutova, G. Yakushev, E. Schultheis, V. Egiazarian, A. Sinitsin, D. Kuznedelev, D.-A. Alistarh, in:, 39th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 52014–52055. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 das_tickbox: '0' date_created: 2026-09-06T22:01:59Z date_published: 2025-12-02T00:00:00Z date_updated: 2026-09-10T07:06:31Z day: '02' ddc: - '000' department: - _id: DaAl doi: 10.52202/085713-1551 fulldoi: https://doi.org/10.52202/085713-1551 has_accepted_license: '1' intvolume: ' 38' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.52202/085713-1551 month: '12' oa: 1 oa_version: Published Version page: 52014-52055 publication: 39th Conference on Neural Information Processing Systems publication_identifier: isbn: - '9798331338275' issn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: 'Hogwild! Inference: Parallel LLM generation via concurrent attention' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher OA_type: free access _id: '22825' abstract: - lang: eng text: "The empirical emergence of neural collapse—a surprising symmetry in the feature representations of the training data in the penultimate layer of deep neural\r\nnetworks—has spurred a line of theoretical research aimed at its understanding.\r\nHowever, existing work focuses on data-agnostic models or, when data structure is\r\ntaken into account, it remains limited to multi-layer perceptrons. Our paper fills\r\nboth these gaps by analyzing modern architectures in a data-aware regime: we\r\nprove that global optima of deep regularized transformers and residual networks\r\n(ResNets) with LayerNorm trained with cross entropy or mean squared error loss\r\nare approximately collapsed, and the approximation gets tighter as the depth grows.\r\nMore generally, we formally reduce any end-to-end large-depth ResNet or transformer training into an equivalent unconstrained features model, thus justifying its\r\nwide use in the literature even beyond data-agnostic settings. Our theoretical results\r\nare supported by experiments on computer vision and language datasets showing\r\nthat, as the depth grows, neural collapse indeed becomes more prominent." acknowledged_ssus: - _id: ScienComp acknowledgement: "M. M. and P. S. are funded by the European Union (ERC, INF2\r\n, project number 101161364). Views\r\nand opinions expressed are however those of the author(s) only and do not necessarily reflect those\r\nof the European Union or the European Research Council Executive Agency. Neither the European\r\nUnion nor the granting authority can be held responsible for them. This research was supported\r\nby the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp)." alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Peter full_name: Súkeník, Peter id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c last_name: Súkeník - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Súkeník P, Lampert C, Mondelli M. Neural collapse is globally optimal in deep regularized ResNets and transformers. In: 39th Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025:48646-48677. doi:10.52202/085713-1450' apa: 'Súkeník, P., Lampert, C., & Mondelli, M. (2025). Neural collapse is globally optimal in deep regularized ResNets and transformers. In 39th Conference on Neural Information Processing Systems (Vol. 38, pp. 48646–48677). San Diego, CA, United States: Neural Information Processing Systems Foundation. https://doi.org/10.52202/085713-1450' chicago: Súkeník, Peter, Christoph Lampert, and Marco Mondelli. “Neural Collapse Is Globally Optimal in Deep Regularized ResNets and Transformers.” In 39th Conference on Neural Information Processing Systems, 38:48646–77. Neural Information Processing Systems Foundation, 2025. https://doi.org/10.52202/085713-1450. ieee: P. Súkeník, C. Lampert, and M. Mondelli, “Neural collapse is globally optimal in deep regularized ResNets and transformers,” in 39th Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38, pp. 48646–48677. ista: 'Súkeník P, Lampert C, Mondelli M. 2025. Neural collapse is globally optimal in deep regularized ResNets and transformers. 39th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 48646–48677.' mla: Súkeník, Peter, et al. “Neural Collapse Is Globally Optimal in Deep Regularized ResNets and Transformers.” 39th Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 48646–77, doi:10.52202/085713-1450. short: P. Súkeník, C. Lampert, M. Mondelli, in:, 39th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 48646–48677. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 corr_author: '1' das_tickbox: '0' date_created: 2026-09-06T22:01:59Z date_published: 2025-12-02T00:00:00Z date_updated: 2026-09-10T08:11:46Z day: '02' ddc: - '000' department: - _id: MaMo - _id: GradSch - _id: ChLa doi: 10.52202/085713-1450 external_id: arxiv: - '2505.15239' fulldoi: https://doi.org/10.52202/085713-1450 intvolume: ' 38' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.52202/085713-1450 month: '12' oa: 1 oa_version: Published Version page: 48646-48677 project: - _id: 911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf grant_number: '101161364' name: 'Inference in High Dimensions: Light-speed Algorithms and Information Limits' publication: 39th Conference on Neural Information Processing Systems publication_identifier: isbn: - '9798331338275' issn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: Neural collapse is globally optimal in deep regularized ResNets and transformers type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher OA_type: free access _id: '22824' abstract: - lang: eng text: "We present new fast-rate PAC-Bayesian generalization bounds for multi-task and\r\nmeta-learning in the unbalanced setting, i.e. when the tasks have training sets of\r\ndifferent sizes, as is typically the case in real-world scenarios. Previously, only\r\nstandard-rate bounds were known for this situation, while fast-rate bounds were\r\nlimited to the setting where all training sets are of equal size. Our new bounds\r\nare numerically computable as well as interpretable, and we demonstrate their\r\nflexibility in handling a number of cases where they give stronger guarantees\r\nthan previous bounds. Besides the bounds themselves, we also make conceptual\r\ncontributions: we demonstrate that the unbalanced multi-task setting has different\r\nstatistical properties than the balanced situation, specifically that proofs from\r\nthe balanced situation do not carry over to the unbalanced setting. Additionally,\r\nwe shed light on the fact that the unbalanced situation allows two meaningful\r\ndefinitions of multi-task risk, depending on whether all tasks should be considered\r\nequally important or if sample-rich tasks should receive more weight than samplepoor ones." acknowledged_ssus: - _id: ScienComp acknowledgement: This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp). alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No author: - first_name: Hossein full_name: Zakerinia, Hossein id: 653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4 last_name: Zakerinia orcid: 0009-0007-3977-6462 - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Zakerinia H, Lampert C. Fast rate bounds for multi-task and meta-learning with different sample sizes. In: 39th Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025:9062-9093. doi:10.52202/085713-0278' apa: 'Zakerinia, H., & Lampert, C. (2025). Fast rate bounds for multi-task and meta-learning with different sample sizes. In 39th Conference on Neural Information Processing Systems (Vol. 38, pp. 9062–9093). San Diego, CA, United States: Neural Information Processing Systems Foundation. https://doi.org/10.52202/085713-0278' chicago: Zakerinia, Hossein, and Christoph Lampert. “Fast Rate Bounds for Multi-Task and Meta-Learning with Different Sample Sizes.” In 39th Conference on Neural Information Processing Systems, 38:9062–93. Neural Information Processing Systems Foundation, 2025. https://doi.org/10.52202/085713-0278. ieee: H. Zakerinia and C. Lampert, “Fast rate bounds for multi-task and meta-learning with different sample sizes,” in 39th Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38, pp. 9062–9093. ista: 'Zakerinia H, Lampert C. 2025. Fast rate bounds for multi-task and meta-learning with different sample sizes. 39th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 9062–9093.' mla: Zakerinia, Hossein, and Christoph Lampert. “Fast Rate Bounds for Multi-Task and Meta-Learning with Different Sample Sizes.” 39th Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 9062–93, doi:10.52202/085713-0278. short: H. Zakerinia, C. Lampert, in:, 39th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 9062–9093. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 corr_author: '1' das_tickbox: '0' date_created: 2026-09-06T22:01:59Z date_published: 2025-12-02T00:00:00Z date_updated: 2026-09-10T08:37:33Z day: '02' department: - _id: GradSch - _id: ChLa doi: 10.52202/085713-0278 fulldoi: https://doi.org/10.52202/085713-0278 intvolume: ' 38' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.52202/085713-0278 month: '12' oa: 1 oa_version: Published Version page: 9062-9093 publication: 39th Conference on Neural Information Processing Systems publication_identifier: isbn: - '9798331338275' issn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: Fast rate bounds for multi-task and meta-learning with different sample sizes type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher OA_type: free access _id: '22830' abstract: - lang: eng text: "We introduce AutoJudge, a method that accelerates large language model (LLM) inference with task-specific lossy speculative decoding. Instead of matching the original model output distribution token-by-token, we identify the generated tokens that affect the downstream quality of the response, relaxing the distribution match guarantee so that the \"unimportant\" tokens can be generated faster. Our approach relies on a semi‑greedy search algorithm to test which of the mismatches between target and draft models should be corrected to preserve quality and which ones may be skipped. We then train a lightweight classifier based on existing LLM embeddings to predict, at inference time, which mismatching tokens can be safely accepted without compromising the final answer quality. We evaluate AutoJudge with multiple draft/target model pairs on mathematical reasoning and programming benchmarks, achieving significant speedups at the cost of a minor accuracy reduction. Notably, on GSM8K with the Llama 3.1 70B target model, our approach achieves up to \r\n≈\r\n2\r\n×\r\n speedup \\textit{over speculative decoding} at the cost of a \r\n≤\r\n1\r\n%\r\n drop in accuracy. When applied to the LiveCodeBench benchmark, AutoJudge automatically detects programming-specific important tokens, accepting \r\n≥\r\n25\r\n tokens per speculation cycle at a\r\n \r\n2\r\n%\r\n drop in Pass@1. Our approach requires no human annotation and is easy to integrate with modern LLM inference frameworks." acknowledgement: "We would like to express our sincere gratitude to Denis Mazur for his valuable contributions to the\r\nimplementation of API calls used in Algorithm 1 and for supporting inference with the Llama 405B\r\nmodel. We are also thankful for his positive influence on the overall atmosphere and team morale\r\nthroughout the course of this project." alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Roman full_name: Garipov, Roman last_name: Garipov - first_name: Fedor full_name: Velikonivtsev, Fedor last_name: Velikonivtsev - first_name: Ivan full_name: Ermakov, Ivan last_name: Ermakov - first_name: Ruslan full_name: Svirschevski, Ruslan last_name: Svirschevski - first_name: Vage full_name: Egiazarian, Vage id: 77451e76-92b2-11ef-a4d1-8dbaa06e16ad last_name: Egiazarian - first_name: Max full_name: Ryabinin, Max last_name: Ryabinin citation: ama: 'Garipov R, Velikonivtsev F, Ermakov I, Svirschevski R, Egiazarian V, Ryabinin M. AutoJudge: Judge decoding without manual annotation. In: 39th Annual Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025:104904-104941. doi:10.52202/085713-3163' apa: 'Garipov, R., Velikonivtsev, F., Ermakov, I., Svirschevski, R., Egiazarian, V., & Ryabinin, M. (2025). AutoJudge: Judge decoding without manual annotation. In 39th Annual Conference on Neural Information Processing Systems (Vol. 38, pp. 104904–104941). San Diego, CA, United States: Neural Information Processing Systems Foundation. https://doi.org/10.52202/085713-3163' chicago: 'Garipov, Roman, Fedor Velikonivtsev, Ivan Ermakov, Ruslan Svirschevski, Vage Egiazarian, and Max Ryabinin. “AutoJudge: Judge Decoding without Manual Annotation.” In 39th Annual Conference on Neural Information Processing Systems, 38:104904–41. Neural Information Processing Systems Foundation, 2025. https://doi.org/10.52202/085713-3163.' ieee: 'R. Garipov, F. Velikonivtsev, I. Ermakov, R. Svirschevski, V. Egiazarian, and M. Ryabinin, “AutoJudge: Judge decoding without manual annotation,” in 39th Annual Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38, pp. 104904–104941.' ista: 'Garipov R, Velikonivtsev F, Ermakov I, Svirschevski R, Egiazarian V, Ryabinin M. 2025. AutoJudge: Judge decoding without manual annotation. 39th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 104904–104941.' mla: 'Garipov, Roman, et al. “AutoJudge: Judge Decoding without Manual Annotation.” 39th Annual Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 104904–41, doi:10.52202/085713-3163.' short: R. Garipov, F. Velikonivtsev, I. Ermakov, R. Svirschevski, V. Egiazarian, M. Ryabinin, in:, 39th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 104904–104941. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 das_tickbox: '0' date_created: 2026-09-06T22:02:00Z date_published: 2025-12-02T00:00:00Z date_updated: 2026-09-10T11:08:33Z day: '02' department: - _id: DaAl doi: 10.52202/085713-3163 external_id: arxiv: - '2504.20039' fulldoi: https://doi.org/10.52202/085713-3163 intvolume: ' 38' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.52202/085713-3163 month: '12' oa: 1 oa_version: Published Version page: 104904-104941 publication: 39th Annual Conference on Neural Information Processing Systems publication_identifier: isbn: - '9798331338275' issn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: 'AutoJudge: Judge decoding without manual annotation' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19595' abstract: - lang: eng text: We investigate the locality of magnetic response in polycyclic aromatic molecules using a novel deep-learning approach. Our method employs graph neural networks (GNNs) with a graph-of-rings representation to predict nucleus independent chemical shifts (NICS) in the space around the molecule. We train a series of models, each time reducing the size of the largest molecules used in training. The accuracy of prediction remains high (MAE < 0.5 ppm), even when training the model only on molecules with up to four rings, thus providing strong evidence for the locality of magnetic response. To overcome the known problem of generalization of GNNs, we implement a k-hop expansion strategy and succeed in achieving accurate predictions for molecules with up to 15 rings (almost 4 times the size of the largest training example). Our findings have implications for understanding the magnetic response in complex molecules and demonstrate a promising approach to overcoming GNN scalability limitations. Furthermore, the trained models enable rapid characterization, without the need for more expensive DFT calculations. acknowledgement: The authors express their gratitude to Professor Dr. Peter Chen for his continued support. The authors acknowledge the Branco Weiss Fellowship for supporting this research as part of a Society in Science grant and the Israel Science Foundation for financial support (Grant No. 1745/23 to R.G.-P.). R.G.-P. is a Branco Weiss Fellow, a Horev Fellow, and an Alon Scholarship recipient. A.M.B. was supported by the ERC StG EARS and the Israeli Science Foundation. article_number: '144101' article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Yair full_name: Davidson, Yair last_name: Davidson - first_name: Aviad full_name: Philipp, Aviad last_name: Philipp - first_name: Sabyasachi full_name: Chakraborty, Sabyasachi last_name: Chakraborty - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Renana full_name: Gershoni-Poranne, Renana last_name: Gershoni-Poranne citation: ama: Davidson Y, Philipp A, Chakraborty S, Bronstein AM, Gershoni-Poranne R. How local is “local”? Deep learning reveals locality of the induced magnetic field of polycyclic aromatic hydrocarbons. Journal of Chemical Physics. 2025;162(14). doi:10.1063/5.0257558 apa: Davidson, Y., Philipp, A., Chakraborty, S., Bronstein, A. M., & Gershoni-Poranne, R. (2025). How local is “local”? Deep learning reveals locality of the induced magnetic field of polycyclic aromatic hydrocarbons. Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0257558 chicago: Davidson, Yair, Aviad Philipp, Sabyasachi Chakraborty, Alex M. Bronstein, and Renana Gershoni-Poranne. “How Local Is ‘Local’? Deep Learning Reveals Locality of the Induced Magnetic Field of Polycyclic Aromatic Hydrocarbons.” Journal of Chemical Physics. AIP Publishing, 2025. https://doi.org/10.1063/5.0257558. ieee: Y. Davidson, A. Philipp, S. Chakraborty, A. M. Bronstein, and R. Gershoni-Poranne, “How local is ‘local’? Deep learning reveals locality of the induced magnetic field of polycyclic aromatic hydrocarbons,” Journal of Chemical Physics, vol. 162, no. 14. AIP Publishing, 2025. ista: Davidson Y, Philipp A, Chakraborty S, Bronstein AM, Gershoni-Poranne R. 2025. How local is “local”? Deep learning reveals locality of the induced magnetic field of polycyclic aromatic hydrocarbons. Journal of Chemical Physics. 162(14), 144101. mla: Davidson, Yair, et al. “How Local Is ‘Local’? Deep Learning Reveals Locality of the Induced Magnetic Field of Polycyclic Aromatic Hydrocarbons.” Journal of Chemical Physics, vol. 162, no. 14, 144101, AIP Publishing, 2025, doi:10.1063/5.0257558. short: Y. Davidson, A. Philipp, S. Chakraborty, A.M. Bronstein, R. Gershoni-Poranne, Journal of Chemical Physics 162 (2025). corr_author: '1' date_created: 2025-04-20T22:01:28Z date_published: 2025-04-14T00:00:00Z date_updated: 2026-09-14T07:44:59Z day: '14' ddc: - '000' department: - _id: AlBr doi: 10.1063/5.0257558 external_id: isi: - '001466311300030' pmid: - '40197568' file: - access_level: open_access checksum: 20a31a4c506b52de863bab7d3ff989ef content_type: application/pdf creator: dernst date_created: 2025-04-22T09:27:43Z date_updated: 2025-04-22T09:27:43Z file_id: '19606' file_name: 2025_JourChemicalPhysics_Davidson.pdf file_size: 7812182 relation: main_file success: 1 file_date_updated: 2025-04-22T09:27:43Z fulldoi: https://doi.org/10.1063/5.0257558 has_accepted_license: '1' intvolume: ' 162' isi: 1 issue: '14' language: - iso: eng month: '04' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 1b39bd8c-ab3c-11f0-a172-a4c5bf64093b grant_number: '863839' name: Acoustics-based drone navigation and interaction publication: Journal of Chemical Physics publication_identifier: eissn: - 1089-7690 issn: - 0021-9606 publication_status: published publisher: AIP Publishing quality_controlled: '1' related_material: link: - relation: software url: https://gitlab.com/porannegroup/magnetic_locality scopus_import: '1' status: public title: How local is “local”? Deep learning reveals locality of the induced magnetic field of polycyclic aromatic hydrocarbons tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 162 year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '17468' abstract: - lang: eng text: Oxygen redox chemistry is central to life1 and many human-made technologies, such as in energy storage2,3,4. The large energy gain from oxygen redox reactions is often connected with the occurrence of harmful reactive oxygen species3,5,6. Key species are superoxide and the highly reactive singlet oxygen3,4,5,6,7, which may evolve from superoxide. However, the factors determining the formation of singlet oxygen, rather than the relatively unreactive triplet oxygen, are unknown. Here we report that the release of triplet or singlet oxygen is governed by individual Marcus normal and inverted region behaviour. We found that as the driving force for the reaction increases, the initially dominant evolution of triplet oxygen slows down, and singlet oxygen evolution becomes predominant with higher maximum kinetics. This behaviour also applies to the widely observed superoxide disproportionation, in which one superoxide is oxidized by another, in both non-aqueous and aqueous systems, with Lewis and Brønsted acidity controlling the driving forces. Singlet oxygen yields governed by these conditions are relevant, for example, in batteries or cellular organelles in which superoxide forms. Our findings suggest ways to understand and control spin states and kinetics in oxygen redox chemistry, with implications for fields, including life sciences, pure chemistry and energy storage. acknowledged_ssus: - _id: Bio - _id: LifeSc - _id: M-Shop - _id: ScienComp acknowledgement: S.A.F. thanks the Institute of Science and Technology Austria (ISTA) for the support. The Scientific Service Units of ISTA supported this research through resources provided by the Imaging and Optics Facility, the Lab Support Facility, the Miba Machine Shop and Scientific Computing. This research was partly funded by the Austrian Science Fund (FWF) (10.55776/P37169 and 10.55776/COE5). For open access purposes, the author has applied for a CC BY public copyright licence to any author-accepted manuscript version arising from this submission. R.H. acknowledges funding through CZI grant DAF2020-225401 (10.37921/120055ratwvi) from the Chan Zuckerberg Initiative DAF, an advised fund of Silicon Valley Community Foundation (10.13039/100014989). H.T.K.N. acknowledges funding by the European Commission Erasmus Mundus Joint Masters programme. We thank M. Sixt and M. Chinon for the discussions about O-redox in life and R. Jethwa for proofreading. Open access funding was provided by ISTA. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Soumyadip full_name: Mondal, Soumyadip id: d25d21ef-dc8d-11ea-abe3-ec4576307f48 last_name: Mondal - first_name: Huyen T.K. full_name: Nguyen, Huyen T.K. last_name: Nguyen - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Mondal S, Nguyen HTK, Hauschild R, Freunberger SA. Marcus kinetics control singlet and triplet oxygen evolving from superoxide. Nature. 2025;646(8085):601–605. doi:10.1038/s41586-025-09587-7 apa: Mondal, S., Nguyen, H. T. K., Hauschild, R., & Freunberger, S. A. (2025). Marcus kinetics control singlet and triplet oxygen evolving from superoxide. Nature. Springer Nature. https://doi.org/10.1038/s41586-025-09587-7 chicago: Mondal, Soumyadip, Huyen T.K. Nguyen, Robert Hauschild, and Stefan Alexander Freunberger. “Marcus Kinetics Control Singlet and Triplet Oxygen Evolving from Superoxide.” Nature. Springer Nature, 2025. https://doi.org/10.1038/s41586-025-09587-7. ieee: S. Mondal, H. T. K. Nguyen, R. Hauschild, and S. A. Freunberger, “Marcus kinetics control singlet and triplet oxygen evolving from superoxide,” Nature, vol. 646, no. 8085. Springer Nature, pp. 601–605, 2025. ista: Mondal S, Nguyen HTK, Hauschild R, Freunberger SA. 2025. Marcus kinetics control singlet and triplet oxygen evolving from superoxide. Nature. 646(8085), 601–605. mla: Mondal, Soumyadip, et al. “Marcus Kinetics Control Singlet and Triplet Oxygen Evolving from Superoxide.” Nature, vol. 646, no. 8085, Springer Nature, 2025, pp. 601–605, doi:10.1038/s41586-025-09587-7. short: S. Mondal, H.T.K. Nguyen, R. Hauschild, S.A. Freunberger, Nature 646 (2025) 601–605. corr_author: '1' date_created: 2024-08-29T10:40:23Z date_published: 2025-10-16T00:00:00Z date_updated: 2026-09-16T06:53:54Z day: '16' ddc: - '540' department: - _id: StFr - _id: Bio doi: 10.1038/s41586-025-09587-7 external_id: isi: - '001586378900001' pmid: - '41044415' file: - access_level: open_access checksum: b507ddd23df0388aa65d04dc9b00fe3d content_type: application/pdf creator: dernst date_created: 2025-10-20T10:26:13Z date_updated: 2025-10-20T10:26:13Z file_id: '20500' file_name: 2025_Nature_Mondal.pdf file_size: 3809247 relation: main_file success: 1 file_date_updated: 2025-10-20T10:26:13Z fulldoi: https://doi.org/10.1038/s41586-025-09587-7 has_accepted_license: '1' intvolume: ' 646' isi: 1 issue: '8085' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 601–605 pmid: 1 project: - _id: 8df062be-16d5-11f0-9cad-f559b6612c7e grant_number: P37169 name: Singlet oxygen in non-aqueous oxygen redox chemistry - _id: c08e9ad1-5a5b-11eb-8a69-9d1cf3b07473 grant_number: CZI01 name: Tools for automation and feedback microscopy - _id: 5eaf4378-b033-11f1-b276-f928018a46c1 grant_number: COE05 name: Materials for Energy Conversion and Storage (Freunberger) publication: Nature publication_identifier: eissn: - 1476-4687 issn: - 0028-0836 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on ISTA website relation: press_release url: https://ista.ac.at/en/news/taming-the-bad-oxygen/ scopus_import: '1' status: public title: Marcus kinetics control singlet and triplet oxygen evolving from superoxide tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 646 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19743' abstract: - lang: eng text: The possibility of errors in human-engineered formal verification software, such as model checkers, poses a serious threat to the purpose of these tools. An established approach to mitigate this problem are certificates—lightweight, easy-to-check proofs of the verification results. In this paper, we develop novel certificates for model checking of Markov decision processes (MDPs) with quantitative reachability and expected reward properties. Our approach is conceptually simple and relies almost exclusively on elementary fixed point theory. Our certificates work for arbitrary finite MDPs and can be readily computed with little overhead using standard algorithms. We formalize the soundness of our certificates in Isabelle/HOL and provide a formally verified certificate checker. Moreover, we augment existing algorithms in the probabilistic model checker Storm with the ability to produce certificates and demonstrate practical applicability by conducting the first formal certification of the reference results in the Quantitative Verification Benchmark Set. acknowledgement: This project has received funding from the ERC CoG 863818 (ForM-SMArt), the Austrian Science Fund (FWF) 10.55776/COE12, a KI-Starter grant from the Ministerium für Kultur und Wissenschaft NRW, the DFG RTG 378803395 (ConVeY), the EU’s Horizon 2020 research and innovation programmes under the Marie Sklodowska-Curie grant agreement Nos. 101034413 (IST-BRIDGE) and 101008233 (MISSION), and the DFG RTG 2236 (UnRAVeL). Experiments were performed with computing resources granted by RWTH Aachen University under project rwth1632. alternative_title: - LNCS article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Tim full_name: Quatmann, Tim last_name: Quatmann - first_name: Maximilian full_name: Schäffeler, Maximilian last_name: Schäffeler - first_name: Maximilian full_name: Weininger, Maximilian id: 02ab0197-cc70-11ed-ab61-918e71f56881 last_name: Weininger orcid: 0000-0002-0163-2152 - first_name: Tobias full_name: Winkler, Tobias last_name: Winkler - first_name: Daniel full_name: Zilken, Daniel id: d8ebc24a-3f98-11f0-9044-8296d4f39ab3 last_name: Zilken citation: ama: 'Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. Fixed point certificates for reachability and expected rewards in MDPs. In: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 15697. Springer Nature; 2025:130-151. doi:10.1007/978-3-031-90653-4_7' apa: 'Chatterjee, K., Quatmann, T., Schäffeler, M., Weininger, M., Winkler, T., & Zilken, D. (2025). Fixed point certificates for reachability and expected rewards in MDPs. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15697, pp. 130–151). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90653-4_7' chicago: Chatterjee, Krishnendu, Tim Quatmann, Maximilian Schäffeler, Maximilian Weininger, Tobias Winkler, and Daniel Zilken. “Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 15697:130–51. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90653-4_7. ieee: K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, and D. Zilken, “Fixed point certificates for reachability and expected rewards in MDPs,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15697, pp. 130–151. ista: 'Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. 2025. Fixed point certificates for reachability and expected rewards in MDPs. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 130–151.' mla: Chatterjee, Krishnendu, et al. “Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15697, Springer Nature, 2025, pp. 130–51, doi:10.1007/978-3-031-90653-4_7. short: K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, D. Zilken, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 130–151. conference: end_date: 2025-05-08 location: Hamilton, ON, Canada name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2025-05-03 corr_author: '1' date_created: 2025-05-25T22:17:09Z date_published: 2025-05-01T00:00:00Z date_updated: 2026-09-16T06:57:17Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-031-90653-4_7 ec_funded: 1 external_id: arxiv: - '2501.11467' file: - access_level: open_access checksum: 64b7f46ef05649b87b827248045c7645 content_type: application/pdf creator: dernst date_created: 2025-06-02T10:49:52Z date_updated: 2025-06-02T10:49:52Z file_id: '19772' file_name: 2025_TACAS_ChatterjeeKrish.pdf file_size: 732136 relation: main_file success: 1 file_date_updated: 2025-06-02T10:49:52Z fulldoi: https://doi.org/10.1007/978-3-031-90653-4_7 has_accepted_license: '1' intvolume: ' 15697' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 130-151 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems publication_identifier: eissn: - 1611-3349 isbn: - '9783031906527' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '19771' relation: research_data status: public scopus_import: '1' status: public title: Fixed point certificates for reachability and expected rewards in MDPs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15697 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19740' abstract: - lang: eng text: Two standard models for probabilistic systems are Markov chains (MCs) and Markov decision processes (MDPs). Classic objectives for such probabilistic models for control and planning problems are reachability and stochastic shortest path. The widely studied algorithmic approach for these problems is the Value Iteration (VI) algorithm which iteratively applies local updates called Bellman updates. There are many practical approaches for VI in the literature but they all require exponentially many Bellman updates for MCs in the worst case. A preprocessing step is an algorithm that is discrete, graph-theoretical, and requires linear space. An important open question is whether, after a polynomial-time preprocessing, VI can be achieved with sub-exponentially many Bellman updates. In this work, we present a new approach for VI based on guessing values. Our theoretical contributions are twofold. First, for MCs, we present an almost-linear-time preprocessing algorithm after which, along with guessing values, VI requires only subexponentially many Bellman updates. Second, we present an improved analysis of the speed of convergence of VI for MDPs. Finally, we present a practical algorithm for MDPs based on our new approach. Experimental results show that our approach provides a considerable improvement over existing VI-based approaches on several benchmark examples from the literature. acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12 grant. alternative_title: - LNCS article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Mahdi full_name: Jafariraviz, Mahdi last_name: Jafariraviz - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 citation: ama: 'Chatterjee K, Jafariraviz M, Saona Urmeneta RJ, Svoboda J. Value iteration with guessing for Markov chains and Markov decision processes. In: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 15697. Springer Nature; 2025:217-236. doi:10.1007/978-3-031-90653-4_11' apa: 'Chatterjee, K., Jafariraviz, M., Saona Urmeneta, R. J., & Svoboda, J. (2025). Value iteration with guessing for Markov chains and Markov decision processes. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15697, pp. 217–236). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90653-4_11' chicago: Chatterjee, Krishnendu, Mahdi Jafariraviz, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Value Iteration with Guessing for Markov Chains and Markov Decision Processes.” In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 15697:217–36. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90653-4_11. ieee: K. Chatterjee, M. Jafariraviz, R. J. Saona Urmeneta, and J. Svoboda, “Value iteration with guessing for Markov chains and Markov decision processes,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15697, pp. 217–236. ista: 'Chatterjee K, Jafariraviz M, Saona Urmeneta RJ, Svoboda J. 2025. Value iteration with guessing for Markov chains and Markov decision processes. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 217–236.' mla: Chatterjee, Krishnendu, et al. “Value Iteration with Guessing for Markov Chains and Markov Decision Processes.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15697, Springer Nature, 2025, pp. 217–36, doi:10.1007/978-3-031-90653-4_11. short: K. Chatterjee, M. Jafariraviz, R.J. Saona Urmeneta, J. Svoboda, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 217–236. conference: end_date: 2025-05-08 location: Hamilton, ON, Canada name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2025-05-03 corr_author: '1' date_created: 2025-05-25T22:17:06Z date_published: 2025-05-01T00:00:00Z date_updated: 2026-09-16T06:56:56Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-031-90653-4_11 ec_funded: 1 external_id: arxiv: - '2505.06769' file: - access_level: open_access checksum: 45da6efbcbed20aada16c48c8e55e2d6 content_type: application/pdf creator: dernst date_created: 2025-06-02T07:31:12Z date_updated: 2025-06-02T07:31:12Z file_id: '19767' file_name: 2025_TACAS_Chatterjee.pdf file_size: 557481 relation: main_file success: 1 file_date_updated: 2025-06-02T07:31:12Z fulldoi: https://doi.org/10.1007/978-3-031-90653-4_11 has_accepted_license: '1' intvolume: ' 15697' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 217-236 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems publication_identifier: eissn: - 1611-3349 isbn: - '9783031906527' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Value iteration with guessing for Markov chains and Markov decision processes tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15697 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19744' abstract: - lang: eng text: We consider the problem of refuting equivalence of probabilistic programs, i.e., the problem of proving that two probabilistic programs induce different output distributions. We study this problem in the context of programs with conditioning (i.e., with observe and score statements), where the output distribution is conditioned by the event that all the observe statements along a run evaluate to true, and where the probability densities of different runs may be updated via the score statements. Building on a recent work on programs without conditioning, we present a new equivalence refutation method for programs with conditioning. Our method is based on weighted restarting, a novel transformation of probabilistic programs with conditioning to the output equivalent probabilistic programs without conditioning that we introduce in this work. Our method is the first to be both a) fully automated, and b) providing provably correct answers. We demonstrate the applicability of our method on a set of programs from the probabilistic inference literature. acknowledgement: This work was partially supported by ERC CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12. Petr Novotný is supported by the Czech Science Foundation grant no. GA23-06963S. alternative_title: - LNCS article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ehsan full_name: Kafshdar Goharshadi, Ehsan id: 103b4fa0-896a-11ed-bdf8-87b697bef40d last_name: Kafshdar Goharshadi orcid: 0000-0002-8595-0587 - first_name: Petr full_name: Novotný, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotný - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic orcid: 0000-0002-4681-1699 citation: ama: 'Chatterjee K, Goharshady E, Novotný P, Zikelic D. Refuting equivalence in probabilistic programs with conditioning. In: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 15697. Springer Nature; 2025:279-300. doi:10.1007/978-3-031-90653-4_14' apa: 'Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2025). Refuting equivalence in probabilistic programs with conditioning. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15697, pp. 279–300). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90653-4_14' chicago: Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic. “Refuting Equivalence in Probabilistic Programs with Conditioning.” In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 15697:279–300. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90653-4_14. ieee: K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Refuting equivalence in probabilistic programs with conditioning,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15697, pp. 279–300. ista: 'Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2025. Refuting equivalence in probabilistic programs with conditioning. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 279–300.' mla: Chatterjee, Krishnendu, et al. “Refuting Equivalence in Probabilistic Programs with Conditioning.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15697, Springer Nature, 2025, pp. 279–300, doi:10.1007/978-3-031-90653-4_14. short: K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 279–300. conference: end_date: 2025-05-08 location: Hamilton, ON, Canada name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2025-05-03 corr_author: '1' date_created: 2025-05-25T22:17:10Z date_published: 2025-05-01T00:00:00Z date_updated: 2026-09-16T06:57:43Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-031-90653-4_14 ec_funded: 1 external_id: arxiv: - '2501.06579' file: - access_level: open_access checksum: 7dcd85e7e753bfa994c10b3cf9ebc185 content_type: application/pdf creator: dernst date_created: 2025-06-02T11:13:49Z date_updated: 2025-06-02T11:13:49Z file_id: '19773' file_name: 2025_TACAS_Chatterjee_Goharshadi.pdf file_size: 532181 relation: main_file success: 1 file_date_updated: 2025-06-02T11:13:49Z fulldoi: https://doi.org/10.1007/978-3-031-90653-4_14 has_accepted_license: '1' intvolume: ' 15697' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 279-300 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems publication_identifier: eissn: - 1611-3349 isbn: - '9783031906527' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Refuting equivalence in probabilistic programs with conditioning tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15697 year: '2025' ... --- OA_place: repository OA_type: green _id: '19667' abstract: - lang: eng text: The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of logic-related applications such as logic for artificial intelligence, program analysis, etc. While there has been much work on checking satisfiability of unquantified LRA and NRA formulas, the problem of checking satisfiability of quantified LRA and NRA formulas remains a significant challenge. The main bottleneck in the existing methods is a computationally expensive quantifier elimination step. In this work, we propose a novel method for efficient quantifier elimination in quantified LRA and NRA formulas. We propose a template-based Skolemization approach, where we automatically synthesize linear/polynomial Skolem functions in order to eliminate quantifiers in the formula. The key technical ingredient in our approach are Positivstellensätze theorems from algebraic geometry, which allow for an efficient manipulation of polynomial inequalities. Our method offers a range of appealing theoretical properties combined with a strong practical performance. On the theory side, our method is sound, semi-complete, and runs in subexponential time and polynomial space, as opposed to existing sound and complete quantifier elimination methods that run in doubly-exponential time and at least exponential space. On the practical side, our experiments show superior performance compared to state of the art SMT solvers in terms of the number of solved instances and runtime, both on LRA and on NRA benchmarks. acknowledgement: This work was partially funded by ERC CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12. article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ehsan full_name: Kafshdar Goharshadi, Ehsan id: 103b4fa0-896a-11ed-bdf8-87b697bef40d last_name: Kafshdar Goharshadi orcid: 0000-0002-8595-0587 - first_name: Mehrdad full_name: Karrabi, Mehrdad id: 67638922-f394-11eb-9cf6-f20423e08757 last_name: Karrabi orcid: 0009-0007-5253-9170 - first_name: Harshit J. full_name: Motwani, Harshit J. last_name: Motwani - first_name: Maximilian full_name: Seeliger, Maximilian last_name: Seeliger - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic orcid: 0000-0002-4681-1699 citation: ama: 'Chatterjee K, Goharshady E, Karrabi M, Motwani HJ, Seeliger M, Zikelic D. Quantified linear and polynomial arithmetic satisfiability via template-based skolemization. In: Proceedings of the 39th AAAI Conference on Artificial Intelligence. Vol 39. Association for the Advancement of Artificial Intelligence; 2025:11158-11166. doi:10.1609/aaai.v39i11.33213' apa: 'Chatterjee, K., Goharshady, E., Karrabi, M., Motwani, H. J., Seeliger, M., & Zikelic, D. (2025). Quantified linear and polynomial arithmetic satisfiability via template-based skolemization. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 11158–11166). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i11.33213' chicago: Chatterjee, Krishnendu, Ehsan Goharshady, Mehrdad Karrabi, Harshit J. Motwani, Maximilian Seeliger, and Dorde Zikelic. “Quantified Linear and Polynomial Arithmetic Satisfiability via Template-Based Skolemization.” In Proceedings of the 39th AAAI Conference on Artificial Intelligence, 39:11158–66. Association for the Advancement of Artificial Intelligence, 2025. https://doi.org/10.1609/aaai.v39i11.33213. ieee: K. Chatterjee, E. Goharshady, M. Karrabi, H. J. Motwani, M. Seeliger, and D. Zikelic, “Quantified linear and polynomial arithmetic satisfiability via template-based skolemization,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11158–11166. ista: 'Chatterjee K, Goharshady E, Karrabi M, Motwani HJ, Seeliger M, Zikelic D. 2025. Quantified linear and polynomial arithmetic satisfiability via template-based skolemization. Proceedings of the 39th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 39, 11158–11166.' mla: Chatterjee, Krishnendu, et al. “Quantified Linear and Polynomial Arithmetic Satisfiability via Template-Based Skolemization.” Proceedings of the 39th AAAI Conference on Artificial Intelligence, vol. 39, no. 11, Association for the Advancement of Artificial Intelligence, 2025, pp. 11158–66, doi:10.1609/aaai.v39i11.33213. short: K. Chatterjee, E. Goharshady, M. Karrabi, H.J. Motwani, M. Seeliger, D. Zikelic, in:, Proceedings of the 39th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2025, pp. 11158–11166. conference: end_date: 2025-03-04 location: Philadelphia, PA, United States name: 'AAAI: Conference on Artificial Intelligence' start_date: 2025-02-25 corr_author: '1' date_created: 2025-05-11T22:02:39Z date_published: 2025-04-11T00:00:00Z date_updated: 2026-09-16T06:55:21Z day: '11' department: - _id: KrCh doi: 10.1609/aaai.v39i11.33213 ec_funded: 1 external_id: arxiv: - '2412.16226' fulldoi: https://doi.org/10.1609/aaai.v39i11.33213 intvolume: ' 39' issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2412.16226 month: '04' oa: 1 oa_version: Preprint page: 11158-11166 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: Proceedings of the 39th AAAI Conference on Artificial Intelligence publication_identifier: eissn: - 2374-3468 issn: - 2159-5399 publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' scopus_import: '1' status: public title: Quantified linear and polynomial arithmetic satisfiability via template-based skolemization type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 39 year: '2025' ... --- OA_place: repository OA_type: green _id: '19669' abstract: - lang: eng text: 'We consider a class of optimization problems defined by a system of linear equations with min and max operators. This class of optimization problems has been studied under restrictive conditions, such as, (C1) the halting or stability condition; (C2) the non-negative coefficients condition; (C3) the sum upto 1 condition; and (C4) the only min or only max operator condition. Several seminal results in the literature focus on special cases. For example, turn-based stochastic games correspond to conditions C2 and C3; and Markov decision process to conditions C2, C3, and C4. However, the systematic computational complexity study of all the cases has not been explored, which we address in this work. Some highlights of our results are: with conditions C2 and C4, and with conditions C3 and C4, the problem is NP-complete, whereas with condition C1 only, the problem is in UP intersects coUP. Finally, we establish the computational complexity of the decision problem of checking the respective conditions.' acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and the Austrian Science Fund (FWF) 10.55776/COE12 grant. article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Ruichen full_name: Luo, Ruichen id: b391db08-1ffe-11ee-8b67-d18ddcfb5a14 last_name: Luo - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 citation: ama: 'Chatterjee K, Luo R, Saona Urmeneta RJ, Svoboda J. Linear equations with min and max operators: Computational complexity. In: Proceedings of the 39th AAAI Conference on Artificial Intelligence. Vol 39. Association for the Advancement of Artificial Intelligence; 2025:11150-11157. doi:10.1609/aaai.v39i11.33212' apa: 'Chatterjee, K., Luo, R., Saona Urmeneta, R. J., & Svoboda, J. (2025). Linear equations with min and max operators: Computational complexity. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 11150–11157). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i11.33212' chicago: 'Chatterjee, Krishnendu, Ruichen Luo, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Linear Equations with Min and Max Operators: Computational Complexity.” In Proceedings of the 39th AAAI Conference on Artificial Intelligence, 39:11150–57. Association for the Advancement of Artificial Intelligence, 2025. https://doi.org/10.1609/aaai.v39i11.33212.' ieee: 'K. Chatterjee, R. Luo, R. J. Saona Urmeneta, and J. Svoboda, “Linear equations with min and max operators: Computational complexity,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11150–11157.' ista: 'Chatterjee K, Luo R, Saona Urmeneta RJ, Svoboda J. 2025. Linear equations with min and max operators: Computational complexity. Proceedings of the 39th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 39, 11150–11157.' mla: 'Chatterjee, Krishnendu, et al. “Linear Equations with Min and Max Operators: Computational Complexity.” Proceedings of the 39th AAAI Conference on Artificial Intelligence, vol. 39, no. 11, Association for the Advancement of Artificial Intelligence, 2025, pp. 11150–57, doi:10.1609/aaai.v39i11.33212.' short: K. Chatterjee, R. Luo, R.J. Saona Urmeneta, J. Svoboda, in:, Proceedings of the 39th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2025, pp. 11150–11157. conference: end_date: 2025-03-04 location: Philadelphia, PA, United States name: 'AAAI: Conference on Artificial Intelligence' start_date: 2025-02-25 corr_author: '1' date_created: 2025-05-11T22:02:40Z date_published: 2025-04-11T00:00:00Z date_updated: 2026-09-16T06:55:47Z day: '11' department: - _id: KrCh doi: 10.1609/aaai.v39i11.33212 ec_funded: 1 external_id: arxiv: - '2412.12228' fulldoi: https://doi.org/10.1609/aaai.v39i11.33212 intvolume: ' 39' issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2412.12228 month: '04' oa: 1 oa_version: Preprint page: 11150-11157 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: Proceedings of the 39th AAAI Conference on Artificial Intelligence publication_identifier: eissn: - 2374-3468 issn: - 2159-5399 publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' scopus_import: '1' status: public title: 'Linear equations with min and max operators: Computational complexity' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 39 year: '2025' ... --- OA_place: repository OA_type: green _id: '19771' abstract: - lang: eng text: "This artifact allows to review and reproduce the Isabelle proofs and practical experiments from the paper *Fixed Point Certificates for Reachability and Expected Rewards in MDPs*.\r\nThe contents are two-fold:\r\nFirst, the artifact contains a formally verified certificate checker for the certificates presented in the paper.\r\nThe formal Isabelle/HOL proofs of the background theory can be inspected, checked by Isabelle and the code extraction can be retraced.\r\n\r\nSecond, the artifact contains a modified version of the model checking tool `Storm` with support for certificate generation. Together with the provided scripts and benchmark files, this allows to reproduce the experiments from the paper.\r\nAn appropriate subset of the experiments is given to allow a review in a timely manner. In addition, original logfiles from our experiments are provided, allowing a detailed inspection.\r\n\r\nThe package includes convenient installation scripts for [the TACAS 2023 VM](https://doi.org/10.5281/zenodo.7113223) (based on Ubuntu 22.04).\r\nA native installation on Linux or macOS systems (including the newer ARM-based machines) is also possible." article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Tim full_name: Quatmann, Tim last_name: Quatmann - first_name: Maximilian full_name: Schäffeler, Maximilian last_name: Schäffeler - first_name: Maximilian full_name: Weininger, Maximilian id: 02ab0197-cc70-11ed-ab61-918e71f56881 last_name: Weininger orcid: 0000-0002-0163-2152 - first_name: Tobias full_name: Winkler, Tobias last_name: Winkler - first_name: Daniel full_name: Zilken, Daniel id: d8ebc24a-3f98-11f0-9044-8296d4f39ab3 last_name: Zilken citation: ama: 'Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. Artifact: Fixed point certificates for reachability and expected rewards in MDPs. 2025. doi:10.5281/ZENODO.14626585' apa: 'Chatterjee, K., Quatmann, T., Schäffeler, M., Weininger, M., Winkler, T., & Zilken, D. (2025). Artifact: Fixed point certificates for reachability and expected rewards in MDPs. Zenodo. https://doi.org/10.5281/ZENODO.14626585' chicago: 'Chatterjee, Krishnendu, Tim Quatmann, Maximilian Schäffeler, Maximilian Weininger, Tobias Winkler, and Daniel Zilken. “Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” Zenodo, 2025. https://doi.org/10.5281/ZENODO.14626585.' ieee: 'K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, and D. Zilken, “Artifact: Fixed point certificates for reachability and expected rewards in MDPs.” Zenodo, 2025.' ista: 'Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. 2025. Artifact: Fixed point certificates for reachability and expected rewards in MDPs, Zenodo, 10.5281/ZENODO.14626585.' mla: 'Chatterjee, Krishnendu, et al. Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs. Zenodo, 2025, doi:10.5281/ZENODO.14626585.' short: K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, D. Zilken, (2025). date_created: 2025-06-02T10:13:24Z date_published: 2025-01-09T00:00:00Z date_updated: 2026-09-16T06:57:17Z day: '09' ddc: - '000' department: - _id: KrCh doi: 10.5281/ZENODO.14626585 fulldoi: https://doi.org/10.5281/ZENODO.14626585 main_file_link: - open_access: '1' url: https://doi.org/10.5281/ZENODO.14626585 month: '01' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '19743' relation: used_in_publication status: public status: public title: 'Artifact: Fixed point certificates for reachability and expected rewards in MDPs' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '19843' abstract: - lang: eng text: 'Social dilemmas are collective-action problems where individual interests are at odds with group interests. Such dilemmas occur frequently at all scales of human interactions. When dealing with collective-action problems, people often act reciprocally. They adjust their behavior to match the previous behavior of the recipient. The literature distinguishes two kinds of reciprocity. According to direct reciprocity, individuals react to their immediate experiences with the recipient. They are more likely to cooperate if the recipient previously cooperated with them. According to indirect reciprocity, individuals react to the recipient’s general behavior, irrespectively of whether or not they benefited directly. In practice, the two kinds of reciprocity are often intertwined; people typically base their decisions on both direct experiences and indirect observations. Yet only recently have researchers begun to explore how the two kinds of reciprocity interact. So far, this research only addresses a single type of social dilemma, the donation game, where the effects of individual behaviors are independent. Instead, here we allow for all pairwise social dilemmas. By applying novel techniques to generalize the theory of zero-determinant strategies, we establish an important proof of principle: In all social dilemmas, socially optimal outcomes can be sustained as an equilibrium, using either direct or indirect reciprocity, or arbitrary mixtures thereof. These results neither require games to be repeated infinitely often, nor that individual opinions are synchronized. In this way, we considerably generalize the scope of models of reciprocity, and we build further bridges between the literatures on direct and indirect reciprocity.' acknowledgement: 'This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.).' article_number: pgaf154 article_processing_charge: Yes article_type: original author: - first_name: Valentin full_name: Hübner, Valentin id: 2c8aa207-dc7d-11ea-9b2f-f22972ecd910 last_name: Hübner orcid: 0009-0001-5009-4987 - first_name: Laura full_name: Schmid, Laura id: 38B437DE-F248-11E8-B48F-1D18A9856A87 last_name: Schmid orcid: 0000-0002-6978-7329 - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: Hübner V, Schmid L, Hilbe C, Chatterjee K. Stable strategies of direct and indirect reciprocity across all social dilemmas. PNAS Nexus. 2025;4(5). doi:10.1093/pnasnexus/pgaf154 apa: Hübner, V., Schmid, L., Hilbe, C., & Chatterjee, K. (2025). Stable strategies of direct and indirect reciprocity across all social dilemmas. PNAS Nexus. Oxford University Press. https://doi.org/10.1093/pnasnexus/pgaf154 chicago: Hübner, Valentin, Laura Schmid, Christian Hilbe, and Krishnendu Chatterjee. “Stable Strategies of Direct and Indirect Reciprocity across All Social Dilemmas.” PNAS Nexus. Oxford University Press, 2025. https://doi.org/10.1093/pnasnexus/pgaf154. ieee: V. Hübner, L. Schmid, C. Hilbe, and K. Chatterjee, “Stable strategies of direct and indirect reciprocity across all social dilemmas,” PNAS Nexus, vol. 4, no. 5. Oxford University Press, 2025. ista: Hübner V, Schmid L, Hilbe C, Chatterjee K. 2025. Stable strategies of direct and indirect reciprocity across all social dilemmas. PNAS Nexus. 4(5), pgaf154. mla: Hübner, Valentin, et al. “Stable Strategies of Direct and Indirect Reciprocity across All Social Dilemmas.” PNAS Nexus, vol. 4, no. 5, pgaf154, Oxford University Press, 2025, doi:10.1093/pnasnexus/pgaf154. short: V. Hübner, L. Schmid, C. Hilbe, K. Chatterjee, PNAS Nexus 4 (2025). corr_author: '1' date_created: 2025-06-15T22:01:30Z date_published: 2025-05-01T00:00:00Z date_updated: 2026-09-16T06:58:23Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1093/pnasnexus/pgaf154 ec_funded: 1 external_id: pmid: - '40417077' file: - access_level: open_access checksum: efd6648db3fc3ea0cdd7155d667e5f11 content_type: application/pdf creator: dernst date_created: 2025-06-23T08:09:50Z date_updated: 2025-06-23T08:09:50Z file_id: '19867' file_name: 2025_PNASNexus_Huebner.pdf file_size: 2551195 relation: main_file success: 1 file_date_updated: 2025-06-23T08:09:50Z fulldoi: https://doi.org/10.1093/pnasnexus/pgaf154 has_accepted_license: '1' intvolume: ' 4' issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: PNAS Nexus publication_identifier: eissn: - 2752-6542 publication_status: published publisher: Oxford University Press quality_controlled: '1' related_material: record: - id: '19903' relation: dissertation_contains status: public scopus_import: '1' status: public title: Stable strategies of direct and indirect reciprocity across all social dilemmas tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '19074' abstract: - lang: eng text: 'The public goods game is among the most studied metaphors of cooperation in groups. In this game, individuals can use their endowments to make contributions towards a good that benefits everyone. Each individual, however, is tempted to free-ride on the contributions of others. Herein, we study repeated public goods games among asymmetric players. Previous work has explored to which extent asymmetry allows for full cooperation, such that players contribute their full endowment each round. However, by design that work focusses on equilibria where individuals make the same contribution each round. Instead, here we consider players whose contributions along the equilibrium path can change from one round to the next. We do so for three different models – one without any budget constraints, one with endowment constraints, and one in which individuals can save their current endowment to be used in subsequent rounds. In each case, we explore two key quantities: the welfare and the resource efficiency that can be achieved in equilibrium. Welfare corresponds to the sum of all players’ payoffs. Resource efficiency relates this welfare to the total contributions made by the players. Compared to constant contribution sequences, we find that time-dependent contributions can improve resource efficiency across all three models. Moreover, they can improve the players’ welfare in the model with savings.' acknowledgement: 'This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement #754411 and the French Agence Nationale de la Recherche (under the Investissement d’Avenir programme, ANR-17-EURE-0010), and ARC SRIEAS Grant SR200100005 Securing Antarctica’s Environmental Future (to M.K.). Open access funding provided by Institute of Science and Technology (IST Austria).' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Valentin full_name: Hübner, Valentin id: 2c8aa207-dc7d-11ea-9b2f-f22972ecd910 last_name: Hübner orcid: 0009-0001-5009-4987 - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Manuel full_name: Staab, Manuel last_name: Staab - first_name: Maria full_name: Kleshnina, Maria id: 4E21749C-F248-11E8-B48F-1D18A9856A87 last_name: Kleshnina orcid: 0000-0002-5518-8317 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: Hübner V, Hilbe C, Staab M, Kleshnina M, Chatterjee K. Time-dependent strategies in repeated asymmetric public goods games. Dynamic Games and Applications. 2025;15:1617-1645. doi:10.1007/s13235-025-00627-5 apa: Hübner, V., Hilbe, C., Staab, M., Kleshnina, M., & Chatterjee, K. (2025). Time-dependent strategies in repeated asymmetric public goods games. Dynamic Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-025-00627-5 chicago: Hübner, Valentin, Christian Hilbe, Manuel Staab, Maria Kleshnina, and Krishnendu Chatterjee. “Time-Dependent Strategies in Repeated Asymmetric Public Goods Games.” Dynamic Games and Applications. Springer Nature, 2025. https://doi.org/10.1007/s13235-025-00627-5. ieee: V. Hübner, C. Hilbe, M. Staab, M. Kleshnina, and K. Chatterjee, “Time-dependent strategies in repeated asymmetric public goods games,” Dynamic Games and Applications, vol. 15. Springer Nature, pp. 1617–1645, 2025. ista: Hübner V, Hilbe C, Staab M, Kleshnina M, Chatterjee K. 2025. Time-dependent strategies in repeated asymmetric public goods games. Dynamic Games and Applications. 15, 1617–1645. mla: Hübner, Valentin, et al. “Time-Dependent Strategies in Repeated Asymmetric Public Goods Games.” Dynamic Games and Applications, vol. 15, Springer Nature, 2025, pp. 1617–45, doi:10.1007/s13235-025-00627-5. short: V. Hübner, C. Hilbe, M. Staab, M. Kleshnina, K. Chatterjee, Dynamic Games and Applications 15 (2025) 1617–1645. corr_author: '1' date_created: 2025-02-23T23:01:57Z date_published: 2025-11-01T00:00:00Z date_updated: 2026-09-16T06:58:23Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/s13235-025-00627-5 ec_funded: 1 external_id: isi: - '001415587800001' file: - access_level: open_access checksum: de0a412cbb7d98bf5e6a551c26acbefa content_type: application/pdf creator: dernst date_created: 2025-12-30T08:01:35Z date_updated: 2025-12-30T08:01:35Z file_id: '20888' file_name: 2025_DynGamesAppl_Huebner.pdf file_size: 1126178 relation: main_file success: 1 file_date_updated: 2025-12-30T08:01:35Z fulldoi: https://doi.org/10.1007/s13235-025-00627-5 has_accepted_license: '1' intvolume: ' 15' isi: 1 language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 1617-1645 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Dynamic Games and Applications publication_identifier: eissn: - 2153-0793 issn: - 2153-0785 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '19903' relation: dissertation_contains status: public scopus_import: '1' status: public title: Time-dependent strategies in repeated asymmetric public goods games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2025' ... --- OA_place: publisher OA_type: diamond _id: '20299' 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." acknowledgement: "This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12.\r\n" alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Ali full_name: Asadi, Ali id: 02d96aae-000e-11ec-b801-cadd0a5eefbb last_name: Asadi - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Jakob full_name: De Raaij, Jakob last_name: De Raaij 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.' 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. 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. 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.' 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. short: A. Asadi, K. Chatterjee, J. De Raaij, in:, The 41st Conference on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 223–232. conference: end_date: 2025-07-25 location: Rio de Janeiro, Brazil name: 'UAI: Conference on Uncertainty in Artificial Intelligence' start_date: 2025-07-21 corr_author: '1' date_created: 2025-09-07T22:01:34Z date_published: 2025-01-01T00:00:00Z date_updated: 2026-09-16T07:01:05Z day: '01' ddc: - '000' department: - _id: KrCh - _id: GradSch ec_funded: 1 external_id: arxiv: - '2506.12254' file: - access_level: open_access checksum: 4180c81bb6ed3b4f5c7a8e48d06520c6 content_type: application/pdf creator: dernst date_created: 2025-09-09T06:27:59Z date_updated: 2025-09-09T06:27:59Z file_id: '20313' file_name: 2025_UAI_Asadi.pdf file_size: 317097 relation: main_file success: 1 file_date_updated: 2025-09-09T06:27:59Z has_accepted_license: '1' intvolume: ' 286' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 223-232 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: The 41st Conference on Uncertainty in Artificial Intelligence publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Lower bound on Howard policy iteration for deterministic Markov Decision Processes tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 286 year: '2025' ... --- OA_place: publisher OA_type: diamond _id: '20297' abstract: - lang: eng 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." 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. alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Ali full_name: Asadi, Ali id: 02d96aae-000e-11ec-b801-cadd0a5eefbb last_name: Asadi - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X - first_name: Ali full_name: Shafiee, Ali id: 2783031a-7378-11f0-b2d0-f17f1db2ebad last_name: Shafiee 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.' 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. 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. 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.' 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. 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. conference: end_date: 2025-07-25 location: Rio de Janeiro, Brazil name: 'UAI: Conference on Uncertainty in Artificial Intelligence' start_date: 2025-07-21 corr_author: '1' date_created: 2025-09-07T22:01:34Z date_published: 2025-07-01T00:00:00Z date_updated: 2026-09-16T07:03:02Z day: '01' ddc: - '000' department: - _id: KrCh - _id: GradSch ec_funded: 1 external_id: arxiv: - '2412.00941' file: - access_level: open_access checksum: 1a37ebe7ba73ab6985765bf0d17a0acc content_type: application/pdf creator: dernst date_created: 2025-09-09T08:19:41Z date_updated: 2025-09-09T08:19:41Z file_id: '20315' file_name: 2025_UAI_AsadiAli.pdf file_size: 307458 relation: main_file success: 1 file_date_updated: 2025-09-09T08:19:41Z has_accepted_license: '1' intvolume: ' 286' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 238-247 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication: The 41st Conference on Uncertainty in Artificial Intelligence publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Limit-sure reachability for small memory policies in POMDPs is NP-complete tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 286 year: '2025' ... --- OA_place: publisher OA_type: diamond _id: '20296' abstract: - lang: eng 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. acknowledged_ssus: - _id: ScienComp 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)." alternative_title: - PMLR article_number: '26' article_processing_charge: No arxiv: 1 author: - first_name: Fabian full_name: Kresse, Fabian id: faff3c84-23f6-11ef-9085-e5187b51c604 last_name: Kresse - first_name: Zhengqi full_name: Yu, Zhengqi id: 20aa2ae8-f2f1-11ed-bbfa-8205053f1342 last_name: Yu orcid: 0000-0002-4993-773X - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 citation: 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.' 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.' 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. 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. 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.' 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. short: F. Kresse, E. Yu, C. Lampert, T.A. Henzinger, in:, 2nd International Conferenceon Neuro-Symbolic Systems, ML Research Press, 2025. conference: end_date: 2025-05-30 location: Philadephia, PA, United States name: 'NeuS: International Conferenceon Neuro-Symbolic Systems' start_date: 2025-05-28 corr_author: '1' date_created: 2025-09-07T22:01:34Z date_published: 2025-06-01T00:00:00Z date_updated: 2026-09-16T07:02:18Z day: '01' ddc: - '000' department: - _id: ChLa - _id: ToHe ec_funded: 1 external_id: arxiv: - '2505.19932' file: - access_level: open_access checksum: 90a32defed34787e771a5c1623b6b0d2 content_type: application/pdf creator: dernst date_created: 2025-09-09T08:10:13Z date_updated: 2025-09-09T08:10:13Z file_id: '20314' file_name: 2025_NeuS_Kresse.pdf file_size: 295466 relation: main_file success: 1 file_date_updated: 2025-09-09T08:10:13Z has_accepted_license: '1' intvolume: ' 288' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software - _id: d8f03aaa-b035-11f1-8588-d5147fa879e0 grant_number: COE12 name: Bilateral Artificial Intelligence (Lampert) publication: 2nd International Conferenceon Neuro-Symbolic Systems publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Logic gate neural networks are good for verification type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 288 year: '2025' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '19508' abstract: - lang: eng text: We consider random two-player zero-sum dynamic games with perfect information on a class of infinite directed graphs. Starting from a fixed vertex, the players take turns to move a token along the edges of the graph. Every vertex is assigned a payoff known in advance by both players. Every time the token visits a vertex, Player 2 pays Player 1 the corresponding payoff. We consider a distribution over such games by assigning i.i.d. payoffs to the vertices. On the one hand, for acyclic directed graphs of bounded degree and sub-exponential expansion, we show that, when the duration of the game tends to infinity, the value converges almost surely to a constant at an exponential rate dominated in terms of the expansion. On the other hand, for the infinite d-ary tree (that does not fall into the previous class of graphs), we show convergence at a double-exponential rate. acknowledgement: Open access funding provided by Institute of Science and Technology (IST Austria). This work was supported by the French Agence Nationale de la Recherche (ANR) under references ANR-21-CE40-0020 (CONVERGENCE project) and ANR-20-CE40-0002 (GrHyDy), by Fondecyt grant 1220174, by ANID Chile grant ACT210005, and by the ERC CoG 863818 (ForM-SMArt) grant. This collaboration was mainly conducted during a 1-year visit of Bruno Ziliotto to the Center for Mathematical Modeling (CMM) at University of Chile in 2023, under the IRL program of CNRS. This work was supported by Fondation CFM pour la Recherche. This paper has also been funded by the Agence Nationale de la Recherche under grant ANR-17-EURE-0010 (Investissements d’Avenir program). article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Luc full_name: Attia, Luc last_name: Attia - first_name: Lyuben full_name: Lichev, Lyuben id: 9aa8388e-d003-11ee-8458-c4c1d7447977 last_name: Lichev - first_name: Dieter full_name: Mitsche, Dieter last_name: Mitsche - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X - first_name: Bruno full_name: Ziliotto, Bruno last_name: Ziliotto citation: ama: Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 2025;15:1517-1535. doi:10.1007/s13235-025-00636-4 apa: Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., & Ziliotto, B. (2025). Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-025-00636-4 chicago: Attia, Luc, Lyuben Lichev, Dieter Mitsche, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” Dynamic Games and Applications. Springer Nature, 2025. https://doi.org/10.1007/s13235-025-00636-4. ieee: L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Random zero-sum dynamic games on infinite directed graphs,” Dynamic Games and Applications, vol. 15. Springer Nature, pp. 1517–1535, 2025. ista: Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. 2025. Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 15, 1517–1535. mla: Attia, Luc, et al. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” Dynamic Games and Applications, vol. 15, Springer Nature, 2025, pp. 1517–35, doi:10.1007/s13235-025-00636-4. short: L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, Dynamic Games and Applications 15 (2025) 1517–1535. corr_author: '1' date_created: 2025-04-06T22:01:32Z date_published: 2025-11-01T00:00:00Z date_updated: 2026-09-16T07:00:33Z day: '01' ddc: - '000' department: - _id: MaKw - _id: KrCh doi: 10.1007/s13235-025-00636-4 ec_funded: 1 external_id: isi: - '001449708900001' file: - access_level: open_access checksum: b3a1b7eef40c9ac2acf3fef563081694 content_type: application/pdf creator: dernst date_created: 2025-12-30T08:13:04Z date_updated: 2025-12-30T08:13:04Z file_id: '20891' file_name: 2025_DynGamesAppl_Attia.pdf file_size: 570994 relation: main_file success: 1 file_date_updated: 2025-12-30T08:13:04Z fulldoi: https://doi.org/10.1007/s13235-025-00636-4 has_accepted_license: '1' intvolume: ' 15' isi: 1 language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 1517-1535 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Dynamic Games and Applications publication_identifier: eissn: - 2153-0793 issn: - 2153-0785 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '20234' relation: dissertation_contains status: public scopus_import: '1' status: public title: Random zero-sum dynamic games on infinite directed graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2025' ...