DARTS-GT: Differentiable Architecture Search for Graph Transformers with Quantifiable Instance-Specific Interpretability Analysis
Not on the map. Why?
Abstract (arXiv)
Graph Transformers (GTs) have emerged as powerful architectures for graph-structured data, yet remain constrained by rigid designs and lack quantifiable interpretability. Current state-of-the-art GTs commit to fixed GNN types across all layers, missing potential benefits of depth-specific component selection, while their complex architectures become opaque where performance gains cannot be distinguished between meaningful patterns and spurious correlations. We redesign GT attention through asymmetry, decoupling structural encoding from feature representation: queries derive from node features while keys and values come from GNN transformations. Within this framework, we use Differentiable ARchiTecture Search (DARTS) to select optimal GNN operators at each layer, enabling depth-wise heterogeneity inside transformer attention itself (DARTS-GT). To understand discovered architectures, we develop the first quantitative interpretability framework for GTs through causal ablation. Our metrics (Head-deviation, Specialization, and Focus), identify which heads and nodes drive predictions while enabling model comparison. Experiments across eight benchmarks show DARTS-GT achieves state-of-the-art on four datasets while remaining competitive on others, with discovered architectures revealing dataset-specific patterns. Our interpretability analysis reveals that visual attention salience and causal importance do not always correlate, indicating widely used visualization approaches may miss components that actually matter. Crucially, heterogeneous architectures found by DARTS-GT consistently produced more interpretable models than baselines, establishing that Graph Transformers need not choose between performance and interpretability.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 41 of its 55 references that are in the map. First posted on arXiv 16 Oct 2025.
Builds on
41 of 55 references.
References · 41
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2020Rethinking Attention with Performerscited by 1,584
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2019GNNExplainer: Generating Explanations for Graph Neural Networkscited by 735
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2020Benchmarking Graph Neural Networkscited by 672
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
29 more
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
- 2017Residual Gated Graph ConvNetscited by 341
- 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 328
- 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 326
- 2021Do Transformers Really Perform Bad for Graph Representation?cited by 318
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
- 2021Mesh Graphormercited by 264
- 2022Long Range Graph Benchmarkcited by 258
- 2021Weisfeiler and Lehman Go Cellular: CW Networkscited by 218
- 2022Representing Long-Range Context for Graph Neural Networks with Global Attentioncited by 193
- 2022Structure-Aware Transformer for Graph Representation Learningcited by 191
- 2024How to use and interpret activation patchingcited by 191
- 2021From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awarenesscited by 154
- 2020Directional Graph Networkscited by 132
- 2021Accurate Learning of Graph Representations with Graph Multiset Poolingcited by 120
- 2021Global Self-Attention as a Replacement for Graph Convolutioncited by 113
- 2022GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networkscited by 57
- 2021Search to aggregate neighborhood for graph neural networkcited by 48
- 2021Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passingcited by 46
- 2019GraphNAS: Graph Neural Architecture Search with Reinforcement Learningcited by 41
- 2024Graph Transformers: A Surveycited by 32
- 2025Towards Mechanistic Interpretability of Graph Transformers via Attention Graphscited by 12
- 2025A Survey of Graph Transformers: Architectures, Theories and Applicationscited by 12
- 2024Self-Explainable Graph Transformer for Link Sign Predictioncited by 8
- 2024Automatic Graph Topology-Aware Transformercited by 4
- 2024Investigating Neuron Ablation in Attention Heads: The Case for Peak Activation Centeringcited by 4
- 2025Mechanistic Interpretability of Fine-Tuned Vision Transformers on Distorted Images: Decoding Attention Head Behavior for Transparent and Trustworthy AIcited by 4
- 2025Robustness questions the interpretability of graph neural networks: what to do?cited by 4
- 2025Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contributioncited by 2
Built on by
Not cited yet.