Papers
1,396 papers found
Maximum Entropy Distributions: Bit Complexity and Stability
Damian Straszak, Nisheeth K. Vishnoi
Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limit
Song Mei, Theodor Misiakiewicz, Andrea Montanari
Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression
Michał Dereziński, Kenneth L. Clarkson, Michael W. Mahoney et al.
Model-based RL in Contextual Decision Processes: PAC bounds and Exponential Improvements over Model-free Approaches
Wen Sun, Nan Jiang, Akshay Krishnamurthy et al.
Multi-armed Bandit Problems with Strategic Arms
Mark Braverman, Jieming Mao, Jon Schneider et al.
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits
Yingkai Li, Yining Wang, Yuan Zhou
Near-optimal method for highly smooth convex optimization
Sébastien Bubeck, Qijia Jiang, Yin Tat Lee et al.
Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives
Alexander Gasnikov, Pavel Dvurechensky, Eduard Gorbunov et al.
Non-asymptotic Analysis of Biased Stochastic Approximation Scheme
Belhal Karimi, Blazej Miasojedow, Eric Moulines et al.
Nonconvex sampling with the Metropolis-adjusted Langevin algorithm
Oren Mangoubi, Nisheeth K Vishnoi
Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLT
Andreas Anastasiou, Krishnakumar Balasubramanian, Murat A. Erdogdu
On Communication Complexity of Classification Problems
Daniel Kane, Roi Livni, Shay Moran et al.
On Mean Estimation for General Norms with Statistical Queries
Jerry Li, Aleksandar Nikolov, Ilya Razenshteyn et al.
On the Computational Power of Online Gradient Descent
Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang
Open Problem: Do Good Algorithms Necessarily Query Bad Points?
Rong Ge, Prateek Jain, Sham M. Kakade et al.
Open Problem: How fast can a multiclass test set be overfit?
Vitaly Feldman, Roy Frostig, Moritz Hardt
Open Problem: Is Margin Sufficient for Non-Interactive Private Distributed Learning?
Amit Daniely, Vitaly Feldman
Open Problem: Monotonicity of Learning
Tom Viering, Alexander Mey, Marco Loog
Open Problem: Risk of Ruin in Multiarmed Bandits
Filipo S. Perotto, Mathieu Bourgais, Bruno C. Silva et al.
Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory
Blake Woodworth, Nathan Srebro
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
Matthew Brennan, Guy Bresler
Optimal Learning of Mallows Block Model
Robert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi et al.
Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization
Alexander Gasnikov, Pavel Dvurechensky, Eduard Gorbunov et al.
Parameter-Free Online Convex Optimization with Sub-Exponential Noise
Kwang-Sung Jun, Francesco Orabona