A new PAC bound for intersection-closed concept classes
From MaRDI portal
Publication:2384136
DOI10.1007/s10994-006-8638-3zbMath1470.68074MaRDI QIDQ2384136
Publication date: 20 September 2007
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-006-8638-3
68Q32: Computational learning theory
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Localization of VC classes: beyond local Rademacher complexities, The optimal PAC bound for intersection-closed concept classes
Cites Work
- Unnamed Item
- On-line learning with malicious noise and the closure algorithm
- Approximating hyper-rectangles: Learning and pseudorandom sets
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Learning nested differences in the presence of malicious noise
- A general lower bound on the number of examples needed for learning
- On the density of families of sets
- Learnability and the Vapnik-Chervonenkis dimension