SparseRoute: Structured Sparse Variable Routing for High-Dimensional Multivariate Time Series Forecasting

Forecasting high-dimensional multivariate time series requires models to represent dependencies across variables without making variable interactions prohibitively expensive. Full attention over variable-level tokens has a pairwise cost quadratic in the number of variables; channel-independent methods avoid this cost but omit explicit cross-variable interactions. SparseRoute addresses this design choice by assigning variables to a small set of learned subspaces and applying attention to their aggregated representations. A vector-quantization routing module produces hard variable-to-subspace assignments, while a straight-through estimator supplies surrogate gradients during training. A dual-path decoder combines subspace predictions broadcast to their assigned variables with variable-level predictions from a shared multilayer perceptron. We evaluate the model with three seeds on Traffic, Electricity, Solar-Energy, PEMS04, and PEMS07. SparseRoute obtains the lowest mean MAE for Traffic at horizon 96 and the lowest mean MSE at horizon 192; Crossformer leads on several other dataset–horizon pairs. Relative to a dense variable-token model with matched tokenization and backbone, routing changes the pairwise attention factor from the square of the variable count to the square of the subspace count; this theoretical comparison does not establish an end-to-end resource advantage over the external baselines.

Authors

Institutions

Publication Details

Journal
Information
Published
2026-10-15
DOI
https://doi.org/10.3390/info17101025
Primary Topic
Time Series Analysis and Forecasting
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SparseRoute: Structured Sparse Variable Routing for High-Dimensional Multivariate Time Series Forecasting

Yu Fang, Hongcheng Zhu
Information
Time Series Analysis and Forecasting
article

SparseRoute: Structured Sparse Variable Routing for High-Dimensional Multivariate Time Series Forecasting

Yu Fang, Hongcheng Zhu
article en

Abstract

Forecasting high-dimensional multivariate time series requires models to represent dependencies across variables without making variable interactions prohibitively expensive. Full attention over variable-level tokens has a pairwise cost quadratic in the number of variables; channel-independent methods avoid this cost but omit explicit cross-variable interactions. SparseRoute addresses this design choice by assigning variables to a small set of learned subspaces and applying attention to their aggregated representations. A vector-quantization routing module produces hard variable-to-subspace assignments, while a straight-through estimator supplies surrogate gradients during training. A dual-path decoder combines subspace predictions broadcast to their assigned variables with variable-level predictions from a shared multilayer perceptron. We evaluate the model with three seeds on Traffic, Electricity, Solar-Energy, PEMS04, and PEMS07. SparseRoute obtains the lowest mean MAE for Traffic at horizon 96 and the lowest mean MSE at horizon 192; Crossformer leads on several other dataset–horizon pairs. Relative to a dense variable-token model with matched tokenization and backbone, routing changes the pairwise attention factor from the square of the variable count to the square of the subspace count; this theoretical comparison does not establish an end-to-end resource advantage over the external baselines.

InformationVol. 17(10)
Southwest Petroleum University (CN)
Openalex Percentile: Top 13%
Time Series Analysis and Forecasting
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.