Bounds on the Generalization Ability of Bayesian Inference and Gibbs Algorithms

Authors:
Olivier Teytaud;Hélène Paugam-Moisy
Affiliations:
-;-
Venue:
ICANN '01 Proceedings of the International Conference on Artificial Neural Networks
Year:
2001

Citing 6
Cited 0

Calculation of the learning curve of Bayes optimal classification algorithm for learning a perceptron with noise

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension

Machine Learning - Special issue on computational learning theory
Playing billiards in version space

Neural Computation
Scale-sensitive dimensions, uniform convergence, and learnability

Journal of the ACM (JACM)
A Theory of Learning and Generalization: With Applications to Neural Networks and Control Systems

A Theory of Learning and Generalization: With Applications to Neural Networks and Control Systems
The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent theoretical works applying the methods of statistical learning theory have put into relief the interest of old well known learning paradigms such as Bayesian inference and Gibbs algorithms. Sample complexity bounds have been given for such paradigms in the zero error case. This paper studies the behavior of these algorithms without this assumption. Results include uniform convergence of Gibbs algorithm towards Bayesian inference, rate of convergence of the empirical loss towards the generalization loss, convergence of the generalization error towards the optimal loss in the underlying class of functions.