TGOnline: Enhancing Temporal Graph Learning with Adaptive Online Meta-Learning
Ruijie Wang, Jingyuan Huang, Yutong Zhang, Jinyang Li, Yufeng Wang, Wanyu Zhao, Shengzhong Liu, Charith Mendis, Tarek F. Abdelzaher
Abstract
Temporal graphs, depicting time-evolving node connections through temporal edges, are extensively utilized in domains where temporal connection patterns are essential, such as recommender systems, financial networks, healthcare, and sensor networks. Despite recent advancements in temporal graph representation learning, performance degradation occurs with periodic collections of new temporal edges, owing to their dynamic nature and newly emerging information. This paper investigates online representation learning on temporal graphs, aiming for efficient updates of temporal models to sustain predictive performance during deployment. Unlike costly retraining or exclusive fine-tuning susceptible to catastrophic forgetting, our approach aims to distill information from previous model parameters and adapt it to newly gathered data. To this end, we propose TGOnline, an adaptive online meta-learning framework, tackling two key challenges. First, to distill valuable knowledge from complex temporal parameters, we establish an optimization objective that determines new parameters, either by leveraging global ones or by placing greater reliance on new data, where global parameters are meta-trained across various data collection periods to enhance temporal generalization. Second, to accelerate the online distillation process, we introduce an edge reduction mechanism that skips new edges lacking additional information and a node deduplication mechanism to prevent redundant computation within training batches on new data. Extensive experiments on four real-world temporal graphs demonstrate the effectiveness and efficiency of TGOnline for online representation learning, outperforming 18 state-of-the-art baselines. Notably, TGOnline not only outperforms the commonly utilized retraining strategy but also achieves a significant speedup of 30x.
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.
Builds on19
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- EvolveGCN: Evolving Graph Convolutional Networks for Dynamic GraphsAldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma et al.AAAI 2020 · 1,429 citations
- Inductive representation learning on temporal graphsDa Xu, Chuanwei Ruan, Evren Körpeoglu, Sushant Kumar et al.ICLR 2020 · 901 citations
- Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge GraphsWoojeong Jin, Meng Qu, Xisen Jin, Xiang RenEMNLP 2020 · 353 citations
- Temporal Knowledge Graph Reasoning Based on Evolutional Representation LearningZixuan Li, Xiaolong Jin, Wei Li, Saiping Guan et al.SIGIR 2021 · 345 citations
Related papers
- Orca: Scalable Temporal Graph Neural Network Training with Theoretical GuaranteesYiming Li, Yanyan Shen, Lei Chen, Mingxuan YuanSIGMOD 2023 · 27 citations
- TIE: A Framework for Embedding-based Incremental Temporal Knowledge Graph CompletionJiapeng Wu, Yishi Xu, Yingxue Zhang, Chen Ma et al.SIGIR 2021 · 27 citations
- Disentangle-based Continual Graph Representation LearningXiaoyu Kou, Yankai Lin, Shaobo Liu, Peng Li et al.EMNLP 2020 · 26 citations
- Temporal Dynamics-Aware Adversarial Attacks on Discrete-Time Dynamic Graph ModelsKartik Sharma, Rakshit S. Trivedi, Rohit Sridhar, Srijan KumarKDD 2023 · 20 citations
- Direct Embedding of Temporal Network Edges via Time-Decayed Line GraphsSudhanshu Chanpuriya, Ryan A. Rossi, Sungchul Kim, Tong Yu et al.ICLR 2023 · 1 citation
