Papers
Faster Algorithms for High-Dimensional Robust Covariance Estimation
Yu Cheng, Ilias Diakonikolas, Rong Ge et al.
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free
Yifang Chen, Chung-Wei Lee, Haipeng Luo et al.
Active Regression via Linear-Sample Sparsification
Xue Chen, Eric Price
On the Computational Power of Online Gradient Descent
Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang
A Rank-1 Sketch for Matrix Multiplicative Weights
Yair Carmon, John C Duchi, Sidford Aaron et al.
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm
Tongyi Cao, Akshay Krishnamurthy
Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret
Daniele Calandriello, Luigi Carratino, Alessandro Lazaric et al.
Optimal Learning of Mallows Block Model
Robert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi et al.
Improved Path-length Regret Bounds for Bandits
Sébastien Bubeck, Yuanzhi Li, Haipeng Luo et al.
Near-optimal method for highly smooth convex optimization
Sébastien Bubeck, Qijia Jiang, Yin Tat Lee et al.
Learning rates for Gaussian mixtures under group action
Victor-Emmanuel Brunel
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
Matthew Brennan, Guy Bresler
Universality of Computational Lower Bounds for Submatrix Detection
Matthew Brennan, Guy Bresler, Wasim Huleihel
Multi-armed Bandit Problems with Strategic Arms
Mark Braverman, Jieming Mao, Jon Schneider et al.
Sorted Top-k in Rounds
Mark Braverman, Jieming Mao, Yuval Peres
The Optimal Approximation Factor in Density Estimation
Olivier Bousquet, Daniel Kane, Shay Moran
Approximate Guarantees for Dictionary Learning
Aditya Bhaskara, Wai Ming Tai
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
Ivona Bezáková, Antonio Blanca, Zongchen Chen et al.
Private Center Points and Learning of Halfspaces
Amos Beimel, Shay Moran, Kobbi Nissim et al.
Learning Two Layer Rectified Neural Networks in Polynomial Time
Ainesh Bakshi, Rajesh Jayaram, David P Woodruff
A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise
Francis Bach, Kfir Y Levy
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
Peter Auer, Yifang Chen, Pratik Gajane et al.
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes
Peter Auer, Pratik Gajane, Ronald Ortner
Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLT
Andreas Anastasiou, Krishnakumar Balasubramanian, Murat A. Erdogdu
Testing Mixtures of Discrete Distributions
Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld