aiqbench analysis
This paper introduces Negation-Aware Weighted Information Fusion (NAWIF), a novel method within Dempster-Shafer theory that improves multi-source information fusion by encoding class exclusion through complementary propositions. By performing source-specific discounting based on reliability, NAWIF effectively suppresses noise and preserves ambiguity among unexcluded classes, achieving state-of-the-art performance on benchmark pattern recognition datasets. The work advances the theoretical framework of evidence reasoning to better handle uncertainty in complex data environments.
Negation-Aware Weighted Information Fusion for Reliable Evidential Reasoning
arXiv:2509.00754v3 Announce Type: replace Abstract: Dempster--Shafer theory (DST) provides an attractive framework for multi-source information fusion. However, its effectiveness critically depends on how a BPA is constructed for each source. Existing methods often rely on heuristic mappings or restrict belief assignment to singleton hypotheses and the full set, thereby underutilizing the expressive belief structure of BPAs for representing ambiguity.This paper proposes Negation-Aware Weighted Information Fusion (NAWIF).First, NAWIF transforms the class-wise possibility distribution of each source into a set of negation-aware simple BPAs, which encode class exclusion through complementary propositions and retain residual uncertainty in the full set. Their combination produces a closed-form BPA over composite hypotheses, preserving ambiguity among the classes not excluded by the source. It further performs source-specific BPA discounting based on its reliability and uncertainty, suppressing the impact of unreliable or uninformative sources.Experiments on benchmark pattern recognition datasets demonstrate the effectiveness of NAWIF, which achieves state-of-the-art average performance with particularly pronounced advantages under noise disturbance.
Abstract:Dempster--Shafer theory (DST) provides an attractive framework for multi-source information fusion. However, its effectiveness critically depends on how a BPA is constructed for each source. Existing methods often rely on heuristic mappings or restrict belief assignment to singleton hypotheses and the full set, thereby underutilizing the expressive belief structure of BPAs for representing this http URL paper proposes Negation-Aware Weighted Information Fusion (NAWIF).First, NAWIF transforms the class-wise possibility distribution of each source into a set of negation-aware simple BPAs, which encode class exclusion through complementary propositions and retain residual uncertainty in the full set. Their combination produces a closed-form BPA over composite hypotheses, preserving ambiguity among the classes not excluded by the source. It further performs source-specific BPA discounting based on its reliability and uncertainty, suppressing the impact of unreliable or uninformative this http URL on benchmark pattern recognition datasets demonstrate the effectiveness of NAWIF, which achieves state-of-the-art average performance with particularly pronounced advantages under noise disturbance.
Machine Learning (cs.LG)
arXiv:2509.00754 [cs.LG]
(or arXiv:2509.00754v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2509.00754 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 249 words
Related coverage

[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)
Latent Space · Sep 17, 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · Oct 8, 2026
[AINews] High Taste Testers Ep. 1
Latent Space · Oct 17, 2026

Improving CoT Monitorability of Evaluation Awareness via Verbalization Training
LessWrong · Oct 2, 2026