mlsanityData to 7 Oct 2026

Kernelized Edge Attention: Addressing Semantic Attention Blurring in Temporal Graph Neural Networks

arXiv 2602.00596 ↗First posted 31 Jan 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Temporal Graph Neural Networks (TGNNs) aim to capture the evolving structure and timing of interactions in dynamic graphs. Although many models incorporate time through encodings or architectural design, they often compute attention over entangled node and edge representations, failing to reflect their distinct temporal behaviors. Node embeddings evolve slowly as they aggregate long-term structural context, while edge features reflect transient, timestamped interactions (e.g. messages, trades, or transactions). This mismatch results in semantic attention blurring, where attention weights cannot distinguish between slowly drifting node states and rapidly changing, information-rich edge interactions. As a result, models struggle to capture fine-grained temporal dependencies and provide limited transparency into how temporal relevance is computed. This paper introduces KEAT (Kernelized Edge Attention for Temporal Graphs), a novel attention formulation that modulates edge features using a family of continuous-time kernels, including Laplacian, RBF, and learnable MLP variant. KEAT preserves the distinct roles of nodes and edges, and integrates seamlessly with both Transformer-style (e.g., DyGFormer) and message-passing (e.g., TGN) architectures. It achieves up to 18% MRR improvement over the recent DyGFormer and 7% over TGN on link prediction tasks, enabling more accurate, interpretable and temporally aware message passing in TGNNs.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 29 references that are in the map. First posted on arXiv 31 Jan 2026.

Builds on

20 of 29 references.

References · 20

  1. 2017Attention Is All You Needcited by 59,932
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  5. 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
  6. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
  7. 2020Inductive Representation Learning on Temporal Graphscited by 454
  8. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
  9. 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
  10. 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 188
  11. 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 141
  12. 2023Temporal Graph Benchmark for Machine Learning on Temporal Graphscited by 137
8 more
  1. 2022Towards Better Evaluation for Dynamic Link Predictioncited by 120
  2. 2022KERPLE: Kernelized Relative Positional Embedding for Length Extrapolationcited by 84
  3. 2022Neighborhood-aware Scalable Temporal Network Representation Learningcited by 54
  4. 2019Self-attention with Functional Time Representation Learningcited by 52
  5. 2024Long Range Propagation on Continuous-Time Dynamic Graphscited by 26
  6. 2024On the Feasibility of Simple Transformer for Dynamic Graph Modelingcited by 22
  7. 2024Efficient Neural Common Neighbor for Temporal Graph Link Predictioncited by 18
  8. 2024Gradformer: Graph Transformer with Exponential Decaycited by 10

Built on by

Not cited yet.