| 2022 | Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem. | Yingli Ran, Zhao Zhang, Shaojie Tang |
| 2022 | Label noise (stochastic) gradient descent implicitly solves the Lasso for quadratic parametrisation. | Loucas Pillaud-Vivien, Julien Reygner, Nicolas Flammarion |
| 2022 | Clustering with Queries under Semi-Random Noise. | Alberto Del Pia, Mingchen Ma, Christos Tzamos |
| 2022 | The Structured Abstain Problem and the Lovsz Hinge. | Enrique B. Nueve, Rafael M. Frongillo, Jessica Finocchiaro |
| 2022 | Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise. | Rajai Nasser, Stefan Tiegel |
| 2022 | Private High-Dimensional Hypothesis Testing. | Shyam Narayanan |
| 2022 | Dimension-free convergence rates for gradient Langevin dynamics in RKHS. | Boris Muzellec, Kanji Sato, Mathurin Massias, Taiji Suzuki |
| 2022 | Optimal and instance-dependent guarantees for Markovian linear stochastic approximation. | Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright, Peter L. Bartlett |
| 2022 | Universality of empirical risk minimization. | Andrea Montanari, Basil Saeed |
| 2022 | Wasserstein GANs with Gradient Penalty Compute Congested Transport. | Tristan Milne, Adrian I. Nachman |
| 2022 | Damped Online Newton Step for Portfolio Selection. | Zakaria Mhammedi, Alexander Rakhlin |
| 2022 | Efficient Projection-Free Online Convex Optimization with Membership Oracle. | Zakaria Mhammedi |
| 2022 | Scale-free Unconstrained Online Learning for Curved Losses. | Jack J. Mayo, Hdi Hadiji, Tim van Erven |
| 2022 | Efficient Convex Optimization Requires Superlinear Memory. | Annie Marsden, Vatsal Sharan, Aaron Sidford, Gregory Valiant |
| 2022 | Strategizing against Learners in Bayesian Games. | Yishay Mansour, Mehryar Mohri, Jon Schneider, Balasubramanian Sivan |
| 2022 | Private Matrix Approximation and Geometry of Unitary Orbits. | Oren Mangoubi, Yikai Wu, Satyen Kale, Abhradeep Thakurta, Nisheeth K. Vishnoi |
| 2022 | Complete Policy Regret Bounds for Tallying Bandits. | Dhruv Malik, Yuanzhi Li, Aarti Singh |
| 2022 | Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes. | Yury Makarychev, Naren Sarayu Manoj, Max Ovsiankin |
| 2022 | Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits. | Haipeng Luo, Mengxiao Zhang, Peng Zhao, Zhi-Hua Zhou |
| 2022 | Adaptive Bandit Convex Optimization with Heterogeneous Curvature. | Haipeng Luo, Mengxiao Zhang, Peng Zhao |
| 2022 | Generalization Bounds via Convex Analysis. | Gbor Lugosi, Gergely Neu |
| 2022 | On Almost Sure Convergence Rates of Stochastic Gradient Methods. | Jun Liu, Ye Yuan |
| 2022 | The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication. | Allen Liu, Mark Sellke |
| 2022 | Learning GMMs with Nearly Optimal Robustness Guarantees. | Allen Liu, Ankur Moitra |
| 2022 | Tight query complexity bounds for learning graph partitions. | Xizhi Liu, Sayan Mukherjee |