mlsanityData to 14 Oct 2026

PTCL: Pseudo-Label Temporal Curriculum Learning for Label-Limited Dynamic Graph

arXiv 2504.17641 ↗First posted 24 Apr 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Dynamic node classification is critical for modeling evolving systems like financial transactions and academic collaborations. In such systems, dynamically capturing node information changes is critical for dynamic node classification, which usually requires all labels at every timestamp. However, it is difficult to collect all dynamic labels in real-world scenarios due to high annotation costs and label uncertainty (e.g., ambiguous or delayed labels in fraud detection). In contrast, final timestamp labels are easier to obtain as they rely on complete temporal patterns and are usually maintained as a unique label for each user in many open platforms, without tracking the history data. To bridge this gap, we propose PTCL(Pseudo-label Temporal Curriculum Learning), a pioneering method addressing label-limited dynamic node classification where only final labels are available. PTCL introduces: (1) a temporal decoupling architecture separating the backbone (learning time-aware representations) and decoder (strictly aligned with final labels), which generate pseudo-labels, and (2) a Temporal Curriculum Learning strategy that prioritizes pseudo-labels closer to the final timestamp by assigning them higher weights using an exponentially decaying function. We contribute a new academic dataset (CoOAG), capturing long-range research interest in dynamic graph. Experiments across real-world scenarios demonstrate PTCL's consistent superiority over other methods adapted to this task. Beyond methodology, we propose a unified framework FLiD (Framework for Label-Limited Dynamic Node Classification), consisting of a complete preparation workflow, training pipeline, and evaluation standards, and supporting various models and datasets. The code can be found at https://github.com/3205914485/FLiD.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 70 references that are in the map. First posted on arXiv 24 Apr 2025.

Builds on

28 of 70 references.

References · 28

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  4. 2024Qwen2 Technical Reportcited by 2,120
  5. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
  6. 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
  7. 2016Geometric deep learning: going beyond Euclidean datacited by 1,048
  8. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  9. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
  10. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
  11. 2020Inductive Representation Learning on Temporal Graphscited by 462
  12. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
16 more
  1. 2021OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphscited by 329
  2. 2021End-to-End Semi-Supervised Object Detection with Soft Teachercited by 316
  3. 2021Curriculum Learning: A Surveycited by 259
  4. 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 143
  5. 2019Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labelscited by 111
  6. 2021Graph Representation Learning in Biomedicinecited by 80
  7. 2021TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learningcited by 68
  8. 2022DGraph: A Large-Scale Financial Dataset for Graph Anomaly Detectioncited by 63
  9. 2022TwiBot-22: Towards Graph-Based Twitter Bot Detectioncited by 44
  10. 2022Temporal Link Prediction: A Unified Framework, Taxonomy, and Reviewcited by 20
  11. 2022Informative Pseudo-Labeling for Graph Neural Networks with Few Labelscited by 19
  12. 2024A Review of Pseudo-Labeling for Computer Visioncited by 16
  13. 2021GCN-SE: Attention as Explainability for Node Classification in Dynamic Graphscited by 13
  14. 2017Quantifying patterns of research interest evolutioncited by 8
  15. 2021Subset Node Representation Learning over Large Dynamic Graphscited by 7
  16. 2022How Does Pseudo-Labeling Affect the Generalization Error of the Semi-Supervised Gibbs Algorithm?cited by 5

Built on by

Not cited yet.