Pith. sign in

REVIEW 3 cited by

Does Long-Term Series Forecasting Need Complex Attention and Extra Long Inputs?

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 2306.05035 v3 pith:R244TSYF submitted 2023-06-08 cs.LG

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

As Transformer-based models have achieved impressive performance on various time series tasks, Long-Term Series Forecasting (LTSF) tasks have also received extensive attention in recent years. However, due to the inherent computational complexity and long sequences demanding of Transformer-based methods, its application on LTSF tasks still has two major issues that need to be further investigated: 1) Whether the sparse attention mechanism designed by these methods actually reduce the running time on real devices; 2) Whether these models need extra long input sequences to guarantee their performance? The answers given in this paper are negative. Therefore, to better copy with these two issues, we design a lightweight Period-Attention mechanism (Periodformer), which renovates the aggregation of long-term subseries via explicit periodicity and short-term subseries via built-in proximity. Meanwhile, a gating mechanism is embedded into Periodformer to regulate the influence of the attention module on the prediction results. Furthermore, to take full advantage of GPUs for fast hyperparameter optimization (e.g., finding the suitable input length), a Multi-GPU Asynchronous parallel algorithm based on Bayesian Optimization (MABO) is presented. MABO allocates a process to each GPU via a queue mechanism, and then creates multiple trials at a time for asynchronous parallel search, which greatly reduces the search time. Compared with the state-of-the-art methods, the prediction error of Periodformer reduced by 13% and 26% for multivariate and univariate forecasting, respectively. In addition, MABO reduces the average search time by 46% while finding better hyperparameters. As a conclusion, this paper indicates that LTSF may not need complex attention and extra long input sequences. The code has been open sourced on Github.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Ground-Truth Neighborhood Regularization for Reinforcement Learning Post-Training of Time Series Foundation Models

    cs.LG 2026-08 conditional novelty 5.0 of 10

    Reward-based fine-tuning of time series foundation models can collapse predictions away from the true future; steering probability mass into a ground-truth neighborhood reduces that collapse and improves forecasts.

  2. Progressive Supervision via Label Decomposition: An Long-Term and Large-Scale Wireless Traffic Forecasting Method

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A label-decomposition training scheme with per-component supervision and recombination, combined with random subgraph sampling, improves long-term large-scale wireless traffic forecasting.

  3. Act Now: A Novel Online Forecasting Framework for Large-Scale Streaming Data

    cs.LG 2024-11 conditional novelty 3.0 of 10

    Act-Now combines random subgraph sampling, fast and slow stream buffers, and a label-decomposition forecaster, reporting large MSE reductions on three cellular traffic datasets.

Pith tools