Papers › Multiview Boosting by Controlling the Diversity and the Accuracy of View-specific Voters

Multiview Boosting by Controlling the Diversity and the Accuracy of View-specific Voters

17 Aug 2018arXiv:1808.05784archive 2025-07-28

Anil Goyal, Emilie Morvant, Pascal Germain, Massih-Reza Amini

In this paper we propose a boosting based multiview learning algorithm, referred to as PB-MVBoost, which iteratively learns i) weights over view-specific voters capturing view-specific information; and ii) weights over views by optimizing a PAC-Bayes multiview C-Bound that takes into account the accuracy of view-specific classifiers and the diversity between the views. We derive a generalization bound for this strategy following the PAC-Bayes theory which is a suitable tool to deal with models expressed as weighted combination over a set of voters. Different experiments on three publicly available datasets show the efficiency of the proposed approach with respect to state-of-art models.

PaperPDFCode

Code

goyalanil/PB-MVBoost officialmentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

DiversityDocument ClassificationMultilingual text classificationMultiview LearningText Classification

Datasets

Introduced by this paper, per the archive.

MNIST Multiview Datasets

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections