Pith. sign in

REVIEW 4 cited by

Effectively Modeling Time Series with Simple Discrete State Spaces

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 2303.09489 v1 pith:VTQCHYLS submitted 2023-03-16 cs.LG cs.AI

classification cs.LGcs.AI
keywords timeseriespriorprocessesspacetimecompanionintroducelong
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Time series modeling is a well-established problem, which often requires that methods (1) expressively represent complicated dependencies, (2) forecast long horizons, and (3) efficiently train over long sequences. State-space models (SSMs) are classical models for time series, and prior works combine SSMs with deep learning layers for efficient sequence modeling. However, we find fundamental limitations with these prior approaches, proving their SSM representations cannot express autoregressive time series processes. We thus introduce SpaceTime, a new state-space time series architecture that improves all three criteria. For expressivity, we propose a new SSM parameterization based on the companion matrix -- a canonical representation for discrete-time processes -- which enables SpaceTime's SSM layers to learn desirable autoregressive processes. For long horizon forecasting, we introduce a "closed-loop" variation of the companion SSM, which enables SpaceTime to predict many future time-steps by generating its own layer-wise inputs. For efficient training and inference, we introduce an algorithm that reduces the memory and compute of a forward pass with the companion matrix. With sequence length $\ell$ and state-space size $d$, we go from $\tilde{O}(d \ell)$ na\"ively to $\tilde{O}(d + \ell)$. In experiments, our contributions lead to state-of-the-art results on extensive and diverse benchmarks, with best or second-best AUROC on 6 / 7 ECG and speech time series classification, and best MSE on 14 / 16 Informer forecasting tasks. Furthermore, we find SpaceTime (1) fits AR($p$) processes that prior deep SSMs fail on, (2) forecasts notably more accurately on longer horizons than prior state-of-the-art, and (3) speeds up training on real-world ETTh1 data by 73% and 80% relative wall-clock time over Transformers and LSTMs.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Parallel Scan Recurrent Neural Quantum States for Scalable Variational Monte Carlo

    cond-mat.str-el 2026-05 conditional novelty 7.0 of 10

    PSR-NQS makes recurrent neural quantum states scalable for variational Monte Carlo by using parallel scan recurrence, reaching accurate results on 52x52 two-dimensional lattices.

  2. CTF4Nuclear: Common Task Framework for Nuclear Fission and Fusion Models

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    CTF4Nuclear proposes a common task framework for benchmarking ML methods on nuclear engineering datasets using 12 metrics and a new sparse-measurement system monitoring paradigm.

  3. Horizon Activation Mapping for Neural Networks in Time Series Forecasting

    cs.LG 2026-01 reject novelty 6.0 of 10

    A grad-CAM-inspired visualization that masks the forecast horizon to show gradient activity for causal and anti-causal subseries, applied to seven model families.

  4. Common Task Framework For a Critical Evaluation of Scientific Machine Learning Algorithms

    cs.CE 2025-10 conditional novelty 5.0 of 10

    The paper introduces a Common Task Framework for scientific ML, benchmarks it on Kuramoto-Sivashinsky and Lorenz systems, and launches a competition on a global sea surface temperature dataset with holdout data.

Pith tools