mlsanityData to 7 Oct 2026

Transductive Linear Probing: A Novel Framework for Few-Shot Node Classification

arXiv 2212.05606 ↗First posted 11 Dec 2022cs.LGcited by 24

Not on the map. Why?

Abstract (arXiv)

Few-shot node classification is tasked to provide accurate predictions for nodes from novel classes with only few representative labeled nodes. This problem has drawn tremendous attention for its projection to prevailing real-world applications, such as product categorization for newly added commodity categories on an E-commerce platform with scarce records or diagnoses for rare diseases on a patient similarity graph. To tackle such challenging label scarcity issues in the non-Euclidean graph domain, meta-learning has become a successful and predominant paradigm. More recently, inspired by the development of graph self-supervised learning, transferring pretrained node embeddings for few-shot node classification could be a promising alternative to meta-learning but remains unexposed. In this work, we empirically demonstrate the potential of an alternative framework, textitTransductive Linear Probing, that transfers pretrained node embeddings, which are learned from graph contrastive learning methods. We further extend the setting of few-shot node classification from standard fully supervised to a more realistic self-supervised setting, where meta-learning methods cannot be easily deployed due to the shortage of supervision from training classes. Surprisingly, even without any ground-truth labels, transductive linear probing with self-supervised graph contrastive pretraining can outperform the state-of-the-art fully supervised meta-learning based methods under the same protocol. We hope this work can shed new light on few-shot node classification problems and foster future research on learning from scarcely labeled instances on graphs.

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). Builds on 42 of its 58 references that are in the map. First posted on arXiv 11 Dec 2022.

Builds on

42 of 58 references.

References · 42

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Graph Attention Networkscited by 8,854
  5. 2017Inductive Representation Learning on Large Graphscited by 6,284
  6. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  7. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  8. 2018How Powerful are Graph Neural Networks?cited by 4,355
  9. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  10. 2020Supervised Contrastive Learningcited by 2,803
  11. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  12. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
30 more
  1. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  2. 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,139
  3. 2018On First-Order Meta-Learning Algorithmscited by 1,003
  4. 2018Pitfalls of Graph Neural Network Evaluationcited by 994
  5. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
  6. 2020Contrastive Multi-View Representation Learning on Graphscited by 651
  7. 2020Deep Graph Contrastive Representation Learningcited by 535
  8. 2020Rethinking Few-Shot Image Classification: a Good Embedding Is All You Need?cited by 435
  9. 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
  10. 2019A Baseline for Few-Shot Image Classificationcited by 298
  11. 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
  12. 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 184
  13. 2022Data Augmentation for Deep Graph Learning: A Surveycited by 132
  14. 2021Self-supervised Graph-level Representation Learning with Local and Global Structurecited by 125
  15. 2021An Empirical Study of Graph Contrastive Learningcited by 113
  16. 2019Meta-GNN: On Few-shot Node Classification in Graph Meta-learningcited by 105
  17. 2015Inferring Networks of Substitutable and Complementary Productscited by 91
  18. 2020Graph Prototypical Networks for Few-shot Learning on Attributed Networkscited by 90
  19. 2020Graph Meta Learning via Local Subgraphscited by 89
  20. 2021Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learningcited by 70
  21. 2022Task-Adaptive Few-shot Node Classificationcited by 43
  22. 2021Graph Few-shot Class-incremental Learningcited by 40
  23. 2019Learning to Propagate for Graph Meta-Learningcited by 29
  24. 2022Graph Few-shot Learning with Task-specific Structurescited by 26
  25. 2021Meta Propagation Networks for Graph Few-shot Semi-supervised Learningcited by 25
  26. 2022FAITH: Few-Shot Graph Classification with Hierarchical Task Graphscited by 22
  27. 2022Eliciting Structural and Semantic Global Knowledge in Unsupervised Graph Contrastive Learningcited by 20
  28. 2020Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network Embeddingcited by 19
  29. 2022Few-Shot Learning on Graphscited by 11
  30. 2022Supervised Graph Contrastive Learning for Few-shot Node Classificationcited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 11; 2024: 6; 2025: 4; 2026: 3.

24 papers.

Sort:

By area:

  1. 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 239
  2. 2024GFT: Graph Foundation Model with Transferable Tree Vocabularycited by 82
  3. 2023Virtual Node Tuning for Few-shot Node Classificationcited by 46
  4. 2024Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Treescited by 30
  5. 2023A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directionscited by 15
  6. 2023Few-shot Node Classification with Extremely Weak Supervisioncited by 14
  7. 2023Contrastive Meta-Learning for Few-shot Node Classificationcited by 11
  8. 2023Federated Few-shot Learningcited by 9
  9. 2023Task-Equivariant Graph Few-shot Learningcited by 8
  10. 2025Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transportcited by 6
  11. 2025Dual-level Mixup for Graph Few-shot Learning with Fewer Taskscited by 5
  12. 2024Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node Classificationcited by 4
12 more
  1. 2023Inductive Linear Probing for Few-shot Node Classificationcited by 3
  2. 2023Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Taskscited by 3
  3. 2025Graph Few-Shot Learning via Adaptive Spectrum Experts and Cross-Set Distribution Calibrationcited by 3
  4. 2023Fair Few-shot Learning with Auxiliary Setscited by 2
  5. 2025Generative Risk Minimization for Out-of-Distribution Generalization on Graphscited by 2
  6. 2023Unsupervised Episode Generation for Graph Meta-learningcited by 1
  7. 2024GraphRCG: Self-Conditioned Graph Generationcited by 1
  8. 2024Cooperative Meta-Learning with Gradient Augmentationcited by 1
  9. 2026Advancing Graph Few-Shot Learning via In-Context Learningcited by 1
  10. 2024Virtual Node Generation for Node Classification in Sparsely-Labeled Graphscited by 0
  11. 2026Improving Graph Few-shot Learning with Hyperbolic Space and Denoising Diffusioncited by 0
  12. 2026Chimaera: A Mixture-of-Graph-Experts Architecture for Cross-Task and Cross-Dataset Graph Learningcited by 0