Graph Coarsening via Convolution Matching for Scalable Graph Neural Network Training
Not on the map. Why?
Abstract (arXiv)
Graph summarization as a preprocessing step is an effective and complementary technique for scalable graph neural network (GNN) training. In this work, we propose the Coarsening Via Convolution Matching (CONVMATCH) algorithm and a highly scalable variant, A-CONVMATCH, for creating summarized graphs that preserve the output of graph convolution. We evaluate CONVMATCH on six real-world link prediction and node classification graph datasets, and show it is efficient and preserves prediction performance while significantly reducing the graph size. Notably, CONVMATCH achieves up to 95% of the prediction performance of GNNs on node classification while trained on graphs summarized down to 1% the size of the original graph. Furthermore, on link prediction tasks, CONVMATCH consistently outperforms all baselines, achieving up to a 2x improvement.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 27 of its 47 references that are in the map. First posted on arXiv 24 Dec 2023.
Builds on
27 of 47 references.
References · 27
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
- 2020Dataset Condensation with Gradient Matchingcited by 510
- 2021Dataset Condensation with Differentiable Siamese Augmentationcited by 290
- 2020Dataset Meta-Learning from Kernel Ridge-Regressioncited by 230
- 2018Dataset Distillationcited by 224
- 2017CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filterscited by 203
- 2021Graph Condensation for Graph Neural Networkscited by 150
15 more
- 2020DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphscited by 139
- 2019Soft-Label Dataset Distillation and Text Dataset Distillationcited by 106
- 2022Condensing Graphs via One-Step Gradient Matchingcited by 100
- 2020Flexible Dataset Distillation: Learn Labels Instead of Imagescited by 91
- 2021Scaling Up Graph Neural Networks Via Graph Coarseningcited by 80
- 2022Graph Condensation via Receptive Field Distribution Matchingcited by 60
- 2019GraphZoom: A multi-level spectral approach for accurate and scalable graph embeddingcited by 58
- 2018MILE: A Multi-Level Framework for Scalable Graph Embeddingcited by 28
- 2021Learn Locally, Correct Globally: A Distributed Algorithm for Training Graph Neural Networkscited by 24
- 2016Graph Summarization Methods and Applications: A Surveycited by 15
- 2020Faster Graph Embeddings via Coarseningcited by 15
- 2021Communication-Efficient Sampling for Distributed Training of Graph Convolutional Networkscited by 7
- 2023Simplifying Distributed Neural Network Training on Massive Graphs: Randomized Partitions Improve Model Aggregationcited by 7
- 2018COSINE: Compressive Network Embedding on Large-scale Information Networkscited by 2
- 2019Network Embedding: on Compression and Learningcited by 1
Built on by
Citing papers per year: 2024: 4; 2025: 3; 2026: 5.
12 papers.
- 2024Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partitioncited by 23
- 2024A Survey on Graph Condensationcited by 9
- 2024Graph Coarsening with Message-Passing Guaranteescited by 9
- 2025Taxonomy of reduction matrices for Graph Coarseningcited by 3
- 2025Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarseningcited by 2
- 2024FIT-GNN: Faster Inference Time for GNNs that 'FIT' in Memory Using Coarseningcited by 1
- 2026Rethinking Efficient Graph Coarsening via a Non-Selfishness Principlecited by 1
- 2025Adaptive Graph Coarsening for Efficient GNN Trainingcited by 0
- 2026Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compressioncited by 0
- 2026Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithmscited by 0
- 2026Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classificationcited by 0
- 2026CoRe-GNN: Multilevel Message passing on Coarsened graphscited by 0
- 2026CoRe-GNN: Multilevel Message passing on Coarsened graphs3 Aug 2026
- 2026Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle13 May 2026
- 2026Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification31 Mar 2026
- 2026Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms30 Jan 2026
- 2026Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression13 Jan 2026
- 2025Adaptive Graph Coarsening for Efficient GNN Training30 Sep 2025
- 2025Taxonomy of reduction matrices for Graph Coarsening13 Jun 2025
- 2025Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening20 May 2025
- 2024FIT-GNN: Faster Inference Time for GNNs that 'FIT' in Memory Using Coarsening19 Oct 2024
- 2024Graph Coarsening with Message-Passing Guarantees28 May 2024
- 2024Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition22 May 2024
- 2024A Survey on Graph Condensation3 Feb 2024