Inria, Lille - Nord Europe research centre, France; The Inria London Programme, France and UK; University College London, Department of Computer Science, Centre for Artiﬁcial Intelligence, UK; Univ Lyon, UJM-Saint-Etienne, CNRS, Institut d Optique Graduate School, Laboratoire Hubert Curien UMR 5516, F-42023, Saint-Etienne, France; Département d’informatique et de génie logiciel, Université Laval, Québec, Canada; Inria, Lille - Nord Europe research centre, France
Valentina Zantedeschi, Paul Viallard, Emilie Morvant, Rémi Emonet, Amaury Habrard, Pascal Germain, Benjamin Guedj
majority vote;ensemble method;generalization bound;bound-driven algorithm;PAC-Bayes
Learning Stochastic Majority Votes by Minimizing a PAC-Bayes Generalization Bound