Skip to Main content Skip to Navigation
Conference papers

Multiview Learning of Weighted Majority Vote by Bregman Divergence Minimization

Abstract : We tackle the issue of classifier combinations when observations have multiple views. Our method jointly learns view-specific weighted majority vote classifiers (i.e. for each view) over a set of base voters, and a second weighted majority vote classifier over the set of these view-specific weighted majority vote classifiers. We show that the empirical risk minimization of the final majority vote given a multiview training set can be cast as the minimization of Bregman divergences. This allows us to derive a parallel-update optimization algorithm for learning our multiview model. We empirically study our algorithm with a particular focus on the impact of the training set size on the multiview learning results. The experiments show that our approach is able to overcome the lack of labeled information.
Document type :
Conference papers
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Anil Goyal Connect in order to contact the contributor
Submitted on : Thursday, May 24, 2018 - 1:58:03 PM
Last modification on : Wednesday, November 3, 2021 - 6:44:53 AM
Long-term archiving on: : Saturday, August 25, 2018 - 2:25:47 PM


  • HAL Id : hal-01799173, version 1
  • ARXIV : 1805.10212


Anil Goyal, Emilie Morvant, Massih-Reza Amini. Multiview Learning of Weighted Majority Vote by Bregman Divergence Minimization. International Symposium on Intelligent Data Analysis (IDA), Oct 2018, ‘s-Hertogenbosch, Netherlands. ⟨hal-01799173⟩



Record views


Files downloads