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} }
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
Figures and Tables from this paper
Paper Mentions
News Article
Blog Post
9,851 Citations
A Fast Sampling Gradient Tree Boosting Framework
- Computer Science, Mathematics
- ArXiv
- 2019
- Highly Influenced
- PDF
Robust boosting for regression problems
- Computer Science, Mathematics
- Comput. Stat. Data Anal.
- 2021
- Highly Influenced
- PDF
BOOSTING ALGORITHMS: REGULARIZATION, PREDICTION AND MODEL FITTING
- Mathematics
- 2007
- 741
- Highly Influenced
- PDF
Special Invited Paper-Additive logistic regression: A statistical view of boosting
- Mathematics
- 2000
- 4,090
- PDF
Gradient and Newton Boosting for Classification and Regression
- Computer Science, Mathematics
- Expert Syst. Appl.
- 2021
- 13
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 32 REFERENCES
Improved Boosting Algorithms using Confidence-Rated Predictions
- Mathematics, Computer Science
- COLT
- 1998
- 2,055
- Highly Influential
- PDF
Prediction Games and Arcing Algorithms
- Mathematics, Computer Science
- Neural Computation
- 1999
- 518
- Highly Influential
- PDF
Learning representations by back-propagating errors
- Computer Science
- Nature
- 1986
- 16,999
- Highly Influential
- PDF