Complexity of hyperconcepts

DOI10.1016/j.tcs.2006.06.013zbMath1110.68132OpenAlexW2009557879MaRDI QIDQ860806

Joel Ratsaby

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.013

zbMATH Keywords

pseudo-dimensionlearning complexitylarge-margin samplessample-dependent error-bounds

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

On the complexity of constrained VC-classes

Cites Work

• Unnamed Item
• Unnamed Item
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• 10.1162/153244303768966111
• On the Combinatorial Representation of Information
• Structural risk minimization over data-dependent hierarchies
• Neural Network Learning
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Model selection and error estimation

This page was built for publication: Complexity of hyperconcepts