2016
A Column Generation Bound Minimization Approach with PAC-Bayesian Generalization Guarantees
AISTATS 2016poster
The C-bound, introduced in Lacasse et al (2006), gives a tight upper bound on the risk of the majority vote classifier. Laviolette et al. (2011) designed a learning algorithm named MinCq that outputs a dense distribution on a finite set of base classifiers by minimizing the C-bound, together with a…