Fetching the paper…
Reading the bibliography…
Stochastic and adversarial data are two widely studied settings in online learning.
A modern introduction to online learning
Orabona, F. (2021) · 1912
Earlier work this paper cites.
A stochastic approximation method
Robbins, H. and Monro, S. (1951) · 1951
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Nemirovsky, A. and Yudin, D. (1985) · 1985
Earlier work this paper cites.
Acceleration of stochastic approximation by averaging
Polyak, B. T. and Juditsky, A. B. (1992) · 1992
Earlier work this paper cites.
Best-fit bin-packing with random order
Kenyon, C. (1997) · 1997
Earlier work this paper cites.
On the generalization ability of online learning algorithms
Cesa-Bianchi, N., Conconi, A., and Gentile, C. (2002) · 2002
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Zinkevich, M. (2003) · 2003
Earlier work this paper cites.
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A. and Teng, S.-H. (2004) · 2004
Earlier work this paper cites.
Prox-method with rate of convergence o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Nemirovski, A. (2005) · 2005
Earlier work this paper cites.
Extracting certainty from uncertainty: regret bounded by variation in costs
Hazan, E. and Kale, S. (2010) · 2010
Earlier work this paper cites.
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
Hazan, E. and Kale, S. (2011) · 2011
Earlier work this paper cites.
Follow-the-regularized-leader and mirror descent: Equivalence theorems and l1 regularization
McMahan, B. (2011) · 2011
Earlier work this paper cites.
Online learning: stochastic, constrained, and smoothed adversaries
Rakhlin, A., Sridharan, K., and Tewari, A. (2011) · 2011
Cited alongside, same era.
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
Agarwal, A., Bartlett, P. L., Ravikumar, P., and Wainwright, M. J. (2012) · 2012
Cited alongside, same era.
Online optimization with gradual variations
Chiang, C.-K., Yang, T., Lee, C.-J., Mahdavi, M., Lu, C.-J., Jin, R., and Zhu, S. (2012) · 2012
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework
Ghadimi, S. and Lan, G. (2012) · 2012
Cited alongside, same era.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
Ghadimi, S. and Lan, G. (2013) · 2013
Cited alongside, same era.
Scale-free online learning
Orabona, F. and Pál, D. (2018) · 2018
Later among the works it cites.
Anytime online-to-batch, optimism and acceleration
Cutkosky, A. (2019) · 2019
Later among the works it cites.
An optimal algorithm for stochastic and adversarial bandits
Zimmert, J. and Seldin, Y. (2019) · 2019
Later among the works it cites.
Prediction with corrupted expert advice
Amir, I., Attias, I., Koren, T., Mansour, Y., and Livni, R. (2020) · 2020
Later among the works it cites.
Online convex optimization in the random order model
Garber, D., Korcia, G., and Levy, K. (2020) · 2020
Later among the works it cites.
A simpler approach to accelerated optimization: iterative averaging meets optimism
Joulani, P., Raj, A., Gyorgy, A., and Szepesvári, C. (2020) · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yang, T., Mahdavi, M., Jin, R., and Zhu, S. (2013) · 2013
Cited alongside, same era.
One practical algorithm for both stochastic and adversarial bandits
Seldin, Y. and Slivkins, A. (2014) · 2014
Cited alongside, same era.
Lectures on Stochastic Programming: Modeling and Theory, Second Edition
Shapiro, A., Dentcheva, D., and Ruszczynski, A. (2014) · 2014
Cited alongside, same era.
Introduction to online convex optimization
Hazan, E. (2016) · 2016
Cited alongside, same era.
A modular analysis of adaptive (non-) convex optimization: Optimism, composite objectives, and variational bounds
Joulani, P., György, A., and Szepesvári, C. (2017) · 2017
Cited alongside, same era.
Accelerating stochastic gradient descent for least squares regression
Jain, P., Kakade, S. M., Kidambi, R., Netrapalli, P., and Sidford, A. (2018) · 2018
Cited alongside, same era.
Online learning with predictable sequences
Rakhlin, A. and Sridharan, K. (2013a)
Cited in the paper.
Dynamic regret of convex and smooth functions
Zhao, P., Zhang, Y.-J., Zhang, L., and Zhou, Z.-H. (2020) · 2020
Later among the works it cites.
Smoothed analysis with adaptive adversaries
Haghtalab, N., Roughgarden, T., and Shetty, A. (2022) · 2021
Later among the works it cites.
On optimal robustness to adversarial corruption in online decision problems
Ito, S. (2021) · 2021
Later among the works it cites.
Optimal rates for random order online optimization
Sherman, U., Koren, T., and Mansour, Y. (2021) · 2021
Later among the works it cites.
Adaptivity and non-stationarity: Problem-dependent dynamic regret for online convex optimization
Zhao, P., Zhang, Y.-J., Zhang, L., and Zhou, Z.-H. (2021) · 2021
Later among the works it cites.