Microchoice bounds and self bounding learning algorithms

DOI10.1023/A:1022806918936MaRDI QIDQ1394783zbMATH OpenOpenAlexFDO

Authors John Langford, Avrim Blum

Publication date 25 June 2003

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022806918936

zbMATH Keywords

Occam's razorsample complexityPAC boundsself-bounding algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• A microchoice bound for continuous-space classification algorithms
• Publication:4952633
• Improved bounds on the sample complexity of learning
• Combinatorial bounds for learning performance
• Computable shell decomposition bounds

Cited in

(4)

• User-friendly Introduction to PAC-Bayes Bounds
• Bitcoin price prediction using machine learning: an approach to sample dimension engineering
• scientific article; zbMATH DE number 7626742 (Why is no real title available?)
• A microchoice bound for continuous-space classification algorithms

This page was built for publication: Microchoice bounds and self bounding learning algorithms

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