arXiv Machine Learning

CARE: A Lightweight Plug-in Gated Correction and Uncertainty-aware Module for Long-term Time Series Forecasting

CARE is a lightweight plug‑in module that can be added to any deterministic time‑series forecaster. It resamples historical data to align with the forecast horizon, learns residual corrections, and applies scale‑aware bounded updates controlled by per‑coordinate sigmoid risk gates. The module is trained with a multi‑objective loss to improve accuracy, track residuals, align risk, and anchor the base model, and it demonstrates accuracy gains on eight benchmarks with minimal extra parameters or latency.

arXiv Machine Learning
3d ago

GateTS: Versatile and Efficient Forecasting via Attention-Inspired routed Mixture-of-Experts

GateTS introduces a streamlined univariate forecasting model that merges sparse Mixture-of-Experts computation with an attention-inspired gating mechanism, eliminating the need for auxiliary load‑balancing losses. The architecture achieves superior predictive accuracy across both short‑ and long‑term horizons, including intermittent signals, while using far fewer parameters than leading transformer models such as PatchTST. Empirical tests on diverse datasets show GateTS is computationally more efficient than LSTM, enabling cost‑effective inference for real‑world time‑series applications.

By Kyrylo Yemets, Mykola Lukashchuk, Ivan Izonin
arXiv Machine Learning
Oct 9

SACQ: Structured Decoding with Memory-Conditioned Refinement for Long-Horizon Forecasting

SACQ introduces a structured prediction head for long‑horizon time‑series forecasting that replaces the traditional flatten readout. It uses a two‑stage decoding process: a coarse patch‑grid scaffold is first generated, then each future position is refined via cross‑attention over historical memory, with a learned gate merging the corrections. A batch‑adaptive scaled log‑cosh loss further stabilizes training under long horizons and noisy labels, leading to superior MSE/MAE performance across multiple backbones with minimal overhead.

By Guo Cheng, Zhengzhuo Xu, Chenchen Jing, Jingyi Hou
arXiv Machine Learning
Jun 10

One Step Closer to Ground Truth: A Multi-Scale Residual-Aware Representation Learning Pipeline for Predicting Time Series Data

arXiv:2606. 10678v1 Announce Type: new Abstract: Transformer-based models have emerged as leading paradigms in time-series forecasting in recent years, employing self-attention mechanisms to capture long-range dependencies.

By Amrijit Biswas, Mustafa Kamal, Robin Krambroeckers, M. M. Lutfe Elahi, Sifat Momen, Nabeel Mohammed, Shafin Rahman
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
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