Probability

Eric Babson, Moon Duchin, Annina Iseli et al.

This work provides foundational theoretical tools for analyzing random MST, a widely used but mathematically understudied object, benefiting researchers in probability and combinatorial optimization.

Xiaoyu Chen, Zhe Ju, Tianshun Miao et al.

For theoretical computer scientists and statistical physicists, this work provides the first sharp mixing bounds for Swendsen-Wang dynamics beyond mean-field or strong spatial mixing regimes and completes the phase transition classification for antiferromagnetic two-spin systems.

Ziang Chen, Jaume de Dios Pont, Paata Ivanisvili et al.

This resolves a conjecture by Carbery and provides optimal constants for functional inequalities in L^p spaces, which is of interest to researchers in harmonic analysis and functional analysis.

Yan Ding, Sizhou Wu, Ying Zhang

Provides rigorous convergence and regularity results for a new numerical scheme, benefiting researchers working on numerical methods for stochastic differential equations with irregular coefficients.

Juan Diego Toscano, Zhaojie Chai, George Em Karniadakis

For researchers in scientific discovery and numerical methods, GRAFT-ATHENA provides a foundation for autonomous laboratories that accumulate knowledge across problems, but the results are demonstrated on specific benchmarks and engineering problems, not yet broadly validated.

Boris Hanin, Tianze Jiang

This work provides theoretical insights into the behavior of deep non-linear MLPs for researchers and practitioners interested in understanding the benefits of network depth in Bayesian inference, particularly in large-scale regimes.

Feng Dai, Egor Kosov, Noel Murasko

This work advances theoretical understanding of random sampling for L_p norm approximation and sparse recovery, offering nearly optimal bounds for practitioners in high-dimensional statistics and signal processing.

Lorenzo Baldassari, Josselin Garnier, Knut Solna et al.

This work bridges the gap between empirical success and theoretical understanding of annealed Langevin dynamics for multimodal sampling, offering guarantees that hold uniformly across dimensions, which is crucial for high-dimensional applications.

Reese Pathak, Nikita Zhivotovskiy · eth-zurich

This extends a fundamental inequality from Gaussian processes to a much larger family, providing a unified theoretical foundation for empirical process theory.

Lifu Wei, Yinuo Ren, Naichen Shi et al.

It provides a computationally efficient and unbiased method for inference-time guidance in diffusion models, addressing the bottleneck of repeated score/gradient evaluations.

Chenyang Wang, Weizhong Wang, Yinuo Ren et al.

This work provides a simpler, gradient-free alternative to inference-time guidance for diffusion models, reducing computational overhead and bias.

Mitia Duerinckx, Borjan Geshkovski, Stefano Rossi

It offers a mathematical foundation for a widely observed empirical phenomenon in large language models, addressing a key limitation in transformer-based architectures.

Xiaoyu Chen, Zongchen Chen, Kuikui Liu et al.

This work addresses computational efficiency challenges in statistical physics and computer science, offering incremental improvements in algorithm speed for spin systems.

Jason M. Altschuler, Sinho Chewi, Matthew S. Zhang

This work addresses a major open problem in computational statistics and machine learning by enabling faster sampling algorithms for log-concave distributions, which is incremental but crucial for applications like Bayesian inference.

Nima Anari

Provides a faster algorithm for sampling Eulerian tours, a fundamental problem in graph theory with applications in combinatorics and network analysis.

Tristan Luca Saidi, Gonzalo Mena, Larry Wasserman et al.

This addresses the challenge of modeling distributional dynamics in scientific systems where classical vector space methods fail, offering a novel approach for researchers in fields like biology and economics.

Yuzhou Gu, Mark Sellke

Resolves a long-standing conjecture in information theory, showing that Gaussian measures are not optimal for certain entropy properties.

Frederic Koehler, Pui Kuen Leung

This addresses the computational complexity of approximating permanents, relevant for quantum computing and statistical physics, but is incremental as it builds on Barvinok's interpolation method and prior work on zero-free regions.

Can Huang, Michela Ottobre, Gideon Simpson

This addresses the problem of reliable numerical simulation for SPDEs in fields like physics and engineering, but it is incremental as it builds on existing methods with new error bounds.

Sourav Chatterjee, Persi Diaconis, Susan Holmes

For statisticians and machine learning researchers, this work provides a unified theoretical framework with finite-sample guarantees for set size estimation across diverse domains.