Multi-Evidence based Fact Verification via A Confidential Graph Neural Network

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Lan, Yuqing, Liu, Zhenghao, Gu, Yu, Yi, Xiaoyuan, Li, Xiaohua, Yang, Liner, Yu, Ge
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914799906979840
author Lan, Yuqing
Liu, Zhenghao
Gu, Yu
Yi, Xiaoyuan
Li, Xiaohua
Yang, Liner
Yu, Ge
author_facet Lan, Yuqing
Liu, Zhenghao
Gu, Yu
Yi, Xiaoyuan
Li, Xiaohua
Yang, Liner
Yu, Ge
contents Fact verification tasks aim to identify the integrity of textual contents according to the truthful corpus. Existing fact verification models usually build a fully connected reasoning graph, which regards claim-evidence pairs as nodes and connects them with edges. They employ the graph to propagate the semantics of the nodes. Nevertheless, the noisy nodes usually propagate their semantics via the edges of the reasoning graph, which misleads the semantic representations of other nodes and amplifies the noise signals. To mitigate the propagation of noisy semantic information, we introduce a Confidential Graph Attention Network (CO-GAT), which proposes a node masking mechanism for modeling the nodes. Specifically, CO-GAT calculates the node confidence score by estimating the relevance between the claim and evidence pieces. Then, the node masking mechanism uses the node confidence scores to control the noise information flow from the vanilla node to the other graph nodes. CO-GAT achieves a 73.59% FEVER score on the FEVER dataset and shows the generalization ability by broadening the effectiveness to the science-specific domain.
format Preprint
id arxiv_https___arxiv_org_abs_2405_10481
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Multi-Evidence based Fact Verification via A Confidential Graph Neural Network
Lan, Yuqing
Liu, Zhenghao
Gu, Yu
Yi, Xiaoyuan
Li, Xiaohua
Yang, Liner
Yu, Ge
Machine Learning
Artificial Intelligence
Fact verification tasks aim to identify the integrity of textual contents according to the truthful corpus. Existing fact verification models usually build a fully connected reasoning graph, which regards claim-evidence pairs as nodes and connects them with edges. They employ the graph to propagate the semantics of the nodes. Nevertheless, the noisy nodes usually propagate their semantics via the edges of the reasoning graph, which misleads the semantic representations of other nodes and amplifies the noise signals. To mitigate the propagation of noisy semantic information, we introduce a Confidential Graph Attention Network (CO-GAT), which proposes a node masking mechanism for modeling the nodes. Specifically, CO-GAT calculates the node confidence score by estimating the relevance between the claim and evidence pieces. Then, the node masking mechanism uses the node confidence scores to control the noise information flow from the vanilla node to the other graph nodes. CO-GAT achieves a 73.59% FEVER score on the FEVER dataset and shows the generalization ability by broadening the effectiveness to the science-specific domain.
title Multi-Evidence based Fact Verification via A Confidential Graph Neural Network
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2405.10481