| 2018 | Averaging Stochastic Gradient Descent on Riemannian Manifolds. | Nilesh Tripuraneni, Nicolas Flammarion, Francis R. Bach, Michael I. Jordan |
| 2018 | Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods. | Yan Shuo Tan, Roman Vershynin |
| 2018 | Learning Without Mixing: Towards A Sharp Analysis of Linear System Identification. | Max Simchowitz, Horia Mania, Stephen Tu, Michael I. Jordan, Benjamin Recht |
| 2018 | Learning Patterns for Detection with Multiscale Scan Statistics. | James Sharpnack |
| 2018 | An Optimal Learning Algorithm for Online Unconstrained Submodular Maximization. | Tim Roughgarden, Joshua R. Wang |
| 2018 | The Externalities of Exploration and How Data Diversity Helps Exploitation. | Manish Raghavan, Aleksandrs Slivkins, Jennifer Wortman Vaughan, Zhiwei Steven Wu |
| 2018 | Exponential Convergence of Testing Error for Stochastic Gradient Methods. | Loucas Pillaud-Vivien, Alessandro Rudi, Francis R. Bach |
| 2018 | Iterate Averaging as Regularization for Stochastic Gradient Descent. | Gergely Neu, Lorenzo Rosasco |
| 2018 | A Direct Sum Result for the Information Complexity of Learning. | Ido Nachum, Jonathan Shafer, Amir Yehudayoff |
| 2018 | Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints. | Wenlong Mou, Liwei Wang, Xiyu Zhai, Kai Zheng |
| 2018 | Fundamental Limits of Weak Recovery with Applications to Phase Retrieval. | Marco Mondelli, Andrea Montanari |
| 2018 | A Data Prism: Semi-verified learning in the small-alpha regime. | Michela Meister, Gregory Valiant |
| 2018 | Empirical bounds for functions with weak interactions. | Andreas Maurer, Massimiliano Pontil |
| 2018 | Breaking the $1/\sqrtn$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time. | Cheng Mao, Ashwin Pananjady, Martin J. Wainwright |
| 2018 | Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing. | Oren Mangoubi, Nisheeth K. Vishnoi |
| 2018 | Small-loss bounds for online learning with partial information. | Thodoris Lykouris, Karthik Sridharan, va Tardos |
| 2018 | Efficient Contextual Bandits in Non-stationary Worlds. | Haipeng Luo, Chen-Yu Wei, Alekh Agarwal, John Langford |
| 2018 | Adaptivity to Smoothness in X-armed bandits. | Andrea Locatelli, Alexandra Carpentier |
| 2018 | Algorithmic Regularization in Over-parameterized Matrix Sensing and Neural Networks with Quadratic Activations. | Yuanzhi Li, Tengyu Ma, Hongyang Zhang |
| 2018 | Learning Mixtures of Linear Regressions with Nearly Optimal Complexity. | Yuanzhi Li, Yingyu Liang |
| 2018 | Efficient Convex Optimization with Membership Oracles. | Yin Tat Lee, Aaron Sidford, Santosh S. Vempala |
| 2018 | Marginal Singularity, and the Benefits of Labels in Covariate-Shift. | Samory Kpotufe, Guillaume Martinet |
| 2018 | A Faster Approximation Algorithm for the Gibbs Partition Function. | Vladimir Kolmogorov |
| 2018 | Counting Motifs with Graph Sampling. | Jason M. Klusowski, Yihong Wu |
| 2018 | Efficient Algorithms for Outlier-Robust Regression. | Adam R. Klivans, Pravesh K. Kothari, Raghu Meka |