arXiv AI

Towards Faithful Graph Explanations with Synergistic Edge Effects via Granular Balls

arXiv:2607. 21381v1 Announce Type: new Abstract: Instance-level explanations aim to reveal the rationale behind a model's decisions for a specific graph.

arXiv Machine Learning
Sep 7

A Comparative Study of Counterfactual Explainers for Graph Neural Networks Enabling Multiple Types of Graph Edit

The paper presents a comparative analysis of six state‑of‑the‑art counterfactual explainers for graph neural networks, focusing on methods that can both add and remove edges to alter model predictions. It evaluates these explainers across diverse real‑world and synthetic datasets, covering binary and multi‑class graph and node classification tasks, using a range of quantitative and qualitative metrics. The study highlights the trade‑offs between explanation size, coverage, and quality, aiming to pinpoint each method’s strengths and weaknesses to inform future research.

By Maria Myrto Villia, Filippos Gouidis, Theodore Patkos, Panos Trahanias
arXiv Machine Learning
Sep 10

Multi-granularity Adaptive Hypergraph Representation Learning via Granular-ball

The paper introduces MGHRL, a framework for hypergraph representation learning that adapts hyperedge granularity through a granular-ball splitting strategy. It constructs hyperedges at multiple levels of detail, capturing high-order relationships tailored to the graph’s topology. A multi-granularity hypergraph network then processes these hyperedges with sub-networks and hierarchical reversible connections, achieving superior performance on benchmark datasets.

By Sen Zhao, Yifan Guan, Jinyuan Ni, Gaojie Xu, Zhang Xu, Xiaoyu Lian, Yi Liu, Yi Wang, Wei Wang
arXiv Machine Learning
Aug 31

Can Subgraph Explanations Be Weaponized to Steal Graph Neural Networks?

Graph Machine Learning as a Service platforms now offer explainability interfaces to satisfy regulatory transparency, but this transparency can be exploited. The paper introduces a novel model extraction attack for graph classification that operates under strict black‑box constraints, using only discrete class labels and binary explanation masks. The method guides Monte Carlo edge sensitivity estimation toward decision boundaries with Hoeffding guarantees and narrows the search space using explanation subgraphs, outperforming comparable baselines on benchmark datasets.

By Ojas Nimase, Jiate Li, Yue Zhao, Yushun Dong
arXiv Machine Learning
Aug 27

DeltaGNN: Graph Neural Network with Information Flow Control

DeltaGNN introduces an information flow control mechanism that uses a new connectivity measure, the information flow score, to mitigate over‑smoothing and over‑squashing in Graph Neural Networks. This approach enables linear computational and memory overhead while effectively capturing both short‑range and long‑range node interactions. Experiments on ten diverse real‑world datasets demonstrate superior performance with limited computational complexity.

By Kevin Mancini, Islem Rekik
arXiv Machine Learning
Sep 4

When Vision Meets Graphs: A Survey on Graph Reasoning and Learning

The survey titled "When Vision Meets Graphs: A Survey on Graph Reasoning and Learning" reviews how visual depictions of graphs can be used as inputs for graph reasoning and learning. It highlights that while Graph Neural Networks dominate graph machine learning, most pipelines ignore the visual form of graphs, despite scientists routinely interpreting graphs visually. The paper organizes existing work into three threads—vision for graph reasoning, vision for graph learning, and scientific graphs—aiming to clarify current capabilities and chart a path toward foundation models that perceive and reason about graphs like scientists do.

By Xinjian Zhao, Wei Pang, Zhixuan Yu, Xiangru Jian, Xiaozhuang Song, Yaoyao Xu, Zhongkai Xue, Dingshuo Chen, Shu Wu, Philip Torr, Tianshu Yu