Position: Graph Condensation Needs a Reset -- Move Beyond Full-dataset Training and Model-Dependence
Mridul Gupta, Samyak Jain, Vansh Ramani, Hariprasad Kodamana, Sayan Ranu

TL;DR
This paper critiques current graph condensation methods for GNNs, highlighting systemic flaws and advocating for lightweight, architecture-agnostic approaches that enable scalable and practical GNN training.
Contribution
It identifies key methodological flaws in existing graph condensation techniques and proposes a research agenda for developing more efficient, generalizable, and deployable solutions.
Findings
Current methods require full-dataset training, undermining efficiency.
Existing approaches have high computational overhead and poor generalization.
Evaluation protocols often misrepresent resource savings.
Abstract
Graph Neural Networks (GNNs) are powerful tools for learning from graph-structured data, but their scalability is increasingly strained by the size of real-world graphs in domains like recommender systems, fraud detection, and molecular biology. Graph condensation -- the task of generating a smaller synthetic graph that retains the performance of models trained on the original -- has emerged as a promising solution. However, the dominant approach of gradient matching introduces a fundamental contradiction: it requires training on the full dataset to create the compressed version, thereby undermining the goal of efficiency. Worse still, these methods suffer from high computational overhead, poor generalization across GNN architectures, and brittle reliance on specific model configurations. Equally concerning is the community's reliance on misleading evaluation protocols such as node…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
