Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference11 articles.
1. A theory of the learnable;Valiant,1984
2. A general lower bound on the number of examples needed for learning;Ehrenfeucht,1988
3. Learnability and the Vapnik–Chervonenkis dimension;Blumer;J. ACM,1989
4. The optimal PAC algorithm;Warmuth,2004
5. A new PAC bound for intersection-closed concept classes;Auer;Mach. Learn.,2007
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimal PAC Bounds without Uniform Convergence;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06