mlsanityData to 7 Oct 2026

Prompt Learning on Temporal Interaction Graphs

arXiv 2402.06326 ↗First posted 9 Feb 2024cs.AI cs.LG cs.SIcited by 13

Not on the map. Why?

Abstract (arXiv)

Temporal Interaction Graphs (TIGs) are widely utilized to represent real-world systems. To facilitate representation learning on TIGs, researchers have proposed a series of TIG models. However, these models are still facing two tough gaps between the pre-training and downstream predictions in their ``pre-train, predict'' training paradigm. First, the temporal discrepancy between the pre-training and inference data severely undermines the models' applicability in distant future predictions on the dynamically evolving data. Second, the semantic divergence between pretext and downstream tasks hinders their practical applications, as they struggle to align with their learning and prediction capabilities across application scenarios. Recently, the ``pre-train, prompt'' paradigm has emerged as a lightweight mechanism for model generalization. Applying this paradigm is a potential solution to solve the aforementioned challenges. However, the adaptation of this paradigm to TIGs is not straightforward. The application of prompting in static graph contexts falls short in temporal settings due to a lack of consideration for time-sensitive dynamics and a deficiency in expressive power. To address this issue, we introduce Temporal Interaction Graph Prompting (TIGPrompt), a versatile framework that seamlessly integrates with TIG models, bridging both the temporal and semantic gaps. In detail, we propose a temporal prompt generator to offer temporally-aware prompts for different tasks. These prompts stand out for their minimalistic design, relying solely on the tuning of the prompt generator with very little supervision data. To cater to varying computational resource demands, we propose an extended ``pre-train, prompt-based fine-tune'' paradigm, offering greater flexibility. Through extensive experiments, the TIGPrompt demonstrates the SOTA performance and remarkable efficiency advantages.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 17 of its 26 references that are in the map. First posted on arXiv 9 Feb 2024.

Builds on

17 of 26 references.

References · 17

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2021Multimodal Few-Shot Learning with Frozen Language Modelscited by 657
  4. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
  5. 2020Inductive Representation Learning on Temporal Graphscited by 454
  6. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
  7. 2021Learning How to Ask: Querying LMs with Mixtures of Soft Promptscited by 376
  8. 2023PRODIGY: Enabling In-context Learning Over Graphscited by 97
  9. 2023Graph Prompt Learning: A Comprehensive Survey and Beyondcited by 61
  10. 2023Virtual Node Tuning for Few-shot Node Classificationcited by 46
  11. 2023HGPROMPT: Bridging Homogeneous and Heterogeneous Graphs for Few-shot Prompt Learningcited by 45
  12. 2023SGL-PT: A Strong Graph Learner with Graph Prompt Tuningcited by 35
5 more
  1. 2016Deep Coevolutionary Network: Embedding User and Item Features for Recommendationcited by 33
  2. 2023RDGSL: Dynamic Graph Representation Learning with Structure Learningcited by 13
  3. 2023PSP: Pre-Training and Structure Prompt Tuning for Graph Neural Networkscited by 8
  4. 2023SPEED: Streaming Partition and Parallel Acceleration for Temporal Interaction Graph Embeddingcited by 7
  5. 2023iLoRE: Dynamic Graph Representation with Instant Long-term Modeling and Re-occurrence Preservationcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 7; 2025: 3; 2026: 3.

13 papers.

Sort:

By area: