The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
Abstract
In this paper we present a generic algorithmic framework, namely, the accelerated stochastic approximation (AC-SA) algorithm, for solving strongly convex stochastic composite optimization (SCO) problems. While the classical stochastic approximation algorithms are asymptotically optimal for solving differentiable and strongly convex problems, the AC-SA algorithm, when employed with proper stepsize policies, can achieve optimal or nearly optimal rates of convergence for solving different classes of SCO problems during a given number of iterations. Moreover, we investigate these AC-SA algorithms in more detail, such as by establishing the large-deviation results associated with the convergence rates and introducing an efficient validation procedure to check the accuracy of the generated solutions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Distance Metric Learning with Application to Clustering with Side-Information
Xing, E. P., Jordan, M. I., Russell, S., & Ng, A. Y. (2002) · Cited by 2,700
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
The Sample Average Approximation Method for Stochastic Discrete Optimization
Kleywegt, A. J., Shapiro, A., & Homem-de-Mello, T. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499363220 · Cited by 1,983
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
Pegasos: primal estimated sub-gradient solver for SVM
Shalev-Shwartz, S., Singer, Y., Srebro, N., & Cotter, A. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0420-4 · Cited by 1,477
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
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273598 · Cited by 973
Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10006-0 · Cited by 916
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
A method for unconstrained convex minimization problem with the rate of convergence o(1/k^2)
Nesterov, Y. E. (1983) · Medical Entomology and Zoology · Cited by 865
Primal-dual subgradient methods for convex problems
Nesterov, Y. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0149-x · Cited by 835
Robust linear programming discrimination of two linearly inseparable sets
Bennett, K. P., & Mangasarian, O. L. (1992) · Optimization Methods and Software · doi:10.1080/10556789208805504 · Cited by 780
Nordhausen, K. (2009) · International Statistical Review · doi:10.1111/j.1751-5823.2009.00095_18.x · Cited by 637
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
Self-citationAsymptotic Distribution of Stochastic Approximation Procedures
Sacks, J. (1958) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706619 · Cited by 368
On a Stochastic Approximation Method
Chung, K. L. (1954) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728716 · Cited by 363
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
stochastic quasigradient methods and their application to system optimization†
Ermoliev, Y. (1983) · Stochastics · doi:10.1080/17442508308833246 · Cited by 280
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
Optimization of Stochastic Models
Pflug, G. C. (1996) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1449-3 · Cited by 259
Proximal Minimization Methods with Generalized Bregman Functions
Kiwiel, K. C. (1997) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012995281742 · Cited by 236
Optimization of Stochastic Models: The Interface Between Simulation and Optimization
Orman, A. J., & Pflug, G. C. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600016 · Cited by 214
Convergence of Proximal-Like Algorithms
Teboulle, M. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495292130 · Cited by 169
A proximal method for composite minimization
Lewis, A. S., & Wright, S. J. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0943-9 · Cited by 167
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
Accelerated Gradient Methods for Stochastic Optimization and Online Learning
Hu, C., Pan, W., & Kwok, J. T.-Y. (2009) · Cited by 140
Juditsky, A., Rigollet, P., & Tsybakov, A. B. (2008) · The Annals of Statistics · doi:10.1214/07-aos546 · Cited by 139
Smale, S., & Yao, Y. (2005) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0160-z · Cited by 137
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 121
Self-citationNon-euclidean restricted memory level method for large-scale convex optimization
Ben‐Tal, A., & Nemirovski, A. S. (2004) · Mathematical Programming · doi:10.1007/s10107-004-0553-4 · Cited by 100
Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging
Juditsky, A., Nazin, A., Tsybakov, A. B., & Vayatis, N. (2005) · Problems of Information Transmission · doi:10.1007/s11122-006-0005-2 · Cited by 77
Dang, C. D., & Lan, G. (2014) · Computational Optimization and Applications · doi:10.1007/s10589-014-9673-9 · Cited by 69
Self-citationRuszczyński, A., & Syski, W. (1986) · Mathematical programming studies · doi:10.1007/bfb0121128 · Cited by 42
Nonstationary stochastic programming problems
Gaivoronskii, A. A. (1979) · Cybernetics and Systems Analysis · doi:10.1007/bf01069841 · Cited by 38
Cited by
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
Ghadimi, S., & Lan, G. (2013) · SIAM Journal on Optimization · doi:10.1137/120880811 · Cited by 1,034
Self-citationAccelerated gradient methods for nonconvex nonlinear and stochastic programming
Ghadimi, S., & Lan, G. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0871-8 · Cited by 487
Self-citationA Stochastic Gradient Method with an Exponential Convergence Rate for Finite Training Sets
Roux, N. L., Schmidt, M., & Bach, F. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.6258 · Cited by 481
First-order methods of smooth convex optimization with inexact oracle
Devolder, O., Glineur, F., & Nesterov, Y. (2014) · Mathematical Programming · doi:10.1007/s10107-013-0677-5 · Cited by 422
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
Ghadimi, S., Lan, G., & Zhang, H. (2016) · Mathematical Programming · doi:10.1007/s10107-014-0846-1 · Cited by 376
Self-citation
Metadata
- Authors
- Ghadimi, S., & Lan, G.
- Venue
- SIAM Journal on Optimization
- Published
- 2012-01
- Volume
- 22
- Issue
- 4
- Pages
- 1469-1492
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2045744861
- Cited by
- 269
- References
- 43
- FWCI
- 14.88
- Type
- journal article
- Language
- en
- Open access
- closed
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.