Multiview Boosting by Controlling the Diversity and the Accuracy of View-specific Voters
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 2.
4 papers.
- 2021A PAC-Bayes Analysis of Adversarial Robustnesscited by 13
- 2024Multi-View Majority Vote Learning Algorithms: Direct Minimization of PAC-Bayesian Boundscited by 1
- 2023Gradient-Boosted Based Structured and Unstructured Learningcited by 0
- 2024Multi-omics data integration for early diagnosis of hepatocellular carcinoma (HCC) using machine learningcited by 0
- 2024Multi-View Majority Vote Learning Algorithms: Direct Minimization of PAC-Bayesian Bounds9 Nov 2024
- 2024Multi-omics data integration for early diagnosis of hepatocellular carcinoma (HCC) using machine learning20 Sep 2024
- 2023Gradient-Boosted Based Structured and Unstructured Learning28 Feb 2023
- 2021A PAC-Bayes Analysis of Adversarial Robustness19 Feb 2021