Papers
1,396 papers found
Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes
Yichun Hu, Nathan Kallus, Xiaojie Mao
Taking a hint: How to leverage loss predictors in contextual bandits?
Chen-Yu Wei, Haipeng Luo, Alekh Agarwal
The EM Algorithm gives Sample-Optimality for Learning Mixtures of Well-Separated Gaussians
Jeongyeol Kwon, Constantine Caramanis
The estimation error of general first order methods
Michael Celentano, Andrea Montanari, Yuchen Wu
The Gradient Complexity of Linear Regression
Mark Braverman, Elad Hazan, Max Simchowitz et al.
The Influence of Shape Constraints on the Thresholding Bandit Problem
James Cheshire, Pierre Menard, Alexandra Carpentier
Tight Lower Bounds for Combinatorial Multi-Armed Bandits
Nadav Merlis, Shie Mannor
Tree-projected gradient descent for estimating gradient-sparse parameters on graphs
Sheng Xu, Zhou Fan, Sahand Negahban
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits
Chloé Rouyer, Yevgeny Seldin
Universal Approximation with Deep Narrow Networks
Patrick Kidger, Terry Lyons
Wasserstein Control of Mirror Langevin Monte Carlo
Kelvin Shuangjian Zhang, Gabriel Peyré, Jalal Fadili et al.
Winnowing with Gradient Descent
Ehsan Amid, Manfred K. Warmuth
Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation
Vishesh Jain, Frederic Koehler, Jingbo Liu et al.
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information
Peter Auer, Yifang Chen, Pratik Gajane et al.
Achieving the Bayes Error Rate in Stochastic Block Model by SDP, Robustly
Yingjie Fei, Yudong Chen
Active Regression via Linear-Sample Sparsification
Xue Chen, Eric Price
Adaptive Hard Thresholding for Near-optimal Consistent Robust Regression
Arun Sai Suggala, Kush Bhatia, Pradeep Ravikumar et al.
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes
Peter Auer, Pratik Gajane, Ronald Ortner
Affine Invariant Covariance Estimation for Heavy-Tailed Distributions
Dmitrii M. Ostrovskii, Alessandro Rudi
A near-optimal algorithm for approximating the John Ellipsoid
Michael B. Cohen, Ben Cousins, Yin Tat Lee et al.
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free
Yifang Chen, Chung-Wei Lee, Haipeng Luo et al.
An Information-Theoretic Approach to Minimax Regret in Partial Monitoring
Tor Lattimore, Csaba Szepesvári
An Optimal High-Order Tensor Method for Convex Optimization
Bo Jiang, Haoyue Wang, Shuzhong Zhang
Approximate Guarantees for Dictionary Learning
Aditya Bhaskara, Wai Ming Tai
A Rank-1 Sketch for Matrix Multiplicative Weights
Yair Carmon, John C Duchi, Sidford Aaron et al.