[{"day":"01","department":[{"_id":"MaSe"}],"OA_place":"repository","acknowledgement":"P.J.E was partially funded by the German BMWK project QCHALLenge (Grant No. 01MQ22008B).\r\n","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2508.10656"}],"author":[{"last_name":"Eder","first_name":"Peter J.","full_name":"Eder, Peter J."},{"id":"ade85a9c-3200-11ee-973b-91c1eb240410","orcid":"0009-0002-2370-8661","full_name":"Kerschbaumer, Aron","first_name":"Aron","last_name":"Kerschbaumer"},{"full_name":"Finžgar, Jernej Rudi","last_name":"Finžgar","first_name":"Jernej Rudi"},{"last_name":"Medina Ramos","first_name":"Raimel A","full_name":"Medina Ramos, Raimel A","orcid":"0000-0002-5383-2869","id":"CE680B90-D85A-11E9-B684-C920E6697425"},{"full_name":"Schuetz, Martin J. A.","first_name":"Martin J. A.","last_name":"Schuetz"},{"last_name":"Katzgraber","first_name":"Helmut G.","full_name":"Katzgraber, Helmut G."},{"first_name":"Sarah","last_name":"Braun","full_name":"Braun, Sarah"},{"full_name":"Mendl, Christian B.","first_name":"Christian B.","last_name":"Mendl"}],"title":"Quantum-guided cluster algorithms for combinatorial optimization","date_updated":"2026-02-18T08:45:56Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"2025 IEEE International Conference on Quantum Computing and Engineering","_id":"21272","oa_version":"Preprint","date_created":"2026-02-17T08:00:17Z","external_id":{"arxiv":["2508.10656"]},"oa":1,"OA_type":"green","publication_identifier":{"eisbn":["9798331557362"]},"arxiv":1,"date_published":"2025-09-01T00:00:00Z","month":"09","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2025","conference":{"start_date":"2025-08-30","location":"Albuquerque, NM, United States","end_date":"2025-09-05","name":"QCE: International Conference on Quantum Computing and Engineering"},"quality_controlled":"1","corr_author":"1","type":"conference","publisher":"IEEE","publication_status":"published","abstract":[{"text":"Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a Monte Carlo (MC)-based algorithm that updates spins one at a time. Yet, these localized updates can cause the system to become trapped in local minima. Cluster algorithms (CAs) were developed to address this limitation and have demonstrated considerable success in studying ferromagnetic systems; however, they tend to encounter percolation issues when applied to generic spin glasses. In this work, we introduce a novel CA designed to tackle these challenges by leveraging precomputed two-point correlations, aiming solve combinatorial optimization problems in the form of Max-Cut more efficiently. In our approach, clusters are formed probabilistically based on these correlations. Various classical and quantum algorithms can be employed to generate correlations that embody information about the energy landscape of the problem. By utilizing this information, the algorithm aims to identify groups of spins whose simultaneous flipping induces large transitions in configuration space with high acceptance probability - even at low energy levels - thereby escaping local minima more effectively. Notably, clusters generated using correlations from the Quantum Approximate Optimization Algorithm exhibit high acceptance rates at low temperatures. These acceptance rates often increase with circuit depth, accelerating the algorithm and enabling more efficient exploration of the solution space.","lang":"eng"}],"citation":{"short":"P.J. Eder, A. Kerschbaumer, J.R. Finžgar, R.A. Medina Ramos, M.J.A. Schuetz, H.G. Katzgraber, S. Braun, C.B. Mendl, in:, 2025 IEEE International Conference on Quantum Computing and Engineering, IEEE, 2025.","ama":"Eder PJ, Kerschbaumer A, Finžgar JR, et al. Quantum-guided cluster algorithms for combinatorial optimization. In: <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/qce65121.2025.00033\">10.1109/qce65121.2025.00033</a>","chicago":"Eder, Peter J., Aron Kerschbaumer, Jernej Rudi Finžgar, Raimel A Medina Ramos, Martin J. A. Schuetz, Helmut G. Katzgraber, Sarah Braun, and Christian B. Mendl. “Quantum-Guided Cluster Algorithms for Combinatorial Optimization.” In <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/qce65121.2025.00033\">https://doi.org/10.1109/qce65121.2025.00033</a>.","ieee":"P. J. Eder <i>et al.</i>, “Quantum-guided cluster algorithms for combinatorial optimization,” in <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>, Albuquerque, NM, United States, 2025.","ista":"Eder PJ, Kerschbaumer A, Finžgar JR, Medina Ramos RA, Schuetz MJA, Katzgraber HG, Braun S, Mendl CB. 2025. Quantum-guided cluster algorithms for combinatorial optimization. 2025 IEEE International Conference on Quantum Computing and Engineering. QCE: International Conference on Quantum Computing and Engineering.","mla":"Eder, Peter J., et al. “Quantum-Guided Cluster Algorithms for Combinatorial Optimization.” <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/qce65121.2025.00033\">10.1109/qce65121.2025.00033</a>.","apa":"Eder, P. J., Kerschbaumer, A., Finžgar, J. R., Medina Ramos, R. A., Schuetz, M. J. A., Katzgraber, H. G., … Mendl, C. B. (2025). Quantum-guided cluster algorithms for combinatorial optimization. In <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. Albuquerque, NM, United States: IEEE. <a href=\"https://doi.org/10.1109/qce65121.2025.00033\">https://doi.org/10.1109/qce65121.2025.00033</a>"},"doi":"10.1109/qce65121.2025.00033"},{"license":"https://creativecommons.org/licenses/by/4.0/","article_processing_charge":"No","file_date_updated":"2026-02-18T09:02:33Z","page":"91:1-91:20","month":"06","conference":{"end_date":"2025-07-11","name":"ICALP: Automata, Languages and Programming","location":"Aarhus, Denmark","start_date":"2025-07-08"},"year":"2025","ddc":["000"],"quality_controlled":"1","volume":334,"language":[{"iso":"eng"}],"corr_author":"1","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","intvolume":"       334","has_accepted_license":"1","doi":"10.4230/lipics.icalp.2025.91","scopus_import":"1","abstract":[{"lang":"eng","text":"We give an algorithm that, with high probability, maintains a (1-ε)-approximate s-t maximum flow in undirected, uncapacitated n-vertex graphs undergoing m edge insertions in Õ(m+ n F^*/ε) total update time, where F^{*} is the maximum flow on the final graph. This is the first algorithm to achieve polylogarithmic amortized update time for dense graphs (m = Ω(n²)), and more generally, for graphs where F^* = Õ(m/n). At the heart of our incremental algorithm is the residual graph sparsification technique of Karger and Levine [SICOMP '15], originally designed for computing exact maximum flows in the static setting. Our main contributions are (i) showing how to maintain such sparsifiers for approximate maximum flows in the incremental setting and (ii) generalizing the cut sparsification framework of Fung et al. [SICOMP '19] from undirected graphs to balanced directed graphs."}],"citation":{"ama":"Goranci G, Henzinger M, Räcke H, Sricharan A. Incremental approximate maximum flow via residual graph sparsification. In: <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:91:1-91:20. doi:<a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">10.4230/lipics.icalp.2025.91</a>","short":"G. Goranci, M. Henzinger, H. Räcke, A. Sricharan, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20.","ieee":"G. Goranci, M. Henzinger, H. Räcke, and A. Sricharan, “Incremental approximate maximum flow via residual graph sparsification,” in <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Aarhus, Denmark, 2025, vol. 334, p. 91:1-91:20.","ista":"Goranci G, Henzinger M, Räcke H, Sricharan A. 2025. Incremental approximate maximum flow via residual graph sparsification. 52nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 334, 91:1-91:20.","chicago":"Goranci, Gramoz, Monika Henzinger, Harald Räcke, and A. Sricharan. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” In <i>52nd International Colloquium on Automata, Languages, and Programming</i>, 334:91:1-91:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">https://doi.org/10.4230/lipics.icalp.2025.91</a>.","mla":"Goranci, Gramoz, et al. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” <i>52nd International Colloquium on Automata, Languages, and Programming</i>, vol. 334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20, doi:<a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">10.4230/lipics.icalp.2025.91</a>.","apa":"Goranci, G., Henzinger, M., Räcke, H., &#38; Sricharan, A. (2025). Incremental approximate maximum flow via residual graph sparsification. In <i>52nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 334, p. 91:1-91:20). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">https://doi.org/10.4230/lipics.icalp.2025.91</a>"},"author":[{"last_name":"Goranci","first_name":"Gramoz","full_name":"Goranci, Gramoz"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"first_name":"A.","last_name":"Sricharan","full_name":"Sricharan, A."}],"title":"Incremental approximate maximum flow via residual graph sparsification","alternative_title":["LIPIcs"],"ec_funded":1,"department":[{"_id":"MoHe"}],"day":"30","acknowledgement":"Monika Henzinger and A. R. Sricharan: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI\r\n10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Harald Räcke: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389.","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-02-18T09:06:12Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","_id":"21280","project":[{"name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422"},{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"date_created":"2026-02-17T08:26:06Z","oa_version":"Published Version","file":[{"creator":"dernst","file_name":"2025_ICALP_Goranci.pdf","relation":"main_file","date_created":"2026-02-18T09:02:33Z","checksum":"c178cf554e44204b9f64ebd9b54cf7ba","file_size":944824,"date_updated":"2026-02-18T09:02:33Z","content_type":"application/pdf","success":1,"access_level":"open_access","file_id":"21315"}],"publication":"52nd International Colloquium on Automata, Languages, and Programming","arxiv":1,"OA_type":"gold","publication_identifier":{"isbn":["9783959773720"]},"date_published":"2025-06-30T00:00:00Z","oa":1,"external_id":{"arxiv":["2502.09105"]}},{"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2026-02-19T09:39:15Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"09","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"ec_funded":1,"OA_place":"publisher","acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093.\r\n","alternative_title":["LIPIcs"],"title":"ε-stationary Nash equilibria in multi-player stochastic graph games","author":[{"full_name":"Asadi, Ali","last_name":"Asadi","first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb"},{"last_name":"Brice","first_name":"Leonard","full_name":"Brice, Leonard"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","last_name":"Thejaswini","first_name":"K. S.","full_name":"Thejaswini, K. S."}],"external_id":{"arxiv":["2508.15356"]},"oa":1,"publication_identifier":{"isbn":["9783959774062"]},"OA_type":"gold","arxiv":1,"date_published":"2025-12-09T00:00:00Z","file":[{"file_name":"2025_FSTTCS_Asadi.pdf","creator":"dernst","checksum":"a66343e3ccc4a9cc5bc699c03d5764ff","date_created":"2026-02-18T09:13:25Z","file_size":1054007,"relation":"main_file","access_level":"open_access","date_updated":"2026-02-18T09:13:25Z","content_type":"application/pdf","success":1,"file_id":"21316"}],"publication":"45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"_id":"21281","oa_version":"Published Version","date_created":"2026-02-17T08:27:14Z","volume":360,"language":[{"iso":"eng"}],"ddc":["000"],"year":"2025","conference":{"location":"Pilani, India","end_date":"2025-12-19","name":"FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science","start_date":"2025-12-17"},"quality_controlled":"1","page":"9:1-9:17","file_date_updated":"2026-02-18T09:13:25Z","month":"12","article_processing_charge":"Yes","abstract":[{"lang":"eng","text":"A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an ε-Nash equilibrium if no player can gain more than ε by unilaterally deviating from their strategy. In this work, we use ε-Nash equilibria to approximate the computation of Nash equilibria. Specifically, we focus on turn-based, multiplayer stochastic games played on graphs, where players are restricted to stationary strategies - strategies that use randomness but not memory.\r\nThe problem of deciding the constrained existence of stationary Nash equilibria - where each player’s payoff must lie within a given interval - is known to be ∃ℝ-complete in such a setting (Hansen and Sølvsten, 2020). We extend this line of work to stationary ε-Nash equilibria and present an algorithm that solves the following promise problem: given a game with a Nash equilibrium satisfying the constraints, compute an ε-Nash equilibrium that ε-satisfies those same constraints - satisfies the constraints up to an ε additive error. Our algorithm runs in FNP^NP time.\r\nTo achieve this, we first show that if a constrained Nash equilibrium exists, then one exists where the non-zero probabilities are at least an inverse of a double-exponential in the input. We further prove that such a strategy can be encoded using floating-point representations, as in the work of Frederiksen and Miltersen (2013), which finally gives us our FNP^NP algorithm. \r\nWe further show that the decision version of the promise problem is NP-hard. Finally, we show a partial tightness result by proving a lower bound for such techniques: if a constrained Nash equilibrium exists, then there must be one where the probabilities in the strategies are double-exponentially small."}],"citation":{"mla":"Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17, doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>.","apa":"Asadi, A., Brice, L., Chatterjee, K., &#38; Thejaswini, K. S. (2025). ε-stationary Nash equilibria in multi-player stochastic graph games. In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>","short":"A. Asadi, L. Brice, K. Chatterjee, K.S. Thejaswini, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17.","ama":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria in multi-player stochastic graph games. In: <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>","ieee":"A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash equilibria in multi-player stochastic graph games,” in <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Pilani, India, 2025, vol. 360, p. 9:1-9:17.","ista":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. 2025. ε-stationary Nash equilibria in multi-player stochastic graph games. 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 360, 9:1-9:17.","chicago":"Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>."},"doi":"10.4230/lipics.fsttcs.2025.9","intvolume":"       360","has_accepted_license":"1","corr_author":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","publication_status":"published"},{"OA_type":"green","arxiv":1,"doi":"10.48550/arXiv.2512.15170","date_published":"2025-12-17T00:00:00Z","abstract":[{"lang":"eng","text":"The polarization of light is a critically under-utilized, rich source of information in astronomy. For stars in particular, surface magnetism polarization that can be detected and measured with spectro-polarimetry. Many questions about these surface fields remain unanswered due to a lack of dedicated instruments capable of probing weak and strong surface magnetic fields for the entire mass range of stars, from M-dwarfs (and even substellar objects) to massive O-type stars at different evolutionary stages and metallicities. These questions range from the origin of these fields to their true incidence rate throughout the stellar population and the dependence on metallicity. Magnetic fields, although currently often excluded from stellar evolution models, play an important role in stellar evolution. Connecting the surface fields to internal fields through asteroseismology will instigate a new era of understanding stellar evolution and the transport of angular momentum and chemical elements throughout stellar interiors, also impacting our understanding of star-planet interactions and stellar remnants. Polarimetry is also an under-utilized tool to observationally constrain the mode identification of nonradial oscillations, which lies at the basis of accurate asteroseismic parameter estimation at percentage-level for stellar radii, masses, ages, internal rotation, and magnetic field strengths. Combining strong constraints on mode identification and surface magnetic properties through the acquisition of time-resolved, high-resolution and high-signal-to-noise (S/N) spectro-polarimetry and spectroscopy promises to bring leaps forward in our understanding of stellar structure, particularly when combined with long-term space photometric data from past, current, and future missions."}],"external_id":{"arxiv":["2512.15170"]},"citation":{"ama":"Vandersnickt J, Armenta RO, Vanlaer V, et al. Expanding stellar horizons with polarized light. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2512.15170\">10.48550/arXiv.2512.15170</a>","short":"J. Vandersnickt, R.O. Armenta, V. Vanlaer, A.D.-U. A. David-Uraz, C. Aerts, S.B. Das, J.-C. Bouret, D.M. Bowman, L.A. Bugnet, V. Khalack, J.L.-B. J. Labadie-Bartz, S. Mathis, Y. Nazé, C. Neiner, P. Petit, V. Petit, K.T.-P. K. Thomson-Paressant, T.V. Doorsselaere, M. Vanrespaille, ArXiv (n.d.).","chicago":"Vandersnickt, J., R. Ochoa Armenta, V. Vanlaer, A. David-Uraz A. David-Uraz, C. Aerts, S. B. Das, J. -C. Bouret, et al. “Expanding Stellar Horizons with Polarized Light.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2512.15170\">https://doi.org/10.48550/arXiv.2512.15170</a>.","ieee":"J. Vandersnickt <i>et al.</i>, “Expanding stellar horizons with polarized light,” <i>arXiv</i>. .","ista":"Vandersnickt J, Armenta RO, Vanlaer V, A. David-Uraz AD-U, Aerts C, Das SB, Bouret J-C, Bowman DM, Bugnet LA, Khalack V, J. Labadie-Bartz JL-B, Mathis S, Nazé Y, Neiner C, Petit P, Petit V, K. Thomson-Paressant KT-P, Doorsselaere TV, Vanrespaille M. Expanding stellar horizons with polarized light. arXiv, 2512.15170.","mla":"Vandersnickt, J., et al. “Expanding Stellar Horizons with Polarized Light.” <i>ArXiv</i>, 2512.15170, doi:<a href=\"https://doi.org/10.48550/arXiv.2512.15170\">10.48550/arXiv.2512.15170</a>.","apa":"Vandersnickt, J., Armenta, R. O., Vanlaer, V., A. David-Uraz, A. D.-U., Aerts, C., Das, S. B., … Vanrespaille, M. (n.d.). Expanding stellar horizons with polarized light. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2512.15170\">https://doi.org/10.48550/arXiv.2512.15170</a>"},"oa":1,"_id":"21309","type":"preprint","oa_version":"Preprint","article_number":"2512.15170","publication_status":"submitted","date_created":"2026-02-17T13:53:50Z","publication":"arXiv","year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-04-07T06:00:40Z","language":[{"iso":"eng"}],"status":"public","author":[{"full_name":"Vandersnickt, J.","last_name":"Vandersnickt","first_name":"J."},{"first_name":"R. Ochoa","last_name":"Armenta","full_name":"Armenta, R. Ochoa"},{"first_name":"V.","last_name":"Vanlaer","full_name":"Vanlaer, V."},{"full_name":"A. David-Uraz, A. David-Uraz","last_name":"A. David-Uraz","first_name":"A. David-Uraz"},{"last_name":"Aerts","first_name":"C.","full_name":"Aerts, C."},{"full_name":"Das, S. B.","first_name":"S. B.","last_name":"Das"},{"first_name":"J. -C.","last_name":"Bouret","full_name":"Bouret, J. -C."},{"full_name":"Bowman, D. M.","last_name":"Bowman","first_name":"D. M."},{"full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","last_name":"Bugnet","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"full_name":"Khalack, V.","first_name":"V.","last_name":"Khalack"},{"full_name":"J. Labadie-Bartz, J. Labadie-Bartz","first_name":"J. Labadie-Bartz","last_name":"J. Labadie-Bartz"},{"last_name":"Mathis","first_name":"S.","full_name":"Mathis, S."},{"first_name":"Y.","last_name":"Nazé","full_name":"Nazé, Y."},{"first_name":"C.","last_name":"Neiner","full_name":"Neiner, C."},{"first_name":"P.","last_name":"Petit","full_name":"Petit, P."},{"last_name":"Petit","first_name":"V.","full_name":"Petit, V."},{"first_name":"K. Thomson-Paressant","last_name":"K. Thomson-Paressant","full_name":"K. Thomson-Paressant, K. Thomson-Paressant"},{"first_name":"T. Van","last_name":"Doorsselaere","full_name":"Doorsselaere, T. Van"},{"last_name":"Vanrespaille","first_name":"M.","full_name":"Vanrespaille, M."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2512.15170"}],"title":"Expanding stellar horizons with polarized light","article_processing_charge":"No","department":[{"_id":"LiBu"}],"day":"17","OA_place":"repository","month":"12"},{"publication_status":"published","type":"journal_article","publisher":"IOP Publishing","has_accepted_license":"1","intvolume":"       990","PlanS_conform":"1","scopus_import":"1","doi":"10.3847/2041-8213/adff82","citation":{"ama":"Galiullin I, Rodriguez AC, El-Badry K, et al. Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. <i>The Astrophysical Journal Letters</i>. 2025;990(2). doi:<a href=\"https://doi.org/10.3847/2041-8213/adff82\">10.3847/2041-8213/adff82</a>","short":"I. Galiullin, A.C. Rodriguez, K. El-Badry, I. Caiazzo, P. Szkody, P. Nagarajan, S. Whitebook, The Astrophysical Journal Letters 990 (2025).","ista":"Galiullin I, Rodriguez AC, El-Badry K, Caiazzo I, Szkody P, Nagarajan P, Whitebook S. 2025. Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. The Astrophysical Journal Letters. 990(2), L57.","ieee":"I. Galiullin <i>et al.</i>, “Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor,” <i>The Astrophysical Journal Letters</i>, vol. 990, no. 2. IOP Publishing, 2025.","chicago":"Galiullin, Ilkham, Antonio C. Rodriguez, Kareem El-Badry, Ilaria Caiazzo, Paula Szkody, Pranav Nagarajan, and Samuel Whitebook. “Optical Spectroscopy of the Most Compact Accreting Binary Harboring a Magnetic White Dwarf and a Hydrogen-Rich Donor.” <i>The Astrophysical Journal Letters</i>. IOP Publishing, 2025. <a href=\"https://doi.org/10.3847/2041-8213/adff82\">https://doi.org/10.3847/2041-8213/adff82</a>.","mla":"Galiullin, Ilkham, et al. “Optical Spectroscopy of the Most Compact Accreting Binary Harboring a Magnetic White Dwarf and a Hydrogen-Rich Donor.” <i>The Astrophysical Journal Letters</i>, vol. 990, no. 2, L57, IOP Publishing, 2025, doi:<a href=\"https://doi.org/10.3847/2041-8213/adff82\">10.3847/2041-8213/adff82</a>.","apa":"Galiullin, I., Rodriguez, A. C., El-Badry, K., Caiazzo, I., Szkody, P., Nagarajan, P., &#38; Whitebook, S. (2025). Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. <i>The Astrophysical Journal Letters</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/2041-8213/adff82\">https://doi.org/10.3847/2041-8213/adff82</a>"},"abstract":[{"lang":"eng","text":"Accreting white dwarfs (WDs) in close binary systems, commonly known as cataclysmic variables (CVs), with orbital periods below the canonical period minimum (≈80 minutes) are rare. Such short periods can only be reached if the donor star in the CV is either significantly evolved before initiating mass transfer to the WD or is metal-poor. We present optical photometry and spectroscopy of Gaia19bxc, a high-amplitude variable identified as a polar CV with an exceptionally short orbital period of 64.42 minutes—well below the canonical CV period minimum. High-speed photometry confirms persistent double-peaked variability consistent with cyclotron beaming, thus indicating the presence of a magnetic WD. Phase-resolved Keck/Low-Resolution Imaging Spectrometer (LRIS) spectroscopy reveals strong hydrogen and helium emission lines but no donor features, indicating the accretor is a magnetic WD and the donor is hydrogen-rich, but cold and faint. The absence of a detectable donor and the low inferred temperature (≲3500 K) disfavor an evolved donor scenario. Instead, the short period and the system’s halo-like kinematics suggest Gaia19bxc may be the first known metal-poor polar. Because metal-poor donors are more compact than solar-metallicity donors of the same mass, they can reach shorter minimum periods. Gaia19bxc is one of only a handful of known metal-poor CVs below the canonical period minimum and has the shortest period of any such magnetic system discovered to date."}],"article_processing_charge":"Yes","month":"09","file_date_updated":"2026-02-19T07:24:10Z","issue":"2","quality_controlled":"1","ddc":["520"],"year":"2025","language":[{"iso":"eng"}],"volume":990,"date_created":"2026-02-18T10:17:04Z","oa_version":"Published Version","article_number":"L57","_id":"21317","publication":"The Astrophysical Journal Letters","file":[{"date_created":"2026-02-19T07:24:10Z","checksum":"f76556d129aa0e9facc85602b0b5b54d","file_size":3772189,"relation":"main_file","file_name":"2025_AstrophysicalJournal_Galiullin.pdf","creator":"dernst","file_id":"21329","access_level":"open_access","date_updated":"2026-02-19T07:24:10Z","content_type":"application/pdf","success":1}],"DOAJ_listed":"1","date_published":"2025-09-08T00:00:00Z","arxiv":1,"publication_identifier":{"eissn":["2041-8213"],"issn":["2041-8205"]},"OA_type":"gold","oa":1,"external_id":{"arxiv":["2508.20170"]},"title":"Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor","author":[{"first_name":"Ilkham","last_name":"Galiullin","full_name":"Galiullin, Ilkham"},{"full_name":"Rodriguez, Antonio C.","first_name":"Antonio C.","last_name":"Rodriguez"},{"full_name":"El-Badry, Kareem","last_name":"El-Badry","first_name":"Kareem"},{"orcid":"0000-0002-4770-5388","full_name":"Caiazzo, Ilaria","last_name":"Caiazzo","first_name":"Ilaria","id":"8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d"},{"full_name":"Szkody, Paula","first_name":"Paula","last_name":"Szkody"},{"first_name":"Pranav","last_name":"Nagarajan","full_name":"Nagarajan, Pranav"},{"first_name":"Samuel","last_name":"Whitebook","full_name":"Whitebook, Samuel"}],"acknowledgement":"Based on observations obtained with the Samuel Oschin Telescope 48 inch and the 60 inch Telescope at the Palomar Observatory as part of the Zwicky Transient Facility project. ZTF is supported by the National Science Foundation under grants No. AST-1440341 and AST-2034437 and a collaboration including current partners Caltech, IPAC, the Weizmann Institute of Science, the Oskar Klein Center at Stockholm University, the University of Maryland, Deutsches Elektronen-Synchrotron and Humboldt University, the TANGO Consortium of Taiwan, the University of Wisconsin at Milwaukee, Trinity College Dublin, Lawrence Livermore National Laboratories, IN2P3, University of Warwick, Ruhr University Bochum, Northwestern University and former partners the University of Washington, Los Alamos National Laboratories, and Lawrence Berkeley National Laboratories. Operations are conducted by COO, IPAC, and UW. This work has made use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC; https://www.cosmos.esa.int/web/gaia/dpac/consortium). Funding for the DPAC has been provided by national institutions, in particular the institutions participating in the Gaia Multilateral Agreement. Some of the data presented herein were obtained at Keck Observatory, which is a private 501(c)3 nonprofit organization operated as a scientific partnership among the California Institute of Technology, the University of California, and the National Aeronautics and Space Administration. The Observatory was made possible by the generous financial support of the W. M. Keck Foundation. We wish to recognize and acknowledge the very significant cultural role and reverence that the summit of Maunakea has always had within the Native Hawaiian community. We are most fortunate to have had the opportunity to conduct observations from this mountain. We are grateful to the staff of the Palomar and Keck Observatories for their work in helping us carry out our observations.\r\n\r\nI.G. acknowledges support from Kazan Federal University. A.C.R. acknowledges support from the National Science Foundation via an NSF Graduate Research Fellowship. We thank the anonymous referee for useful comments and suggestions, which contributed to the improvement of this manuscript.","article_type":"original","OA_place":"publisher","day":"08","department":[{"_id":"IlCa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2026-02-19T07:27:01Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"title":"Quantum delocalization of a levitated nanoparticle","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2408.01264","open_access":"1"}],"author":[{"first_name":"M.","last_name":"Rossi","full_name":"Rossi, M."},{"id":"d67706f8-8eb1-11ee-ad1b-9c30dfa19e0b","full_name":"Militaru, Andrei","last_name":"Militaru","first_name":"Andrei"},{"last_name":"Carlon Zambon","first_name":"N.","full_name":"Carlon Zambon, N."},{"last_name":"Riera-Campeny","first_name":"A.","full_name":"Riera-Campeny, A."},{"full_name":"Romero-Isart, O.","last_name":"Romero-Isart","first_name":"O."},{"last_name":"Frimmer","first_name":"M.","full_name":"Frimmer, M."},{"full_name":"Novotny, L.","last_name":"Novotny","first_name":"L."}],"article_type":"original","OA_place":"repository","day":"19","department":[{"_id":"JoFi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2026-02-24T07:03:57Z","article_number":"083601","oa_version":"Preprint","date_created":"2026-02-18T10:19:30Z","pmid":1,"_id":"21318","publication":"Physical Review Letters","date_published":"2025-08-19T00:00:00Z","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"OA_type":"green","arxiv":1,"external_id":{"pmid":["40929305"],"arxiv":["2408.01264"]},"oa":1,"article_processing_charge":"No","month":"08","issue":"8","quality_controlled":"1","year":"2025","language":[{"iso":"eng"}],"volume":135,"publication_status":"published","publisher":"American Physical Society","type":"journal_article","intvolume":"       135","doi":"10.1103/2yzc-fsm3","citation":{"ama":"Rossi M, Militaru A, Carlon Zambon N, et al. Quantum delocalization of a levitated nanoparticle. <i>Physical Review Letters</i>. 2025;135(8). doi:<a href=\"https://doi.org/10.1103/2yzc-fsm3\">10.1103/2yzc-fsm3</a>","short":"M. Rossi, A. Militaru, N. Carlon Zambon, A. Riera-Campeny, O. Romero-Isart, M. Frimmer, L. Novotny, Physical Review Letters 135 (2025).","chicago":"Rossi, M., Andrei Militaru, N. Carlon Zambon, A. Riera-Campeny, O. Romero-Isart, M. Frimmer, and L. Novotny. “Quantum Delocalization of a Levitated Nanoparticle.” <i>Physical Review Letters</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/2yzc-fsm3\">https://doi.org/10.1103/2yzc-fsm3</a>.","ieee":"M. Rossi <i>et al.</i>, “Quantum delocalization of a levitated nanoparticle,” <i>Physical Review Letters</i>, vol. 135, no. 8. American Physical Society, 2025.","ista":"Rossi M, Militaru A, Carlon Zambon N, Riera-Campeny A, Romero-Isart O, Frimmer M, Novotny L. 2025. Quantum delocalization of a levitated nanoparticle. Physical Review Letters. 135(8), 083601.","apa":"Rossi, M., Militaru, A., Carlon Zambon, N., Riera-Campeny, A., Romero-Isart, O., Frimmer, M., &#38; Novotny, L. (2025). Quantum delocalization of a levitated nanoparticle. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/2yzc-fsm3\">https://doi.org/10.1103/2yzc-fsm3</a>","mla":"Rossi, M., et al. “Quantum Delocalization of a Levitated Nanoparticle.” <i>Physical Review Letters</i>, vol. 135, no. 8, 083601, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/2yzc-fsm3\">10.1103/2yzc-fsm3</a>."},"abstract":[{"lang":"eng","text":"Matter waves have been observed in double-slit experiments with microscopic objects, such as atoms or molecules. The wave function describing the motion of these objects must extend over a distance comparable to the slit separation, much larger than the characteristic size of the objects. Preparing such states for more massive objects, such as mechanical oscillators, remains an outstanding challenge. Here we delocalize the quantum ground state of an optically levitated nanosphere by modulating the stiffness of the confining potential. We show a more than threefold increase of the initial coherence length, which corresponds to mechanical momentum squeezing of more than 7 dB. Our work is a stepping stone toward the generation of coherence lengths comparable to the object size, a crucial regime for macroscopic quantum experiments."}]},{"doi":"10.4230/LIPIcs.ICALP.2025.87","abstract":[{"text":"Prophet inequalities are a central object of study in optimal stopping theory. In the iid model, a gambler sees values in an online fashion, sampled independently from a given distribution. Upon observing each value, the gambler either accepts it as a reward, or irrevocably rejects it and proceeds to observe the next value. The goal of the gambler, who cannot see the future, is to maximise the expected value of the reward while competing against the expectation of a prophet (the offline maximum). In other words, one seeks to maximise the gambler-to-prophet ratio of the expectations. \r\nThis model has been studied with infinite, finite and unknown number of values. When the gambler faces a random number of values, the model is said to have a random horizon. We consider the model in which the gambler is given a priori knowledge of the horizon’s distribution. Alijani et al. (2020) designed a single-threshold algorithm achieving a ratio of 1/2 when the random horizon has an increasing hazard rate and is independent of the values. We prove that with a single threshold, a ratio of 1/2 is actually achievable for several larger classes of horizon distributions, with the largest being known as the 𝒢 class in reliability theory. Moreover, we show that this does not extend to its dual, the  ̅𝒢 class (which includes the decreasing hazard rate class), while it can be extended to low-variance horizons. Finally, we construct the first example of a family of horizons, for which multiple thresholds are necessary to achieve a nonzero ratio. We establish that the Secretary Problem optimal stopping rule provides one such algorithm, paving the way towards the study of the model beyond single-threshold algorithms.","lang":"eng"}],"citation":{"apa":"Giambartolomei, G., Mallmann-Trenn, F., &#38; Saona Urmeneta, R. J. (2025). IID prophet inequality with random horizon: Going beyond increasing hazard rates. In <i>52nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 334). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">https://doi.org/10.4230/LIPIcs.ICALP.2025.87</a>","mla":"Giambartolomei, Giordano, et al. “IID Prophet Inequality with Random Horizon: Going beyond Increasing Hazard Rates.” <i>52nd International Colloquium on Automata, Languages, and Programming</i>, vol. 334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">10.4230/LIPIcs.ICALP.2025.87</a>.","ista":"Giambartolomei G, Mallmann-Trenn F, Saona Urmeneta RJ. 2025. IID prophet inequality with random horizon: Going beyond increasing hazard rates. 52nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 334.","ieee":"G. Giambartolomei, F. Mallmann-Trenn, and R. J. Saona Urmeneta, “IID prophet inequality with random horizon: Going beyond increasing hazard rates,” in <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Aarhus, Denmark, 2025, vol. 334.","chicago":"Giambartolomei, Giordano, Frederik Mallmann-Trenn, and Raimundo J Saona Urmeneta. “IID Prophet Inequality with Random Horizon: Going beyond Increasing Hazard Rates.” In <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Vol. 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">https://doi.org/10.4230/LIPIcs.ICALP.2025.87</a>.","ama":"Giambartolomei G, Mallmann-Trenn F, Saona Urmeneta RJ. IID prophet inequality with random horizon: Going beyond increasing hazard rates. In: <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">10.4230/LIPIcs.ICALP.2025.87</a>","short":"G. Giambartolomei, F. Mallmann-Trenn, R.J. Saona Urmeneta, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","publication_status":"published","intvolume":"       334","has_accepted_license":"1","conference":{"start_date":"2025-07-08","name":"ICALP: Automata, Languages and Programming","end_date":"2025-07-11","location":"Aarhus, Denmark"},"ddc":["000"],"year":"2025","quality_controlled":"1","volume":334,"language":[{"iso":"eng"}],"article_processing_charge":"No","file_date_updated":"2026-02-19T07:41:55Z","month":"06","publication_identifier":{"isbn":["9783959773720"]},"OA_type":"gold","arxiv":1,"date_published":"2025-06-30T00:00:00Z","external_id":{"arxiv":["2407.11752"]},"oa":1,"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"_id":"21320","oa_version":"Published Version","date_created":"2026-02-18T10:44:14Z","file":[{"relation":"main_file","checksum":"960110956c26a5cefadde8e47888bfbe","date_created":"2026-02-19T07:41:55Z","file_size":876167,"creator":"dernst","file_name":"2025_ICALP_Giambartolomei.pdf","file_id":"21331","date_updated":"2026-02-19T07:41:55Z","success":1,"content_type":"application/pdf","access_level":"open_access"}],"publication":"52nd International Colloquium on Automata, Languages, and Programming","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2026-02-19T07:43:29Z","status":"public","alternative_title":["LIPIcs"],"title":"IID prophet inequality with random horizon: Going beyond increasing hazard rates","author":[{"last_name":"Giambartolomei","first_name":"Giordano","full_name":"Giambartolomei, Giordano"},{"full_name":"Mallmann-Trenn, Frederik","first_name":"Frederik","last_name":"Mallmann-Trenn"},{"last_name":"Saona Urmeneta","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425"}],"day":"30","department":[{"_id":"KrCh"}],"ec_funded":1,"OA_place":"publisher","acknowledgement":"We would like to thank José Correa for his precious advice, Bruno Ziliotto and Vasilis Livanos for early conversations. Giambartolomei, Giordano: EPSRC grants EP/W005573/1 and EP/X021696/1. Mallmann-Trenn, Frederik: EPSRC grant EP/W005573/1. Saona, Raimundo: ERC grant CoG 863818 (ForM-SMArt), ANID Chile grant ACT210005, French Agence Nationale de la Recherche (ANR) grant ANR-21-CE40-0020 (CONVERGENCE), and Austrian Science Fund (FWF) grant 10.55776/COE12."},{"issue":"1","file_date_updated":"2026-02-19T07:31:15Z","month":"01","article_processing_charge":"Yes (in subscription journal)","volume":18,"language":[{"iso":"eng"}],"year":"2025","ddc":["540"],"PlanS_conform":"1","intvolume":"        18","has_accepted_license":"1","type":"journal_article","publisher":"Tsinghua University Press","publication_status":"published","abstract":[{"text":"The development of cost-effective and high-performance thermoelectric (TE) materials faces significant challenges, particularly in improving the properties of promising copper-based TE materials such as Cu3SbSe4, which are limited by their poor electrical conductivity. This study presents a detailed comparative analysis of three strategies to promote the electrical transport properties of Cu3SbSe4 through Sn doping: conventional Sn atomic doping, surface treatment with SnSe molecular complexes, and blending with SnSe nanocrystals to form nanocomposites, all followed by annealing and hot pressing under identical conditions. Our results reveal that a surface treatment using SnSe molecular complexes significantly enhances TE performance over atomic doping and nanocomposite formation, achieving a power factor of 1.1 mW·m−1·K−2 and a maximum dimensionless figure of merit zT value of 0.80 at 640 K, representing an excellent performance among Cu3SbSe4-based materials produced via solution-processing methods. This work highlights the effectiveness of surface engineering in optimizing the transport properties of nanostructured materials, demonstrating the versatility and cost-efficiency of solution-based technologies in the development of advanced nanostructured materials for application in the field of TE among others.","lang":"eng"}],"citation":{"mla":"Xiao, Shanshan, et al. “Band and Defect Engineering in Solution-Processed Nanocrystal Building Blocks to Promote Transport Properties in Nanomaterials: The Case of Thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>.” <i>Nano Research</i>, vol. 18, no. 1, 94907072, Tsinghua University Press, 2025, doi:<a href=\"https://doi.org/10.26599/nr.2025.94907072\">10.26599/nr.2025.94907072</a>.","apa":"Xiao, S., Zhao, M., Li, M., Wan, S., Genç, A., Huang, L., … Cabot, A. (2025). Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. <i>Nano Research</i>. Tsinghua University Press. <a href=\"https://doi.org/10.26599/nr.2025.94907072\">https://doi.org/10.26599/nr.2025.94907072</a>","short":"S. Xiao, M. Zhao, M. Li, S. Wan, A. Genç, L. Huang, L. Chen, Y. Zhang, M. Ibáñez, K.H. Lim, M. Hong, Y. Liu, A. Cabot, Nano Research 18 (2025).","ama":"Xiao S, Zhao M, Li M, et al. Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. <i>Nano Research</i>. 2025;18(1). doi:<a href=\"https://doi.org/10.26599/nr.2025.94907072\">10.26599/nr.2025.94907072</a>","ista":"Xiao S, Zhao M, Li M, Wan S, Genç A, Huang L, Chen L, Zhang Y, Ibáñez M, Lim KH, Hong M, Liu Y, Cabot A. 2025. Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. Nano Research. 18(1), 94907072.","ieee":"S. Xiao <i>et al.</i>, “Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>,” <i>Nano Research</i>, vol. 18, no. 1. Tsinghua University Press, 2025.","chicago":"Xiao, Shanshan, Mingjun Zhao, Mingquan Li, Shanhong Wan, Aziz Genç, Lulu Huang, Lei Chen, et al. “Band and Defect Engineering in Solution-Processed Nanocrystal Building Blocks to Promote Transport Properties in Nanomaterials: The Case of Thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>.” <i>Nano Research</i>. Tsinghua University Press, 2025. <a href=\"https://doi.org/10.26599/nr.2025.94907072\">https://doi.org/10.26599/nr.2025.94907072</a>."},"doi":"10.26599/nr.2025.94907072","department":[{"_id":"MaIb"}],"day":"01","article_type":"original","OA_place":"publisher","acknowledgement":"Y. L. acknowledges funding from the National Natural Science Foundation of China (No. 22209034), the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (No. 2022LCX002), and the Fundamental Research Funds for the Central Universities (No. JZ2024HGTB0239). K. H. L. acknowledges financial support from the National Natural Science Foundation of China (No. 22208293). M. I. acknowledge financial support from ISTA and the Werner Siemens Foundation. M. H. acknowledges funding from Australian Research Council (No. FT230100316). L. L. H. and S. H. W. acknowledge the Fundamental Research Funds for the Central Universities (Nos. JZ2023HGTA0179 and JZ2024HGTA0170).","title":"Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>","author":[{"first_name":"Shanshan","last_name":"Xiao","full_name":"Xiao, Shanshan"},{"first_name":"Mingjun","last_name":"Zhao","full_name":"Zhao, Mingjun"},{"full_name":"Li, Mingquan","first_name":"Mingquan","last_name":"Li"},{"full_name":"Wan, Shanhong","first_name":"Shanhong","last_name":"Wan"},{"last_name":"Genç","first_name":"Aziz","full_name":"Genç, Aziz"},{"full_name":"Huang, Lulu","last_name":"Huang","first_name":"Lulu"},{"first_name":"Lei","last_name":"Chen","full_name":"Chen, Lei"},{"first_name":"Yu","last_name":"Zhang","full_name":"Zhang, Yu"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria"},{"full_name":"Lim, Khak Ho","last_name":"Lim","first_name":"Khak Ho"},{"full_name":"Hong, Min","last_name":"Hong","first_name":"Min"},{"last_name":"Liu","first_name":"Yu","full_name":"Liu, Yu"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2026-02-19T07:32:22Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2025_NanoResearch_Xiao.pdf","creator":"dernst","file_size":27740524,"checksum":"aa531f1363538fece12ecfad83456b65","date_created":"2026-02-19T07:31:15Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"date_updated":"2026-02-19T07:31:15Z","file_id":"21330"}],"publication":"Nano Research","project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"_id":"21321","oa_version":"Published Version","article_number":"94907072","date_created":"2026-02-18T10:45:06Z","oa":1,"publication_identifier":{"issn":["1998-0124"],"eissn":["1998-0000"]},"OA_type":"hybrid","date_published":"2025-01-01T00:00:00Z"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-07T08:45:14Z","status":"public","author":[{"first_name":"Oluwafunmilola O","last_name":"Olusanya","orcid":"0000-0003-1971-8314","full_name":"Olusanya, Oluwafunmilola O","id":"41AD96DC-F248-11E8-B48F-1D18A9856A87"},{"id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","first_name":"Kseniia","last_name":"Khudiakova","full_name":"Khudiakova, Kseniia","orcid":"0000-0002-6246-1465"},{"id":"42377A0A-F248-11E8-B48F-1D18A9856A87","full_name":"Sachdeva, Himani","last_name":"Sachdeva","first_name":"Himani"}],"main_file_link":[{"url":"https://doi.org/10.1101/2023.12.02.569702","open_access":"1"}],"title":"Genetic load, eco-evolutionary feedback, and extinction in metapopulations","department":[{"_id":"JaMa"},{"_id":"NiBa"}],"day":"01","OA_place":"repository","article_type":"original","acknowledgement":"This research was partially funded by the Austrian Science Fund (FWF P-32896B) and DOC Fellowships of the Austrian Academy of Sciences: grants 26380 (O.O.) and 26293 (K.K.). We thank Nick Barton for useful comments on the chapter in O.O.’s thesis that led to this article.","OA_type":"green","publication_identifier":{"issn":["0003-0147"],"eissn":["1537-5323"]},"date_published":"2025-06-01T00:00:00Z","external_id":{"pmid":["40446297 "]},"oa":1,"project":[{"name":"Causes and consequences of population fragmentation","_id":"c08d3278-5a5b-11eb-8a69-fdb09b55f4b8","grant_number":"P32896"},{"name":"Polygenic Adaptation in a Metapopulation","grant_number":"26380","_id":"34c872fe-11ca-11ed-8bc3-8534b82131e6"},{"grant_number":"26293","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8","name":"The impact of deleterious mutations on small populations"}],"pmid":1,"_id":"21322","oa_version":"Preprint","date_created":"2026-02-18T10:47:18Z","publication":"The American Naturalist","year":"2025","quality_controlled":"1","volume":205,"language":[{"iso":"eng"}],"article_processing_charge":"No","page":"617-636","issue":"6","month":"06","related_material":{"record":[{"status":"public","id":"14732","relation":"earlier_version"}]},"doi":"10.1086/735562","scopus_import":"1","abstract":[{"text":"Habitat fragmentation poses a significant risk to population survival, causing both demographic stochasticity and genetic drift within local populations to increase, thereby increasing genetic load. Higher load causes population numbers to decline, which reduces the efficiency of selection and further increases load, resulting in a positive feedback that may drive entire populations to extinction. Here, we investigate this eco-evolutionary feedback in a metapopulation consisting of local demes connected via migration, with individuals subject to deleterious mutation at a large number of loci. We first analyze the determinants of load under soft selection, where population sizes are fixed, and then build on this to understand hard selection, where population sizes and load coevolve. We show that under soft selection, very little gene flow (less than one migrant per generation) is enough to prevent fixation of deleterious alleles. By contrast, much higher levels of migration are required to mitigate load and prevent extinction when selection is hard, with critical migration thresholds for metapopulation persistence increasing sharply as the genome-wide deleterious mutation rate becomes comparable to the baseline population growth rate. Moreover, critical migration thresholds are highest if deleterious mutations have intermediate selection coefficients but lower if alleles are predominantly recessive rather than additive (due to more efficient purging of recessive load within local populations). Our analysis is based on a combination of analytical approximations and simulations, allowing for a more comprehensive understanding of the factors influencing load and extinction in fragmented populations.","lang":"eng"}],"citation":{"short":"O.O. Olusanya, K. Khudiakova, H. Sachdeva, The American Naturalist 205 (2025) 617–636.","ama":"Olusanya OO, Khudiakova K, Sachdeva H. Genetic load, eco-evolutionary feedback, and extinction in metapopulations. <i>The American Naturalist</i>. 2025;205(6):617-636. doi:<a href=\"https://doi.org/10.1086/735562\">10.1086/735562</a>","ista":"Olusanya OO, Khudiakova K, Sachdeva H. 2025. Genetic load, eco-evolutionary feedback, and extinction in metapopulations. The American Naturalist. 205(6), 617–636.","chicago":"Olusanya, Oluwafunmilola O, Kseniia Khudiakova, and Himani Sachdeva. “Genetic Load, Eco-Evolutionary Feedback, and Extinction in Metapopulations.” <i>The American Naturalist</i>. University of Chicago Press, 2025. <a href=\"https://doi.org/10.1086/735562\">https://doi.org/10.1086/735562</a>.","ieee":"O. O. Olusanya, K. Khudiakova, and H. Sachdeva, “Genetic load, eco-evolutionary feedback, and extinction in metapopulations,” <i>The American Naturalist</i>, vol. 205, no. 6. University of Chicago Press, pp. 617–636, 2025.","mla":"Olusanya, Oluwafunmilola O., et al. “Genetic Load, Eco-Evolutionary Feedback, and Extinction in Metapopulations.” <i>The American Naturalist</i>, vol. 205, no. 6, University of Chicago Press, 2025, pp. 617–36, doi:<a href=\"https://doi.org/10.1086/735562\">10.1086/735562</a>.","apa":"Olusanya, O. O., Khudiakova, K., &#38; Sachdeva, H. (2025). Genetic load, eco-evolutionary feedback, and extinction in metapopulations. <i>The American Naturalist</i>. University of Chicago Press. <a href=\"https://doi.org/10.1086/735562\">https://doi.org/10.1086/735562</a>"},"corr_author":"1","publisher":"University of Chicago Press","type":"journal_article","publication_status":"published","intvolume":"       205"},{"publication":"45th Annual International Cryptology Conference","_id":"21323","date_created":"2026-02-18T10:59:58Z","oa_version":"Preprint","oa":1,"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783032018878"],"isbn":["9783032018861"]},"OA_type":"green","date_published":"2025-08-17T00:00:00Z","department":[{"_id":"KrPi"}],"day":"17","acknowledgement":"Juraj Belohorec, Pavel Hubáček, and Kristýna Mašková were partially supported by the Academy of Sciences of the Czech Republic (RVO 67985840), Czech Science Foundation GAČR grant No. 25-16311S, and by Zircuit. Pavel Dvořák was supported by Czech Science Foundation GAČR grant No. 22-14872O. Juraj Belohorec and Kristýna Mašková were supported by the grant SVV–2025–260822.","OA_place":"repository","main_file_link":[{"url":"https://eprint.iacr.org/2025/514","open_access":"1"}],"title":"On extractability of the KZG family of polynomial commitment schemes","author":[{"full_name":"Belohorec, Juraj","last_name":"Belohorec","first_name":"Juraj"},{"first_name":"Pavel","last_name":"Dvořák","full_name":"Dvořák, Pavel"},{"orcid":"0000-0003-2027-5549","full_name":"Hoffmann, Charlotte","first_name":"Charlotte","last_name":"Hoffmann","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7"},{"last_name":"Hubáček","first_name":"Pavel","full_name":"Hubáček, Pavel"},{"last_name":"Mašková","first_name":"Kristýna","full_name":"Mašková, Kristýna"},{"full_name":"Pastyřík, Martin","first_name":"Martin","last_name":"Pastyřík"}],"alternative_title":["LNCS"],"date_updated":"2026-02-19T07:50:33Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"     16005","publisher":"Springer Nature","type":"conference","publication_status":"published","abstract":[{"text":"We present a unifying framework for proving the knowledge-soundness of KZG-like polynomial commitment schemes, encompassing both univariate and multivariate variants. By conceptualizing the proof technique of Lipmaa, Parisella, and Siim for the univariate KZG scheme (EUROCRYPT 2024), we present tools and falsifiable hardness assumptions that permit black-box extraction of the multivariate KZG scheme. Central to our approach is the notion of a canonical Proof-of-Knowledge of a Polynomial (PoKoP) of a polynomial commitment scheme, which we use to capture the extractability notion required in constructions of practical zk-SNARKs. We further present an explicit polynomial decomposition lemma for multivariate polynomials, enabling a more direct analysis of interpolating extractors and bridging the gap between univariate and multivariate commitments. Our results provide the first standard-model proofs of extractability for the multivariate KZG scheme and many of its variants under falsifiable assumptions.","lang":"eng"}],"citation":{"ieee":"J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková, and M. Pastyřík, “On extractability of the KZG family of polynomial commitment schemes,” in <i>45th Annual International Cryptology Conference</i>, Santa Barbara, CA, United States, 2025, vol. 16005, pp. 584–616.","chicago":"Belohorec, Juraj, Pavel Dvořák, Charlotte Hoffmann, Pavel Hubáček, Kristýna Mašková, and Martin Pastyřík. “On Extractability of the KZG Family of Polynomial Commitment Schemes.” In <i>45th Annual International Cryptology Conference</i>, 16005:584–616. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">https://doi.org/10.1007/978-3-032-01887-8_19</a>.","ista":"Belohorec J, Dvořák P, Hoffmann C, Hubáček P, Mašková K, Pastyřík M. 2025. On extractability of the KZG family of polynomial commitment schemes. 45th Annual International Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 16005, 584–616.","short":"J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková, M. Pastyřík, in:, 45th Annual International Cryptology Conference, Springer Nature, 2025, pp. 584–616.","ama":"Belohorec J, Dvořák P, Hoffmann C, Hubáček P, Mašková K, Pastyřík M. On extractability of the KZG family of polynomial commitment schemes. In: <i>45th Annual International Cryptology Conference</i>. Vol 16005. Springer Nature; 2025:584-616. doi:<a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">10.1007/978-3-032-01887-8_19</a>","apa":"Belohorec, J., Dvořák, P., Hoffmann, C., Hubáček, P., Mašková, K., &#38; Pastyřík, M. (2025). On extractability of the KZG family of polynomial commitment schemes. In <i>45th Annual International Cryptology Conference</i> (Vol. 16005, pp. 584–616). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">https://doi.org/10.1007/978-3-032-01887-8_19</a>","mla":"Belohorec, Juraj, et al. “On Extractability of the KZG Family of Polynomial Commitment Schemes.” <i>45th Annual International Cryptology Conference</i>, vol. 16005, Springer Nature, 2025, pp. 584–616, doi:<a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">10.1007/978-3-032-01887-8_19</a>."},"doi":"10.1007/978-3-032-01887-8_19","page":"584-616","month":"08","article_processing_charge":"No","volume":16005,"language":[{"iso":"eng"}],"conference":{"start_date":"2025-08-17","end_date":"2025-08-221","name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States"},"year":"2025","quality_controlled":"1"},{"date_published":"2025-07-30T00:00:00Z","arxiv":1,"OA_type":"gold","publication_identifier":{"eissn":["2640-3498"]},"oa":1,"external_id":{"arxiv":["2502.01347"]},"date_created":"2026-02-18T11:58:00Z","oa_version":"Published Version","_id":"21324","project":[{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf"},{"_id":"92099302-16d5-11f0-9cad-f9a785f54fbd","name":"Trustworthy Deep Learning Theory: Private Over-Parameterized Models and Robust LLMs"}],"publication":"Proceedings of the 42nd International Conference on Machine Learning","file":[{"file_id":"21335","date_updated":"2026-02-19T08:04:38Z","content_type":"application/pdf","success":1,"access_level":"open_access","relation":"main_file","checksum":"d4ba4f7717b362ca38878f45e57bd643","date_created":"2026-02-19T08:04:38Z","file_size":887526,"creator":"dernst","file_name":"2025_ICML_Bombari.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2026-02-19T08:08:55Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization","author":[{"id":"ca726dda-de17-11ea-bc14-f9da834f63aa","full_name":"Bombari, Simone","last_name":"Bombari","first_name":"Simone"},{"first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"}],"alternative_title":["PMLR"],"acknowledgement":"Marco Mondelli is funded by the European Union (ERC, INF2, project number 101161364). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. Simone Bombari is supported by a Google PhD fellowship. The authors would like to thank GuanWen Qiu for helpful discussions.","OA_place":"publisher","day":"30","department":[{"_id":"MaMo"}],"citation":{"mla":"Bombari, Simone, and Marco Mondelli. “Spurious Correlations in High Dimensional Regression: The Roles of Regularization, Simplicity Bias and over-Parameterization.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 4839–73.","apa":"Bombari, S., &#38; Mondelli, M. (2025). Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 4839–4873). Vancouver, Canada: ML Research Press.","ama":"Bombari S, Mondelli M. Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:4839-4873.","short":"S. Bombari, M. Mondelli, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 4839–4873.","ista":"Bombari S, Mondelli M. 2025. Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 4839–4873.","ieee":"S. Bombari and M. Mondelli, “Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 4839–4873.","chicago":"Bombari, Simone, and Marco Mondelli. “Spurious Correlations in High Dimensional Regression: The Roles of Regularization, Simplicity Bias and over-Parameterization.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:4839–73. ML Research Press, 2025."},"abstract":[{"text":"Learning models have been shown to rely on spurious correlations between non-predictive features and the associated labels in the training data, with negative implications on robustness, bias and fairness. In this work, we provide a statistical characterization of this phenomenon for high-dimensional regression, when the data contains a predictive core feature x and a spurious feature y. Specifically, we quantify the amount of spurious correlations C learned via linear regression, in terms of the data covariance and the strength λ of the ridge regularization. As a consequence, we first capture the simplicity of y through the spectrum of its covariance, and its correlation with x through the Schur complement of the full data covariance. Next, we prove a trade-off between C and the in-distribution test loss L, by showing that the value of λ that minimizes L lies in an interval where C is increasing. Finally, we investigate the effects of over-parameterization via the random features model, by showing its equivalence to regularized linear regression. Our theoretical results are supported by numerical experiments on Gaussian, Color-MNIST, and CIFAR-10 datasets.","lang":"eng"}],"publication_status":"published","publisher":"ML Research Press","type":"conference","corr_author":"1","has_accepted_license":"1","intvolume":"       267","quality_controlled":"1","year":"2025","conference":{"location":"Vancouver, Canada","name":"ICML: International Conference on Machine Learning","end_date":"2025-07-19","start_date":"2025-07-13"},"ddc":["000"],"language":[{"iso":"eng"}],"volume":267,"article_processing_charge":"No","month":"07","file_date_updated":"2026-02-19T08:04:38Z","page":"4839-4873"},{"quality_controlled":"1","conference":{"start_date":"2025-07-13","location":"Vancouver, Canada","name":"ICML: International Conference on Machine Learning","end_date":"2025-07-19"},"ddc":["000"],"year":"2025","language":[{"iso":"eng"}],"volume":267,"article_processing_charge":"No","month":"11","file_date_updated":"2026-02-19T08:15:48Z","page":"20266-20295","citation":{"mla":"Gozeten, Halil Alperen, et al. “Test-Time Training Provably Improves Transformers as in-Context Learners.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 20266–95.","apa":"Gozeten, H. A., Ildiz, M. E., Zhang, X., Soltanolkotabi, M., Mondelli, M., &#38; Oymak, S. (2025). Test-time training provably improves transformers as in-context learners. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 20266–20295). Vancouver, Canada: ML Research Press.","ama":"Gozeten HA, Ildiz ME, Zhang X, Soltanolkotabi M, Mondelli M, Oymak S. Test-time training provably improves transformers as in-context learners. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:20266-20295.","short":"H.A. Gozeten, M.E. Ildiz, X. Zhang, M. Soltanolkotabi, M. Mondelli, S. Oymak, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 20266–20295.","ista":"Gozeten HA, Ildiz ME, Zhang X, Soltanolkotabi M, Mondelli M, Oymak S. 2025. Test-time training provably improves transformers as in-context learners. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 20266–20295.","ieee":"H. A. Gozeten, M. E. Ildiz, X. Zhang, M. Soltanolkotabi, M. Mondelli, and S. Oymak, “Test-time training provably improves transformers as in-context learners,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 20266–20295.","chicago":"Gozeten, Halil Alperen, Muhammed Emrullah Ildiz, Xuechen Zhang, Mahdi Soltanolkotabi, Marco Mondelli, and Samet Oymak. “Test-Time Training Provably Improves Transformers as in-Context Learners.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:20266–95. ML Research Press, 2025."},"abstract":[{"lang":"eng","text":"Test-time training (TTT) methods explicitly update the weights of a model to adapt to the specific test instance, and they have found success in a variety of settings, including most recently language modeling and reasoning. To demystify this success, we investigate a gradient-based TTT algorithm for in-context learning, where we train a transformer model on the in-context demonstrations provided in the test prompt. Specifically, we provide a comprehensive theoretical characterization of linear transformers when the update rule is a single gradient step. Our theory (i) delineates the role of alignment between pretraining distribution and target task, (ii) demystifies how TTT can alleviate distribution shift, and (iii) quantifies the sample complexity of TTT including how it can significantly reduce the eventual sample size required for in-context learning. As our empirical contribution, we study the benefits of TTT for TabPFN, a tabular foundation model. In line with our theory, we demonstrate that TTT significantly reduces the required sample size for tabular classification (3 to 5 times fewer) unlocking substantial inference efficiency with a negligible training cost."}],"publication_status":"published","type":"conference","publisher":"ML Research Press","has_accepted_license":"1","intvolume":"       267","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2026-02-19T08:18:24Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Test-time training provably improves transformers as in-context learners","author":[{"full_name":"Gozeten, Halil Alperen","first_name":"Halil Alperen","last_name":"Gozeten"},{"first_name":"Muhammed Emrullah","last_name":"Ildiz","full_name":"Ildiz, Muhammed Emrullah"},{"full_name":"Zhang, Xuechen","last_name":"Zhang","first_name":"Xuechen"},{"last_name":"Soltanolkotabi","first_name":"Mahdi","full_name":"Soltanolkotabi, Mahdi"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco"},{"full_name":"Oymak, Samet","last_name":"Oymak","first_name":"Samet"}],"alternative_title":["PMLR"],"acknowledgement":"H.A.G., M.E.I., X.Z., and S.O. were supported in part by the NSF grants CCF2046816, CCF-2403075, CCF-2008020, and the Office of Naval Research grant N000142412289.\r\nM. M. is funded by the European Union (ERC, INF2 , project number 101161364). Views and opinions expressed are, however, those of the author(s) only and do not necessarily\r\nreflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. M.S. is supported by the Packard Fellowship in Science and Engineering, a Sloan Research Fellowship in Mathematics, an NSF-CAREER under award #1846369, DARPA FastNICS program, and NSF-CIF awards #1813877 and #2008443, and NIH DP2LM014564-01. The authors also\r\nacknowledge further support from Open Philanthropy, OpenAI, Amazon Research, Google Research, and Microsoft Research.","OA_place":"publisher","department":[{"_id":"MaMo"}],"day":"30","date_published":"2025-11-30T00:00:00Z","OA_type":"gold","publication_identifier":{"eissn":["2640-3498"]},"oa":1,"external_id":{"pmid":["41321376"]},"date_created":"2026-02-18T12:00:44Z","oa_version":"Published Version","_id":"21325","project":[{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf","grant_number":"101161364"}],"pmid":1,"publication":"Proceedings of the 42nd International Conference on Machine Learning","file":[{"file_name":"2025_ICML_Gozeten.pdf","creator":"dernst","file_size":471176,"date_created":"2026-02-19T08:15:48Z","checksum":"f774f8619a0d72f3975d9cb23942a1e9","relation":"main_file","access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2026-02-19T08:15:48Z","file_id":"21336"}]},{"citation":{"short":"D. Wu, M. Mondelli, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 67499–67536.","ama":"Wu D, Mondelli M. Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:67499-67536.","chicago":"Wu, Diyuan, and Marco Mondelli. “Neural Collapse beyond the Unconstrained Features Model: Landscape, Dynamics, and Generalization in the Mean-Field Regime.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:67499–536. ML Research Press, 2025.","ista":"Wu D, Mondelli M. 2025. Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 67499–67536.","ieee":"D. Wu and M. Mondelli, “Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 67499–67536.","mla":"Wu, Diyuan, and Marco Mondelli. “Neural Collapse beyond the Unconstrained Features Model: Landscape, Dynamics, and Generalization in the Mean-Field Regime.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 67499–536.","apa":"Wu, D., &#38; Mondelli, M. (2025). Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 67499–67536). Vancouver, Canada: ML Research Press."},"abstract":[{"text":"Neural Collapse is a phenomenon where the last-layer representations of a well-trained neural network converge to a highly structured geometry. In this paper, we focus on its first (and most basic) property, known as NC1: the within-class variability vanishes. While prior theoretical studies establish the occurrence of NC1 via the data-agnostic unconstrained features model, our work adopts a data-specific perspective, analyzing NC1 in a three-layer neural network, with the first two layers operating in the mean-field regime and followed by a linear layer. In particular, we establish a fundamental connection between NC1 and the loss landscape: we prove that points with small empirical loss and gradient norm (thus, close to being stationary) approximately satisfy NC1, and the closeness to NC1 is controlled by the residual loss and gradient norm. We then show that (i) gradient flow on the mean squared error converges to NC1 solutions with small empirical loss, and (ii) for well-separated data distributions, both NC1 and vanishing test loss are achieved simultaneously. This aligns with the empirical observation that NC1 emerges during training while models attain near-zero test error. Overall, our results demonstrate that NC1 arises from gradient training due to the properties of the loss landscape, and they show the co-occurrence of NC1 and small test error for certain data distributions.","lang":"eng"}],"has_accepted_license":"1","intvolume":"       267","publication_status":"published","type":"conference","corr_author":"1","publisher":"ML Research Press","language":[{"iso":"eng"}],"volume":267,"quality_controlled":"1","conference":{"end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","location":"Vancouver, Canada","start_date":"2025-07-13"},"ddc":["000"],"year":"2025","month":"07","page":"67499-67536","file_date_updated":"2026-02-19T08:28:22Z","article_processing_charge":"No","external_id":{"arxiv":["2501.19104"]},"oa":1,"date_published":"2025-07-30T00:00:00Z","publication_identifier":{"eissn":["2640-3498"]},"OA_type":"gold","arxiv":1,"publication":"Proceedings of the 42nd International Conference on Machine Learning","file":[{"file_id":"21337","access_level":"open_access","date_updated":"2026-02-19T08:28:22Z","content_type":"application/pdf","success":1,"checksum":"c5ce8b1c83e33dc3a11122f4910deb67","date_created":"2026-02-19T08:28:22Z","file_size":3994385,"relation":"main_file","file_name":"2025_ICML_Wu.pdf","creator":"dernst"}],"oa_version":"Published Version","date_created":"2026-02-18T12:02:45Z","_id":"21326","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2026-02-19T08:30:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/COE12. For the purpose of open access, the authors have applied a CC BY public\r\ncopyright license to any Author Accepted Manuscript version arising from this submission. The authors would like to thank Peter Sukenık for general helpful discussions and for pointing out that all the stationary points are approximately proportional in the case without entropic regularization. ","day":"30","department":[{"_id":"MaMo"}],"alternative_title":["PMLR"],"title":"Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime","author":[{"full_name":"Wu, Diyuan","first_name":"Diyuan","last_name":"Wu","id":"1a5914c2-896a-11ed-bdf8-fb80621a0635"},{"first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"}]},{"author":[{"id":"e957f5e5-91c9-11f0-a95f-e090f66ecb4d","full_name":"Maddipatla, Sai A","first_name":"Sai A","last_name":"Maddipatla"},{"full_name":"Sellam, Nadav E","first_name":"Nadav E","last_name":"Sellam","id":"ef280fe0-91c9-11f0-a95f-8dea3f5bc513"},{"id":"11d88cf5-91ca-11f0-a95f-edf9f08f47b7","last_name":"Bojan","first_name":"Meital I","full_name":"Bojan, Meital I"},{"full_name":"Vedula, Sanketh","first_name":"Sanketh","last_name":"Vedula","id":"94f2fe44-70fa-11f0-b76b-92922c09452b"},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","last_name":"Schanda","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606"},{"full_name":"Marx, Ailie","last_name":"Marx","first_name":"Ailie"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander"}],"title":"Inverse problems with experiment-guided AlphaFold","alternative_title":["PMLR"],"acknowledgement":"This work was supported by the Israeli Science Foundation (ISF) grant number 1834/24. We acknowledge support from the Austrian Science Fund (FWF, grant numbers I5812-B and I6223) and the financial support of the Helmsley Fellowships Program for Sustainability and Health. This research uses resources of the Institute of Science and Technology Austria’s scientific computing cluster. ","OA_place":"publisher","day":"30","department":[{"_id":"PaSc"},{"_id":"AlBr"},{"_id":"GradSch"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2026-02-19T08:56:43Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_created":"2026-02-18T12:11:17Z","oa_version":"Published Version","_id":"21327","project":[{"grant_number":"I05812","_id":"eb9c82eb-77a9-11ec-83b8-aadd536561cf","name":"AlloSpace. The emergence and mechanisms of allostery"},{"name":"Structure and mechanism of the mitochondrial MIM insertase","grant_number":"I06223","_id":"bdb9578d-d553-11ed-ba76-ed5d39fce6f0"}],"publication":"Proceedings of the 42nd International Conference on Machine Learning","file":[{"relation":"main_file","date_created":"2026-02-19T08:56:10Z","checksum":"f33230a6d59b7978d4cd72795e4e9059","file_size":1924177,"creator":"dernst","file_name":"2025_ICML_Maddipatla.pdf","file_id":"21338","date_updated":"2026-02-19T08:56:10Z","success":1,"content_type":"application/pdf","access_level":"open_access"}],"date_published":"2025-07-30T00:00:00Z","arxiv":1,"OA_type":"gold","publication_identifier":{"eissn":["2640-3498"]},"oa":1,"external_id":{"arxiv":["2502.09372"]},"article_processing_charge":"No","month":"07","file_date_updated":"2026-02-19T08:56:10Z","page":"42366 - 42393","acknowledged_ssus":[{"_id":"ScienComp"}],"quality_controlled":"1","conference":{"location":"Vancouver, Canada","end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","start_date":"2025-07-13"},"year":"2025","ddc":["000","540"],"language":[{"iso":"eng"}],"volume":267,"publication_status":"published","corr_author":"1","publisher":"ML Research Press","type":"conference","has_accepted_license":"1","intvolume":"       267","citation":{"ama":"Maddipatla SA, Sellam NE, Bojan MI, et al. Inverse problems with experiment-guided AlphaFold. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:42366-42393.","short":"S.A. Maddipatla, N.E. Sellam, M.I. Bojan, S. Vedula, P. Schanda, A. Marx, A.M. Bronstein, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 42366–42393.","ieee":"S. A. Maddipatla <i>et al.</i>, “Inverse problems with experiment-guided AlphaFold,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 42366–42393.","ista":"Maddipatla SA, Sellam NE, Bojan MI, Vedula S, Schanda P, Marx A, Bronstein AM. 2025. Inverse problems with experiment-guided AlphaFold. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 42366–42393.","chicago":"Maddipatla, Sai A, Nadav E Sellam, Meital I Bojan, Sanketh Vedula, Paul Schanda, Ailie Marx, and Alex M. Bronstein. “Inverse Problems with Experiment-Guided AlphaFold.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:42366–93. ML Research Press, 2025.","mla":"Maddipatla, Sai A., et al. “Inverse Problems with Experiment-Guided AlphaFold.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 42366–93.","apa":"Maddipatla, S. A., Sellam, N. E., Bojan, M. I., Vedula, S., Schanda, P., Marx, A., &#38; Bronstein, A. M. (2025). Inverse problems with experiment-guided AlphaFold. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 42366–42393). Vancouver, Canada: ML Research Press."},"abstract":[{"lang":"eng","text":"Proteins exist as a dynamic ensemble of multiple conformations, and these motions are often crucial for their functions. However, current structure prediction methods predominantly yield a single conformation, overlooking the conformational heterogeneity revealed by diverse experimental modalities. Here, we present a framework for building experiment-grounded protein structure generative models that infer conformational ensembles consistent with measured experimental data. The key idea is to treat stateof-the-art protein structure predictors (e.g., AlphaFold3) as sequence-conditioned structural priors, and cast ensemble modeling as posterior inference of protein structures given experimental measurements. Through extensive real-data experiments, we demonstrate the generality of our method to incorporate a variety of experimental measurements. In particular, our framework uncovers previously unmodeled conformational heterogeneity from crystallographic densities, and generates high-accuracy NMR ensembles orders of magnitude faster than the status quo. Notably, we demonstrate that our ensembles outperform AlphaFold3 (Abramson et al., 2024) and sometimes better fit experimental data than publicly deposited structures to the Protein Data Bank (PDB, Burley et al. (2017)). We believe that this approach will unlock building predictive models that fully embrace experimentally observed conformational diversity."}]},{"scopus_import":"1","citation":{"apa":"Kovačević, F., Yihan, Z., &#38; Mondelli, M. (2025). Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery. In <i>Proceedings of 38th Conference on Learning Theory</i> (Vol. 291, pp. 3354–3404). Lyon, France: ML Research Press.","mla":"Kovačević, Filip, et al. “Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery.” <i>Proceedings of 38th Conference on Learning Theory</i>, vol. 291, ML Research Press, 2025, pp. 3354–404.","ieee":"F. Kovačević, Z. Yihan, and M. Mondelli, “Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery,” in <i>Proceedings of 38th Conference on Learning Theory</i>, Lyon, France, 2025, vol. 291, pp. 3354–3404.","chicago":"Kovačević, Filip, Zhang Yihan, and Marco Mondelli. “Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery.” In <i>Proceedings of 38th Conference on Learning Theory</i>, 291:3354–3404. ML Research Press, 2025.","ista":"Kovačević F, Yihan Z, Mondelli M. 2025. Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery. Proceedings of 38th Conference on Learning Theory. COLT: Conference on Learning Theory, PMLR, vol. 291, 3354–3404.","ama":"Kovačević F, Yihan Z, Mondelli M. Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery. In: <i>Proceedings of 38th Conference on Learning Theory</i>. Vol 291. ML Research Press; 2025:3354-3404.","short":"F. Kovačević, Z. Yihan, M. Mondelli, in:, Proceedings of 38th Conference on Learning Theory, ML Research Press, 2025, pp. 3354–3404."},"abstract":[{"text":"Multi-index models provide a popular framework to investigate the learnability of functions with low-dimensional structure and, also due to their connections with neural networks, they have been object of recent intensive study. In this paper, we focus on recovering the subspace spanned by the signals via spectral estimators – a family of methods routinely used in practice, often as a warm-start for iterative algorithms. Our main technical contribution is a precise asymptotic characterization of the performance of spectral methods, when sample size and input dimension grow proportionally and the dimension p of the space to recover is fixed. Specifically, we locate the top-p eigenvalues of the spectral matrix and establish the overlaps between the corresponding eigenvectors (which give the spectral estimators) and a basis of the signal subspace. Our analysis unveils a phase transition phenomenon in which, as the sample complexity grows, eigenvalues escape from the bulk of the spectrum and, when that happens, eigenvectors recover directions of the desired subspace. The precise characterization we put forward enables the optimization of the data preprocessing, thus allowing to identify the spectral estimator that requires the minimal sample size for weak recovery.","lang":"eng"}],"publication_status":"published","type":"conference","publisher":"ML Research Press","corr_author":"1","has_accepted_license":"1","intvolume":"       291","quality_controlled":"1","conference":{"start_date":"2025-06-30","name":"COLT: Conference on Learning Theory","end_date":"2025-07-04","location":"Lyon, France"},"ddc":["000"],"year":"2025","language":[{"iso":"eng"}],"volume":291,"article_processing_charge":"No","month":"07","file_date_updated":"2026-02-19T09:03:43Z","page":"3354-3404","date_published":"2025-07-01T00:00:00Z","arxiv":1,"OA_type":"gold","publication_identifier":{"eissn":["2640-3498"]},"oa":1,"external_id":{"arxiv":["2502.01583"]},"date_created":"2026-02-18T12:12:47Z","oa_version":"Published Version","_id":"21328","project":[{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf"}],"publication":"Proceedings of 38th Conference on Learning Theory","file":[{"access_level":"open_access","date_updated":"2026-02-19T09:03:43Z","success":1,"content_type":"application/pdf","file_id":"21339","file_name":"2025_LearningTheory_Kovacevic.pdf","creator":"dernst","date_created":"2026-02-19T09:03:43Z","checksum":"19aa70ab4f57fb9067b6ebb99a5fd6f0","file_size":844611,"relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2026-02-19T09:03:53Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery","author":[{"id":"d0258e7b-50b8-11ef-ad56-8b9f537b6b1b","full_name":"Kovačević, Filip","first_name":"Filip","last_name":"Kovačević"},{"full_name":"Yihan, Zhang","last_name":"Yihan","first_name":"Zhang"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"}],"alternative_title":["PMLR"],"acknowledgement":"This work was done when Y. Z. was at the Institute of Science and Technology Austria. Y. Z. and\r\nM. M. are funded by the European Union (ERC, INF2, project number 101161364). Views and\r\nopinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. The authors would like to acknowledge (in alphabetical order) discussions with Yatin Dandi, Leonardo Defilippis and Bruno Loureiro concerning their parallel work (Defilippis et al., 2025).","OA_place":"publisher","day":"01","department":[{"_id":"MaMo"}]},{"publication_status":"published","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","intvolume":"       356","scopus_import":"1","doi":"10.4230/LIPIcs.DISC.2025.23","citation":{"ieee":"K. Chatterjee, J. M. Křišťan, S. Schmid, J. Svoboda, and M. X. Yeo, “Boosting payment channel network liquidity with topology optimization and transaction selection,” in <i>39th International Symposium on Distributed Computing</i>, Berlin, Germany, 2025, vol. 356.","chicago":"Chatterjee, Krishnendu, Jan Matyáš Křišťan, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” In <i>39th International Symposium on Distributed Computing</i>, Vol. 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>.","ista":"Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. 2025. Boosting payment channel network liquidity with topology optimization and transaction selection. 39th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 356, 23.","ama":"Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. Boosting payment channel network liquidity with topology optimization and transaction selection. In: <i>39th International Symposium on Distributed Computing</i>. Vol 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">10.4230/LIPIcs.DISC.2025.23</a>","short":"K. Chatterjee, J.M. Křišťan, S. Schmid, J. Svoboda, M.X. Yeo, in:, 39th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","apa":"Chatterjee, K., Křišťan, J. M., Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2025). Boosting payment channel network liquidity with topology optimization and transaction selection. In <i>39th International Symposium on Distributed Computing</i> (Vol. 356). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>","mla":"Chatterjee, Krishnendu, et al. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” <i>39th International Symposium on Distributed Computing</i>, vol. 356, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">10.4230/LIPIcs.DISC.2025.23</a>."},"abstract":[{"lang":"eng","text":"Payment channel networks (PCNs) are a promising technology that alleviates blockchain scalability by shifting the transaction load from the blockchain to the PCN. Nevertheless, the network topology has to be carefully designed to maximise the transaction throughput in PCNs. Additionally, users in PCNs also have to make optimal decisions on which transactions to forward and which to reject to prolong the lifetime of their channels. In this work, we consider an input sequence of transactions over p parties. Each transaction consists of a transaction size, source, and target, and can be either accepted or rejected (entailing a cost). The goal is to design a PCN topology among the p cooperating parties, along with the channel capacities, and then output a decision for each transaction in the sequence to minimise the cost of creating and augmenting channels, as well as the cost of rejecting transactions. Our main contribution is an 𝒪(p) approximation algorithm for the problem with p parties. We further show that with some assumptions on the distribution of transactions, we can reduce the approximation ratio to 𝒪(√p). We complement our theoretical analysis with an empirical study of our assumptions and approach in the context of the Lightning Network."}],"article_processing_charge":"No","month":"10","file_date_updated":"2026-03-09T11:51:59Z","quality_controlled":"1","ddc":["000"],"conference":{"name":"DISC: Symposium on Distributed Computing","end_date":"2025-10-31","location":"Berlin, Germany","start_date":"2025-10-27"},"year":"2025","language":[{"iso":"eng"}],"volume":356,"article_number":"23","oa_version":"Published Version","date_created":"2026-03-08T23:01:46Z","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"_id":"21412","publication":"39th International Symposium on Distributed Computing","file":[{"file_id":"21418","access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2026-03-09T11:51:59Z","file_size":1130069,"checksum":"8e3d1594365df60163d9df22158a37b1","date_created":"2026-03-09T11:51:59Z","relation":"main_file","file_name":"2025_DISC_Chatterjee.pdf","creator":"dernst"}],"date_published":"2025-10-22T00:00:00Z","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959774024"]},"OA_type":"gold","arxiv":1,"external_id":{"arxiv":["2508.14524"]},"oa":1,"alternative_title":["LIPIcs"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/1484.pdf"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Křišťan, Jan Matyáš","last_name":"Křišťan","first_name":"Jan Matyáš"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Svoboda","first_name":"Jakub","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"last_name":"Yeo","first_name":"Michelle X","full_name":"Yeo, Michelle X","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"}],"title":"Boosting payment channel network liquidity with topology optimization and transaction selection","OA_place":"publisher","acknowledgement":"Chatterjee, Krishnendu: European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.\r\nKřišťan, Jan Matyáš: Czech Science Foundation Grant no. 24-12046S.\r\nSchmid, Stefan: German Research Foundation (DFG) project ReNO (SPP 2378) from 2023-2027.\r\nSvoboda, Jakub: European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.\r\nYeo, Michelle: MOE-T2EP20122-0014 (Data-Driven Distributed Algorithms).","day":"22","department":[{"_id":"KrCh"}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2026-03-09T11:52:58Z"},{"PlanS_conform":"1","intvolume":"         4","has_accepted_license":"1","type":"journal_article","publisher":"TheoretiCS Foundation","publication_status":"published","abstract":[{"text":"We present a general framework for applying learning algorithms and heuristical guidance to the verification of Markov decision processes (MDPs).\r\nThe primary goal of our techniques is to improve performance by avoiding an exhaustive exploration of the state space, instead focussing on particularly relevant areas of the system, guided by heuristics. Our work builds on the previous results of Br{á}zdil et al., significantly extending it as well as refining several details and fixing errors.\r\nThe presented framework focuses on probabilistic reachability, which is a core problem in verification, and is instantiated in two distinct scenarios.\r\nThe first assumes that full knowledge of the MDP is available, in particular precise transition probabilities. It performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP without knowing the exact transition dynamics. Here, we obtain probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. In particular, the latter is an extension of statistical model-checking (SMC) for unbounded properties in MDPs. In contrast to other related approaches, we do not restrict our attention to time-bounded (finite-horizon) or discounted properties, nor assume any particular structural properties of the MDP.","lang":"eng"}],"citation":{"mla":"Brázdil, Tomáš, et al. “Learning Algorithms for Verification of Markov Decision Processes.” <i>TheoretiCS</i>, vol. 4, 10, TheoretiCS Foundation, 2025, doi:<a href=\"https://doi.org/10.46298/theoretics.25.10\">10.46298/theoretics.25.10</a>.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2025). Learning algorithms for verification of Markov decision processes. <i>TheoretiCS</i>. TheoretiCS Foundation. <a href=\"https://doi.org/10.46298/theoretics.25.10\">https://doi.org/10.46298/theoretics.25.10</a>","ista":"Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Meggendorfer T, Parker D, Ujma M. 2025. Learning algorithms for verification of Markov decision processes. TheoretiCS. 4, 10.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, and Mateusz Ujma. “Learning Algorithms for Verification of Markov Decision Processes.” <i>TheoretiCS</i>. TheoretiCS Foundation, 2025. <a href=\"https://doi.org/10.46298/theoretics.25.10\">https://doi.org/10.46298/theoretics.25.10</a>.","ieee":"T. Brázdil <i>et al.</i>, “Learning algorithms for verification of Markov decision processes,” <i>TheoretiCS</i>, vol. 4. TheoretiCS Foundation, 2025.","ama":"Brázdil T, Chatterjee K, Chmelik M, et al. Learning algorithms for verification of Markov decision processes. <i>TheoretiCS</i>. 2025;4. doi:<a href=\"https://doi.org/10.46298/theoretics.25.10\">10.46298/theoretics.25.10</a>","short":"T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, T. Meggendorfer, D. Parker, M. Ujma, TheoretiCS 4 (2025)."},"doi":"10.46298/theoretics.25.10","scopus_import":"1","file_date_updated":"2026-03-09T11:39:59Z","month":"04","article_processing_charge":"Yes","volume":4,"language":[{"iso":"eng"}],"ddc":["000"],"year":"2025","quality_controlled":"1","file":[{"access_level":"open_access","date_updated":"2026-03-09T11:39:59Z","success":1,"content_type":"application/pdf","file_id":"21417","file_name":"2026_TheoretiCS_Brazdil.pdf","creator":"dernst","date_created":"2026-03-09T11:39:59Z","checksum":"2ccf563ae577ee08d82baf752292ca7b","file_size":861607,"relation":"main_file"}],"publication":"TheoretiCS","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"}],"_id":"21413","oa_version":"Published Version","article_number":"10","date_created":"2026-03-08T23:01:46Z","external_id":{"arxiv":["2403.09184"]},"oa":1,"publication_identifier":{"eissn":["2751-4838"]},"OA_type":"gold","arxiv":1,"date_published":"2025-04-01T00:00:00Z","DOAJ_listed":"1","department":[{"_id":"KrCh"}],"day":"01","ec_funded":1,"OA_place":"publisher","article_type":"original","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement AdG-267989 (QUAREM)*, AdG-246967 (VERIWARE)*, StG-279307 (Graph Games)*\r\n, CoG-863818 (ForM-SMArt), and AdG-834115 (FUN2MODEL), by the EU FP7 project HIERATIC*, by the German Research Foundation (DFG) project 427755713 (GOPro), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE)* , S11407-N23 (RiSE)*\r\n, and P23499-N23* , by the Czech Science Foundation grant No P202/12/P612* and GA23-06963S, by the MUNI Award in Science and Humanities (MUNI/I/1757/2021) of the Grant\r\nAgency of Masaryk University, by EPSRC project EP/K038575/1*, and by the Microsoft faculty fellows award*. A preliminary version of this article appeared at ATVA 2014 [33]. The * indicates funding that supported that version.","title":"Learning algorithms for verification of Markov decision processes","author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"full_name":"Kwiatkowska, Marta","first_name":"Marta","last_name":"Kwiatkowska"},{"orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Parker","first_name":"David","full_name":"Parker, David"},{"full_name":"Ujma, Mateusz","first_name":"Mateusz","last_name":"Ujma"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2026-03-09T11:43:38Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-03-16T08:43:57Z","status":"public","language":[{"iso":"eng"}],"title":"Strain-induced multiferroicity in Cr1/3NbS2","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2510.11619"}],"author":[{"full_name":"Sun, Y.","last_name":"Sun","first_name":"Y."},{"first_name":"Y.","last_name":"Ahn","full_name":"Ahn, Y."},{"first_name":"D.","last_name":"Sapkota","full_name":"Sapkota, D."},{"full_name":"Arachchige, H. S.","last_name":"Arachchige","first_name":"H. S."},{"full_name":"Xue, R.","first_name":"R.","last_name":"Xue"},{"full_name":"Mozaffari, S.","first_name":"S.","last_name":"Mozaffari"},{"full_name":"Mandrus, D. G.","last_name":"Mandrus","first_name":"D. G."},{"full_name":"Zhao, L.","first_name":"L.","last_name":"Zhao"},{"last_name":"Orenstein","first_name":"J.","full_name":"Orenstein, J."},{"last_name":"Sunko","first_name":"Veronika","full_name":"Sunko, Veronika","orcid":"0000-0003-2724-3523","id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3"}],"article_processing_charge":"No","department":[{"_id":"VeSu"}],"day":"13","OA_place":"repository","acknowledgement":"Y.S., V.S. and J.O. received support from the Gordon and Betty Moore Foundation’s\r\nEPiQS Initiative through Grant GBMF4537 to J.O. at UC Berkeley. Experimental and theoretical work at LBNL and UC Berkeley was funded by the Quantum Materials (KC2202) program under the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences,\r\nMaterials Sciences and Engineering Division under Contract No. DE-AC02-05CH11231.\r\nY.S. also acknowledges support by the David J. Thouless Postdoctoral Fellowship at the\r\nDepartment of Physics, University of Washington. DGM acknowledges support from the\r\nGordon and Betty Moore Foundation’s EPiQS Initiative, Grant GBMF9069. L.Z. acknowledges the support from the U.S. Department of Energy (DOE), Office of Science, Basic\r\nEnergy Science (BES), under award No. DE-SC0024145","month":"10","OA_type":"green","doi":"10.48550/arXiv.2510.11619","arxiv":1,"date_published":"2025-10-13T00:00:00Z","abstract":[{"text":"Multiferroic materials, in which electric polarization and magnetic order coexist and couple, offer rich opportunities for both fundamental discovery and technology. However, multiferroicity remains rare due to conflicting electronic requirements for ferroelectricity and magnetism. One route to circumvent this challenge is to exploit the noncollinear ordering of spin cycloids, whose symmetry permits the emergence of polar order. In this work, we introduce another pathway to multiferroic order in which strain generates polarization in materials that host nonpolar spin spirals. To demonstrate this phenomenon, we chose the spin spiral in the well-studied helimagnet Cr1/3NbS2. To detect the induced polarization, we introduce the technique of magnetoelectric birefringence (MEB), an optical probe that enables spatially-resolved and unambiguous detection of polar order. By combining MEB imaging with strain engineering, we confirm the onset of a polar vector at the magnetic transition, establishing strained Cr1/3NbS2 as a type-II multiferroic.","lang":"eng"}],"citation":{"ista":"Sun Y, Ahn Y, Sapkota D, Arachchige HS, Xue R, Mozaffari S, Mandrus DG, Zhao L, Orenstein J, Sunko V. Strain-induced multiferroicity in Cr1/3NbS2. arXiv, 2510.11619.","chicago":"Sun, Y., Y. Ahn, D. Sapkota, H. S. Arachchige, R. Xue, S. Mozaffari, D. G. Mandrus, L. Zhao, J. Orenstein, and Veronika Sunko. “Strain-Induced Multiferroicity in Cr1/3NbS2.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2510.11619\">https://doi.org/10.48550/arXiv.2510.11619</a>.","ieee":"Y. Sun <i>et al.</i>, “Strain-induced multiferroicity in Cr1/3NbS2,” <i>arXiv</i>. .","ama":"Sun Y, Ahn Y, Sapkota D, et al. Strain-induced multiferroicity in Cr1/3NbS2. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2510.11619\">10.48550/arXiv.2510.11619</a>","short":"Y. Sun, Y. Ahn, D. Sapkota, H.S. Arachchige, R. Xue, S. Mozaffari, D.G. Mandrus, L. Zhao, J. Orenstein, V. Sunko, ArXiv (n.d.).","mla":"Sun, Y., et al. “Strain-Induced Multiferroicity in Cr1/3NbS2.” <i>ArXiv</i>, 2510.11619, doi:<a href=\"https://doi.org/10.48550/arXiv.2510.11619\">10.48550/arXiv.2510.11619</a>.","apa":"Sun, Y., Ahn, Y., Sapkota, D., Arachchige, H. S., Xue, R., Mozaffari, S., … Sunko, V. (n.d.). Strain-induced multiferroicity in Cr1/3NbS2. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2510.11619\">https://doi.org/10.48550/arXiv.2510.11619</a>"},"external_id":{"arxiv":["2510.11619"]},"oa":1,"type":"preprint","_id":"21435","corr_author":"1","article_number":"2510.11619","publication_status":"submitted","oa_version":"Preprint","date_created":"2026-03-11T10:39:44Z","publication":"arXiv"},{"publication":"Proceedings SIGGRAPH Asia 2025 Conference Papers 2025","file":[{"file_size":57903731,"checksum":"a3dc426cdf7bbd84a192e5140bb3bb49","date_created":"2026-03-23T14:41:07Z","relation":"main_file","file_name":"2025_SiggraphAsia_Rao.pdf","creator":"dernst","file_id":"21479","access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2026-03-23T14:41:07Z"}],"date_created":"2026-03-22T23:04:35Z","oa_version":"Published Version","article_number":"108","_id":"21474","oa":1,"external_id":{"arxiv":["2510.15846"]},"date_published":"2025-12-14T00:00:00Z","arxiv":1,"OA_type":"gold","publication_identifier":{"isbn":["9798400721373"]},"acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784) and Saarbrücken Research Center for Visual Comput- ing, Interaction, and AI. We thank Oleksandr Sotnychenko for helping us with setting up data capture. Finally, we thank Shrisha Bharadwaj for discussions, proofreading and innumerable support.","OA_place":"publisher","day":"14","department":[{"_id":"BeBi"}],"title":"3DPR: Single image 3D portrait relighting with generative priors","author":[{"first_name":"Pramod","last_name":"Rao","full_name":"Rao, Pramod"},{"full_name":"Meka, Abhimitra","last_name":"Meka","first_name":"Abhimitra"},{"full_name":"Zhou, Xilong","last_name":"Zhou","first_name":"Xilong"},{"full_name":"Fox, Gereon","last_name":"Fox","first_name":"Gereon"},{"full_name":"Mallikarjun, B. R.","first_name":"B. R.","last_name":"Mallikarjun"},{"full_name":"Zhan, Fangneng","last_name":"Zhan","first_name":"Fangneng"},{"full_name":"Weyrich, Tim","first_name":"Tim","last_name":"Weyrich"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385"},{"full_name":"Pfister, Hanspeter","first_name":"Hanspeter","last_name":"Pfister"},{"last_name":"Matusik","first_name":"Wojciech","full_name":"Matusik, Wojciech"},{"full_name":"Beeler, Thabo","first_name":"Thabo","last_name":"Beeler"},{"last_name":"Elgharib","first_name":"Mohamed","full_name":"Elgharib, Mohamed"},{"full_name":"Habermann, Marc","last_name":"Habermann","first_name":"Marc"},{"last_name":"Theobalt","first_name":"Christian","full_name":"Theobalt, Christian"}],"status":"public","date_updated":"2026-03-23T14:45:58Z","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publication_status":"published","type":"conference","publisher":"Association for Computing Machinery","citation":{"apa":"Rao, P., Meka, A., Zhou, X., Fox, G., Mallikarjun, B. R., Zhan, F., … Theobalt, C. (2025). 3DPR: Single image 3D portrait relighting with generative priors. In <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>. Hong Kong, Hong Kong: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3757377.3763962\">https://doi.org/10.1145/3757377.3763962</a>","mla":"Rao, Pramod, et al. “3DPR: Single Image 3D Portrait Relighting with Generative Priors.” <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>, 108, Association for Computing Machinery, 2025, doi:<a href=\"https://doi.org/10.1145/3757377.3763962\">10.1145/3757377.3763962</a>.","ama":"Rao P, Meka A, Zhou X, et al. 3DPR: Single image 3D portrait relighting with generative priors. In: <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>. Association for Computing Machinery; 2025. doi:<a href=\"https://doi.org/10.1145/3757377.3763962\">10.1145/3757377.3763962</a>","short":"P. Rao, A. Meka, X. Zhou, G. Fox, B.R. Mallikarjun, F. Zhan, T. Weyrich, B. Bickel, H. Pfister, W. Matusik, T. Beeler, M. Elgharib, M. Habermann, C. Theobalt, in:, Proceedings SIGGRAPH Asia 2025 Conference Papers 2025, Association for Computing Machinery, 2025.","chicago":"Rao, Pramod, Abhimitra Meka, Xilong Zhou, Gereon Fox, B. R. Mallikarjun, Fangneng Zhan, Tim Weyrich, et al. “3DPR: Single Image 3D Portrait Relighting with Generative Priors.” In <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3757377.3763962\">https://doi.org/10.1145/3757377.3763962</a>.","ieee":"P. Rao <i>et al.</i>, “3DPR: Single image 3D portrait relighting with generative priors,” in <i>Proceedings SIGGRAPH Asia 2025 Conference Papers 2025</i>, Hong Kong, Hong Kong, 2025.","ista":"Rao P, Meka A, Zhou X, Fox G, Mallikarjun BR, Zhan F, Weyrich T, Bickel B, Pfister H, Matusik W, Beeler T, Elgharib M, Habermann M, Theobalt C. 2025. 3DPR: Single image 3D portrait relighting with generative priors. Proceedings SIGGRAPH Asia 2025 Conference Papers 2025. SA: SIGGRAPH Asia, 108."},"abstract":[{"lang":"eng","text":"Rendering novel, relit views of a human head, given a monocular portrait image as input, is an inherently underconstrained problem. The traditional graphics solution is to explicitly decompose the input image into geometry, material and lighting via differentiable rendering; but this is constrained by the multiple assumptions and approximations of the underlying models and parameterizations of these scene components. We propose 3DPR, an image-based relighting model that leverages generative priors learnt from multi-view One-Light-at-A-Time (OLAT) images captured in a light stage. We introduce a new diverse and large-scale multi-view 4K OLAT dataset of 139 subjects to learn a high-quality prior over the distribution of high-frequency face reflectance. We leverage the latent space of a pre-trained generative head model that provides a rich prior over face geometry learnt from in-the-wild image datasets. The input portrait is first embedded in the latent manifold of such a model through an encoder-based inversion process. Then a novel triplane-based reflectance network trained on our lightstage data is used to synthesize high-fidelity OLAT images to enable image-based relighting. Our reflectance network operates in the latent space of the generative head model, crucially enabling a relatively small number of lightstage images to train the reflectance model. Combining the generated OLATs according to a given HDRI environment maps yields physically accurate environmental relighting results. Through quantitative and qualitative evaluations, we demonstrate that 3DPR outperforms previous methods, particularly in preserving identity and in capturing lighting effects such as specularities, self-shadows, and subsurface scattering."}],"scopus_import":"1","doi":"10.1145/3757377.3763962","month":"12","file_date_updated":"2026-03-23T14:41:07Z","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc/4.0/","language":[{"iso":"eng"}],"quality_controlled":"1","ddc":["000"],"conference":{"start_date":"2025-12-15","end_date":"2025-12-18","name":"SA: SIGGRAPH Asia","location":"Hong Kong, Hong Kong"},"year":"2025"},{"_id":"21668","publisher":"Zenodo","type":"research_data_reference","date_created":"2026-04-07T09:47:22Z","oa_version":"Published Version","doi":"10.5281/ZENODO.14500423","OA_type":"gold","related_material":{"record":[{"id":"21661","relation":"used_for_analysis_in","status":"public"}]},"date_published":"2025-03-07T00:00:00Z","abstract":[{"lang":"eng","text":"This artifact allows to review and reproduce the experiments from the paper *A Revised Practitioner's Guide to MDP Model Checking Algorithms*.\r\nThe package contains all original logfiles and derived data used to generate the plots as in the paper. Furthermore, the artifact contains the model checking tools `Storm` and `mcsta` in the version exercised in the paper, the used Docker container, as well as benchmark instances and execution scripts to reproduce the experiments.\r\n\r\nSee also the artifact of the conference paper: https://zenodo.org/records/7509474"}],"oa":1,"citation":{"apa":"Hartmanns, A., Junges, S., Quatmann, T., &#38; Weininger, M. (2025). Benchmark data for the revised practitioner’s guide to MDP model checking algorithms. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.14500423\">https://doi.org/10.5281/ZENODO.14500423</a>","mla":"Hartmanns, Arnd, et al. <i>Benchmark Data for the Revised Practitioner’s Guide to MDP Model Checking Algorithms</i>. Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.14500423\">10.5281/ZENODO.14500423</a>.","short":"A. Hartmanns, S. Junges, T. Quatmann, M. Weininger, (2025).","ama":"Hartmanns A, Junges S, Quatmann T, Weininger M. Benchmark data for the revised practitioner’s guide to MDP model checking algorithms. 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.14500423\">10.5281/ZENODO.14500423</a>","ieee":"A. Hartmanns, S. Junges, T. Quatmann, and M. Weininger, “Benchmark data for the revised practitioner’s guide to MDP model checking algorithms.” Zenodo, 2025.","chicago":"Hartmanns, Arnd, Sebastian Junges, Tim Quatmann, and Maximilian Weininger. “Benchmark Data for the Revised Practitioner’s Guide to MDP Model Checking Algorithms.” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.14500423\">https://doi.org/10.5281/ZENODO.14500423</a>.","ista":"Hartmanns A, Junges S, Quatmann T, Weininger M. 2025. Benchmark data for the revised practitioner’s guide to MDP model checking algorithms, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.14500423\">10.5281/ZENODO.14500423</a>."},"title":"Benchmark data for the revised practitioner's guide to MDP model checking algorithms","author":[{"full_name":"Hartmanns, Arnd","first_name":"Arnd","last_name":"Hartmanns"},{"last_name":"Junges","first_name":"Sebastian","full_name":"Junges, Sebastian"},{"full_name":"Quatmann, Tim","last_name":"Quatmann","first_name":"Tim"},{"last_name":"Weininger","first_name":"Maximilian","full_name":"Weininger, Maximilian","orcid":"0000-0002-0163-2152","id":"02ab0197-cc70-11ed-ab61-918e71f56881"}],"main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.14500423","open_access":"1"}],"article_processing_charge":"No","department":[{"_id":"KrCh"}],"day":"07","month":"03","OA_place":"repository","year":"2025","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-04-07T09:52:55Z","status":"public"}]