the open
    research
    Contribute
    Back to the reading lists

    Machine learning foundations· 2001

    Rademacher and Gaussian Complexities: Risk Bounds and Structural Results

    Peter Bartlett (first author) · 2001 · published 2002

    Read the original

    DOI 10.1007/3-540-44581-1_15OpenAlex W2579923771

    On the reading lists

    Why it matters

    Developed influential data-dependent complexity measures for bounding prediction risk.

    Condensed from the expert lists' notes.

    The record

    First released
    2001 (from Crossref)
    Published
    2002
    Citations
    3,399 citations, as counted by Semantic Scholar logoSemantic Scholar (non-commercial licence)
    Named by
    both expert lists
    Score
    0.324 · computed rank 546 · consensus 0.42, must-read 0, citations percentile 0.567 (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), and Semantic Scholar logoSemantic Scholar (used under its non-commercial API licence). Each count names its source. See the method.