Bounding Embeddings of VC Classes into Maximum Classes

DOI10.1007/978-3-319-21852-6_21zbMath1357.68182arXiv1401.7388OpenAlexW2963945525MaRDI QIDQ2805735

Bartlett, Peter L., Benjamin I. P. Rubinstein, Joachim Hyam Rubinstein

Publication date: 13 May 2016

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

Full work available at URL: https://arxiv.org/abs/1401.7388

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids ⋮ On partial cubes, well-graded families and their duals with some applications in graphs ⋮ Sign rank versus Vapnik-Chervonenkis dimension ⋮ Two-dimensional partial cubes

Cites Work

• Unnamed Item
• Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
• Predicting \(\{ 0,1\}\)-functions on randomly drawn points
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• A general lower bound on the number of examples needed for learning
• Almost optimal set covers in finite VC-dimension
• A combinatorial problem; stability and order for models and theories in infinitary languages
• Learnability and the Vapnik-Chervonenkis dimension
• A Geometric Approach to Sample Compression

This page was built for publication: Bounding Embeddings of VC Classes into Maximum Classes