Supra-Laplacian Encoding for Transformer on Dynamic Graphs
원문 초록
Fully connected Graph Transformers (GT) have rapidly become prominent in the static graph community as an alternative to Message-Passing models, which suffer from a lack of expressivity, oversquashing, and under-reaching. However, in a dynamic context, by interconnecting all nodes at multiple snapshots with self-attention, GT loose both structural and temporal information. In this work, we introduce Supra-LAplacian encoding for spatio-temporal TransformErs (SLATE), a new spatio-temporal encoding to leverage the GT architecture while keeping spatio-temporal information. Specifically, we transform Discrete Time Dynamic Graphs into multi-layer graphs and take advantage of the spectral properties of their associated supra-Laplacian matrix. Our second contribution explicitly model nodes' pairwise relationships with a cross-attention mechanism, providing an accurate edge representation for dynamic link prediction. SLATE outperforms numerous state-of-the-art methods based on Message-Passing Graph Neural Networks combined with recurrent models (e.g LSTM), and Dynamic Graph Transformers, on 9 datasets. Code is available at: github.com/ykrmm/SLATE.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Representation Learning for Dynamic Link Prediction in Temporal Networks
Temporal receptive field in dynamic graph learning: A comprehensive analysis
Exploring the Performance of Continuous-Time Dynamic Link Prediction Algorithms
Higher-order Structure Boosts Link Prediction on Temporal Graphs
A PID-Controlled Tensor Wheel Decomposition Model for Dynamic Link Prediction
Predict Confidently, Predict Right: Abstention in Dynamic Graph Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.