mlsanityData to 14 Oct 2026

Topology-Aware Active Learning on Graphs

arXiv 2510.25892 ↗First posted 29 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a graph-topological approach to active learning that directly targets the core challenge of exploration versus exploitation under scarce label budgets. To guide exploration, we introduce a coreset construction algorithm based on Balanced Forman Curvature (BFC), which selects representative initial labels that reflect the graph's cluster structure. This method includes a data-driven stopping criterion that signals when the graph has been sufficiently explored. We further use BFC to dynamically trigger the shift from exploration to exploitation within active learning routines, replacing hand-tuned heuristics. To improve exploitation, we introduce a localized graph rewiring strategy that efficiently incorporates multiscale information around labeled nodes, enhancing label propagation while preserving sparsity. Experiments on benchmark classification tasks show that our methods consistently outperform existing graph-based semi-supervised baselines at low label rates.

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

Builds on

29 of 63 references.

References · 29

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
  4. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
  5. 2019Label Propagation for Deep Semi-supervised Learningcited by 289
  6. 2018Learning to Propagate Labels: Transductive Propagation Network for Few-shot Learningcited by 211
  7. 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
  8. 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 117
  9. 2022FoSR: First-order spectral rewiring for addressing oversquashing in GNNscited by 105
  10. 2022On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networkscited by 64
  11. 2020Poisson Learning: Graph Based Semi-Supervised Learning At Very Low Label Ratescited by 49
  12. 2017Analysis of p-Laplacian Regularization in Semi-Supervised Learningcited by 39
17 more
  1. 2015A variational approach to the consistency of spectral clusteringcited by 28
  2. 2018Large Data and Zero Noise Limits of Graph-Based Semi-Supervised Learning Algorithmscited by 22
  3. 2018Properly-weighted graph Laplacian for semi-supervised learningcited by 19
  4. 2017Consistency of Lipschitz learning with infinite unlabeled data and finite labeled datacited by 15
  5. 2023Curvature-based Clustering on Graphscited by 14
  6. 2019Spectral Analysis Of Weighted Laplacians Arising In Data Clusteringcited by 11
  7. 2024Graph Pooling via Ricci Flowcited by 10
  8. 2020PTN: A Poisson Transfer Network for Semi-supervised Few-shot Learningcited by 9
  9. 2021Model-Change Active Learning in Graph-Based Semi-Supervised Learningcited by 8
  10. 2022Graph-based Active Learning for Semi-supervised Classification of SAR Datacited by 7
  11. 2023Heterophily-Aware Graph Attention Networkcited by 7
  12. 2022Poisson Reweighted Laplacian Uncertainty Sampling for Graph-based Active Learningcited by 6
  13. 2020Cautious Active Clusteringcited by 5
  14. 2021LaplaceNet: A Hybrid Graph-Energy Neural Network for Deep Semi-Supervised Classificationcited by 5
  15. 2021Multiscale Laplacian Learningcited by 5
  16. 2023Novel Batch Active Learning Approach and Its Application to Synthetic Aperture Radar Datasetscited by 4
  17. 2019Graph Interpolating Activation Improves Both Natural and Robust Accuracies in Data-Efficient Deep Learningcited by 3

Built on by

Not cited yet.