Evaluating post-hoc explanations for graph neural networks via robustness analysis

J Fang, W Liu, Y Gao, Z Liu, A Zhang… - Advances in Neural …, 2024 - proceedings.neurips.cc
This work studies the evaluation of explaining graph neural networks (GNNs), which is
crucial to the credibility of post-hoc explainability in practical usage. Conventional evaluation …

Factorized explainer for graph neural networks

R Huang, F Shirani, D Luo - Proceedings of the AAAI conference on …, 2024 - ojs.aaai.org
Graph Neural Networks (GNNs) have received increasing attention due to their ability to
learn from graph-structured data. To open the black-box of these deep learning models, post …

Regexplainer: Generating explanations for graph neural networks in regression task

J Zhang, Z Chen, H Mei, D Luo, H Wei - arXiv preprint arXiv:2307.07840, 2023 - arxiv.org
Graph regression is a fundamental task and has received increasing attention in a wide
range of graph learning tasks. However, the inference process is often not interpretable …

Towards mitigating dimensional collapse of representations in collaborative filtering

H Chen, V Lai, H Jin, Z Jiang, M Das, X Hu - Proceedings of the 17th …, 2024 - dl.acm.org
Contrastive Learning (CL) has shown promising performance in collaborative filtering. The
key idea is to use contrastive loss to generate augmentation-invariant embeddings by …

On regularization for explaining graph neural networks: An information theory perspective

J Fang, G Zhang, K Wang, W Du… - … on Knowledge and …, 2024 - ieeexplore.ieee.org
This work studies the explainability of graph neural networks (GNNs), which is important for
the credibility of GNNs in practical usage. Existing mask-based explanation methods mostly …

Graph Convolutional Networks With Adaptive Neighborhood Awareness

M Guang, C Yan, Y Xu, J Wang… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Graph convolutional networks (GCNs) can quickly and accurately learn graph
representations and have shown powerful performance in many graph learning domains …

A Graph is Worth Words: Euclideanizing Graph using Pure Transformer

Z Gao, D Dong, C Tan, J Xia, B Hu, SZ Li - arXiv preprint arXiv:2402.02464, 2024 - arxiv.org
Can we model non-Euclidean graphs as pure language or even Euclidean vectors while
retaining their inherent information? The non-Euclidean property have posed a long term …

Interpreting Graph Neural Networks with In-Distributed Proxies

Z Chen, J Zhang, J Ni, X Li, Y Bian, MM Islam… - arXiv preprint arXiv …, 2024 - arxiv.org
Graph Neural Networks (GNNs) have become a building block in graph data processing,
with wide applications in critical domains. The growing needs to deploy GNNs in high-stakes …

REVEAL-IT: REinforcement learning with Visibility of Evolving Agent poLicy for InTerpretability

S Ao, S Khan, H Aziz, FD Salim - arXiv preprint arXiv:2406.14214, 2024 - arxiv.org
Understanding the agent's learning process, particularly the factors that contribute to its
success or failure post-training, is crucial for comprehending the rationale behind the agent's …

Feature Attribution with Necessity and Sufficiency via Dual-stage Perturbation Test for Causal Explanation

X Chen, R Cai, Z Huang, Y Zhu, J Horwood… - arXiv preprint arXiv …, 2024 - arxiv.org
We investigate the problem of explainability in machine learning. To address this problem,
Feature Attribution Methods (FAMs) measure the contribution of each feature through a …