mlsanityData to 14 Oct 2026

Towards Adaptive Neighborhood for Advancing Temporal Interaction Graph Modeling

arXiv 2406.11891 ↗First posted 14 Jun 2024cs.SI cs.AI cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Temporal Graph Networks (TGNs) have demonstrated their remarkable performance in modeling temporal interaction graphs. These works can generate temporal node representations by encoding the surrounding neighborhoods for the target node. However, an inherent limitation of existing TGNs is their reliance on fixed, hand-crafted rules for neighborhood encoding, overlooking the necessity for an adaptive and learnable neighborhood that can accommodate both personalization and temporal evolution across different timestamps. In this paper, we aim to enhance existing TGNs by introducing an adaptive neighborhood encoding mechanism. We present SEAN, a flexible plug-and-play model that can be seamlessly integrated with existing TGNs, effectively boosting their performance. To achieve this, we decompose the adaptive neighborhood encoding process into two phases: (i) representative neighbor selection, and (ii) temporal-aware neighborhood information aggregation. Specifically, we propose the Representative Neighbor Selector component, which automatically pinpoints the most important neighbors for the target node. It offers a tailored understanding of each node's unique surrounding context, facilitating personalization. Subsequently, we propose a Temporal-aware Aggregator, which synthesizes neighborhood aggregation by selectively determining the utilization of aggregation routes and decaying the outdated information, allowing our model to adaptively leverage both the contextually significant and current information during aggregation. We conduct extensive experiments by integrating SEAN into three representative TGNs, evaluating their performance on four public datasets and one financial benchmark dataset introduced in this paper. The results demonstrate that SEAN consistently leads to performance improvements across all models, achieving SOTA performance and exceptional robustness.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 26 of its 44 references that are in the map. First posted on arXiv 14 Jun 2024.

Builds on

26 of 44 references.

References · 26

  1. 2017Attention Is All You Needcited by 60,361
  2. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  3. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
  4. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
  5. 2020Inductive Representation Learning on Temporal Graphscited by 462
  6. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
  7. 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 193
  8. 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 157
  9. 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 143
  10. 2018Graph HyperNetworks for Neural Architecture Searchcited by 132
  11. 2022Towards Better Evaluation for Dynamic Link Predictioncited by 122
  12. 2022Not too little, not too much: a theoretical analysis of graph (over)smoothingcited by 106
14 more
  1. 2018GeniePath: Graph Neural Networks with Adaptive Receptive Pathscited by 66
  2. 2022Provably expressive temporal graph networkscited by 56
  3. 2020Policy-GNN: Aggregation Optimization for Graph Neural Networkscited by 48
  4. 2021Search to aggregate neighborhood for graph neural networkcited by 48
  5. 2021Pooling Architecture Search for Graph Classificationcited by 36
  6. 2022Bring Your Own View: Graph Neural Networks for Link Prediction with Personalized Subgraph Selectioncited by 26
  7. 2023Robustifying Token Attention for Vision Transformerscited by 19
  8. 2021AutoGEL: An Automated Graph Neural Network with Explicit Link Informationcited by 17
  9. 2023TIGER: Temporal Interaction Graph Embedding with Restartscited by 17
  10. 2023RDGSL: Dynamic Graph Representation Learning with Structure Learningcited by 13
  11. 2024Prompt Learning on Temporal Interaction Graphscited by 13
  12. 2023SPEED: Streaming Partition and Parallel Acceleration for Temporal Interaction Graph Embeddingcited by 7
  13. 2023iLoRE: Dynamic Graph Representation with Instant Long-term Modeling and Re-occurrence Preservationcited by 4
  14. 2020The Geometry of Information Cocoon: Analyzing the Cultural Space with Word Embedding Modelscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 5; 2026: 1.

8 papers.