Papers
1,396 papers found
The Many Faces of Exponential Weights in Online Learning
Dirk Hoeven, Tim Erven, Wojciech Kotłowski
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity
Vishesh Jain, Frederic Koehler, Elchanan Mossel
The Vertex Sample Complexity of Free Energy is Polynomial
Vishesh Jain, Frederic Koehler, Elchanan Mossel
Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials
Paul Beame, Shayan Oveis Gharan, Xin Yang
Underdamped Langevin MCMC: A non-asymptotic analysis
Xiang Cheng, Niladri S. Chatterji, Peter L. Bartlett et al.
Unleashing Linear Optimizers for Group-Fair Learning and Optimization
Daniel Alabi, Nicole Immorlica, Adam Kalai
A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics
Yuchen Zhang, Percy Liang, Moses Charikar
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning
Nicolò Cesa-Bianchi, Pierre Gaillard, Claudio Gentile et al.
An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits
Yevgeny Seldin, Gábor Lugosi
A Second-order Look at Stability and Generalization
Andreas Maurer
A Unified Analysis of Stochastic Optimization Methods Using Jump System Theory and Quadratic Constraints
Bin Hu, Peter Seiler, Anders Rantzer
Bandits with Movement Costs and Adaptive Pricing
Tomer Koren, Roi Livni, Yishay Mansour
Computationally Efficient Robust Sparse Estimation in High Dimensions
Sivaraman Balakrishnan, Simon S. Du, Jerry Li et al.
Corralling a Band of Bandit Algorithms
Alekh Agarwal, Haipeng Luo, Behnam Neyshabur et al.
Correspondence retrieval
Alexandr Andoni, Daniel Hsu, Kevin Shi et al.
Depth Separation for Neural Networks
Amit Daniely
Effective Semisupervised Learning on Manifolds
Amir Globerson, Roi Livni, Shai Shalev-Shwartz
Efficient Co-Training of Linear Separators under Weak Dependence
Avrim Blum, Yishay Mansour
Efficient PAC Learning from the Crowd
Pranjal Awasthi, Avrim Blum, Nika Haghtalab et al.
Empirical Risk Minimization for Stochastic Convex Optimization: $O(1/n)$- and $O(1/n^2)$-type of Risk Bounds
Lijun Zhang, Tianbao Yang, Rong Jin
Exact tensor completion with sum-of-squares
Aaron Potechin, David Steurer
Fast and robust tensor decomposition with applications to dictionary learning
Tselil Schramm, David Steurer
Fast Rates for Empirical Risk Minimization of Strict Saddle Problems
Alon Gonen, Shai Shalev-Shwartz
Fast rates for online learning in Linearly Solvable Markov Decision Processes
Gergely Neu, Vicenç Gómez