Higher Order Structures For Graph Explanations
<|reference_start|>Higher Order Structures For Graph Explanations: Graph Neural Networks (GNNs) have emerged as powerful tools for learning representations of graph-structured data, demonstrating remarkable performance across various tasks. Recognising their importance, there has been extensive research focused on explaining GNN predictions, aiming to enhance their interpretability and trustworthiness. However, GNNs and their explainers face a notable challenge: graphs are primarily designed to model pair-wise relationships between nodes, which can make it tough to capture higher-order, multi-node interactions. This characteristic can pose difficulties for existing explainers in fully representing multi-node relationships. To address this gap, we present Framework For Higher-Order Representations In Graph Explanations (FORGE), a framework that enables graph explainers to capture such interactions by incorporating higher-order structures, resulting in more accurate and faithful explanations. Extensive evaluation shows that on average real-world datasets from the GraphXAI benchmark and synthetic datasets across various graph explainers, FORGE improves average explanation accuracy by 1.9x and 2.25x, respectively. We perform ablation studies to confirm the importance of higher-order relations in improving explanations, while our scalability analysis demonstrates FORGE's efficacy on large graphs.<|reference_end|>
@article{sinha2024higher,
    title={Higher Order Structures For Graph Explanations},
    author={Akshit Sinha, Sreeram Vennam, Charu Sharma, Ponnurangam Kumaraguru},
    journal={arXiv preprint arXiv:2406.03253},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.03253},
    primaryClass={cs.LG}
}