Pith. sign in

REVIEW 1 cited by

Discrete Graph Structure Learning for Forecasting Multiple Time Series

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 2101.06861 v3 pith:EP7KBDW4 submitted 2021-01-18 cs.LG stat.ML

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

Time series forecasting is an extensively studied subject in statistics, economics, and computer science. Exploration of the correlation and causation among the variables in a multivariate time series shows promise in enhancing the performance of a time series model. When using deep neural networks as forecasting models, we hypothesize that exploiting the pairwise information among multiple (multivariate) time series also improves their forecast. If an explicit graph structure is known, graph neural networks (GNNs) have been demonstrated as powerful tools to exploit the structure. In this work, we propose learning the structure simultaneously with the GNN if the graph is unknown. We cast the problem as learning a probabilistic graph model through optimizing the mean performance over the graph distribution. The distribution is parameterized by a neural network so that discrete graphs can be sampled differentiably through reparameterization. Empirical evaluations show that our method is simpler, more efficient, and better performing than a recently proposed bilevel learning approach for graph structure learning, as well as a broad array of forecasting models, either deep or non-deep learning based, and graph or non-graph based.

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. Beyond Attention: Learning Spatio-Temporal Dynamics with Emergent Interpretable Topologies

    cs.LG 2025-06 conditional novelty 4.0 of 10

    InterGAT replaces per-step attention with a static, learnable interaction matrix, reporting better traffic forecasts, faster training, and interpretable community structure than its GAT-GRU baseline.

Pith tools