Skip to content
Conference Open access

DNFormer: Differential Attention for Graph Transformers

Sep 2026 · Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence · 0 citations · 30 references

TL;DR

DNFormer mitigates structural dominance in attention aggregation, better capturing node-specific relational patterns while preserving local structural properties, and introduces a differential local attention mechanism in DNFormer that computes attention scores as differences across multiple topology-aware similarity measures, rather than relying on a single score.

Abstract

Graph Transformers (GTs) have emerged as a powerful paradigm for graph representation learning, leveraging attention mechanisms to enable flexible information exchange. Recent GTs often adopt local attention to restrict computation to neighborhoods, thereby reducing costs and enhancing scalability. However, local attention computation poses a serious issue that significantly reduces the efficacy of the overall approaches – because computation is restricted to local neighborhoods, node pairs that share topological patterns receive similar attention scores, thereby reducing attention’s discriminative power. Consequently, GT-based models typically overemphasize common structural motifs but fail to capture node-specific properties. To address this problem, we propose DNFormer, a novel GT grounded in differential modeling. We introduce a differential local attention mechanism in DNFormer that computes attention scores as differences across multiple topology-aware similarity measures, rather than relying on a single score. This mechanism suppresses shared topological patterns among neighbors and emphasizes relative node-to-node distinctions. As a result, DNFormer mitigates structural dominance in attention aggregation, better capturing node-specific relational patterns while preserving local structural properties. Extensive experiments confirm DNFormer's superior performance over representative GT baselines.

Read PDF

Similar papers

Open access Aug 2026

SimGAT: structure-aware graph attention network with multi-scale structural embedding

SimGAT, a structure-aware graph attention model built on SimRank-derived structural embeddings, is proposed, which computes structural similarity in the SimRank2Vec embedding space and injects it as a topological prior into the graph attention mechanism, enabling neighborhood aggregation to be jointly guided by node at...

Chengda Xu, Yinglong Zhang · 0 citations
Conference Open access Sep 2026

Efficient and Exact Global Attention on Latent Summaries for Knowledge Graph Reasoning

This paper introduces LaGR, a novel approach for integrating global information in knowledge graph reasoning that compresses the graph into a fixed, compact set of latent summaries and applies exact self-attention within this latent space, resulting in scale-invariant attention and stable performance across diverse dat...

Chen Lin, Lei Wang, Yin Zhang et al. · 0 citations
Oct 2026

Semantic Augmented Multiview Graph Learning With Frequency-Aware Propagation for Recommendation

Graph neural networks (GNNs) have been widely adopted in collaborative filtering to model higher order relationships between users and items. However, existing methods mainly focus on interaction-based structures and neglect the explicit modeling of semantic relations among users and among items. Within these graph str...

Yi-Xin Liu, Yu Zhang, Lei Sang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

QUARTET: Quad-branch cross-Attention and Random-walk Traces for Enhancing Transformers on Relational Graphs

QUARTET is an expressive graph transformer architecture that applies full self-attention on local subgraphs while enriching global context through cross-attention branches, and consistently matches or outperforms the current state-of-the-art graph transformer baselines (HGT and RelGT).

K. Myint, Nan Jiang, Xiang Li et al. · 0 citations
Preprint Sep 2026

SUCRe: Selective Uncertainty-Aware Contrastive Representation for Graph Transfer Learning

This work introduces structure-aware entropy-based matching discrepancy, which jointly models feature uncertainty and structural coherence to ensure accurate feature adaptation between graphs and develops a domain-aware semi-hard negative sampling strategy that constructs informative contrastive sets by filtering unrel...

Ming-Can Wang, Jun-Chang Xin, Zhong-Ming Yao et al. · 0 citations
Sep 2026

Generalizing on Diverse Shifts: A Unified Topology-Aware Reweighting Algorithm for Graphs.

Topology-Aware Dynamic Reweighting (TAR+), a model-agnostic framework for node classification under strict graph distribution shifts and related robustness stressors, is proposed, supporting the broad applicability of topology-aware reweighting across heterogeneous graph learning conditions.

Jia-Xing Li, Jia-Shuo Liu, Wei-Huang Zheng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.