| 2018 | Information Directed Sampling and Bandits with Heteroscedastic Noise. | Johannes Kirschner, Andreas Krause |
| 2018 | Restricted Eigenvalue from Stable Rank with Applications to Sparse Linear Regression. | Shiva Prasad Kasiviswanathan, Mark Rudelson |
| 2018 | Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent. | Chi Jin, Praneeth Netrapalli, Michael I. Jordan |
| 2018 | Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon. | Nan Jiang, Alekh Agarwal |
| 2018 | The Vertex Sample Complexity of Free Energy is Polynomial. | Vishesh Jain, Frederic Koehler, Elchanan Mossel |
| 2018 | The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity. | Vishesh Jain, Frederic Koehler, Elchanan Mossel |
| 2018 | Approximate Nearest Neighbors in Limited Space. | Piotr Indyk, Tal Wagner |
| 2018 | Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability. | Nina Holden, Robin Pemantle, Yuval Peres |
| 2018 | The Many Faces of Exponential Weights in Online Learning. | Dirk van der Hoeven, Tim van Erven, Wojciech Kotlowski |
| 2018 | Cutting plane methods can be extended into nonconvex optimization. | Oliver Hinder |
| 2018 | Open problem: Improper learning of mixtures of Gaussians. | Elad Hazan, Roi Livni |
| 2018 | Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints. | Yanjun Han, Ayfer zgr, Tsachy Weissman |
| 2018 | Actively Avoiding Nonsense in Generative Models. | Steve Hanneke, Adam Tauman Kalai, Gautam Kamath, Christos Tzamos |
| 2018 | Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance. | Yanjun Han, Jiantao Jiao, Tsachy Weissman |
| 2018 | Global Guarantees for Enforcing Deep Generative Priors by Empirical Risk. | Paul Hand, Vladislav Voroninski |
| 2018 | Certified Computation from Unreliable Datasets. | Themis Gouleakis, Christos Tzamos, Manolis Zampetakis |
| 2018 | Size-Independent Sample Complexity of Neural Networks. | Noah Golowich, Alexander Rakhlin, Ohad Shamir |
| 2018 | Online Learning: Sufficient Statistics and the Burkholder Method. | Dylan J. Foster, Alexander Rakhlin, Karthik Sridharan |
| 2018 | Logistic Regression: The Importance of Being Improper. | Dylan J. Foster, Satyen Kale, Haipeng Luo, Mehryar Mohri, Karthik Sridharan |
| 2018 | Calibrating Noise to Variance in Adaptive Data Analysis. | Vitaly Feldman, Thomas Steinke |
| 2018 | Hidden Integrality of SDP Relaxations for Sub-Gaussian Mixture Models. | Yingjie Fei, Yudong Chen |
| 2018 | Fitting a Putative Manifold to Noisy Data. | Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas, Hariharan Narayanan |
| 2018 | Privacy-preserving Prediction. | Cynthia Dwork, Vitaly Feldman |
| 2018 | Log-concave sampling: Metropolis-Hastings algorithms are fast! | Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, Bin Yu |
| 2018 | $\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent. | David Durfee, Kevin A. Lai, Saurabh Sawlani |