Curriculum Negative Mining For Temporal Networks
Not on the map. Why?
Abstract (arXiv)
Temporal networks are effective in capturing the evolving interactions of networks over time, such as social networks and e-commerce networks. In recent years, researchers have primarily concentrated on developing specific model architectures for Temporal Graph Neural Networks (TGNNs) in order to improve the representation quality of temporal nodes and edges. However, limited attention has been given to the quality of negative samples during the training of TGNNs. When compared with static networks, temporal networks present two specific challenges for negative sampling: positive sparsity and positive shift. Positive sparsity refers to the presence of a single positive sample amidst numerous negative samples at each timestamp, while positive shift relates to the variations in positive samples across different timestamps. To robustly address these challenges in training TGNNs, we introduce Curriculum Negative Mining (CurNM), a model-aware curriculum learning framework that adaptively adjusts the difficulty of negative samples. Within this framework, we first establish a dynamically updated negative pool that balances random, historical, and hard negatives to address the challenges posed by positive sparsity. Secondly, we implement a temporal-aware negative selection module that focuses on learning from the disentangled factors of recently active edges, thus accurately capturing shifting preferences. Finally, the selected negatives are combined with annealing random negatives to support stable training. Extensive experiments on 12 datasets and 3 TGNNs demonstrate that our method outperforms baseline methods by a significant margin. Additionally, thorough ablation studies and parameter sensitivity experiments verify the usefulness and robustness of our approach.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 32 of its 49 references that are in the map. First posted on arXiv 24 Jul 2024.
Builds on
32 of 49 references.
References · 32
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
- 2020Inductive Representation Learning on Temporal Graphscited by 454
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 443
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
20 more
- 2016Structured Sequence Modeling with Graph Convolutional Recurrent Networkscited by 273
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
- 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
- 2022Semi-Supervised Semantic Segmentation Using Unreliable Pseudo-Labelscited by 218
- 2019Time2Vec: Learning a Vector Representation of Timecited by 208
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 154
- 2022ROLAND: Graph Learning Framework for Dynamic Graphscited by 131
- 2020Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A surveycited by 123
- 2017Dynamic Graph Convolutional Networkscited by 83
- 2017On Sampling Strategies for Neural Network-based Collaborative Filteringcited by 71
- 2022TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphscited by 59
- 2018NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embeddingcited by 42
- 2018Dynamic Graph Representation Learning via Self-Attention Networkscited by 39
- 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
- 2020Laplacian Change Point Detection for Dynamic Graphscited by 25
- 2022DyTed: Disentangled Representation Learning for Discrete-time Dynamic Graphcited by 21
- 2023TIGER: Temporal Interaction Graph Embedding with Restartscited by 17
- 2018DynamicGEM: A Library for Dynamic Graph Embedding Methodscited by 8
- 2023Augmented Negative Sampling for Collaborative Filteringcited by 7
- 2024TASER: Temporal Adaptive Sampling for Fast and Accurate Dynamic Graph Representation Learningcited by 2
Built on by
Citing papers per year: 2024: 1.
1 paper.