GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights
<|reference_start|>GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights: Graph condensation (GC) is an emerging technique designed to learn a significantly smaller graph that retains the essential information of the original graph. This condensed graph has shown promise in accelerating graph neural networks while preserving performance comparable to those achieved with the original, larger graphs. Additionally, this technique facilitates downstream applications like neural architecture search and deepens our understanding of redundancies in large graphs. Despite the rapid development of GC methods, particularly for node classification, a unified evaluation framework is still lacking to systematically compare different GC methods or clarify key design choices for improving their effectiveness. To bridge these gaps, we introduce \textbf{GC4NC}, a comprehensive framework for evaluating diverse GC methods on node classification across multiple dimensions including performance, efficiency, privacy preservation, denoising ability, NAS effectiveness, and transferability. Our systematic evaluation offers novel insights into how condensed graphs behave and the critical design choices that drive their success. These findings pave the way for future advancements in GC methods, enhancing both performance and expanding their real-world applications. Our code is available at \url{https://github.com/Emory-Melody/GraphSlim/tree/main/benchmark}.<|reference_end|>
@article{gong2024gc4nc:,
    title={GC4NC: A Benchmark Framework for Graph Condensation on Node
  Classification with New Insights},
    author={Shengbo Gong, Juntong Ni, Noveen Sachdeva, Carl Yang, Wei Jin},
    journal={arXiv preprint arXiv:2406.16715},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.16715},
    primaryClass={cs.LG}
}