Pith. sign in

REVIEW 3 cited by

EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs

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 1902.10191 v3 pith:TYL4MSQI submitted 2019-02-26 cs.LG cs.SIstat.ML

classification cs.LGcs.SIstat.ML
keywords graphnodeevolvegcnapproachembeddingsnetworksneuralapproaches
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph representation learning resurges as a trending research subject owing to the widespread use of deep learning for Euclidean data, which inspire various creative designs of neural networks in the non-Euclidean domain, particularly graphs. With the success of these graph neural networks (GNN) in the static setting, we approach further practical scenarios where the graph dynamically evolves. Existing approaches typically resort to node embeddings and use a recurrent neural network (RNN, broadly speaking) to regulate the embeddings and learn the temporal dynamics. These methods require the knowledge of a node in the full time span (including both training and testing) and are less applicable to the frequent change of the node set. In some extreme scenarios, the node sets at different time steps may completely differ. To resolve this challenge, we propose EvolveGCN, which adapts the graph convolutional network (GCN) model along the temporal dimension without resorting to node embeddings. The proposed approach captures the dynamism of the graph sequence through using an RNN to evolve the GCN parameters. Two architectures are considered for the parameter evolution. We evaluate the proposed approach on tasks including link prediction, edge classification, and node classification. The experimental results indicate a generally higher performance of EvolveGCN compared with related approaches. The code is available at \url{https://github.com/IBM/EvolveGCN}.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. T-GRAB: A Synthetic Diagnostic Benchmark for Learning on Temporal Graphs

    cs.LG 2025-07 conditional novelty 7.0 of 10

    T-GRAB, a set of three synthetic temporal-graph tasks, shows that no current TGNN reliably does counting, delayed cause-effect, or long-range spatio-temporal reasoning.

  2. K-STEMIT: Knowledge-Informed Spatio-Temporal Efficient Multi-Branch Graph Neural Network for Subsurface Stratigraphy Thickness Estimation from Radar Data

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    K-STEMIT reduces RMSE by 21% for subsurface stratigraphy thickness estimation from radar data via a knowledge-informed spatio-temporal GNN with adaptive feature fusion and physical priors from the MAR weather model.

  3. GRIT: Graph Transformer For Internal Ice Layer Thickness Prediction

    cs.LG 2025-07 conditional novelty 4.0 of 10

    GRIT, a graph transformer using GraphSAGE and temporal attention, predicts deep ice layer thickness from shallow layers with RMSE 3.06 m, slightly better than prior GNN baselines.

Pith tools