Researches on Rademacher complexities in statistical learning theory: a survey

DOI10.16383/J.AAS.2017.C160149MaRDI QIDQ5367550zbMATH OpenWikidataFDO

Authors Xinxing Wu, Junping Zhang

Publication date 20 October 2017

Full work available at URL https://doi.org/10.16383/J.AAS.2017.C160149

zbMATH Keywords

generalization boundsmachine learningRademacher complexitiesstatistical learning theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• VC dimension, fat-shattering dimension, Rademacher averages, and their applications
• Statistical learning theory: models, concepts, and results
• Local Rademacher complexities
• scientific article; zbMATH DE number 1804106
• 10.1162/153244303321897690

Cited in

(7)

• VC dimension, fat-shattering dimension, Rademacher averages, and their applications
• Permutational Rademacher Complexity
• Rademacher Chaos Complexities for Learning the Kernel Problem
• Rademacher complexity and grammar induction algorithms: what it may (not) tell us
• scientific article; zbMATH DE number 5588603 (Why is no real title available?)
• Transductive Rademacher Complexity and Its Applications
• Rademacher Margin Complexity

This page was built for publication: Researches on Rademacher complexities in statistical learning theory: a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367550)