Learning reliably and with one-sided error
From MaRDI portal
Publication:4327384
DOI10.1007/BF01191474zbMath0815.68086MaRDI QIDQ4327384
Publication date: 5 April 1995
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Cites Work
- Equivalence of models for polynomial learnability
- A general lower bound on the number of examples needed for learning
- Probably Approximate Learning of Sets and Functions
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Computational limitations on learning from examples
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: Learning reliably and with one-sided error