mlsanityData to 7 Oct 2026

Mirage: Model-Agnostic Graph Distillation for Graph Classification

arXiv 2310.09486 ↗First posted 14 Oct 2023cs.LG cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 26 of its 45 references that are in the map. First posted on arXiv 14 Oct 2023.

Builds on

26 of 45 references.

References · 26

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2018How Powerful are Graph Neural Networks?cited by 4,355
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  6. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  7. 2021E(n) Equivariant Graph Neural Networkscited by 951
  8. 2020Learning to Simulate Complex Physics with Graph Networkscited by 867
  9. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
  10. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
  11. 2020Dataset Condensation with Gradient Matchingcited by 510
  12. 2022DiGress: Discrete Denoising diffusion for graph generationcited by 503
14 more
  1. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
  2. 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 406
  3. 2023Exphormer: Sparse Transformers for Graphscited by 166
  4. 2021Graph Condensation for Graph Neural Networkscited by 150
  5. 2022Condensing Graphs via One-Step Gradient Matchingcited by 100
  6. 2020GraphGen: A Scalable Approach to Domain-agnostic Labeled Graph Generationcited by 65
  7. 2021Graph Coarsening with Neural Networkscited by 55
  8. 2023Does Graph Distillation See Like Vision Dataset Counterpart?cited by 45
  9. 2020Graph-Based Continual Learningcited by 24
  10. 2022Learning Articulated Rigid Body Dynamics with Lagrangian Graph Neural Networkcited by 22
  11. 2022Enhancing the Inductive Biases of Graph Neural ODE for Modeling Dynamical Systemscited by 20
  12. 2022TIGGER: Scalable Generative Modelling for Temporal Interaction Graphscited by 18
  13. 2023FRIGATE: Frugal Spatio-temporal Forecasting on Road Networkscited by 14
  14. 2019Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transportcited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 8; 2025: 3; 2026: 2.

13 papers.

Sort: