Time-series forecasting research has been moving steadily toward larger architectures, from specialized transformers to general-purpose foundation models, on the assumption that capacity is what unlocks accuracy. We take the opposite position: most of the gap can be closed at far lower cost by tuning preprocessing rather than scaling models.
arXiv:2603. 15506v2 Announce Type: replace-cross Abstract: We argue that the current practice of evaluating AI/ML time-series forecasting models, predominantly on benchmarks characterized by strong, persistent periodicities and seasonalities, obscures real progress by overlooking the performance of efficient classical methods.
By Raeid Saqur, Christoph Bergmeir, Blanka Horvath, Daniel Schmidt, Frank Rudzicz, Terry Lyons
The paper presents an empirical benchmark of nine modern deep‑learning models for time‑series forecasting of smart‑meter energy consumption, evaluated on two publicly available datasets. It examines how historical input length, prediction horizon, and model architecture affect accuracy, finding that longer historical context improves performance up to a saturation point and that accuracy declines with longer horizons. The study also compares computational complexity, showing that lightweight architectures achieve similar performance to heavier models, and notes that model choice has limited impact across most demographic and household subgroups.
By Behnaz Kavoosighafi, Maria Eidenskog, Wiktoria Glad, Katerina Vrotsou
The paper presents an empirical benchmark of nine deep learning models for smart meter energy forecasting, evaluating them on two public datasets. It examines how historical input length, prediction horizon, and model architecture affect accuracy, finding that longer historical context improves performance up to a saturation point while accuracy declines with longer horizons. The study also compares computational cost, showing lightweight models achieve similar accuracy to heavier ones, and notes that model choice matters less across most population segments.
arXiv:2602. 02288v3 Announce Type: replace Abstract: Current time-series forecasting models are primarily based on transformer-style neural networks.
By Zheng Li, Jerry Cheng, Huanying Gu
arXiv:2606. 28670v1 Announce Type: cross Abstract: We introduce MACROCAST, a lightweight Time Series Foundation Model (TSFM) for real-time macroeconomic forecasting.
By Andrea Carriero, Davide Pettenuzzo, Shubhranshu Shekhar
arXiv:2607. 05450v1 Announce Type: cross Abstract: This paper explores the "Granularity Paradox" in time-series forecasting, wherein finer temporal disaggregation (e.
By Hugo Moreira
arXiv:2609.39386v1 Announce Type: new
Abstract: Pretrained time-series foundation models (TSFMs) are evaluated as forecasters of future values, yet for sparse series many decisions depend only on whi...
By Daniel Schoess, Florian von Wangenheim
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:2505. 15354v3 Announce Type: replace Abstract: Time-series forecasting is a critical task in various business domains, but it remains inherently challenging.
By Hamza Cherkaoui, Malik Tiomoko, Giuseppe Paolo, Zhang Yili, Yu Meng, Zhang Keli, Hafiz Tiomoko Ali
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
AdaRDiff is a new adaptive reversible differencing technique for time‑series forecasting that learns weighted differencing to remove trend and seasonality, stabilizes residuals for forecasting, and then reconstructs the forecast autoregressively. The method offers a closed‑form convolutional implementation that can be GPU‑parallelized, achieving up to 33.7× speedup over naive recurrence. Experiments on eight diverse benchmarks show state‑of‑the‑art accuracy and significant performance gains when integrated into various backbone models, from linear models to Transformers.
By Morad Laglil, Younes Hlal, Marouane El Hadari, Emilie Devijver, Eric Gaussier