The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
Open accessAbstract
This paper considers a class of constrained stochastic composite optimization problems whose objective function is given by the summation of a differentiable (possibly nonconvex) component, together with a certain non-differentiable (but convex) component. In order to solve these problems, we propose a randomized stochastic projected gradient (RSPG) algorithm, in which proper mini-batch of samples are taken at each iteration depending on the total budget of stochastic samples allowed. The RSPG algorithm also employs a general distance function to allow taking advantage of the geometry of the feasible region. Complexity of this algorithm is established in a unified setting, which shows nearly optimal complexity of the algorithm for convex stochastic programming. A post-optimization phase is also proposed to significantly reduce the variance of the solutions returned by the algorithm. In addition, based on the RSPG algorithm, a stochastic gradient free algorithm, which only uses the stochastic zeroth-order information, has been also discussed. Some preliminary numerical results are also provided.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
Rockafellar, R. T., & Wets, R. J. B. (1998) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-02431-3 · Cited by 4,086
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114
Robust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Self-citationIntroduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
Spall, J. C. (2003) · Wiley eBooks · doi:10.1002/0471722138 · Cited by 1,890
Acceleration of Stochastic Approximation by Averaging
Polyak, B. T., & Juditsky, A. B. (1992) · SIAM Journal on Control and Optimization · doi:10.1137/0330046 · Cited by 1,827 · cited 2×
“Later, Polyak [28] and Polyak and Juditsky [29] proposed important improvements to the classical SA algorithms, where larger stepsizes were allowed in their methods.”
BackgroundKelton, D. W., Sadowski, R. P., & Sadowski, D. A. (1998) · Cited by 1,542
Problem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
INTRODUCTION TO STOCHASTIC SEARCH AND OPTIMIZATION: ESTIMATION, SIMULATION, AND CONTROL
Nowak, W. (2012) · Medical Entomology and Zoology · Cited by 1,033
Minimizing finite sums with the stochastic average gradient
Schmidt, M., Le Roux, N., & Bach, F. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1030-6 · Cited by 922
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Feature Article: Optimization for simulation: Theory vs. Practice
Fu, M. C. (2002) · INFORMS Journal on Computing · doi:10.1287/ijoc.14.3.192.113 · Cited by 742
Gradient Estimation via Perturbation Analysis
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90124-l · Cited by 692
Online convex optimization in the bandit setting: gradient descent without a gradient
Flaxman, A. D., Kalai, A. T., & McMahan, H. B. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408007 · Cited by 546
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
Self-citationOptimization Techniques for Semi-Supervised Support Vector Machines
Chapelle, O., Sindhwani, V., & Keerthi, S. S. (2008) · MPG.PuRe (Max Planck Society) · doi:10.5555/1390681.1390688 · Cited by 401
Goodfriend, J. H., Rubinstein, R. Y., & Shapiro, A. (1995) · Technometrics · doi:10.1080/00401706.1995.10485910 · Cited by 393
Composite objective mirror descent
Duchi, J. C., Shalev‐Shwartz, S., Singer, Y., & Tewari, A. (2010) · Conference on Learning Theory · Cited by 372
Bregman Monotone Optimization Algorithms
Bauschke, H. H., Borwein, J. M., & Combettes, P. L. (2003) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012902407120 · Cited by 281
Interior Gradient and Proximal Methods for Convex and Conic Optimization
Auslender, A., & Teboulle, M. (2006) · SIAM Journal on Optimization · doi:10.1137/s1052623403427823 · Cited by 269
Ghadimi, S., & Lan, G. (2012) · SIAM Journal on Optimization · doi:10.1137/110848864 · Cited by 269
Self-citationA review of simulation optimization techniques
Andradottir, S. (2002) · 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274) · doi:10.1109/wsc.1998.744910 · Cited by 204
Randomized smoothing for stochastic optimizationPreprint
Duchi, J. C., & Wainwright, M. J. (2016) · Cited by 188
Convergence of Proximal-Like Algorithms
Teboulle, M. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495292130 · Cited by 169
Ghadimi, S., & Lan, G. (2013) · SIAM Journal on Optimization · doi:10.1137/110848876 · Cited by 167
Self-citationThe Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
Ben‐Tal, A., Margalit, T., & Nemirovski, A. S. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623499354564 · Cited by 157
Validation analysis of mirror descent stochastic approximation method
Lan, G., Nemirovski, A. S., & Shapiro, A. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0442-6 · Cited by 153
Self-citationRandom gradient-free minimization of convex functionsPreprint
Nesterov, Y. E. (2011) · RePEc: Research Papers in Economics · Cited by 89
Dang, C. D., & Lan, G. (2014) · Computational Optimization and Applications · doi:10.1007/s10589-014-9673-9 · Cited by 69
Self-citation
Cited by
Recent Advances in Stochastic Gradient Descent in Deep Learning
Tian, Y., Zhang, Y., & Zhang, H. (2023) · Mathematics · doi:10.3390/math11030682 · Cited by 277
Self-citationStochastic Model-Based Minimization of Weakly Convex Functions
Davis, D., & Drusvyatskiy, D. (2019) · SIAM Journal on Optimization · doi:10.1137/18m1178244 · Cited by 258
Large Batch Optimization for Deep Learning: Training BERT in 76 minutes
You, Y., Li, J., Reddi, S., Hseu, J., Kumar, S., Bhojanapalli, S., Song, X., Demmel, J., Keutzer, K., & Hsieh, C.-J. (2019) · arXiv · doi:10.48550/arxiv.1904.00962
Metadata
- Authors
- Ghadimi, S., Lan, G., & Zhang, H.
- Venue
- Mathematical Programming
- Published
- 2014-12-11
- Volume
- 155
- Issue
- 1-2
- Pages
- 267-305
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2029463628
- Cited by
- 376
- References
- 33
- FWCI
- 13.86
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.