mlsanityData to 14 Oct 2026

LOBSTUR: A Local Bootstrap Framework for Tuning Unsupervised Representations in Graph Neural Networks

arXiv 2505.14867 ↗First posted 20 May 2025stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) are increasingly used in conjunction with unsupervised learning techniques to learn powerful node representations, but their deployment is hindered by their high sensitivity to hyperparameter tuning and the absence of established methodologies for selecting the optimal models. To address these challenges, we propose LOBSTUR-GNN (bf Local bf Bootbf strap for bf Tuning bf Unsupervised bf Representations in GNNs) i), a novel framework designed to adapt bootstrapping techniques for unsupervised graph representation learning. LOBSTUR-GNN tackles two main challenges: (a) adapting the bootstrap edge and feature resampling process to account for local graph dependencies in creating alternative versions of the same graph, and (b) establishing robust metrics for evaluating learned representations without ground-truth labels. Using locally bootstrapped resampling and leveraging Canonical Correlation Analysis (CCA) to assess embedding consistency, LOBSTUR provides a principled approach for hyperparameter tuning in unsupervised GNNs. We validate the effectiveness and efficiency of our proposed method through extensive experiments on established academic datasets, showing an 65.9% improvement in the classification accuracy compared to an uninformed selection of hyperparameters. Finally, we deploy our framework on a real-world application, thereby demonstrating its validity and practical utility in various settings. footnoteThe code is available at hrefhttps://github.com/sowonjeong/lobstur-graph-bootstrapgithub.com/sowonjeong/lobstur-graph-bootstrap.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 55 references that are in the map. First posted on arXiv 20 May 2025.

Builds on

22 of 55 references.

References · 22

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  3. 2016Variational Graph Auto-Encoderscited by 1,382
  4. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  5. 2020Deep Graph Contrastive Representation Learningcited by 539
  6. 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 378
  7. 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 186
  8. 2021On Feature Decorrelation in Self-Supervised Learningcited by 160
  9. 2022RankMe: Assessing the downstream performance of pretrained self-supervised representations by their rankcited by 153
  10. 2021From Canonical Correlation Analysis to Self-supervised Graph Neural Networkscited by 141
  11. 2023Uncertainty Quantification over Graph with Conformalized Graph Neural Networkscited by 79
  12. 2021Cross-validation: what does it estimate and how well does it do it?cited by 65
10 more
  1. 2016Network cross-validation by edge samplingcited by 26
  2. 2014Network Cross-Validation for Determining the Number of Communities in Network Datacited by 21
  3. 2023Data thinning for convolution-closed distributionscited by 13
  4. 2019Bootstrapping Networks with Latent Space Structurecited by 12
  5. 2021Asymptotics of Network Embeddings Learned via Subsamplingcited by 10
  6. 2023Unsupervised Embedding Quality Evaluationcited by 9
  7. 2017Estimating the number of clusters using cross-validationcited by 6
  8. 2018Network estimation via graphon with node featurescited by 3
  9. 2022Graph Neural Networks for Microbial Genome Recoverycited by 1
  10. 2024Graph fission and cross-validationcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.