The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Large-Scale Machine Learning with Stochastic Gradient Descent
Abstract
During the last decade, the data sizes have grown faster than the speed of processors.In this context, the capabilities of statistical machine learning methods is limited by the computing time rather than the sample size.A more precise analysis uncovers qualitatively different tradeoffs for the case of small-scale and large-scale learning problems.The large-scale case involves the computational complexity of the underlying optimization algorithm in non-trivial ways.Unlikely optimization algorithms such as stochastic gradient descent show amazing performance for large-scale problems.In particular, second order stochastic gradient and averaged stochastic gradient are asymptotically efficient after a single pass on the training set.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
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
(1967) · Cited by 23,719
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
WIDROW, B., & HOFF, M. E. (1960) · doi:10.21236/ad0241531 · Cited by 4,009
RCV1: A New Benchmark Collection for Text Categorization Research
Lewis, D., Yang, Y., Rose, T. G., & Li, F. (2004) · Goldsmiths (University of London) · doi:10.5555/1005332.1005345 · Cited by 2,503
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
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
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
Self-citationOptimal aggregation of classifiers in statistical learning
Tsybakov, A. B. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120131 · Cited by 582
SGD-QN: Careful Quasi-Newton Stochastic Gradient Descent
Bordes, A., Bottou, L., & Gallinari, P. (2009) · HAL · Cited by 324
Self-citationAn Ontology for CoNLL-RDF: Formal Data Structures for TSV Formats in Language Technology
Chiarcos, C., Ionov, M., Glaser, L., & Fäth, C. (2000) · arXiv (Cornell University) · doi:10.4230/oasics.ldk.2021.20 · Cited by 322
Trust region Newton methods for large-scale logistic regression
Lin, C.-J., Weng, R. C., & Keerthi, S. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273567 · Cited by 284
Some applications of concentration inequalities to statistics
Massart, P. (2000) · Annales de la Faculté des sciences de Toulouse : Mathématiques · doi:10.5802/afst.961 · Cited by 240
Towards Optimal One Pass Large Scale Learning with Averaged Stochastic Gradient DescentPreprint
Xu, W. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1107.2490 · Cited by 143
On‐line learning for very large data sets
Bottou, L., & LeCun, Y. (2005) · Applied Stochastic Models in Business and Industry · doi:10.1002/asmb.538 · Cited by 116
Self-citationThe importance of convexity in learning with squared loss
Lee, W. S., Bartlett, P. L., & Williamson, R. C. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705577 · Cited by 98
Bousquet, O. (2002) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 80
A Statistical Study of On-line Learning
Murata, N. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511569920.005 · Cited by 57
Cited by
Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing
Zhou, Z., Chen, X., Li, E., Zeng, L., Luo, K., & Zhang, J. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2918951 · Cited by 2,455
A Review of Relational Machine Learning for Knowledge Graphs
Nickel, M., Murphy, K., Tresp, V., & Gabrilovich, E. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2483592 · Cited by 1,638
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A · doi:10.1103/physreva.101.032308 · Cited by 1,057
Jo, T., Nho, K., & Saykin, A. J. (2019) · Frontiers in Aging Neuroscience · doi:10.3389/fnagi.2019.00220 · Cited by 724
Samuel, N., Diskin, T., & Wiesel, A. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2899805 · Cited by 515
Metadata
- Authors
- Bottou, L.
- Venue
- Chapman & Hall/CRC Computer Science & Data Analysis
- Publisher
- Chapman and Hall/CRC
- Published
- 2011-12-19
- Pages
- 17-25
- ISSN
- 2154-4654 (ISSN-L)
- OpenAlex
- W4234117503
- Cited by
- 460
- References
- 21
- FWCI
- 10.85
- Type
- book chapter
- 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.