| 2026 | Learning Ising Models from Evolutions (Extended Abstract). | Jason Gaitonde, Ankur Moitra, Elchanan Mossel |
| 2026 | Toward Simultaneously Optimal Regret in U-Calibration. | Rafael M. Frongillo, Haipeng Luo, Nishant A. Mehta, Jon Schneider |
| 2026 | Space-Efficient Language Generation in the Limit. | Nicolas Flammarion, Chirag Pabbaraju, Hristo Papazov, Miltiadis Stouras, Ola Svensson |
| 2026 | Optimal Reconstruction from Linear Queries. | Yuval Filmus, Shay Moran, Elizaveta Nesterova |
| 2026 | Invited Open Problem: Is the Power of Deep Learning over Linear Models Inherently Distribution Dependent? | Vitaly Feldman, Pritish Kamath, Nathan Srebro |
| 2026 | Defensive Generation. | Gabriele Farina, Juan Carlos Perdomo |
| 2026 | Tight Sample Complexity Bounds for Entropic Best Policy Identification. | Amer Essakine, Claire Vernade |
| 2026 | The Sample Complexity of Multiclass and Sparse Contextual Bandits. | Liad Erez, Fan Chen, Alon Cohen, Tomer Koren, Yishay Mansour, Shay Moran, Alexander Rakhlin |
| 2026 | Leveraging Similarities in Multi-Armed Bandits. | Khaled Eldowa, Thibaud Rahier, Augustin Cablant, Panayotis Mertikopoulos, Pierre Gaillard |
| 2026 | Model Agreement via Anchoring. | Eric Eaton, Surbhi Goel, Marcel Hussing, Michael Kearns, Aaron Roth, Sikata Bela Sengupta, Jessica Sorrell |
| 2026 | The Median is Easier than it Looks: Approximation with a Constant-Depth, Linear-Width ReLU Network. | Abhigyan Dutta, Itay Safran, Paul Valiant |
| 2026 | Relatively Smart: A New Approach for Instance-Optimal Learning. | Shaddin Dughmi, Alireza F. Pour |
| 2026 | Online Realizable Regression and Applications for ReLU Networks. | Ilan Doron-Arad, Idan Mehalel, Elchanan Mossel |
| 2026 | Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees. | Daniil Dmitriev, Zhihan Huang, Yuting Wei |
| 2026 | Minimax optimal differentially private synthetic data for smooth queries. | Rundong Ding, Yiyun He, Yizhe Zhu |
| 2026 | Rate-optimal community detection near the KS threshold via node-robust algorithms. | Jingqiu Ding, Yiding Hua, Kasper Lindberg, David Steurer, Aleksandr Storozhenko |
| 2026 | High-Dimensional Gaussian Mean Estimation under Realizable Contamination. | Ilias Diakonikolas, Daniel M. Kane, Thanasis Pittas |
| 2026 | A Quasi-Polynomial Time Mean Estimator Under Mean-Shift Contamination with Unknown Covariance. | Ilias Diakonikolas, Jingyi Gao, Giannis Iakovidis, Daniel M. Kane, Sihan Liu, Thanasis Pittas |
| 2026 | Linear Regression under Missing or Corrupted Coordinates. | Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane, Jasper C. H. Lee, Thanasis Pittas |
| 2026 | The matrix-vector complexity of Ax=b. | Michal Derezinski, Ethan N. Epperly, Raphael A. Meyer |
| 2026 | Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size. | Michal Derezinski, Xiaoyu Dong |
| 2026 | Stochastic Safe Action Model Learning. | Zihao Deng, Brendan Juba |
| 2026 | Estimating Ising Models in Total Variation Distance. | Constantinos Daskalakis, Anthimos Vardis Kandiros, Rui Yao |
| 2026 | Rigorous Asymptotics for First-Order Algorithms Through the Dynamical Cavity Method. | Yatin Dandi, David Gamarnik, Francisco Pernice, Lenka Zdeborov |
| 2026 | Tight Bounds for Logistic Regression with Large Stepsize Gradient Descent in Low Dimension. | Michael Crawshaw, Mingrui Liu |