Graph Additive Models (AMIGA) address three key limitations of Graph Neural Additive Networks (GNANs): they prevent irrelevant nodes from inheriting spurious relevance, represent topology via mined motifs instead of only shortest‑path distances, and separate feature, structure, and interaction effects into distinct additive channels. AMIGA’s decomposition is centered around a graph‑balanced training baseline, ensuring a unique and well‑defined representation for each node. Across ten graph classification and regression benchmarks, AMIGA outperforms GNAN on most datasets and narrows the performance gap with standard black‑box GNNs, while providing node‑local explanations that exactly reconstruct the model output.
Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn graph representations. However, their discriminative...
arXiv:2511. 11046v3 Announce Type: replace-cross Abstract: Graph neural networks (GNNs) have become an indispensable tool for analyzing relational data.
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.
arXiv:2601. 21207v4 Announce Type: replace-cross Abstract: Combinatorial and topological structures, such as graphs, simplicial complexes, and cell complexes, form the foundation of geometric and topological deep learning (GDL and TDL) architectures.
arXiv:2609.17061v1 Announce Type: cross Abstract: Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn g...
arXiv:2607. 21381v1 Announce Type: new Abstract: Instance-level explanations aim to reveal the rationale behind a model's decisions for a specific graph.
Instance-level explanations aim to reveal the rationale behind a model's decisions for a specific graph. Previous methods explain graph neural networks (GNNs) by selecting important edges to induce subgraphs, where edge importance is assessed by perturbing each edge and observing changes in the model predictions.
arXiv:2608. 04381v1 Announce Type: cross Abstract: Self-supervised learning on graphs is largely shaped by contrastive methods that depend on carefully designed augmentations, and by generative methods that reconstruct node attributes in the input space.
arXiv:2606. 05756v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have demonstrated remarkable performance across a range of applications involving graph-structured data, particularly in high-stakes domains.
The paper introduces Model-to-Data (M2D) distillation, a method that transfers properties learned by a complex graph neural network (GNN) teacher into the graph data itself. By jointly learning augmented node features and graph structure, M2D encodes the teacher’s behavior, allowing simpler GNNs to recover high predictive performance, fairness, and robustness. The resulting graph can be reused with various downstream models, enabling them to approximate sophisticated teachers such as fairness-aware GNNs, Graph Attention Networks, and Graph Transformers.
HyPE-GT introduces a framework that generates learnable hyperbolic positional encodings for Graph Transformers, enabling the capture of complex hierarchical relationships in graph-structured data. Unlike traditional Euclidean encodings, HyPE’s hyperbolic encodings can be selected to suit specific downstream tasks and help mitigate oversmoothing in deep Graph Neural Networks. Experiments on molecular benchmarks and large-scale Open Graph Benchmark datasets demonstrate improved performance, while additional tests on Coauthor and Copurchase networks confirm HyPE’s effectiveness in controlling oversmoothing.
arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).