arXiv:2610.00405v1 Announce Type: cross
Abstract: Time-series foundation models (TSFMs) perform strongly across forecasting tasks, but their per-series inference is ill-suited to neighbor-rich foreca...
By Hao-Nan Shi, Tong Wu, Chen-Cong Sun, Yuan Jiang, Han-Jia Ye, De-Chuan Zhan
arXiv:2609.37255v1 Announce Type: cross
Abstract: Time series foundation models (TSFMs) are pretrained on heterogeneous collections containing billions of observations, yet their training windows are...
By Yike Li, Shaoxu Song, Jianmin Wang
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.
By Guo Cheng, Changlong Lv, Jingyi Hou
arXiv:2606. 18539v1 Announce Type: new Abstract: Time series forecasting (TSF) underpins consequential decisions in energy, transportation, finance, and healthcare, yet TSF models are almost universally ranked by a single number (e.
By Yuyang Zhao, Lian Xu, Hao Miao, Chenxi Liu, Hao Xue
arXiv:2604. 27967v2 Announce Type: replace Abstract: Background: We introduce StructGP, a continuous-time multi-task Gaussian process that couples process convolutions with differentiable structure learning to uncover a sparse, ordered directed acyclic graph (DAG) of inter-variable dependencies while preserving principled uncertainty.
By Ivan Lerner, Jean Feydy, Alexandre Kalimouttou, Anita Burgun, Francis Bach
CoRe is a model‑agnostic learning objective for direct multivariate time‑series forecasting that replaces pointwise errors with two output‑space constraints: a frequency coherence loss aligning predicted and target spectra, and a low‑rank relational graph loss matching pairwise differences in a PCA subspace. The objective introduces no trainable parameters and can be applied to existing forecasting backbones by changing only the loss. Experiments on standard benchmarks show that CoRe improves strong baselines, compares favorably with recent forecasting objectives, and remains effective across different backbones, datasets, and hyperparameter settings.
By Xiaoyu Lin, Huiran Duan, Yining Liu, Zhixiang Wu, Chu Lin, Lin Lu
arXiv:2609.31315v1 Announce Type: cross
Abstract: Unobserved common causes are pervasive in real-world time series and can induce spurious associations that causal discovery methods mistake for direc...
By Mohammad Fesanghary
The paper investigates when forecasting accuracy can reliably reveal the underlying temporal structure of a time series. It shows that a small forecast margin does not automatically mean structural ambiguity and introduces a stability-based measure that assesses how well different temporal mechanisms can be distinguished given uncertainty in the selection objective. Experiments demonstrate that this stability metric better predicts when forecast-only structural selection succeeds or fails compared to relying solely on forecast margin.
By Qipeng Qian, Yuntao Qian
arXiv:2604. 22328v2 Announce Type: replace-cross Abstract: Driven by the transition towards a climate-neutral energy system, accurate energy time series forecasting is critical for planning and operations.
By Marco Obermeier, Marco Pruckner, Florian Haselbeck, Andreas Zeiselmair
arXiv:2606. 01400v1 Announce Type: cross Abstract: Evaluating large language models (LLMs) across comprehensive benchmarks is expensive and time-consuming.
By Denica Kjorvezir, Marko Djukanovi\'c, Ana Gjorgjevikj, Gjorgjina Cenikj, Tome Eftimov
arXiv:2608. 05742v1 Announce Type: cross Abstract: Multivariate time series forecasting presents unique challenges because future variables often co-evolve under shared system dynamics.
By Kuiye Ding, Yifan Hu, Hanchen Wang, Hao Xue
PACE introduces a propagation‑aware collaborative correction for one‑shot personalized federated graph learning. Each client sends a rank‑r update and a diagonal sketch of message moments, allowing the server to construct a correction that anchors to the receiver’s local model. A convex negative‑log‑likelihood calibration selects a single coefficient to blend local and external logits, improving accuracy and weighted‑F1 on most datasets while preserving local predictions when the correction is unhelpful.
By Ruizhe Huang, Chengran Li, Xiaochuan Shi