the open
    research
    Contribute
    Back to the reading lists

    Machine learning foundations· 1989

    Learnability and the Vapnik-Chervonenkis Dimension

    Anselm Blumer (first author) · 1989

    Read the original

    DOI 10.1145/76359.76371OpenAlex W2154952480

    On the reading lists

    Why it matters

    Connected finite VC dimension to distribution-free learnability and sample complexity.

    Condensed from the expert lists' notes.

    The record

    First released
    1989 (from OpenAlex)
    Citations
    1,820 citations, as counted by OpenAlex (CC0)
    Named by
    both expert lists
    Score
    0.371 · computed rank 423 · consensus 0.78, must-read 0.5, citations percentile 0.25 (1980s · foundations), awards 0, existing lists 0. Method

    Editor's notes

    • Readability check: fail: Dense learning theory; read Valiant 1984 first. (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.