Distance-Misaligned Training in Graph Transformers and Adaptive Graph-Aware Control

• URL: http://arxiv.org/abs/2604.22413v1
• Date: Fri, 24 Apr 2026 10:19:08 GMT
• Title: Distance-Misaligned Training in Graph Transformers and Adaptive Graph-Aware Control
• Abstract summary: Graph Transformers can mix information globally, but this flexibility also creates failure modes.<n>We study this through a synthetic node-classification benchmark on contextual block model graphs.<n>We define distance-misaligned as a mismatch between where label-relevant information lies and where the model allocates communication over graph distance.
• Score: 4.104525618451057
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Cognitive Graph Intelligence for Adaptive and Robust DDoS Attack Detection in Next Generation Networks [2.434167379974669]
  This paper proposes a Graph-based Generative Adrial Network (GraphGAN) that serves as the cognitive detection engine for this task.<n>GraphGAN captures the relational structure among traffic flows while addressing imbalance through adversarial generation of synthetic samples.<n>The generator learns the distribution of DDoS attacks to synthesize realistic minority samples, while a Graph Convolutional Network (GCN)-based discriminator distinguishes real from synthetic graph data.
  arXiv  Detail & Related papers  (2026-08-18T04:18:31Z)
• Programmable Synchronization Graphs for Adaptive and Fault-Tolerant Modular Miniature Robots [0.0]
  We introduce a programmable synchronization-graph framework for modular miniature robots in which each actuator-sensor pair is represented as a network node.<n>In physical robot collectives with up to nine modules, graph coupling drives the emergence of synchronization.<n>An upper-confidence-bound edge-selection algorithm learns inter-subgraph links that drive the system toward target phase states.
  arXiv  Detail & Related papers  (2026-07-08T11:19:38Z)
• Generative Diffusion Models of Stochastic Graph Signals [74.4097723209053]
  This paper tackles problems of conditional graph signal generative modeling and tackles them with a single denoising diffusion framework.<n>We learn a reverse diffusion process, parametrized by graph neural networks (GNNs), that draws graph signals conditioned directly on the graph topology and on node-feature side information.<n>We demonstrate our method on two generative tasks: stock price forecasting and optimal wireless resource allocation, with extensive numerical results in both domains.
  arXiv  Detail & Related papers  (2026-07-07T22:02:13Z)
• DREAM: Dual-Standard Semantic Homogeneity with Dynamic Optimization for Graph Learning with Label Noise [53.55187452152358]
  This paper proposes a novel method, Dual-Standard Semantic Homogeneity with Dynamic Optimization (DREAM) for reliable, relation-informed optimization on graphs with label noise.<n>Specifically, we design a relation-informed dynamic optimization framework that iteratively reevaluates the reliability of each labeled node in the graph.
  arXiv  Detail & Related papers  (2026-01-24T12:54:18Z)
• Transfer Learning on Edge Connecting Probability Estimation under Graphon Model [7.805468525082696]
  We propose a transfer learning framework that integrates neighborhood smoothing and Gromov-Wasserstein optimal transport to align and transfer structural patterns between graphs.<n>GTRANS includes an adaptive debiasing mechanism that identifies and corrects for target-specific deviations via residual smoothing.<n>These improvements translate directly to enhanced performance in downstream applications, such as the graph classification task and the link prediction task.
  arXiv  Detail & Related papers  (2025-10-07T02:37:12Z)
• Structural Alignment Improves Graph Test-Time Adaptation [17.564393890432193]
  We introduce Test-Time Structural Alignment (TSA), a novel algorithm for Graph Test-Time Adaptation (GTTA)<n>TSA aligns graph structures during inference without accessing the source data.<n>Experiments on synthetic and real-world datasets demonstrate TSA's consistent outperformance of both non-graph TTA methods and state-of-the-art GTTA baselines.
  arXiv  Detail & Related papers  (2025-02-25T16:26:25Z)
• DPGAN: A Dual-Path Generative Adversarial Network for Missing Data Imputation in Graphs [17.847551850315895]
  This paper proposes a novel framework, called Dual-Pathrative Adversarial Network (DPGAN) DPGAN can deal simultaneously with missing data and avoid over-smoothing problems. Comprehensive experiments across various benchmark datasets substantiate that DPGAN consistently rivals, if not outperforms, existing state-of-the-art imputation algorithms.
  arXiv  Detail & Related papers  (2024-04-26T05:26:10Z)
• Graph Transformer GANs with Graph Masked Modeling for Architectural Layout Generation [153.92387500677023]
  We present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations. The proposed graph Transformer encoder combines graph convolutions and self-attentions in a Transformer to model both local and global interactions. We also propose a novel self-guided pre-training method for graph representation learning.
  arXiv  Detail & Related papers  (2024-01-15T14:36:38Z)
• Mobility-Induced Graph Learning for WiFi Positioning [3.9913115858730865]
  This paper proposes a novel integration technique using a graph neural network called Mobility-INduced Graph LEarning (MINGLE) It is designed based on two types of graphs made by capturing different user mobility features. The proposed MINGLE's effectiveness is extensively verified through field experiments.
  arXiv  Detail & Related papers  (2023-11-14T16:06:11Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• Distributed Graph Learning with Smooth Data Priors [61.405131495287755]
  We propose a novel distributed graph learning algorithm, which permits to infer a graph from signal observations on the nodes. Our results show that the distributed approach has a lower communication cost than a centralised algorithm without compromising the accuracy in the inferred graph.
  arXiv  Detail & Related papers  (2021-12-11T00:52:02Z)
• Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming [48.99614465020678]
  We introduce a novel self-supervised graph representation learning algorithm via Graph Contrastive Adjusted Zooming. This mechanism enables G-Zoom to explore and extract self-supervision signals from a graph from multiple scales. We have conducted extensive experiments on real-world datasets, and the results demonstrate that our proposed model outperforms state-of-the-art methods consistently.
  arXiv  Detail & Related papers  (2021-11-20T22:45:53Z)
• Scalable Perception-Action-Communication Loops with Convolutional and Graph Neural Networks [208.15591625749272]
  We present a perception-action-communication loop design using Vision-based Graph Aggregation and Inference (VGAI) Our framework is implemented by a cascade of a convolutional and a graph neural network (CNN / GNN), addressing agent-level visual perception and feature learning. We demonstrate that VGAI yields performance comparable to or better than other decentralized controllers.
  arXiv  Detail & Related papers  (2021-06-24T23:57:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.