| 2025 | Learning Constant-Depth Circuits in Malicious Noise Models. | Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan |
| 2025 | Experimental Design for Semiparametric Bandits. | Seok-Jin Kim, Gi-Soo Kim, Min-hwan Oh |
| 2025 | The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints. | Hadi Kazemi, Ankit Pensia, Varun S. Jog |
| 2025 | A Theory of Learning with Autoregressive Chain of Thought. | Nirmit Joshi, Gal Vardi, Adam Block, Surbhi Goel, Zhiyuan Li, Theodor Misiakiewicz, Nathan Srebro |
| 2025 | Structure-agnostic Optimality of Doubly Robust Learning for Treatment Effect Estimation (Extended Abstract). | Jikai Jin, Vasilis Syrgkanis |
| 2025 | On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy. | Zeyu Jia, Alexander Rakhlin, Yury Polyanskiy |
| 2025 | Online Covariance Estimation in Nonsmooth Stochastic Approximation. | Liwei Jiang, Abhishek Roy, Krishna Balasubramanian, Damek Davis, Dmitriy Drusvyatskiy, Sen Na |
| 2025 | Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization. | Ruichen Jiang, Devyani Maladkar, Aryan Mokhtari |
| 2025 | Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis. | Minhui Jiang, Yuansi Chen |
| 2025 | Local Regularizers Are Not Transductive Learners. | Sky Jafar, Julian Asilis, Shaddin Dughmi |
| 2025 | Optimal Differentially Private Sampling of Unbounded Gaussians. | Valentio Iverson, Gautam Kamath, Argyris Mouzakis |
| 2025 | Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback. | Shinji Ito, Haipeng Luo, Taira Tsuchiya, Yue Wu |
| 2025 | Polynomial low degree hardness for Broadcasting on Trees (Extended Abstract). | Han Huang, Elchanan Mossel |
| 2025 | Improved Margin Generalization Bounds for Voting Classifiers. | Mikael Mller Hgsgaard, Kasper Green Larsen |
| 2025 | Noisy Group Testing in the Linear Regime: Exact Thresholds and Efficient. | Lukas Hintze, Lena Krieg, Olga Scheftelowitsch, Haodong Zhu |
| 2025 | On the query complexity of sampling from non-log-concave distributions (extended abstract). | Yuchen He, Chihao Zhang |
| 2025 | Learning DNF through Generalized Fourier Representations. | Mohsen Heidari, Roni Khardon |
| 2025 | Compression Barriers in Autoregressive Transformers. | Themistoklis Haris, Krzysztof Onak |
| 2025 | Universal Rates of ERM for Agnostic Learning. | Steve Hanneke, Mingyue Xu |
| 2025 | Universal Rates for Multiclass Learning with Bandit Feedback. | Steve Hanneke, Amirreza Shaeiri, Qian Zhang |
| 2025 | Open Problem: Data Selection for Regression Tasks. | Steve Hanneke, Shay Moran, Alexander Shlimovich, Amir Yehudayoff |
| 2025 | Data Selection for ERMs. | Steve Hanneke, Shay Moran, Alexander Shlimovich, Amir Yehudayoff |
| 2025 | Private List Learnability vs. Online List Learnability. | Steve Hanneke, Shay Moran, Hilla Schefler, Iska Tsubari |
| 2025 | Alternating Regret for Online Convex Optimization. | Soumita Hait, Ping Li, Haipeng Luo, Mengxiao Zhang |
| 2025 | Conference on Learning Theory 2025: Preface. | Nika Haghtalab, Ankur Moitra |