Journal article · 2001

Greedy function approximation: A gradient boosting machine.

Jerome H. Friedman

The Annals of Statistics, 29(5), 1189–1232 · Published 1 October 2001 · DOI 10.1214/aos/1013203451

View at the publisherCite this paper

In brief

“Greedy function approximation: A gradient boosting machine.” is a 2001 journal article by Jerome H. Friedman, published in The Annals of Statistics. OpenAlex counts 32,984 citations as of 16 November 2026, which puts it in the top 1% of works published in 2001 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
32,984
Most cited in
2026 (6,025)
Field-weighted impact
43.32
References
26
Authors
1

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… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. The Annals of Statistics, 29(5), 1189–1232. https://doi.org/10.1214/aos/1013203451

MLA 9

Friedman, Jerome H. “Greedy function approximation: A gradient boosting machine.” The Annals of Statistics, vol. 29, no. 5, 2001, pp. 1189–1232. https://doi.org/10.1214/aos/1013203451.

Chicago

Friedman, Jerome H. 2001. “Greedy function approximation: A gradient boosting machine.” The Annals of Statistics 29 (5): 1189–1232. https://doi.org/10.1214/aos/1013203451.

Harvard

Friedman, J. H. (2001) ‘Greedy function approximation: A gradient boosting machine.’, The Annals of Statistics, 29(5), pp. 1189–1232. doi:10.1214/aos/1013203451.

IEEE

J. H. Friedman, “Greedy function approximation: A gradient boosting machine.,” The Annals of Statistics, vol. 29, no. 5, pp. 1189–1232, 2001, doi: 10.1214/aos/1013203451.

BibTeX

@article{friedman2001greedy,
  title     = {{Greedy function approximation: A gradient boosting machine.}},
  author    = {Friedman, Jerome H.},
  journal   = {The Annals of Statistics},
  year      = {2001},
  volume    = {29},
  number    = {5},
  pages     = {1189--1232},
  doi       = {10.1214/aos/1013203451},
  url       = {https://doi.org/10.1214/aos/1013203451}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
2017759759
20181,1511151
20191,7451745
20202,4142414
20212,9432943
20223,0143014
20233,3113311
20243,9533953
20254,6904690
20266,0256025

Its field-weighted citation impact is 43.32: it has been cited 43.32 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference

  • gradient boosting
  • gradient descent
  • regression trees
  • least absolute deviation
  • Huber loss
  • logistic regression
  • classification
  • robust regression

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. The Annals of Statistics, 29(5), 1189–1232. https://doi.org/10.1214/aos/1013203451

How many times has this paper been cited?

32,984 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Jerome H. Friedman.

What is the DOI of this paper?

10.1214/aos/1013203451. The permanent link is https://doi.org/10.1214/aos/1013203451.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.