arXiv Machine Learning

Sliding-Window Reordering with Overlap Averaging: A Simple Time-Domain Augmentation for Multivariate Forecasting

The paper introduces a simple, model‑agnostic time‑domain augmentation called Sliding‑Window Reordering with Overlap Averaging. It transforms the joint input‑target sequence into overlapping windows, randomly reorders a fraction of them based on a variance criterion, and reconstructs the sequence by averaging overlaps to generate synthetic samples with controlled variation and minimal temporal distortion. Experiments show strong performance gains across nine long‑term forecasting benchmarks and four short‑term traffic benchmarks, with detailed ablations and diagnostics highlighting the effectiveness of each design choice.

arXiv AI
Oct 9

AdaCast: Conditional Parameter Generation for Adaptive Time Series Forecasting

AdaCast introduces a conditional parameter generation framework that tailors time‑series forecasting models to each input by producing low‑rank updates for a frozen pretrained foundation model. Unlike static adaptation methods that apply a single set of updates to all inputs, AdaCast generates input‑specific updates during both training and inference. Experiments on six public benchmarks show that AdaCast consistently outperforms static baselines in in‑domain forecasting and improves zero‑shot generalization to unseen datasets across domains.

By Darahaas Nallagatla, Darryl Cherian Jacob, Pan He
arXiv AI
Sep 30

Channel-Dependent State Space Model for Multivariate Time Series Forecasting

The paper introduces Chameleon, a channel‑dependent state space model for multivariate time series forecasting that allows data‑dependent, fine‑grained interactions across variables while maintaining linear scaling with the number of variables. By integrating selective state space models with a Kalman filter and adapting GatedDeltaNet as the backbone, Chameleon improves generalization and achieves lower MSE and MAE on strongly dependent ODE and PEMS datasets compared to both channel‑independent and prior channel‑dependent methods. Across 28 benchmark settings, it outperforms baselines in the majority of cases and demonstrates competitive training‑time and memory efficiency on Traffic and ETT datasets.

By Yu-Cheng Wu, Fan-Keng Sun, Li-Chun Lu, Duane S. Boning
arXiv Machine Learning
3d ago

Series-wise Cross-validation for Global Time Series Forecasting

The paper introduces series‑wise cross‑validation (CV) for global time‑series forecasting models, contrasting it with the traditional time‑wise CV that partitions data along the time axis. It formalizes several series‑wise CV schemes—K‑fold, bootstrapping, and Monte Carlo—and evaluates them on 11 datasets with 10 neural network architectures across five metrics, including performance estimation, overoptimism, model selection accuracy, regret, and downstream forecasting performance. The study finds that series‑wise CV improves downstream forecasting accuracy by better guiding model selection for generalization across both time and series, while time‑wise CV slightly outperforms it for estimating out‑of‑sample error.

By Vitor Cerqueira, Mariana Oliveira, Luis Roque
arXiv Machine Learning
Oct 8

Evaluating Sequence Assembly Strategies for Differentially Private Synthetic Time-Series Forecasting

The paper investigates how post‑generation assembly of fixed‑length synthetic windows affects downstream forecasting performance. By varying overlap rates and window‑weighting schemes, the authors evaluate boundary continuity, statistical and temporal fidelity, and TSTR utility across four public datasets and five forecasting models. Results show that optimal assembly depends on the forecaster, with increased overlap improving continuity but not always reducing forecasting error, and provide assembly grids and TRTR references to quantify these effects.

By Guoxiong Long, Huizhen Huang, Qikun Cai, Tao Huang, Chen Hou
arXiv Statistics ML
Oct 27

Sliding-Window Signatures as Features for Time Series Forecasting

arXiv:2510.12337v2 Announce Type: replace-cross Abstract: The evolution of a time series is often influenced not only by its past values but also by external covariates, giving rise to forecasting wi...

By Nina Drobac (LPSM), Margaux Br{\'e}g{\`e}re (LPSM), Joseph de Vilmarest (LPSM), Olivier Wintenberger (LPSM)
arXiv Machine Learning
Oct 5

Dual-Context Analog Retrieval for Time Series Forecasting

Dual-Context Analog Retrieval for Time Series Forecasting (DuoTS) introduces a two-stage forecasting approach that first generates a base forecast and then refines it patch by patch. Each refinement step fuses a current context, which focuses on recent tokens, with a detail context that incorporates retrieved analogs and their subsequent trajectories. Experiments on real-world datasets demonstrate that DuoTS achieves state‑of‑the‑art performance, and ablation studies confirm the importance of both contexts and the refinement mechanism.

By Jung Min Choi, Ngoc Son Le, Ibram Abdelmalak, Vijaya Krishna Yalavarthi, Lars Schmidt-Thieme
arXiv Machine Learning
Jul 13

Forking-Sequences: Statistically and Computationally Efficient Multi-Horizon Forecasting with Reduced Volatility

arXiv:2510. 04487v5 Announce Type: replace Abstract: While accuracy is a critical requirement for time series forecasting, an equally important desideratum is reasonable forecast volatility across forecast creation dates (FCDs).

By Willa Potosnak, Malcolm Wolff, Mengfei Cao, Ruijun Ma, Tatiana Konstantinova, Dmitry Efimov, Michael W. Mahoney, Boris Oreshkin, Kin G. Olivares
arXiv Machine Learning
Sep 29

Aurora-X: Built for Extreme Time Series Forecasting

Aurora‑X is a billion‑parameter time‑series foundation model designed for extreme forecasting tasks. It employs a progressive curriculum that starts with channel‑independent pretraining, then adds cross‑variable dependencies, variable context and horizon lengths, and optional future covariates during mid‑training. A variable‑resolution post‑training stage allows adjustable temporal spans per token at inference, while a pattern‑guided mixture‑of‑experts expands capacity through sparse activation and expert specialization. An implicit quantile network head predicts arbitrary quantiles, enhancing probabilistic forecasting flexibility. Experiments on GIFT‑Eval, TIME, FEV‑Bench, TFB, and DAG‑Bench show state‑of‑the‑art performance against both pretrained TSFMs and task‑specific supervised models.

By Xingjian Wu, Chenjuan Guo, Xiangfei Qiu, Zhigang Hu, Hanyin Cheng, Peng Chen, Yang Shu, Jilin Hu, Bin Yang