| 2025 | Learning sparse generalized linear models with binary outcomes via iterative hard thresholding. | Namiko Matsumoto, Arya Mazumdar |
| 2025 | Universality of High-Dimensional Logistic Regression and a Novel CGMT under Dependence with Applications to Data Augmentation. | Matthew Esmaili Mallory, Kevin Han Huang, Morgane Austern |
| 2025 | Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries. | Arnab Maiti, Zhiyuan Fan, Kevin Jamieson, Lillian J. Ratliff, Gabriele Farina |
| 2025 | Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games. | Arnab Maiti |
| 2025 | Identifiability and Estimation in High-Dimensional Nonparametric Latent Structure Models. | Yichen Lyu, Pengkun Yang |
| 2025 | Sparsity-Based Interpolation of External, Internal and Swap Regret. | Zhou Lu, Y. Jennifer Sun, Zhiyu Zhang |
| 2025 | Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses. | Jiuyao Lu, Aaron Roth, Mirah Shi |
| 2025 | Robust Algorithms for Recovering Planted r-Colorable Graphs. | Anand Louis, Rameesh Paul, Prasad Raghavendra |
| 2025 | Multi-Pass Memory Lower Bounds for Learning Problems. | Qian Li, Shuo Wang, Jiapeng Zhang |
| 2025 | Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity. | Bo Li, Wei Wang, Peng Ye |
| 2025 | Decision Making in Hybrid Environments: A Model Aggregation Approach. | Haolin Liu, Chen-Yu Wei, Julian Zimmert |
| 2025 | Some easy optimization problems have the overlap-gap property. | Shuangping Li, Tselil Schramm |
| 2025 | A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker Conditions. | Junfan Li, Shizhong Liao, Zenglin Xu, Liqiang Nie |
| 2025 | Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of Φ-Mutual Information (Extended Abstract). | Jiaming Liang, Siddharth Mitra, Andre Wibisono |
| 2025 | Low-dimensional adaptation of diffusion models: Convergence in total variation (extended abstract). | Jiadong Liang, Zhihan Huang, Yuxin Chen |
| 2025 | Robust random graph matching in Gaussian models via vector approximate message passing. | Zhangsong Li |
| 2025 | The Fundamental Limits of Recovering Planted Subgraphs (extended abstract). | Daniel Lee, Francisco Pernice, Amit Rajaraman, Ilias Zadik |
| 2025 | Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play. | John Lazarsfeld, Georgios Piliouras, Ryann Sim, Andre Wibisono |
| 2025 | Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models. | Dmitriy Kunisky |
| 2025 | Spike-and-Slab Posterior Sampling in High Dimensions. | Symantak Kumar, Purnamrita Sarkar, Kevin Tian, Yusong Zhu |
| 2025 | A Gap Between the Gaussian RKHS and Neural Networks: An Infinite-Center Asymptotic Analysis. | Akash Kumar, Rahul Parhi, Mikhail Belkin |
| 2025 | The Role of Environment Access in Agnostic Reinforcement Learning (Extended Abstract). | Akshay Krishnamurthy, Gene Li, Ayush Sekhari |
| 2025 | Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery. | Filip Kovacevic, Yihan Zhang, Marco Mondelli |
| 2025 | The Oracle Complexity of Simplex-based Matrix Games: Linear Separability and Nash Equilibria. | Guy Kornowski, Ohad Shamir |
| 2025 | Efficiently learning and sampling multimodal distributions with data-based initialization. | Frederic Koehler, Holden Lee, Thuy-Duong Vuong |