Scaling-laws for Large Time-series Models
Thomas D. P. Edwards, James Alvey, Justin Alsing, Nam H. Nguyen, Benjamin D. Wandelt
TL;DR
The paper addresses the absence of predictable scaling laws for time-series foundation models. It demonstrates that decoder-only LTMs trained on a large, diverse univariate time-series corpus follow power-law scaling with $N_p$, $rak{D}$, and $rak{C}$ across about five orders of magnitude, for $ ext{MSE}$, $ ext{CRPS}$, and $ ext{log-likelihood}$. Contributions include showing robustness to architectural choices such as $N_{ ext{heads}}$ and modest dependence on aspect ratio (below ~100), proposing a learnable positional encoding and a Student's-$t$ head, and documenting practical training parameters and data-balancing strategies. This work provides a foundation for resource-allocation planning in time-series foundation modeling and underscores data diversity as a critical ingredient for observing scaling laws, while outlining avenues for extending to multivariate data, longer contexts, and alternative distribution heads.
Abstract
Scaling laws for large language models (LLMs) have provided useful guidance in training ever larger models for predictable performance gains. Time series forecasting shares a similar sequential structure to language, and is amenable to large-scale transformer architectures. Here we show that foundational decoder-only time series transformer models exhibit analogous scaling-behavior to LLMs, with architectural details (aspect ratio and number of heads) having a minimal effect over broad ranges. We assemble a large corpus of heterogenous time series data on which to train, and establish for the first time power-law scaling with parameter count, dataset size, and training compute, spanning five orders of magnitude.
