Pith. sign in

REVIEW 4 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

Discrete Graph Structure Learning for Forecasting Multiple Time Series

classification cs.LG stat.ML
keywords graphlearningseriesstructuretimeforecastingneuraldeep
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
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)

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

Forward citations

Cited by 4 Pith papers

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

  1. SpatialEpiBench: Benchmarking Spatial Information and Epidemic Priors in Forecasting

    cs.AI 2026-05 unverdicted novelty 7.0

    SpatialEpiBench shows adjacency-informed models with epidemic priors underperform a last-value baseline across 11 datasets from 1 day to 1 month ahead, identifying failures in outbreak anticipation, sparsity handling,...

  2. GAMMA-Net: Adaptive Long-Horizon Traffic Spatio-Temporal Forecasting Model based on Interleaved Graph Attention and Multi-Axis Mamba

    cs.AI 2026-04 unverdicted novelty 6.0

    GAMMA-Net combines Graph Attention Networks and multi-axis Mamba to outperform prior models in long-horizon traffic forecasting, with up to 16.25% lower MAE on benchmarks like METR-LA and PEMS datasets.

  3. Once-for-All: Scalable Simultaneous Forecasting via Equilibrium State Estimation

    cs.LG 2026-06 unverdicted novelty 5.0

    ESE enables simultaneous forecasting of multiple interacting systems by estimating an equilibrium state in a single pass, matching SOTA accuracy with 10-70x speedup and linear complexity.

  4. Deep Learning Surrogates for Emulating Stochastic Climate Tipping Dynamics

    cs.LG 2026-05 unverdicted novelty 5.0

    A dynamics-informed Temporal Fusion Transformer surrogate emulates stochastic tipping events in global ocean transport simulations with 465x speedup and high-fidelity timing predictions.