ACM Home Page
Please provide us with feedback. Feedback
PAC-Bayesian learning of linear classifiers
Full text PdfPdf (722 KB)
Source ACM International Conference Proceeding Series; Vol. 382 archive
Proceedings of the 26th Annual International Conference on Machine Learning table of contents
Montreal, Quebec, Canada
Pages 353-360  
Year of Publication: 2009
ISBN:978-1-60558-516-1
Authors
Pascal Germain  Université Laval, Québec, Canada
Alexandre Lacasse  Université Laval, Québec, Canada
François Laviolette  Université Laval, Québec, Canada
Mario Marchand  Université Laval, Québec, Canada
Sponsors
: MITACS
: NSF
Microsoft Research : Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 65,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1553374.1553419
What is a DOI?

ABSTRACT

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


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Ambroladze, A., Parrado-Hernández, E., & Shawe-Taylor, J. (2006). Tighter PAC-Bayes bounds. Proceedings of the 2006 conference on Neural Information Processing Systems (NIPS-06) (pp. 9--16).
2
 
3
Catoni, O. (2007). PAC-Bayesian surpevised classification: the thermodynamics of statistical learning. Monograph series of the Institute of Mathematical Statistics, http://arxiv.org/abs/0712.0248.
 
4
 
5
Langford, J., & Shawe-Taylor, J. (2003). PAC-Bayes & margins. In S. T. S. Becker and K. Obermayer (Eds.), Advances in neural information processing systems 15, 423--430. Cambridge, MA: MIT Press.
 
6
 
7
Schapire, R. E., Freund, Y., Bartlett, P., & Lee, W. S. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26, 1651--1686.
 
8

Collaborative Colleagues:
Pascal Germain: colleagues
Alexandre Lacasse: colleagues
François Laviolette: colleagues
Mario Marchand: colleagues