GraphSculptor: Sculpting Pre-training Coreset for Graph Self-supervised Learning
Not on the map. Why?
Abstract (arXiv)
Graph self-supervised learning typically relies on large-scale unlabeled datasets, heavily inflating computational costs. However, empirical evidence suggests that these datasets contain substantial redundancy-our analysis reveals that uniformly subsampling 50% of graphs retains over 96% of downstream performance. To exploit this redundancy, we introduce GraphSculptor for pre-training coreset construction. Unlike methods dependent on additional training-time signals or limited solely to topological statistics, GraphSculptor provides a label-free solution that constructs coresets via two complementary perspectives: intrinsic structure and contextual semantics. Concretely, structural diversity is quantified using intrinsic graph statistics, yielding a structural feature vector for each graph, while semantic diversity is captured by utilizing a pre-trained language model to encode descriptions generated via graph-to-text. GraphSculptor integrates these signals into a unified metric space and performs cluster-aware selection to preserve joint structural-semantic diversity. We further derive a theoretical bound on the loss gap between coreset and full-data pre-training, offering theoretical motivation for our selection formulation. Extensive experiments demonstrate that GraphSculptor effectively sculpts the dataset: a 10% coreset achieves 99.6% of full-data performance while reducing pre-training time by nearly 90%, offering a scalable solution for data-efficient graph pre-training.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 33 references that are in the map. First posted on arXiv 2 May 2026.
Builds on
26 of 33 references.
References · 26
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,404
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 443
- 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
- 2021Graph Condensation for Graph Neural Networkscited by 150
- 2023GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learnercited by 131
- 2022Condensing Graphs via One-Step Gradient Matchingcited by 100
14 more
- 2023BioT5: Enriching Cross-modal Integration in Biology with Chemical Knowledge and Natural Language Associationscited by 100
- 2022What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoderscited by 82
- 2023Rethinking Tokenizer and Decoder in Masked Graph Modeling for Moleculescited by 49
- 2023Does Graph Distillation See Like Vision Dataset Counterpart?cited by 45
- 2022A Survey of Pretraining on Graphs: Taxonomy, Methods, and Applicationscited by 23
- 2024Rethinking Graph Masked Autoencoders through Alignment and Uniformitycited by 22
- 2023GiGaMAE: Generalizable Graph Masked Autoencoder via Collaborative Latent Space Reconstructioncited by 21
- 2023Better with Less: A Data-Active Perspective on Pre-Training Graph Neural Networkscited by 14
- 2023Mirage: Model-Agnostic Graph Distillation for Graph Classificationcited by 13
- 2024Beyond Efficiency: Molecular Data Pruning for Enhanced Generalizationcited by 9
- 2024GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruningcited by 8
- 2024Where to Mask: Structure-Guided Masking for Graph Masked Autoencoderscited by 7
- 2025Graph Positional Autoencoders as Self-supervised Learnerscited by 3
- 2024Hi-GMAE: Hierarchical Graph Masked Autoencoderscited by 1
Built on by
Not cited yet.