the open
    research
    Contribute
    Back to the reading lists

    Machine learning foundations· 1990

    The Strength of Weak Learnability

    Robert E. Schapire (first author) · 1990

    Read the original

    DOI 10.1007/bf00116037OpenAlex W2093717447

    On the reading lists

    Why it matters

    Proved weak and strong PAC learnability equivalent, establishing the theoretical foundations of boosting.

    Condensed from the expert lists' notes.

    The record

    First released
    1990 (from OpenAlex)
    Citations
    3,427 citations, as counted by OpenAlex (CC0)
    Named by
    both expert lists
    Score
    0.552 · computed rank 189 · consensus 0.87, must-read 1, citations percentile 0.545 (1990s · foundations), awards 0, existing lists 0. Method

    Editor's notes

    • Readability check: pass: Schapire's proof that weak learners can be boosted. (AI draft (Claude), not yet reviewed, 2026-10-29)

    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.