Papers › ElasTST: Towards Robust Varied-Horizon Forecasting with Elastic Time-Series Transformer

ElasTST: Towards Robust Varied-Horizon Forecasting with Elastic Time-Series Transformer

4 Nov 2024arXiv:2411.01842archive 2025-07-28

Jiawen Zhang, Shun Zheng, Xumeng Wen, Xiaofang Zhou, Jiang Bian, Jia Li

Numerous industrial sectors necessitate models capable of providing robust forecasts across various horizons. Despite the recent strides in crafting specific architectures for time-series forecasting and developing pre-trained universal models, a comprehensive examination of their capability in accommodating varied-horizon forecasting during inference is still lacking. This paper bridges this gap through the design and evaluation of the Elastic Time-Series Transformer (ElasTST). The ElasTST model incorporates a non-autoregressive design with placeholders and structured self-attention masks, warranting future outputs that are invariant to adjustments in inference horizons. A tunable version of rotary position embedding is also integrated into ElasTST to capture time-series-specific periods and enhance adaptability to different horizons. Additionally, ElasTST employs a multi-scale patch design, effectively integrating both fine-grained and coarse-grained information. During the training phase, ElasTST uses a horizon reweighting strategy that approximates the effect of random sampling across multiple horizons with a single fixed horizon setting. Through comprehensive experiments and comparisons with state-of-the-art time-series architectures and contemporary foundation models, we demonstrate the efficacy of ElasTST's unique design elements. Our findings position ElasTST as a robust solution for the practical necessity of varied-horizon forecasting.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2411.01842")

Code

Syntology Ran 2 of 14 code samples harvested from 1 repository linked to this paper; 12 have no recorded run. Of those that ran: 2 ran · fixture could not drive it.

By repository: official repository: 14 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

microsoft/probts officialmentioned on GitHubjaxMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 2 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · fixture could not drive it
12unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from microsoft/ProbTS. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

extract microsoft/ProbTS/probts/utils/utils.py official repository ran · fixture could not drive it MIT (permissive) · df116dde4bb6ab3e · report
get_1d_sincos_pos_embed_from_grid microsoft/ProbTS/probts/utils/position_emb.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · e5947aba1d10885f · report
abs_error microsoft/ProbTS/probts/utils/metrics.py official repository unverified MIT (permissive) · 1b456163f15dff07 · report
abs_target_sum microsoft/ProbTS/probts/utils/metrics.py official repository unverified MIT (permissive) · a169084ad0e815a0 · report
byte2gb microsoft/ProbTS/probts/callbacks/memory_callback.py official repository unverified MIT (permissive) · a8273d970bb0f2ba · report
calculate_average microsoft/ProbTS/probts/utils/save_utils.py official repository unverified MIT (permissive) · 76c6745b9b380415 · report
calculate_weighted_average microsoft/ProbTS/probts/utils/save_utils.py official repository unverified MIT (permissive) · 09de1fe9aa41ea2c · report
get_weights microsoft/ProbTS/probts/model/forecast_module.py official repository unverified MIT (permissive) · 627f3d58e3247384 · report
mse microsoft/ProbTS/probts/utils/metrics.py official repository unverified MIT (permissive) · 02b65b093a712e17 · report
process_tensor microsoft/ProbTS/probts/utils/evaluator.py official repository unverified MIT (permissive) · 366672efd91af2fd · report
repeat microsoft/ProbTS/probts/utils/utils.py official repository unverified MIT (permissive) · d6932de4de105184 · report
sin_cos_encoding microsoft/ProbTS/probts/utils/position_emb.py official repository unverified MIT (permissive) · 99d47a14c8bad15e · report
update_metrics microsoft/ProbTS/probts/utils/save_utils.py official repository unverified MIT (permissive) · 8dd5f62ecb607733 · report
weighted_average microsoft/ProbTS/probts/utils/utils.py official repository unverified MIT (permissive) · 3cd5309f49681509 · report

Tasks

Time SeriesTime Series Forecasting

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections