Distance-Misaligned Training in Graph Transformers and Adaptive Graph-Aware Control
Not on the map. Why?
Abstract (arXiv)
Graph Transformers can mix information globally, but this flexibility also creates failure modes: some tasks require long-range communication while others are better served by local interaction. We study this through a synthetic node-classification benchmark on contextual stochastic block model graphs, where labels are generated by a controllable mixture of local and far-shell signals. We define distance-misaligned training as a mismatch between where label-relevant information lies and where the model allocates communication over graph distance. On this benchmark, we find three points. First, the preferred graph-distance bias changes systematically with task locality. Second, an oracle adaptive controller, given offline access to the task-side distance target, nearly matches the best fixed bias across regimes and strongly improves over a neutral baseline on mixed and local tasks. Third, a task-agnostic zero-gap controller is weaker, indicating that adaptation alone is not enough and that the control target matters. These results suggest that distance-resolved diagnosis is useful for understanding Graph Transformer failures and for designing graph-aware control.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 7 references that are in the map. First posted on arXiv 24 Apr 2026.
Builds on
5 of 7 references.
References · 5
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2023Demystifying Oversmoothing in Attention-Based Graph Neural Networkscited by 47
- 2024Setting the Record Straight on Transformer Oversmoothingcited by 19
- 2024What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encodingcited by 14
- 2025Relieving the Over-Aggregating Effect in Graph Transformerscited by 2
Built on by
Not cited yet.