Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension
- 1 January 1991
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- On-line Learning with an Oblivious Environment and the Power of RandomizationPublished by Elsevier ,1991
- Calculation of the Learning Curve of Bayes Optimal Classification Algorithm for Learning a Perceptron With NoisePublished by Elsevier ,1991
- Learning from examples in large neural networksPhysical Review Letters, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- What Size Net Gives Valid Generalization?Neural Computation, 1989
- LEARNING CLASSIFICATION RULES USING BAYESPublished by Elsevier ,1989
- A theory of the learnableCommunications of the ACM, 1984
- Densité et dimensionAnnales de l'institut Fourier, 1983
- 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