Papers
1,396 papers found
More Adaptive Algorithms for Adversarial Bandits
Chen-Yu Wei, Haipeng Luo
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities
Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos et al.
Non-Convex Matrix Completion Against a Semi-Random Adversary
Yu Cheng, Rong Ge
Nonstochastic Bandits with Composite Anonymous Feedback
Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour
Online learning over a finite action set with limited switching
Jason Altschuler, Kunal Talwar
Online Learning: Sufficient Statistics and the Burkholder Method
Dylan J. Foster, Alexander Rakhlin, Karthik Sridharan
Online Variance Reduction for Stochastic Optimization
Zalan Borsos, Andreas Krause, Kfir Y. Levy
Open problem: Improper learning of mixtures of Gaussians
Elad Hazan, Livni Roi
Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon
Nan Jiang, Alekh Agarwal
Optimal Errors and Phase Transitions in High-Dimensional Generalized Linear Models
Jean Barbier, Florent Krzakala, Nicolas Macris et al.
Optimal Single Sample Tests for Structured versus Unstructured Network Data
Guy Bresler, Dheeraj Nagaraj
Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods
Yan Shuo Tan, Roman Vershynin
Privacy-preserving Prediction
Cynthia Dwork, Vitaly Feldman
Private Sequential Learning
John Tsitsiklis, Kuang Xu, Zhi Xu
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
Matthew Brennan, Guy Bresler, Wasim Huleihel
Restricted Eigenvalue from Stable Rank with Applications to Sparse Linear Regression
Shiva Prasad Kasiviswanathan, Mark Rudelson
Size-Independent Sample Complexity of Neural Networks
Noah Golowich, Alexander Rakhlin, Ohad Shamir
Small-loss bounds for online learning with partial information
Thodoris Lykouris, Karthik Sridharan, Éva Tardos
Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
Srinadh Bhojanapalli, Nicolas Boumal, Prateek Jain et al.
Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent
Niangjun Chen, Gautam Goel, Adam Wierman
Subpolynomial trace reconstruction for random strings \{and arbitrary deletion probability
Nina Holden, Robin Pemantle, Yuval Peres
Testing Symmetric Markov Chains From a Single Trajectory
Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin
The Externalities of Exploration and How Data Diversity Helps Exploitation
Manish Raghavan, Aleksandrs Slivkins, Jennifer Vaughan Wortman et al.