PAC-Bayesian Learning of Linear Classifiers (2009)

Authors

Abstract

We present a general PAC-Bayes theorem from which all known PAC-Bayes bounds are simply obtained as particular cases. We also propose different learning algorithms for finding linear classifiers that minimize these PAC-Bayes risk bounds. These learning algorithms are generally competitive with both AdaBoost and the SVM.

Discussion

Enter your comment (wiki syntax is allowed):
INELB
 
paper/2009/89.txt · Last modified: 2009/05/24 18:43 (external edit)
 
Driven by DokuWiki