通过自我反思机制提升图模型在伪相关数据上的解释能力。
Combating Spurious Correlations in Graph Interpretability via Self-Reflection
- 引入自我反思框架,迭代优化节点与边的重要性评分。
- 在Spurious-Motif基准上显著提升解释性能,超越现有方法。
- 适合关注图神经网络可解释性与鲁棒性研究的读者。
可解释图学习已成为机器学习领域的热门研究方向,旨在识别对特定图推理任务至关重要的节点和边。尽管已有多种方法和基准数据集被提出,其中最具挑战性的是ICLR 2022提出的合成基准Spurious-Motif,其故意引入伪相关,使模型难以区分真实结构与误导模式。现有方法在此基准上表现明显下降。本文聚焦于改善在该类数据上的可解释性,证明大语言模型中常用的自我反思技术可有效迁移至图学习。我们提出一种自反射框架,将现有可解释方法输出的重要性评分反馈回原模型进行二次评估,形成迭代优化过程。该机制模拟了大模型通过自我提示重新审视输出的策略。进一步从图表示学习角度分析改进原因,并据此提出基于反馈机制的微调训练方法。
原文摘要 · Abstract (English)
Interpretable graph learning has recently emerged as a popular research topic in machine learning. The goal is to identify the important nodes and edges of an input graph that are crucial for performing a specific graph reasoning task. A number of studies have been conducted in this area, and various benchmark datasets have been proposed to facilitate evaluation. Among them, one of the most challenging is the Spurious-Motif benchmark, introduced at ICLR 2022. The datasets in this synthetic benchmark are deliberately designed to include spurious correlations, making it particularly difficult for models to distinguish truly relevant structures from misleading patterns. As a result, existing methods exhibit significantly worse performance on this benchmark compared to others. In this paper, we focus on improving interpretability on the challenging Spurious-Motif datasets. We demonstrate that the self-reflection technique, commonly used in large language models to tackle complex tasks, can also be effectively adapted to enhance interpretability in datasets with strong spurious correlations. Specifically, we propose a self-reflection framework that can be integrated with existing interpretable graph learning methods. When such a method produces importance scores for each node and edge, our framework feeds these predictions back into the original method to perform a second round of evaluation. This iterative process mirrors how large language models employ self-reflective prompting to reassess their previous outputs. We further analyze the reasons behind this improvement from the perspective of graph representation learning, which motivates us to propose a fine-tuning training method based on this feedback mechanism.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。