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 https://github.com/Emory-Melody/GraphSlim/tree/main/benchmark.
Bonsai: Gradient-free Graph Condensation for Node Classification
Yardi School of Artificial Intelligence(亚迪人工智能学院);Department of Computer Science(计算机科学系);Department of Chemical Engineering(化学工程系);Indian Institute of Technology Delhi(德里印度理工学院)
College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院);Key Laboratory of Advanced Design and Intelligent Computing, Dalian University(大连大学先进设计与智能计算重点实验室);School of Computing Technologies, RMIT University(RMIT大学计算技术学院);Guangdong Institute of Smart Education, Jinan University(暨南大学广东智慧教育研究院)
SUSTech(南方科技大学);The Hong Kong Polytechnic University(香港理工大学);Hong Kong University of Science and Technology(香港科技大学);University of Science and Technology of China(中国科学技术大学)
School of Electrical Engineering and Computer Science, the University of Queensland(昆士兰大学电气工程与计算机科学学院);School of Computer Science, Beijing University of Posts and Telecommunications(北京邮电大学计算机学院);Center for Machine Learning Research, Peking University(北京大学机器学习研究中心)
Graph Condensation for Inductive Node Representation Learning
The University of Queensland(昆士兰大学);German Research Centre for Artificial Intelligence (DFKI)(德国人工智能研究中心);Peking University(北京大学);National Engineering Laboratory for Big Data Analysis and Applications(大数据分析与应用国家工程实验室);Griffith University(格里菲斯大学);University of Electronic Science and Technology of China(电子科技大学)
An overview of condensation phenomenon in deep learning
School of Mathematical Sciences, Institute of Natural Sciences, MOE-LSC, Shanghai Jiao Tong University(上海交通大学数学科学学院、自然科学研究院、教育部科学与工程计算重点实验室);School of Artificial Intelligence, Shanghai Jiao Tong University(上海交通大学人工智能学院)
Position: Graph Condensation Needs a Reset -- Move Beyond Full-dataset Training and Model-Dependence
Yardi School of Artificial Intelligence, IIT Delhi, India(印度德里理工学院Yardi人工智能学院);Department of Computer Science and Engineering, IIT Delhi, India(印度德里理工学院计算机科学与工程系);Department of Chemical Engineering, IIT Delhi, India(印度德里理工学院化学工程系);Indian Institute of Technology Delhi, Abu Dhabi, Zayed City, Abu Dhabi, UAE(印度德里理工学院阿布扎赫德分校,扎耶德城,阿布扎赫德,阿联酋)