PAC-MDL bounds.

DOI10.1007/B12006MaRDI QIDQ5305862zbMATH OpenOpenAlexFDO

Authors John Langford, Avrim Blum

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12006

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1445318
• Improved bounds on the sample complexity of learning
• The optimal sample complexity of PAC learning
• Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
• PAC-learning from general examples

Cited in

(7)

• Learning the set covering machine by bound minimization and margin-sparsity trade-off
• Speculate-correct error bounds for \(k\)-nearest neighbor classifiers
• On the fusion of threshold classifiers for categorization and dimensionality reduction
• Permutational Rademacher Complexity
• Minimum description length revisited
• Concentration inequalities for samples without replacement
• A geometric modeling of Occam's razor in deep learning

This page was built for publication: PAC-MDL bounds.

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