A PAC-Bayes approach to the Set Covering Machine
François Laviolette, Mario Marchand, Mohak Shah · Neural Information Processing Systems · 2005
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.