| 2021 | Hypothesis testing with low-degree polynomials in the Morris class of exponential families. | Dmitriy Kunisky |
| 2021 | Asymptotically Optimal Information-Directed Sampling. | Johannes Kirschner, Tor Lattimore, Claire Vernade, Csaba Szepesvri |
| 2021 | The Sparse Vector Technique, Revisited. | Haim Kaplan, Yishay Mansour, Uri Stemmer |
| 2021 | (Nearly) Dimension Independent Private ERM with AdaGrad Ratesvia Publicly Estimated Subspaces. | Peter Kairouz, Mnica Ribero Diaz, Keith Rush, Abhradeep Thakurta |
| 2021 | Reduced-Rank Regression with Operator Norm Error. | Praneeth Kacham, David P. Woodruff |
| 2021 | Double Explore-then-Commit: Asymptotic Optimality and Beyond. | Tianyuan Jin, Pan Xu, Xiaokui Xiao, Quanquan Gu |
| 2021 | Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds. | Shinji Ito |
| 2021 | Group testing and local search: is there a computational-statistical gap? | Fotis Iliopoulos, Ilias Zadik |
| 2021 | Fast Rates for the Regret of Offline Reinforcement Learning. | Yichun Hu, Nathan Kallus, Masatoshi Uehara |
| 2021 | Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates. | De Huang, Jonathan Niles-Weed, Rachel A. Ward |
| 2021 | On the Approximation Power of Two-Layer Networks of Random ReLUs. | Daniel Hsu, Clayton Sanford, Rocco A. Servedio, Emmanouil V. Vlatakis-Gkaragkounis |
| 2021 | Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium. | Yu-Guan Hsieh, Kimon Antonakopoulos, Panayotis Mertikopoulos |
| 2021 | Bounded Memory Active Learning through Enriched Queries. | Max Hopkins, Daniel Kane, Shachar Lovett, Michal Moshkovitz |
| 2021 | Shape Matters: Understanding the Implicit Bias of the Noise Covariance. | Jeff Z. HaoChen, Colin Wei, Jason D. Lee, Tengyu Ma |
| 2021 | Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games. | Steve Hanneke, Roi Livni, Shay Moran |
| 2021 | Open Problem: Is There an Online Learning Algorithm That Learns Whenever Online Learning Is Possible? | Steve Hanneke |
| 2021 | Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem. | Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang |
| 2021 | PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate bounds that handle general VC classes. | Peter Grnwald, Thomas Steinke, Lydia Zakynthinou |
| 2021 | Source Identification for Mixtures of Product Distributions. | Spencer Gordon, Bijan H. Mazaheri, Yuval Rabani, Leonard J. Schulman |
| 2021 | Differentially Private Nonparametric Regression Under a Growth Condition. | Noah Golowich |
| 2021 | Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information. | Angeliki Giannou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos |
| 2021 | On Avoiding the Union Bound When Answering Multiple Differentially Private Queries. | Badih Ghazi, Ravi Kumar, Pasin Manurangsi |
| 2021 | Frank-Wolfe with a Nearest Extreme Point Oracle. | Dan Garber, Noam Wolf |
| 2021 | Impossibility of Partial Recovery in the Graph Alignment Problem. | Luca Ganassali, Laurent Massouli, Marc Lelarge |
| 2021 | Efficient Algorithms for Learning from Coarse Labels. | Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos |