Pith. sign in

REVIEW 1 cited by

Do We Really Need Graph Neural Networks for Traffic Forecasting?

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 2301.12603 v1 pith:5L6EYQGJ submitted 2023-01-30 cs.LG cs.SI

Do We Really Need Graph Neural Networks for Traffic Forecasting?

classification cs.LG cs.SI
keywords simstgnnsspatialtrafficforecastinggraphlearningnetworks
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Spatio-temporal graph neural networks (STGNN) have become the most popular solution to traffic forecasting. While successful, they rely on the message passing scheme of GNNs to establish spatial dependencies between nodes, and thus inevitably inherit GNNs' notorious inefficiency. Given these facts, in this paper, we propose an embarrassingly simple yet remarkably effective spatio-temporal learning approach, entitled SimST. Specifically, SimST approximates the efficacies of GNNs by two spatial learning techniques, which respectively model local and global spatial correlations. Moreover, SimST can be used alongside various temporal models and involves a tailored training strategy. We conduct experiments on five traffic benchmarks to assess the capability of SimST in terms of efficiency and effectiveness. Empirical results show that SimST improves the prediction throughput by up to 39 times compared to more sophisticated STGNNs while attaining comparable performance, which indicates that GNNs are not the only option for spatial modeling in traffic forecasting.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Efficient Traffic Prediction at Scale: A Systematic Study of STGCN Architectural Depth

    cs.LG 2026-06 unverdicted novelty 5.0

    Systematic experiments on four traffic datasets find that a 1-block STGCN achieves optimal short-term (10 min) prediction on three datasets with only marginal longer-horizon degradation and 61% lower CPU latency than ...