Simple Graph Condensation
Abstract
The burdensome training costs on large-scale graphs have aroused significant interest in graph condensation, which involves tuning Graph Neural Networks (GNNs) on a small condensed graph for use on the large-scale original graph. Existing methods primarily focus on aligning key metrics between the condensed and original graphs, such as gradients, output distribution and trajectories of GNNs, satisfactory performance on downstream tasks. However, these complex metrics necessitate intricate external parameters and can potentially disrupt the optimization process of the condensation graph, making the condensation process highly demanding and unstable. This straightforward yet effective strategy achieves a significant speedup of up to 10 times compared to existing graph condensation methods while performing on par with state-of-the-art baselines. Comprehensive experiments conducted on seven benchmark datasets demonstrate the effectiveness of SimGC in prediction accuracy, condensation time, and generalization capability. Our code is available at.
Benchmark Results
Tested on 4 datasets 6 baseline values reported too low Non-standard metric on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 | |
| 522 | SimGC | 0.8210
±0.0130 | This paper |
| 523 | Random | 0.8209
±0.0008 best reported | best at pub: NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search (NeurIPS 2022) |
| 560 | SFGC | 0.8170
±0.0050 | This paper |
| 615 | GCond | 0.8090
±0.0320 best reported | best at pub: Two Trades are not Baffled: Condensing Graph via Crafting Rational Gradient Matching (2024) best today: TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks (2024) Difference within reported uncertainty; not counted as underperformance. |
| 629 | SGDD | 0.8060
±0.0080 | This paper |
| 683 | GCDM | 0.7940
±0.0010 | This paper |
| 724 | MLP | 0.7768 | |
| 742 | Herding | 0.7680
±0.0010 | This paper |
| 743 | K-Center | 0.7670
±0.0010 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 44 | GCN | 0.8033
±0.0088 | |
| 244 | SimGC | 0.7380
±0.0250 | This paper |
| 350 | MLP | 0.7289
±0.0010 | |
| 415 | SFGC | 0.7240
±0.0040 | |
| 487 | Whole Dataset | 0.7170
±0.0010 | This paper |
| 572 | GCond | 0.7080
±0.0450 best reported | best at pub: Condensing Graphs via One-Step Gradient Matching (KDD 2022) best today: TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks (2024) Difference within reported uncertainty; not counted as underperformance. |
| 593 | Random | 0.7049
±0.0008 best reported | best at pub: NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search (NeurIPS 2022) |
| 606 | SGDD | 0.7030
±0.0170 | This paper |
| 632 | GCDM | 0.6980
±0.0020 | This paper |
| 650 | K-Center | 0.6910
±0.0010 | |
| 651 | Herding | 0.6900
±0.0010 |
Sorted by Accuracy. Highlighted rows are from other papers.
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GAP-EDP | 0.9870
±0.0003 | |
| 2 | NE-ASGCN | 0.9758
±0.0027 | |
| 3 | HSGT | 0.9730
±0.0024 | |
| 21 | GraphSAGE | 0.9653
±0.0011 | |
| 89 | Whole Dataset | 0.9350
±0.0010 | This paper |
| 105 | SGDD | 0.9180
±0.0190 best reported | best at pub: Graph Distillation with Eigenbasis Matching (ICML 2023) |
| 110 | SimGC | 0.9140
±0.0020 | This paper |
| 113 | Random | 0.9110 best reported | |
| 120 | GCond | 0.9030
±0.0310 best reported | best at pub: Graph Condensation for Inductive Node Representation Learning (2023) best today: TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks (2024) |
| 124 | GCDM | 0.8970
±0.0020 best reported | best at pub: Disentangled Condensation for Large-scale Graphs (WWW 2024) |
| 125 | SFGC | 0.8970
±0.0020 best reported | best at pub: Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data (NeurIPS 2023) best today: Graph Distillation with Eigenbasis Matching (ICML 2023) Difference within reported uncertainty; not counted as underperformance. |
| 147 | MLP | 0.8240
±0.0010 | |
| 153 | Herding | 0.7140
±0.0160 | This paper |
| 161 | K-Center | 0.5740
±0.0180 | This paper |
OGB
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Jacobi | 0.8968 | |
| 2 | GPR | 0.8953 | |
| 3 | LEMP4HG | 0.8939 | |
| 4 | SAGE | 0.8933 | |
| 298 | Whole Dataset | 0.7400
±0.0010 | This paper |
| 334 | Random | 0.7040
±0.0060 best reported | best at pub: Label-free Node Classification on Graphs with Large Language Models (LLMs) (ICLR 2023) |
| 347 | SimGC | 0.6700
±0.0070 | This paper |
| 351 | MLP | 0.6605
±0.0020 | |
| 360 | SFGC | 0.6440
±0.0040 | This paper |
| 365 | K-Center | 0.6240
±0.0050 | This paper |
| 375 | SGDD | 0.5930
±0.0170 | This paper |
| 376 | Herding | 0.5910
±0.0010 | This paper |
| 380 | GCond | 0.5640
±0.0100 | This paper |
| 385 | GCDM | 0.5350
±0.0110 | This paper |
