Author:
Haussler David,Kearns Michael,Littlestone Nick,Warmuth Manfred K.
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference25 articles.
1. Queries and concept learning;Angluin;Machine Learning,1987
2. Fast probabilistic algortihms for Hamiltonian circuits and matchings;Angluin;J. Comput. System Sci.,1979
3. Learnability by fixed distributions;Benedek,1988
4. Nonuniform learnability;Benedek,1988
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the non-efficient PAC learnability of conjunctive queries;Information Processing Letters;2024-01
2. Parameterized Formal Graph Systems and Their Polynomial-Time PAC learnability;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2022
3. On the Quantum versus Classical Learnability of Discrete Distributions;Quantum;2021-03-23
4. Stochastic Finite Learning;Encyclopedia of Machine Learning and Data Mining;2017
5. PAC Learning;Encyclopedia of Machine Learning and Data Mining;2017