| 2019 | Open Problem: Is Margin Sufficient for Non-Interactive Private Distributed Learning? | Amit Daniely, Vitaly Feldman |
| 2019 | Space lower bounds for linear prediction in the streaming model. | Yuval Dagan, Gil Kur, Ohad Shamir |
| 2019 | Learning from Weakly Dependent Data under Dobrushin's Condition. | Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, Siddhartha Jayanti |
| 2019 | Combining Online Learning Guarantees. | Ashok Cutkosky |
| 2019 | Artificial Constraints and Hints for Unbounded Online Learning. | Ashok Cutkosky |
| 2019 | A near-optimal algorithm for approximating the John Ellipsoid. | Michael B. Cohen, Ben Cousins, Yin Tat Lee, Xin Yang |
| 2019 | Pure entropic regularization for metrical task systems. | Christian Coester, James R. Lee |
| 2019 | Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games. | Yun Kuen Cheung, Georgios Piliouras |
| 2019 | Fast Mean Estimation with Sub-Gaussian Rates. | Yeshwanth Cherapanamjeri, Nicolas Flammarion, Peter L. Bartlett |
| 2019 | Testing Symmetric Markov Chains Without Hitting. | Yeshwanth Cherapanamjeri, Peter L. Bartlett |
| 2019 | Active Regression via Linear-Sample Sparsification. | Xue Chen, Eric Price |
| 2019 | A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free. | Yifang Chen, Chung-Wei Lee, Haipeng Luo, Chen-Yu Wei |
| 2019 | On the Computational Power of Online Gradient Descent. | Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang |
| 2019 | A Rank-1 Sketch for Matrix Multiplicative Weights. | Yair Carmon, John C. Duchi, Aaron Sidford, Kevin Tian |
| 2019 | Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm. | Tongyi Cao, Akshay Krishnamurthy |
| 2019 | Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret. | Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco |
| 2019 | Optimal Learning of Mallows Block Model. | Rbert Busa-Fekete, Dimitris Fotakis, Balzs Szrnyi, Manolis Zampetakis |
| 2019 | Improved Path-length Regret Bounds for Bandits. | Sbastien Bubeck, Yuanzhi Li, Haipeng Luo, Chen-Yu Wei |
| 2019 | Near-optimal method for highly smooth convex optimization. | Sbastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, Aaron Sidford |
| 2019 | Learning rates for Gaussian mixtures under group action. | Victor-Emmanuel Brunel |
| 2019 | Universality of Computational Lower Bounds for Submatrix Detection. | Matthew S. Brennan, Guy Bresler, Wasim Huleihel |
| 2019 | Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness. | Matthew S. Brennan, Guy Bresler |
| 2019 | Multi-armed Bandit Problems with Strategic Arms. | Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg |
| 2019 | Sorted Top-k in Rounds. | Mark Braverman, Jieming Mao, Yuval Peres |
| 2019 | The Optimal Approximation Factor in Density Estimation. | Olivier Bousquet, Daniel Kane, Shay Moran |