Uncertainty Quantification for Incomplete Multi-View Data Using Divergence Measures
Zhipeng Xue, Yan Zhang, Ming Li, Chun Li, Yue Liu, and Fei Yu

TL;DR
This paper introduces KPHD-Net, a novel multi-view learning framework that uses H"older divergence and Dempster-Shafer theory to improve uncertainty estimation, robustness, and reliability in classification and clustering tasks.
Contribution
It proposes KPHD-Net, integrating H"older divergence with Dempster-Shafer evidence theory and Kalman filtering for enhanced uncertainty quantification in multi-view learning.
Findings
Outperforms state-of-the-art methods in accuracy.
Provides more reliable uncertainty estimates.
Demonstrates robustness to noisy data.
Abstract
Existing multi-view classification and clustering methods typically improve task accuracy by leveraging and fusing information from different views. However, ensuring the reliability of multi-view integration and final decisions is crucial, particularly when dealing with noisy or corrupted data. Current methods often rely on Kullback-Leibler (KL) divergence to estimate uncertainty of network predictions, ignoring domain gaps between different modalities. To address this issue, KPHD-Net, based on H\"older divergence, is proposed for multi-view classification and clustering tasks. Generally, our KPHD-Net employs a variational Dirichlet distribution to represent class probability distributions, models evidences from different views, and then integrates it with Dempster-Shafer evidence theory (DST) to improve uncertainty estimation effects. Our theoretical analysis demonstrates that Proper…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbabilistic and Robust Engineering Design
