Kernelized Edge Attention: Addressing Semantic Attention Blurring in Temporal Graph Neural Networks
Govind Waghmare, Srini Rohan Gujulla Leel, Nikhil Tumbde, Sumedh B. G, Sonia Gupta, Srikanta Bedathur
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext bbcea5da-118d-467b-94c9-ec1c8931c7d6Builds on8
- Inductive representation learning on temporal graphsDa Xu, Chuanwei Ruan, Evren Körpeoglu, Sushant Kumar et al.ICLR 2020 · 901 citations
- Inductive Representation Learning in Temporal Networks via Causal Anonymous WalksYanbang Wang, Yen-Yu Chang, Yunyu Liu, Jure Leskovec et al.ICLR 2021 · 326 citations
- Towards Better Dynamic Graph Learning: New Architecture and Unified LibraryLe Yu, Leilei Sun, Bowen Du, Weifeng LvNeurIPS 2023 · 323 citations
- KERPLE: Kernelized Relative Positional Embedding for Length ExtrapolationTa-Chung Chi, Ting-Han Fan, Peter J. Ramadge, Alexander RudnickyNeurIPS 2022 · 112 citations
- On the Feasibility of Simple Transformer for Dynamic Graph ModelingYuxia Wu, Yuan Fang, Lizi LiaoWWW 2024 · 49 citations
Related papers
- Forecasting Interaction Order on Temporal GraphsWenwen Xia, Yuchen Li, Jianwei Tian, Shenghong LiKDD 2021 · 8 citations
- Learning Neural Ordinary Equations for Forecasting Future Links on Temporal Knowledge GraphsZhen Han, Zifeng Ding, Yunpu Ma, Yujia Gu et al.EMNLP 2021 · 112 citations
- TGLite: A Lightweight Programming Framework for Continuous-Time Temporal Graph Neural NetworksYufeng Wang, Charith MendisASPLOS 2024 · 13 citations
- TP-GNN: Continuous Dynamic Graph Neural Network for Graph ClassificationJie Liu, Jiamou Liu, Kaiqi Zhao, Yanni Tang et al.ICDE 2024 · 9 citations
- TIDFormer: Exploiting Temporal and Interactive Dynamics Makes A Great Dynamic Graph TransformerJie Peng, Zhewei Wei, Yuhang YeKDD 2025 · 2 citations
