The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Sample size selection in optimization methods for machine learning
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 Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
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
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
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×
“Stochastic gradient algorithms, such as the Robbins–Monro method [27], its averaging variant proposed by Polyak and Juditsky [25], and Nesterov’s dual averaging method [23], have both low computational costs and fast learning rates, and have found a great deal of success in solving large-scale machine learning problem…”
MethodHogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Niu, F., Recht, B., Re, C., & Wright, S. J. (2011) · arXiv · doi:10.48550/arxiv.1106.5730 · Cited by 1,211 · cited 1×
“These methods must, however, perform a vast number of iterations before an appreciable improvement in the objective is obtained, and due to the sequential nature of these iterations, it can be difficult to parallelize them; see [1,10,24] and the references”
MethodThe conjugate gradient method in extremal problems
Polyak, B. T. (1969) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(69)90035-4 · Cited by 1,164
The Tradeoffs of Large-Scale Learning
Bottou, L., & Bousquet, O. (2011) · Optimization for Machine Learning · doi:10.7551/mitpress/8996.003.0015 · Cited by 1,128
Conn, A. R., Gould, N. I. M., & Toint, P. (1991) · SIAM Journal on Numerical Analysis · doi:10.1137/0728030 · Cited by 873
Primal-dual subgradient methods for convex problems
Nesterov, Y. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0149-x · Cited by 835
Deep learning via Hessian-free optimization
Martens, J. (2010) · International Conference on Machine Learning · Cited by 732
Efficient Online and Batch Learning Using Forward Backward Splitting
Duchi, J. C., & Singer, Y. (2009) · Journal of Machine Learning Research · Cited by 687
On the Goldstein-Levitin-Polyak gradient projection method
Bertsekas, D. P. (1976) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1976.1101194 · Cited by 583
Dual Averaging Method for Regularized Stochastic Learning and Online Optimization
Xiao, L. (2009) · Cited by 574
Optimal Distributed Online Prediction using Mini-Batches
Dekel, O., Gilad-Bachrach, R., Shamir, O., & Xiao, L. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.1367 · Cited by 512
Scalable training of L1-regularized log-linear models
Andrew, G., & Gao, J. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273501 · Cited by 506
Composite objective mirror descent
Duchi, J. C., Shalev‐Shwartz, S., Singer, Y., & Tewari, A. (2010) · Conference on Learning Theory · Cited by 372
A simulation-based approach to two-stage stochastic programming with recourse
Shapiro, A., & Homem‐de‐Mello, T. (1998) · Mathematical Programming · doi:10.1007/bf01580086 · Cited by 338
Newton's Method for Large Bound-Constrained Optimization Problems
Lin, C., & Morè, J. J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623498345075 · Cited by 322
Hybrid deterministic-stochastic methods for data fitting
Friedlander, M. P., & Schmidt, M. (2011) · Cited by 314
Accelerated training of conditional random fields with stochastic gradient methods
Vishwanathan, S. V. N., Schraudolph, N. N., Schmidt, M. W., & Murphy, K. P. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143966 · Cited by 278
On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
Shapiro, A., & Homem‐de‐Mello, T. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623498349541 · Cited by 250
Distributed delayed stochastic optimization
Agarwal, A., & Duchi, J. C. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426626 · Cited by 243
On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning
Byrd, R. H., Chin, G. M., Neveitt, W., & Nocedal, J. (2011) · SIAM Journal on Optimization · doi:10.1137/10079923x · Cited by 242
Self-citation
Cited by
TensorFlow: A system for large-scale machine learning
Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.08695 · Cited by 11,822
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
Self-citationEfficient mini-batch training for stochastic optimization
Li, M., Zhang, T., Chen, Y., & Smola, A. J. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623612 · Cited by 742
Solving inverse problems using data-driven models
Arridge, S., Maass, P., Öktem, O., & Schönlieb, C.-B. (2019) · Acta Numerica · doi:10.1017/s0962492919000059 · Cited by 686
Advances in Variational Inference
Zhang, C., Butepage, J., Kjellstrom, H., & Mandt, S. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2889774 · Cited by 671
Metadata
- Authors
- Byrd, R. H., Chin, G. M., Nocedal, J., & Wu, Y.
- Venue
- Mathematical Programming
- Published
- 2012-06-24
- Volume
- 134
- Issue
- 1
- Pages
- 127-155
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2061570747
- Cited by
- 369
- References
- 27
- FWCI
- 14.25
- 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.