Greedy function approximation: A gradient boosting machine
The DOI matches its Crossref record; 25 of the 26 references it cites were found in a registry or an index.
Abstract
Function estimation/approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest-descent minimization. A general gradient descent “boosting” paradigm is developed for additive expansions based on any fitting criterion.Specific algorithms are presented for least-squares, least absolute deviation, and Huber-M loss functions for regression, and multiclass logistic likelihood for classification. Special enhancements are derived for the particular case where the individual additive components are regression trees, and tools for interpreting such “TreeBoost” models are presented. Gradient boosting of regression trees produces competitive, highly robust, interpretable procedures for both regression and classification, especially appropriate for mining less than clean data. Connections between this approach and the boosting methods of Freund and Shapire and Friedman, Hastie and Tibshirani are discussed.
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 (2001) has therefore introduced Gradient Boosting to allow for an arbitrary differentiable loss function and to include a shrinkage parameter in the boosting algorithm.”
From Customer price sensitivities in competitive insurance markets (2022) · cites this paper as Friedman (2001)
In the citing paper
“Furthermore, formula (2.3) using the special choice P ∗ ( d ) = P ( d ) corresponds precisely to the partial dependence plot (PDP) introduced by Friedman (2001), see also Zhao and Hastie (2021).”
From Discrimination-Free Insurance Pricing (2022) · cites this paper as Friedman (2001)
In the citing paper
“The algorithm is constructed such that the new base learners are maximally correlated with the negative gradient of the loss function (e.g., squared-error loss, Adaboost) of the whole ensemble (Friedman 2001).”
From Modelling Motor Insurance Claim Frequency and Severity Using Gradient Boosting (2023) · cites this paper as Friedman 2001
In the citing paper
“Friedman et al. (2000) andFriedman (2001) extend boosting to contexts beyond classification, eventually leading to the gradient boosted regression tree.”
From Empirical Asset Pricing via Machine Learning (2020) · cites this paper as Friedman (2001)
In the citing paper
“These non-linear models encompass non-parametric (KNN), kernel-based (KRR, SVR and GP) and tree-ensemble (RFR, XGB and ETR) approaches, enabling a comprehensive comparison34,35,47.”
From Data-driven de novo design of super-adhesive hydrogels (2025) · cites this paper as [35]
3 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892 · cited 1×
“Such expansions (2) are at the heart of many function approximation methods such as neural networks (Rumelhart, Hinton, and Williams 1986), radial basis functions (Powell CSIRO CMIS, Locked Bag 17, North Ryde NSW 1670; jhf@stat.stanford.edu 1987), MARS (Friedman 1991), wavelets (Donoho 1993), and…”
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Self-citationClassification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Self-citationMatching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Brown, R. A., Hastie, T. J., & Tibshirani, R. J. (1991) · Biometrics · doi:10.2307/2532174 · Cited by 8,176
Multivariate Adaptive Regression Splines
Friedman, J. H. (1991) · The Annals of Statistics · doi:10.1214/aos/1176347963 · Cited by 8,000
Self-citationRobust estimation of a location parameter
Huber, P. J. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703732 · Cited by 7,228
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 1×
“This permits the replacement of the di cult minimization problem (9) by least{squares minimization (11).”
Self-citationPattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
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
“Our system implements gradient boosting [10], which performs additive optimization in functional space.”
MethodData mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
LightGBM: A Highly Efficient Gradient Boosting Decision Tree
(2017) · HAL · Cited by 10,512
The global distribution and burden of dengue
Bhatt, S., Gething, P. W., Brady, O. J., Messina, J. P., Farlow, A. W., Moyes, C. L., Drake, J. M., Brownstein, J. S., Hoen, A. G., Sankoh, O., et al. (2013) · Nature · doi:10.1038/nature12060 · Cited by 10,037
“India19,20 alone contributed 34% (33 [24-44] million infections) of the global total.”
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
“The Stagewise procedure is related to boosting and also to Friedman’s MART algorithm (Friedman 2001); see Section 8, as well as Chapter 10 and Algorithm 10.”
Influential
Metadata
- Authors
- Friedman, J. H.
- Affiliations
- Stanford University (US)
- Corresponding author
- Friedman, Jerome H.
- ORCID
- Friedman, Jerome H.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2001-10-01
- Volume
- 29
- Issue
- 5
- Pages
- 1189-1232
- ISSN
- 0090-5364 (ISSN-L)
- 2168-8966
- OpenAlex
- W1678356000
- Cited by
- 30,731
- References
- 26
- Citations by year
- 2026: 4476 · 2025: 4330 · 2024: 3729 · 2023: 3240 · 2022: 2945 · 2021: 2949 · 2020: 2403 · 2019: 1755 · 2018: 1153 · 2017: 759 · 2016: 527 · 2015: 477 · 2014: 361 · 2013: 298 · 2012: 248
- FWCI
- 48.08
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- The Annals of Statistics (publishedVersion)
- Project Euclid (Cornell University) (submittedVersion)
- Funders
- National Science Foundation (DE-AC03- 76SF00515, DMS-97-64431)
- U.S. Department of Energy (DE-AC03-76SF00515, DE-AC03-?, 76SF00515)
- Commonwealth Scientific and Industrial Research Organisation
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Imbalanced Data Classification Techniques
- Keywords
- gradient boosting, gradient descent, regression trees, least absolute deviation, Huber loss, logistic regression, classification, robust regression, interpretable models, noisy data, 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: Greedy function approximation: A gradient boosting machine. https://app.cochat.ai/papers/10.1214/aos/1013203451
- The paper
- Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. The Annals of Statistics. https://doi.org/10.1214/aos/1013203451
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.