On ordinal VC-dimension and some notions of complexity

DOI10.1016/j.tcs.2006.07.041zbMath1110.68056OpenAlexW2147088019MaRDI QIDQ860824

Arun Sharma, Frank Stephan, Eric Martin

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.07.041

zbMATH Keywords

inductive inferencegeneralized VC-dimensionpredictive complexity

Mathematics Subject Classification ID

Computational learning theory (68Q32) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on batch and incremental learnability
• On the role of procrastination in machine learning
• Ordinal mind change complexity of language identification
• A Note on VC-Dimension and Measure of Sets of Reals
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Inductive inference of formal languages from positive data
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Language identification in the limit

This page was built for publication: On ordinal VC-dimension and some notions of complexity