Microchoice bounds and self bounding learning algorithms

DOI10.1023/A:1022806918936zbMath1027.68109OpenAlexW211569560MaRDI QIDQ1394783

John Langford, Avrim L. 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

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

Related Items (3)

User-friendly Introduction to PAC-Bayes Bounds ⋮ Unnamed Item ⋮ Bitcoin price prediction using machine learning: an approach to sample dimension engineering

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