Given the prevalence of large-scale graphs in real-world applications, the storage and time for training neural models have raised increasing concerns. To alleviate the concerns, we propose and study the problem of graph condensation for graph neural networks (GNNs). Specifically, we aim to condense the large, original graph into a small, synthetic and highly-informative graph, such that GNNs trained on the small graph and large graph have comparable performance. We approach the condensation problem by imitating the GNN training trajectory on the original graph through the optimization of a gradient matching loss and design a strategy to condense node futures and structural information simultaneously. Extensive experiments have demonstrated the effectiveness of the proposed framework in condensing different graph datasets into informative smaller graphs. In particular, we are able to approximate the original test accuracy by 95.3% on Reddit, 99.8% on Flickr and 99.0% on Citeseer, while reducing their graph size by more than 99.9%, and the condensed graphs can be used to train various GNN architectures.Code is released at https://github.com/ChandlerBang/GCond.
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(德里印度理工学院)
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(电子科技大学)
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(北京大学机器学习研究中心)
Institute of Information Science, Beijing Jiaotong University(信息科学学院,北京交通大学);Visual Intelligence + X International Joint Laboratory of the Ministry of Education(教育部视觉智能+X国际联合实验室);Medical Big Data Research Center, Chinese PLA General Hospital Beijing, 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(机器学习研究中心,北京大学);School of Computer Science, Peking University(计算机科学学院,北京大学)
Rethinking Federated Graph Learning: A Data Condensation Perspective
Computer Network Information Center, Chinese Academy of Sciences(中国科学院计算机网络信息中心);University of Chinese Academy of Sciences(中国科学院大学);Beijing Institute of Technology(北京理工大学);Sun Yat-sen University(中山大学)
EXGC: Bridging Efficiency and Explainability in Graph Condensation
University of Science and Technology of China(中国科学技术大学);Hunan University(湖南大学);Tongji University(同济大学);National University of Singapore(新加坡国立大学);Institute of Dataspace(数据空间研究院)
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(暨南大学广东智慧教育研究院)
Artificial neural networks condensation: A strategy to facilitate adaption of machine learning in medical settings by reducing computational burden
Computer Science and Artificial Intelligence Laboratory, MIT(麻省理工学院计算机科学与人工智能实验室);Department of Nuclear Science and Engineering, MIT(麻省理工学院核科学与工程系);Harvard Medical School(哈佛医学院);Boston Children’s Hospital(波士顿儿童医院);Department of Physics, MIT(麻省理工学院物理系)
Two Trades is not Baffled: Condensing Graph via Crafting Rational Gradient Matching
National University of Singapore(新加坡国立大学);A*STAR Centre for Frontier AI Research (CFAR)(新加坡科技研究局前沿人工智能研究中心);Shanghai AI Laboratory(上海人工智能实验室);University of Nevada, Reno(内华达大学雷诺分校)
High Pileup Particle Tracking with Object Condensation
Princeton University(普林斯顿大学);Institute for Research and Innovation in Software for High Energy Physics (IRIS-HEP)(高能物理软件研究与创新研究所(IRIS-HEP));Delhi Technological University(德里理工大学);University of Chicago(芝加哥大学);Georgia Tech(佐治亚理工学院)
Robust Graph Condensation via Classification Complexity Mitigation
SKLCCSE, School of Computer Science and Engineering, Beihang University(北京航空航天大学信息与电子技术学院);Laboratory for Foundations of Computer Science, University of Edinburgh(爱丁堡大学计算机科学基础实验室);Key Lab of Education Blockchain and Intelligent Technology, Guangxi Normal University(广西师范大学教育区块链与智能技术重点实验室);Gaoling School of Artificial Intelligence, Renmin University of China(中国人民大学光荣人工智能学院);Department of Computer Science, University of Illinois, Chicago(伊利诺伊大学芝加哥分校计算机科学系)
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(上海交通大学人工智能学院)
Transferable Graph Condensation from the Causal Perspective
Southwestern University of Finance and Economics(西南财经大学);Tsinghua University(清华大学);Ant Group(蚂蚁集团);Dongbei University of Finance and Economics(东北财经大学);Emory University(埃默里大学);Xiangjiang Laboratory(湘江实验室)
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(印度德里理工学院阿布扎赫德分校,扎耶德城,阿布扎赫德,阿联酋)
DANCE: Dynamic, Available, Neighbor-gated Condensation for Federated Text-Attributed Graphs
Department of Computer Science, Beijing Institute of Technology, Beijing, China(北京理工大学计算机科学系);The Hong Kong University of Science and Technology (GZ), Guangzhou, China(香港科技大学(广州))