dorsal/arxiv
View SchemaPLGC: Pseudo-Labeled Graph Condensation
| Authors | Jay Nandy, Arnab Kumar Mondal, Anuj Rathore, Mahesh Chandran |
|---|---|
| Categories | |
| ArXiv ID | 2601.10358vv1 |
| URL | https://arxiv.org/abs/2601.10358 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Large graph datasets make training graph neural networks (GNNs) computationally costly. Graph condensation methods address this by generating small synthetic graphs that approximate the original data. However, existing approaches rely on clean, supervised labels, which limits their reliability when labels are scarce, noisy, or inconsistent. We propose Pseudo-Labeled Graph Condensation (PLGC), a self-supervised framework that constructs latent pseudo-labels from node embeddings and optimizes condensed graphs to match the original graph's structural and feature statistics -- without requiring ground-truth labels. PLGC offers three key contributions: (1) A diagnosis of why supervised condensation fails under label noise and distribution shift. (2) A label-free condensation method that jointly learns latent prototypes and node assignments. (3) Theoretical guarantees showing that pseudo-labels preserve latent structural statistics of the original graph and ensure accurate embedding alignment. Empirically, across node classification and link prediction tasks, PLGC achieves competitive performance with state-of-the-art supervised condensation methods on clean datasets and exhibits substantial robustness under label noise, often outperforming all baselines by a significant margin. Our findings highlight the practical and theoretical advantages of self-supervised graph condensation in noisy or weakly-labeled environments.
{
"annotation_id": "6e844fce-5938-475b-88ec-1e7a3e81aeab",
"date_created": "2026-02-17T05:53:23.980000Z",
"date_modified": "2026-02-17T05:53:23.980000Z",
"file_hash": "4795cb3837220d5d6e9cb59d49b6bfa6d4c27d1cd94ff073815344345c39b28a",
"private": false,
"record": {
"abstract": "Large graph datasets make training graph neural networks (GNNs) computationally costly. Graph condensation methods address this by generating small synthetic graphs that approximate the original data. However, existing approaches rely on clean, supervised labels, which limits their reliability when labels are scarce, noisy, or inconsistent. We propose Pseudo-Labeled Graph Condensation (PLGC), a self-supervised framework that constructs latent pseudo-labels from node embeddings and optimizes condensed graphs to match the original graph\u0027s structural and feature statistics -- without requiring ground-truth labels. PLGC offers three key contributions: (1) A diagnosis of why supervised condensation fails under label noise and distribution shift. (2) A label-free condensation method that jointly learns latent prototypes and node assignments. (3) Theoretical guarantees showing that pseudo-labels preserve latent structural statistics of the original graph and ensure accurate embedding alignment. Empirically, across node classification and link prediction tasks, PLGC achieves competitive performance with state-of-the-art supervised condensation methods on clean datasets and exhibits substantial robustness under label noise, often outperforming all baselines by a significant margin. Our findings highlight the practical and theoretical advantages of self-supervised graph condensation in noisy or weakly-labeled environments.",
"arxiv_id": "2601.10358",
"authors": [
"Jay Nandy",
"Arnab Kumar Mondal",
"Anuj Rathore",
"Mahesh Chandran"
],
"categories": [
"cs.LG"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "PLGC: Pseudo-Labeled Graph Condensation",
"url": "https://arxiv.org/abs/2601.10358",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e962f3ee-e2c1-4595-a8b9-b77cad41cc6e",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}