the open
    research
    Contribute
    Back to the reading lists

    Machine learning foundations· 2001

    Greedy Function Approximation: A Gradient Boosting Machine

    Jerome Friedman (first author) · 2001

    Read the original

    DOI 10.1214/aos/1013203451OpenAlex W1678356000

    On the reading lists

    Why it matters

    Formulated gradient boosting as functional optimization, underpinning modern boosted-tree systems.

    Condensed from the expert lists' notes.

    The record

    First released
    2001 (from OpenAlex)
    Citations
    30,481 citations, as counted by OpenAlex (CC0)
    Named by
    the chatgpt list only
    Score
    0.509 · computed rank 230 · consensus 0.44, must-read 0.5, citations percentile 0.933 (2000s · foundations), awards 0, existing lists 0. Method

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.