The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Stochastic gradient boosting
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Friedman (2002) has extended this approach further by injecting randomness in the learning process, leading to Stochastic Gradient Boosting.”
From Customer price sensitivities in competitive insurance markets (2022) · cites this paper as Friedman (2002)
In the citing paper
“In addition, some variants of the original boosting algorithm were also developed, such as Adaptive Boosting (AdaBoost) [153] and Stochastic Gradient Boosting (SGBoost) [155].”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [155]
In the citing paper
“MART and XGBoost are respectively a commercial and open source implementation of Friedman's Gradient Boosting Decision Tree (GBDT) algorithm; an ensemble DT algorithm based on gradient boosting [154,155].”
From A comprehensive survey on machine learning for networking: Evolution, applications and research opportunities (2018) · cites this paper as [155]
Citations
Cites
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Self-citationBreiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
Self-citation1 USING ADAPTIVE BAGGING TO DEBIAS REGRESSIONS
Breiman, L. (1999) · Cited by 41
(1996)
Cited by
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939785 · Cited by 54,569
LightGBM: A Highly Efficient Gradient Boosting Decision Tree
(2017) · HAL · Cited by 10,512
A working guide to boosted regression trees
Elith, J., Leathwick, J. R., & Hastie, T. (2008) · Journal of Animal Ecology · doi:10.1111/j.1365-2656.2008.01390.x · Cited by 6,484
Chicco, D., & Jurman, G. (2020) · BMC Genomics · doi:10.1186/s12864-019-6413-7 · Cited by 6,143
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Metadata
- Authors
- Friedman, J. H.
- Affiliations
- SLAC National Accelerator Laboratory (US)
- Corresponding author
- Friedman, Jerome H.
- ORCID
- Friedman, Jerome H.
- Venue
- Computational Statistics & Data Analysis
- Publisher
- Elsevier BV
- Published
- 2002-02
- Volume
- 38
- Issue
- 4
- Pages
- 367-378
- ISSN
- 0167-9473 (ISSN-L)
- OpenAlex
- W2070493638
- Cited by
- 7,067
- References
- 5
- Citations by year
- 2026: 338 · 2025: 591 · 2024: 713 · 2023: 772 · 2022: 745 · 2021: 848 · 2020: 695 · 2019: 513 · 2018: 366 · 2017: 266 · 2016: 220 · 2015: 188 · 2014: 144 · 2013: 137 · 2012: 101
- FWCI
- 17.26
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- Computational Statistics & Data Analysis (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Funders
- National Science Foundation
- U.S. Department of Energy
- Commonwealth Scientific and Industrial Research Organisation
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Keywords
- stochastic gradient boosting, gradient boosting, randomization, subsampling, base learners, overfitting, robustness, additive regression, boosting
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Stochastic gradient boosting. https://app.cochat.ai/papers/10.1016/s0167-9473(01)00065-2
- The paper
- Friedman, J. H. (2002). Stochastic gradient boosting. Computational Statistics & Data Analysis. https://doi.org/10.1016/s0167-9473(01)00065-2
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.