arXiv:2606.27201cs.LG2026-06

提出新方法解释事件驱动图神经网络中信息流动全过程。

Explaining Temporal Graph Neural Networks via Feature-induced Information Flow

论文配图:Explaining Temporal Graph Neural Networks via Feature-induced Information Flow
图 1 · 摘自论文原文
  • 基于归一化相关性度量框架,追踪事件嵌入与事件诱导变量的完整信息流。
  • 在流行病追踪、社会动态等数据集上,解释精度显著优于现有方法。
  • 适合需要理解复杂时序图模型决策过程的研究者和应用开发者。

事件驱动的时序图神经网络(ETGNNs)在社交网络分析、疫情追踪、推荐系统和政治事件预测等多个领域表现出色,但其日益复杂的结构带来了可解释性挑战。现有解释方法仅关注从事件嵌入到输出的有限信息路径,忽略了事件诱导变量在节点间交互中的关键中介作用,而这些变量对捕捉长时程依赖至关重要。为此,本文提出一种新型归因方法,系统分析通过所有事件相关变量的完整信息流。该方法基于近期提出的归一化相关性度量(NRM)框架,能显式量化来自事件嵌入的信息流以及经过事件诱导变量的信息流,并保证层间隐变量的可比性,支持事件间高阶交互分析。为应对ETGNN架构复杂性,我们引入模块化分解机制,实现复杂神经结构的相关性结构系统构建。在两个合成数据集(用于疫情追踪与社会动态)及一个真实世界政治事件网络数据集上评估表明,本方法在定性和定量实验中均持续优于现有解释方法,且生成的解释更具人类可读性。

原文摘要 · Abstract (English)

Event-based Temporal Graph Neural Networks (ETGNNs) have demonstrated strong performance across a wide range of applications, including social network analysis, epidemic tracing, recommender systems, and political event forecasting. However, their increasing complexity poses significant challenges for explainability. Existing explanation methods focus only on a subset of the information flow within ETGNNs, typically tracing contributions from the event-related embeddings to the output. Consequently, they overlook the important pathways through event-induced variables, which mediate interactions between nodes and thereby play a central role in capturing long-range temporal dependencies. To overcome this limitation, we propose a novel attribution method that analyzes the entire information flow through all event-associated variables. Our method is built upon the recent Normalized Relevance Measure (NRM) framework, which enables explicit quantification of information flow originating from event embeddings as well as information flow passing through event-induced variables. It also ensures comparability of latent variables across layers, and supports higher-order analysis of interactions between events. To handle the architectural complexity of ETGNNs, we extend the NRM framework with a modular decomposition procedure that facilitates the systematic construction of relevance structure for complex neural architectures. We evaluate our approach on two synthetic datasets for epidemic tracing and social dynamics, as well as a real-world dataset of political event networks. Our qualitative and quantitative experiments show that our method consistently outperforms existing explanation approaches while producing more human-interpretable explanations.

时序图神经网络可解释性信息流

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。