| 2021 | Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications. | Liyu Chen, Haipeng Luo, Chen-Yu Wei |
| 2021 | Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition. | Liyu Chen, Haipeng Luo, Chen-Yu Wei |
| 2021 | Breaking The Dimension Dependence in Sparse Distribution Estimation under Communication Constraints. | Wei-Ning Chen, Peter Kairouz, Ayfer zgr |
| 2021 | Learning and testing junta distributions with sub cube conditioning. | Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten |
| 2021 | Black-Box Control for Linear Dynamical Systems. | Xinyi Chen, Elad Hazan |
| 2021 | Query complexity of least absolute deviation regression via robust uniform convergence. | Xue Chen, Michal Derezinski |
| 2021 | When does gradient descent with logistic loss interpolate using deep networks with smoothed ReLU activations? | Niladri S. Chatterji, Philip M. Long, Peter L. Bartlett |
| 2021 | Optimizing Optimizers: Regret-optimal gradient descent algorithms. | Philippe Casgrain, Anastasis Kratsios |
| 2021 | Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss. | Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford |
| 2021 | Fast Rates for Structured Prediction. | Vivien A. Cabannes, Francis R. Bach, Alessandro Rudi |
| 2021 | A Law of Robustness for Two-Layers Neural Networks. | Sbastien Bubeck, Yuanzhi Li, Dheeraj M. Nagaraj |
| 2021 | Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions. | Sbastien Bubeck, Thomas Budzinski, Mark Sellke |
| 2021 | Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. | Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm |
| 2021 | Near Optimal Distributed Learning of Halfspaces with Two Parties. | Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena |
| 2021 | Near-Optimal Entrywise Sampling of Numerically Sparse Matrices. | Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir |
| 2021 | Multiplayer Bandit Learning, from Competition to Cooperation. | Simina Brnzei, Yuval Peres |
| 2021 | Rank-one matrix estimation: analytic time evolution of gradient descent dynamics. | Antoine Bodin, Nicolas Macris |
| 2021 | Robust learning under clean-label attack. | Avrim Blum, Steve Hanneke, Jian Qian, Han Shao |
| 2021 | Majorizing Measures, Sequential Complexities, and Online Learning. | Adam Block, Yuval Dagan, Alexander Rakhlin |
| 2021 | Online Learning from Optimal Actions. | Omar Besbes, Yuri Fonseca, Ilan Lobel |
| 2021 | Deterministic Finite-Memory Bias Estimation. | Tomer Berg, Or Ordentlich, Ofer Shayevitz |
| 2021 | Reconstructing weighted voting schemes from partial information about their power indices. | Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis |
| 2021 | Non-Euclidean Differentially Private Stochastic Convex Optimization. | Raef Bassily, Cristbal Guzmn, Anupama Nandi |
| 2021 | Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. | Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein |
| 2021 | Optimal Dynamic Regret in Exp-Concave Online Learning. | Dheeraj Baby, Yu-Xiang Wang |