• DOI:10.1214/AOS/1013203451
Corpus ID: 39450643

Greedy function approximation: A gradient boosting machine.

@article{Friedman2001GreedyFA,
  title={Greedy function approximation: A gradient boosting machine.},
  author={J. Friedman},
  journal={Annals of Statistics},
  year={2001},
  volume={29},
  pages={1189-1232}
}

J. Friedman

Published 2001

Mathematics

Annals of Statistics

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… CONTINUE READING

View via Publisher

luthuli.cs.uiuc.edu

Save to Library

Create Alert

Cite

Launch Research Feed