通过因果路径优化,提升谣言验证的准确性和鲁棒性。
MuPlon: Multi-Path Causal Optimization for Claim Verification through Controlling Confounding
- 设计双因果干预路径,分别处理数据噪声与偏见问题
- 在主流数据集上达到最新性能,显著优于现有方法
- 适合关注可信AI与虚假信息检测的研究者
作为数据质量控制的关键任务,谣言验证旨在基于多源证据评估声明的真实性,以遏制虚假信息传播。然而,传统方法常忽略证据间的复杂交互,导致验证结果不可靠。一种直接方案是将声明与证据表示为全连接图,即声明-证据图(C-E Graph)。但基于全连接图的方法面临两大混淆挑战:数据噪声与数据偏见。为此,我们提出新型框架MuPlon,集成双因果干预策略,包括后门路径与前门路径。后门路径中,MuPlon通过优化节点概率权重稀释噪声干扰,同时增强相关证据节点间的连接;前门路径中,MuPlon提取高度相关的子图并构建推理路径,进一步应用反事实推理消除路径内的数据偏见。实验表明,MuPlon超越现有方法,取得最先进性能。
原文摘要 · Abstract (English)
As a critical task in data quality control, claim verification aims to curb the spread of misinformation by assessing the truthfulness of claims based on a wide range of evidence. However, traditional methods often overlook the complex interactions between evidence, leading to unreliable verification results. A straightforward solution represents the claim and evidence as a fully connected graph, which we define as the Claim-Evidence Graph (C-E Graph). Nevertheless, claim verification methods based on fully connected graphs face two primary confounding challenges, Data Noise and Data Biases. To address these challenges, we propose a novel framework, Multi-Path Causal Optimization (MuPlon). MuPlon integrates a dual causal intervention strategy, consisting of the back-door path and front-door path. In the back-door path, MuPlon dilutes noisy node interference by optimizing node probability weights, while simultaneously strengthening the connections between relevant evidence nodes. In the front-door path, MuPlon extracts highly relevant subgraphs and constructs reasoning paths, further applying counterfactual reasoning to eliminate data biases within these paths. The experimental results demonstrate that MuPlon outperforms existing methods and achieves state-of-the-art performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。