A sufficient condition for polynomial distribution-dependent learnability
- 1 June 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 77 (1) , 1-12
- https://doi.org/10.1016/s0166-218x(96)00129-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Parameterization Scheme for Classifying Models of PAC LearnabilityInformation and Computation, 1995
- Learnability with respect to fixed distributionsTheoretical Computer Science, 1991
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Quantifying inductive bias: AI learning algorithms and Valiant's learning frameworkArtificial Intelligence, 1988
- Queries and concept learningMachine Learning, 1988
- A theory of the learnableCommunications of the ACM, 1984
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971