Fetching the paper…
Reading the bibliography…
We prove impossibility results for adaptivity in non-smooth stochastic convex optimization.
Transmission of information, 1961
R. M. Fano and W. Wintringham · 1961
Earlier work this paper cites.
On tail probabilities for martingales
D. A. Freedman · 1975
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Introduction to Optimization
B. T. Polyak · 1987
Earlier work this paper cites.
Elements of information theory
T. M. Cover and A. J. Thomas · 1991
Earlier work this paper cites.
Probability theory
A. A. Borovkov · 1999
Earlier work this paper cites.
Selfish routing and the price of anarchy
T. Roughgarden · 2005
Earlier work this paper cites.
Noisy binary search and its applications
R. M. Karp and R. Kleinberg · 2007
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
A. Agarwal, P. L. Bartlett, P. Ravikumar, and M. J. Wainwright · 2012
Earlier work this paper cites.
No-regret algorithms for unconstrained online convex optimization
M. Streeter and H. B. McMahan · 2012
Earlier work this paper cites.
Dimension-free exponentiated gradient
F. Orabona · 2013
Earlier work this paper cites.
Unconstrained online linear learning in Hilbert spaces: Minimax algorithms and normal approximations
H. B. McMahan and F. Orabona · 2014
Earlier work this paper cites.
Simultaneous model selection and optimization through parameter-free stochastic learning
F. Orabona · 2014
Earlier work this paper cites.
Coin betting and parameter-free online learning
F. Orabona and D. Pál · 2016
Earlier work this paper cites.
Lower bounds on the oracle complexity of nonsmooth convex optimization via information theory
G. Braun, C. Guzmán, and S. Pokutta · 2017
Earlier work this paper cites.
Online learning without prior information
A. Cutkosky and K. Boahen · 2017
Cited alongside, same era.
A unified approach to adaptive regularization in online and stochastic optimization
V. Gupta, T. Koren, and Y. Singer · 2017
Cited alongside, same era.
A survey of algorithms and analysis for adaptive online learning
H. B. McMahan · 2017
Cited alongside, same era.
Black-box reductions for parameter-free online learning in Banach spaces
A. Cutkosky and F. Orabona · 2018
Cited alongside, same era.
Introductory lectures on stochastic optimization
J. C. Duchi · 2018
Cited alongside, same era.
Artificial constraints and hints for unbounded online learning
A. Cutkosky · 2019
Cited alongside, same era.
A modern introduction to online learning
F. Orabona · 2021
Later among the works it cites.
Parameter-free stochastic optimization of variationally coherent functions
F. Orabona and D. Pál · 2021
Later among the works it cites.
Making SGD parameter-free
Y. Carmon and O. Hinder · 2022
Later among the works it cites.
Optimal and adaptive monteiro-svaiter acceleration
Y. Carmon, D. Hausler, A. Jambulapati, Y. Jin, and A. Sidford · 2022
Later among the works it cites.
Better parameter-free stochastic optimization with ODE updates for coin-betting
K. Chen, J. Langford, and F. Orabona · 2022
Later among the works it cites.
Parameter-free regret in high probability with heavy tails
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Revisiting the Polyak step size
E. Hazan and S. Kakade · 2019
Cited alongside, same era.
UniXGrad: A universal, adaptive algorithm with optimal guarantees for constrained optimization
A. Kavis, K. Y. Levy, F. Bach, and V. Cevher · 2019
Cited alongside, same era.
Lipschitz adaptivity with multiple learning rates in online learning
Z. Mhammedi, W. M. Koolen, and T. Van Erven · 2019
Cited alongside, same era.
Algorithms of robust stochastic optimization based on mirror descent method
A. V. Nazin, A. S. Nemirovsky, A. B. Tsybakov, and A. B. Juditsky · 2019
Cited alongside, same era.
Painless stochastic gradient: Interpolation, line-search, and convergence rates
S. Vaswani, A. Mishkin, I. Laradji, M. Schmidt, G. Gidel, and S. Lacoste-Julien · 2019
Cited alongside, same era.
Stochastic optimization with heavy-tailed noise via accelerated gradient clipping
E. Gorbunov, M. Danilova, and A. Gasnikov · 2020
Cited alongside, same era.
J. Zhang and A. Cutkosky · 2022
Later among the works it cites.
PDE-based optimal strategy for unconstrained online learning
Z. Zhang, A. Cutkosky, and I. Paschalidis · 2022
Later among the works it cites.
DoG is SGD’s best friend: A parameter-free dynamic step size schedule
M. Ivgi, O. Hinder, and Y. Carmon · 2023
Later among the works it cites.
Unconstrained online learning with unbounded losses
A. Jacobsen and A. Cutkosky · 2023
Later among the works it cites.
Prodigy: An expeditiously adaptive parameter-free learner
K. Mishchenko and A. Defazio · 2023
Later among the works it cites.
Improved convergence in high probability of clipped gradient methods with heavy tailed noise
T. D. Nguyen, T. H. Nguyen, A. Ene, and H. Nguyen · 2023
Later among the works it cites.
High-probability bounds for stochastic optimization and variational inequalities: the case of unbounded variance
A. Sadiev, M. Danilova, E. Gorbunov, S. Horváth, G. Gidel, P. Dvurechensky, A. Gasnikov, and P. Richtárik · 2023
Later among the works it cites.
Coin sampling: Gradient-based bayesian inference without learning rates
L. Sharrock and C. Nemeth · 2023
Later among the works it cites.
How free is parameter-free stochastic optimization?
A. Attia and T. Koren · 2024
Closest in time.
Tuning-free stochastic optimization
A. Khaled and C. Jin · 2024
Closest in time.