Fetching the paper…
Reading the bibliography…
We study local complexity measures for stochastic convex optimization problems, providing a local minimax theory analogous to that of H\'{a}jek and Le Cam for classical statistical problems.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Efficient nonparametric testing and estimation
C. Stein · 1956
Earlier work this paper cites.
A general class of coefficients of divergence of one distribution from another
S. M. Ali and S. D. Silvey · 1966
Earlier work this paper cites.
Information-type measures of difference of probability distributions and indirect observation
I. Csiszár · 1967
Earlier work this paper cites.
An extension of the Robbins-Monro procedure
J. H. Venter · 1967
Earlier work this paper cites.
On the stochastic quasi-gradient method and stochastic quasi-Feyer sequences
Y. Ermoliev · 1969
Earlier work this paper cites.
Convex Analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
A convergence theorem for non-negative almost supermartingales and some applications
H. Robbins and D. Siegmund · 1971
Earlier work this paper cites.
Asymptotically efficient stochastic approximation; the RM case
V. Fabian · 1973
Earlier work this paper cites.
Stochastic approximation algorithms for constrained optimization problems
H. J. Kushner · 1974
Earlier work this paper cites.
Statistical Estimation: Asymptotic Theory
I. A. Ibragimov and R. Z. Has’minskii · 1981
Earlier work this paper cites.
Approximation dans les espaces métriques et théorie de l’estimation
L. Birgé · 1983
Earlier work this paper cites.
Stochastic quasigradient methods and their application to system optimization
Y. Ermoliev · 1983
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Stochastic iteration for a constrained optimization problem
H. Walk · 1983
Earlier work this paper cites.
Probability and Measure
P. Billingsley · 1986
Earlier work this paper cites.
Geometrizing rates of convergence I
D. L. Donoho and R. C. Liu · 1987
Earlier work this paper cites.
Sensitivity analysis of nonlinear programs and differentiability properties of metric projections
A. Shapiro · 1988
Earlier work this paper cites.
Asymptotic properties of statistical estimators in stochastic programming
A. Shapiro · 1989
Earlier work this paper cites.
Empirical likelihood ratio confidence regions
A. Owen · 1990
Earlier work this paper cites.
Matrix Perturbation Theory
G. W. Stewart and J.-G. Sun · 1990
Earlier work this paper cites.
Geometrizing rates of convergence II
D. L. Donoho and R. C. Liu · 1991
Cited alongside, same era.
Acceleration of stochastic approximation by averaging
B. T. Polyak and A. B. Juditsky · 1992
Cited alongside, same era.
Convex Analysis and Minimization Algorithms I & II
J. Hiriart-Urruty and C. Lemaréchal · 1993
Cited alongside, same era.
Identifiable surfaces in constrained optimization
S. J. Wright · 1993
Cited alongside, same era.
Exposing constraints
J. Burke and J. Moré · 1994
Cited alongside, same era.
Weak Convergence and Empirical Processes: With Applications to Statistics
A. W. van der Vaart and J. A. Wellner · 1996
Cited alongside, same era.
Superefficiency
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Later among the works it cites.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Later among the works it cites.
Lectures on Stochastic Programming: Modeling and Theory
A. Shapiro, D. Dentcheva, and A. Ruszczyński · 2009
Later among the works it cites.
Dual averaging methods for regularized stochastic learning and online optimization
L. Xiao · 2010
Later among the works it cites.
Adaptive subgradient methods for online learning and stochastic optimization
J. C. Duchi, E. Hazan, and Y. Singer · 2011
Later among the works it cites.
Information-theoretic lower bounds on the oracle complexity of convex optimization
A. Agarwal, P. L. Bartlett, P. Ravikumar, and M. J. Wainwright · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. W. van der Vaart · 1997
Cited alongside, same era.
Efficient and Adaptive Estimation for Semiparametric Models
P. Bickel, C. A. J. Klaassen, Y. Ritov, and J. Wellner · 1998
Cited alongside, same era.
Optimization problems with perturbations: A guided tour
J. F. Bonnans and A. Shapiro · 1998
Cited alongside, same era.
Tilt stability of a local minimum
R. A. Poliquin and R. T. Rockafellar · 1998
Cited alongside, same era.
Asymptotic Statistics
A. W. van der Vaart · 1998
Cited alongside, same era.
Asymptotics in Statistics: Some Basic Concepts
L. Le Cam and G. L. Yang · 2000
Cited alongside, same era.
Later among the works it cites.
A stochastic gradient method with an exponential convergence rate for finite training sets
N. Le Roux, M. Schmidt, and F. Bach · 2012
Later among the works it cites.
Manifold identification in dual averaging for regularized stochastic online learning
S. Lee and S. J. Wright · 2012
Later among the works it cites.
Stochastic gradient descent on Riemannian manifolds
S. Bonnabel · 2013
Later among the works it cites.
Tilt stability, uniform quadratic growth, and strong metric regularity of the subdifferential
D. Drusvyatskiy and A. Lewis · 2013
Later among the works it cites.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Later among the works it cites.
Optimization and estimation on manifolds
N. Boumal · 2014
Later among the works it cites.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Later among the works it cites.
Implicit Functions and Solution Mappings: A View from Variational Analysis
A. L. Dontchev and R. T. Rockafellar · 2014
Later among the works it cites.
Asynchronous stochastic convex optimization
J. C. Duchi, S. Chaturapruek, and C. Ré · 2015
Later among the works it cites.
A universal catalyst for first-order optimization
H. Lin, J. Mairal, and Z. Harchaoui · 2015
Later among the works it cites.
Lecture notes on probability theory: Stanford statistics 310
A. Dembo · 2016
Closest in time.
Local minimax complexity of stochastic convex optimization
Y. Zhu, S. Chatterjee, J. Duchi, and J. Lafferty · 2016
Closest in time.
Stochastic cubic regularization for fast nonconvex optimization
N. Tripuraneni, M. Stern, C. Jin, J. Regier, and M. I. Jordan · 2017
Closest in time.
Stochastic (approximate) proximal point methods: Convergence, optimality, and adaptivity
H. Asi and J. C. Duchi · 2018
Closest in time.