Mirage: Model-agnostic Graph Distillation for Graph Classification
Mridul Gupta, Sahil Manchanda, Hariprasad Kodamana, Sayan Ranu
摘要
GNNs, like other deep learning models, are data and computation hungry. There is a pressing need to scale training of GNNs on large datasets to enable their usage on low-resource environments. Graph distillation is an effort in that direction with the aim to construct a smaller synthetic training set from the original training data without significantly compromising model performance. While initial efforts are promising, this work is motivated by two key observations: (1) Existing graph distillation algorithms themselves rely on training with the full dataset, which undermines the very premise of graph distillation. (2) The distillation process is specific to the target GNN architecture and hyper-parameters and thus not robust to changes in the modeling pipeline. We circumvent these limitations by designing a distillation algorithm called Mirage for graph classification. Mirage is built on the insight that a message-passing GNN decomposes the input graph into a multiset of computation trees. Furthermore, the frequency distribution of computation trees is often skewed in nature, enabling us to condense this data into a concise distilled summary. By compressing the computation data itself, as opposed to emulating gradient flows on the original training set-a prevalent approach to date-Mirage transforms into an unsupervised and architecture-agnostic distillation algorithm. Extensive benchmarking on real-world datasets underscores Mirage's superiority, showcasing enhanced generalization accuracy, data compression, and distillation efficiency when compared to state-of-the-art baselines.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- GFT: Graph Foundation Model with Transferable Tree VocabularyZehong Wang, Zheyuan Zhang, Nitesh V. Chawla, Chuxu Zhang 等NeurIPS 2024 · 被引用 108 次
- Towards Pre-trained Graph Condensation via Optimal TransportYeyu Yan, Shuai Zheng, Wenjun Hui, Xiangkai Zhu 等NeurIPS 2025 · 被引用 3 次
- Backdoor Graph CondensationJiahao Wu, Ning Lu, Zeyu Dai, Kun Wang 等ICDE 2025 · 被引用 2 次
- Robust Graph Condensation via Classification Complexity MitigationJiayi Luo, Qingyun Sun, Beining Yang, Haonan Yuan 等NeurIPS 2025
- Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-TreesZehong Wang, Zheyuan Zhang, Tianyi Ma, Nitesh V. Chawla 等ICML 2025
它引用的顶会 Paper20
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong 等NeurIPS 2020 · 被引用 3,935 次
- Do Transformers Really Perform Badly for Graph Representation?Chengxuan Ying, Tianle Cai, Shengjie Luo, Shuxin Zheng 等NeurIPS 2021 · 被引用 1,632 次
- Learning to Simulate Complex Physics with Graph NetworksAlvaro Sanchez-Gonzalez, Jonathan Godwin, Tobias Pfaff, Rex Ying 等ICML 2020 · 被引用 1,439 次
- E(n) Equivariant Graph Neural NetworksVictor Garcia Satorras, Emiel Hoogeboom, Max WellingICML 2021 · 被引用 1,432 次
- Recipe for a General, Powerful, Scalable Graph TransformerLadislav Rampásek, Michael Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu 等NeurIPS 2022 · 被引用 1,216 次
相关 Paper
- Bonsai: Gradient-free Graph Condensation for Node ClassificationMridul Gupta, Samyak Jain, Vansh Ramani, Hariprasad Kodamana 等ICLR 2025
- Graph Distillation with Eigenbasis MatchingYang Liu, Deyu Bo, Chuan ShiICML 2024 · 被引用 17 次
- Simple yet Effective Graph Distillation via ClusteringYurui Lai, Taiyan Zhang, Renchi YangKDD 2025 · 被引用 1 次
- Compressing Deep Graph Neural Networks via Adversarial Knowledge DistillationHuarui He, Jie Wang, Zhanqiu Zhang, Feng WuKDD 2022 · 被引用 44 次
- Dir-GD: Directed Graph DistillationCe Yang, Fei Hao, Jie Gao, Jianrui Chen 等WWW 2026
