REVIEW 6 cited by
Graph Condensation for Graph Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 6 Pith papers
-
Geometry-Aware Dataset Condensation for Diffusion Model Training
A geometry-aware dataset condensation technique reformulates subset selection as one-sided partial optimal transport alignment plus regularization to improve diffusion model training fidelity.
-
Analytic Drift Resister for Non-Exemplar Continual Graph Learning
ADR achieves theoretically zero-forgetting class-incremental graph learning by combining backpropagation adaptation with ridge-regression-based layer-wise merging of GNN linear transformations.
-
Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms
STPGC coarsens graphs by iteratively removing dominated nodes and edges (plus a neighborhood-coning step), preserving clique-complex homotopy and yielding 8.7–37x speedups over GEC on large graphs.
-
An Efficient and Scalable Graph Condensation with Structure-Preserving
SP-ESGC decouples graph condensation into heat-kernel node condensation and pre-trained edge prediction for structure, claiming high efficiency and cross-GNN generalization on real-world datasets.
-
Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification
A multi-granularity granular-ball coarsening algorithm reduces large graphs in linear time for faster GCN training on node classification, with experiments claiming superior performance over prior methods.
-
FIT-GNN: Faster Inference Time for GNNs that 'FIT' in Memory Using Coarsening
FIT-GNN applies graph coarsening during inference to deliver orders-of-magnitude faster single-node inference and lower memory use on node and graph classification/regression tasks while keeping competitive accuracy.
Discussion (0). Sign in to comment.