The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Robust Stochastic Approximation Approach to Stochastic Programming
Abstract
In this paper we consider optimization problems where the objective function is given in a form of the expectation. A basic difficulty of solving such stochastic optimization problems is that the involved multidimensional integrals (expectations) cannot be computed with high accuracy. The aim of this paper is to compare two computational approaches based on Monte Carlo sampling techniques, namely, the stochastic approximation (SA) and the sample average approximation (SAA) methods. Both approaches, the SA and SAA methods, have a long history. Current opinion is that the SAA method can efficiently use a specific (say, linear) structure of the considered problem, while the SA approach is a crude subgradient method, which often performs poorly in practice. We intend to demonstrate that a properly modified SA approach can be competitive and even significantly outperform the SAA method for a certain class of convex stochastic problems. We extend the analysis to the case of convex-concave stochastic saddle point problems and present (in our opinion highly encouraging) results of numerical experiments.
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
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
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
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
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
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
Self-citationProblem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
The Existence of Probability Measures with Given Marginals
Strassen, V. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700153 · Cited by 1,301
Weighted sums of certain dependent random variables
Azuma, K. (1967) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178243286 · Cited by 1,084
INTRODUCTION TO STOCHASTIC SEARCH AND OPTIMIZATION: ESTIMATION, SIMULATION, AND CONTROL
Nowak, W. (2012) · Medical Entomology and Zoology · Cited by 1,033
Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10006-0 · Cited by 916
Self-citationPrimal-dual subgradient methods for convex problems
Nesterov, Y. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0149-x · Cited by 835
Monte Carlo bounding techniques for determining solution quality in stochastic programs
Mak, W.-K., Morton, D. P., & Wood, R. K. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(98)00054-6 · Cited by 704
Verweij, B., Ahmed, S., Kleywegt, A. J., Nemhauser, G. L., & Shapiro, A. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021814225969 · Cited by 494
Self-citationThe empirical behavior of sampling methods for stochastic programming
Linderoth, J., Shapiro, A., & Wright, S. (2006) · Annals of Operations Research · doi:10.1007/s10479-006-6169-8 · Cited by 425
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
stochastic quasigradient methods and their application to system optimization†
Ermoliev, Y. (1983) · Stochastics · doi:10.1080/17442508308833246 · Cited by 280
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
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
A sublinear-time randomized approximation algorithm for matrix games
Grigoriadis, M. D., & Khachiyan, L. G. (1995) · Operations Research Letters · doi:10.1016/0167-6377(95)00032-0 · Cited by 128
Non-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
Self-citationRecursive 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
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
(2010) · Cited by 8,261
Optimization Methods for Large-Scale Machine Learning
Bottou, L., Curtis, F. E., & Nocedal, J. (2018) · SIAM Review · doi:10.1137/16m1080173 · Cited by 3,128
(2015) · Cited by 2,857
Federated Optimization: Distributed Machine Learning for On-Device Intelligence
Konečný, J., McMahan, H. B., Ramage, D., & Richtárik, P. (2016) · arXiv · doi:10.48550/arxiv.1610.02527 · Cited by 1,563
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986276 · Cited by 1,404
Metadata
- Authors
- Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A.
- Venue
- SIAM Journal on Optimization
- Published
- 2009-01
- Volume
- 19
- Issue
- 4
- Pages
- 1574-1609
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1992208280
- Cited by
- 1,945
- References
- 26
- FWCI
- 53.85
- 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.