nips nips2005 nips2005-12 nips2005-12-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: François Laviolette, Mario Marchand, Mohak Shah
Abstract: We design a new learning algorithm for the Set Covering Machine from a PAC-Bayes perspective and propose a PAC-Bayes risk bound which is minimized for classifiers achieving a non trivial margin-sparsity trade-off. 1
B. E. Boser, I. M. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pages 144–152. ACM Press, 1992. John Langford. Tutorial on practical prediction theory for classification. Journal of Machine Learning Research, 6:273–306, 2005. Fran¸ois Laviolette and Mario Marchand. PAC-Bayes risk bounds for sample-compressed c Gibbs classifiers. Proceedings of the 22nth International Conference on Machine Learning (ICML 2005), pages 481–488, 2005. Fran¸ois Laviolette, Mario Marchand, and Mohak Shah. Margin-sparsity trade-off for the c set covering machine. Proceedings of the 16th European Conference on Machine Learning (ECML 2005); Lecture Notes in Artificial Intelligence, 3720:206–217, 2005. Mario Marchand and John Shawe-Taylor. The set covering machine. Journal of Machine Learning Reasearch, 3:723–746, 2002. David McAllester. Some PAC-Bayesian theorems. Machine Learning, 37:355–363, 1999a. David A. McAllester. Pac-bayesian model averaging. In COLT, pages 164–170, 1999b.