Jerome H. Friedman
Stanford University
1 paper in the Anchorcite directory, published in 2001, cited 30,810 times in total.
ORCID profileResearch topics
- Neural Networks and Applications · 1 paper
- Machine Learning and Algorithms · 1 paper
- Model Reduction and Neural Networks · 1 paper
Papers
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics · 2001 · 30,810 citations
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…
Metadata from OpenAlex (CC0).