Pith. sign in

REVIEW 1 cited by

GCondenser: Benchmarking Graph Condensation

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

arxiv 2405.14246 v3 pith:F55EXFS3 submitted 2024-05-23 cs.LG

classification cs.LG
keywords gcondensergraphcondensationmethodscomprehensiveeffectivenessgraphslarge-scale
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large-scale graphs are valuable for graph representation learning, yet the abundant data in these graphs hinders the efficiency of the training process. Graph condensation (GC) alleviates this issue by compressing the large graph into a significantly smaller one that still supports effective model training. Although recent research has introduced various approaches to improve the effectiveness of the condensed graph, comprehensive and practical evaluations across different GC methods are neglected. This paper proposes the first large-scale graph condensation benchmark, GCondenser, to holistically evaluate and compare mainstream GC methods. GCondenser includes a standardised GC paradigm, consisting of condensation, validation, and evaluation procedures, as well as enabling extensions to new GC methods and datasets. With GCondenser, a comprehensive performance study is conducted, presenting the effectiveness of existing methods. GCondenser is open-sourced and available at https://github.com/superallen13/GCondenser.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Random Walk Guided Hyperbolic Graph Distillation

    cs.LG 2025-01 conditional novelty 6.0 of 10

    HyDRO distills graphs in hyperbolic space with random-walk spectral gap matching, improving link prediction and continual graph learning.

Pith tools