| 2019 | When can unlabeled data improve the learning rate? | Christina Gpfert, Shai Ben-David, Olivier Bousquet, Sylvain Gelly, Ilya O. Tolstikhin, Ruth Urner |
| 2019 | Learning Ising Models with Independent Failures. | Surbhi Goel, Daniel M. Kane, Adam R. Klivans |
| 2019 | Learning Neural Networks with Two Nonlinear Layers in Polynomial Time. | Surbhi Goel, Adam R. Klivans |
| 2019 | Stabilized SVRG: Simple Variance Reduction for Nonconvex Optimization. | Rong Ge, Zhize Li, Weiyao Wang, Xiang Wang |
| 2019 | Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization. | Alexander V. Gasnikov, Pavel E. Dvurechensky, Eduard Gorbunov, Evgeniya A. Vorontsova, Daniil Selikhanovych, Csar A. Uribe |
| 2019 | Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives. | Alexander V. Gasnikov, Pavel E. Dvurechensky, Eduard Gorbunov, Evgeniya A. Vorontsova, Daniil Selikhanovych, Csar A. Uribe, Bo Jiang, Haoyue Wang, Shuzhong Zhang, Sbastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, Aaron Sidford |
| 2019 | On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA. | Dan Garber |
| 2019 | The Complexity of Making the Gradient Small in Stochastic Convex Optimization. | Dylan J. Foster, Ayush Sekhari, Ohad Shamir, Nathan Srebro, Karthik Sridharan, Blake E. Woodworth |
| 2019 | Statistical Learning with a Nuisance Component. | Dylan J. Foster, Vasilis Syrgkanis |
| 2019 | Sum-of-squares meets square loss: Fast rates for agnostic tensor completion. | Dylan J. Foster, Andrej Risteski |
| 2019 | High probability generalization bounds for uniformly stable algorithms with nearly optimal rate. | Vitaly Feldman, Jan Vondrk |
| 2019 | Open Problem: How fast can a multiclass test set be overfit? | Vitaly Feldman, Roy Frostig, Moritz Hardt |
| 2019 | Achieving the Bayes Error Rate in Stochastic Block Model by SDP, Robustly. | Yingjie Fei, Yudong Chen |
| 2019 | Sharp Analysis for Nonconvex SGD Escaping from Saddle Points. | Cong Fang, Zhouchen Lin, Tong Zhang |
| 2019 | Lower Bounds for Locally Private Estimation via Communication Complexity. | John C. Duchi, Ryan Rogers |
| 2019 | On the Performance of Thompson Sampling on Logistic Bandits. | Shi Dong, Tengyu Ma, Benjamin Van Roy |
| 2019 | Testing Identity of Multidimensional Histograms. | Ilias Diakonikolas, Daniel M. Kane, John Peebles |
| 2019 | Communication and Memory Efficient Testing of Discrete Distributions. | Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao |
| 2019 | Lower Bounds for Parallel and Randomized Convex Optimization. | Jelena Diakonikolas, Cristbal Guzmn |
| 2019 | Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. | Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth |
| 2019 | Fast determinantal point processes via distortion-free intermediate sampling. | Michal Derezinski |
| 2019 | Is your function low dimensional? | Anindya De, Elchanan Mossel, Joe Neeman |
| 2019 | Computational Limitations in Robust Classification and Win-Win Results. | Akshay Degwekar, Preetum Nakkiran, Vinod Vaikuntanathan |
| 2019 | Reconstructing Trees from Traces. | Sami Davies, Mikls Z. Rcz, Cyrus Rashtchian |
| 2019 | Computationally and Statistically Efficient Truncated Regression. | Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis |