Effect of Choosing Loss Function when Using T-batching for Representation Learning on Dynamic Networks
Not on the map. Why?
Abstract (arXiv)
Representation learning methods have revolutionized machine learning on networks by converting discrete network structures into continuous domains. However, dynamic networks that evolve over time pose new challenges. To address this, dynamic representation learning methods have gained attention, offering benefits like reduced learning time and improved accuracy by utilizing temporal information. T-batching is a valuable technique for training dynamic network models that reduces training time while preserving vital conditions for accurate modeling. However, we have identified a limitation in the training loss function used with t-batching. Through mathematical analysis, we propose two alternative loss functions that overcome these issues, resulting in enhanced training performance. We extensively evaluate the proposed loss functions on synthetic and real-world dynamic networks. The results consistently demonstrate superior performance compared to the original loss function. Notably, in a real-world network characterized by diverse user interaction histories, the proposed loss functions achieved more than 26.9% enhancement in Mean Reciprocal Rank (MRR) and more than 11.8% improvement in Recall@10. These findings underscore the efficacy of the proposed loss functions in dynamic network modeling.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 14 of its 29 references that are in the map. First posted on arXiv 13 Aug 2023.
Builds on
14 of 29 references.
References · 14
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,245
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 447
- 2020GPT-GNN: Generative Pre-Training of Graph Neural Networkscited by 303
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 265
2 more
- 2018What is the Effect of Importance Weighting in Deep Learning?cited by 251
- 2023Temporal Graph Benchmark for Machine Learning on Temporal Graphscited by 138
Built on by
Citing papers per year: 2024: 3.
3 papers.