Learning theory
Generalization, sample complexity, information-theoretic and PAC-Bayes bounds.
1 item · All topics
-
The optimal information complexity of VC learning
A randomised majority vote of five learners reaches the optimal generalisation guarantee, with conditional mutual information of order of the VC dimension.