Making Vapnik–Chervonenkis Bounds Accurate

DOI10.1007/978-3-319-21852-6_9zbMath1336.68211OpenAlexW2308624625MaRDI QIDQ2805721

Léon Bottou

Publication date: 13 May 2016

Published in: Measures of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21852-6_9

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
• Uniform Central Limit Theorems
• An accurate computation of the hypergeometric distribution function
• Structural risk minimization over data-dependent hierarchies
• Unnamed Item
• Unnamed Item

This page was built for publication: Making Vapnik–Chervonenkis Bounds Accurate