Continuous Horizon Forecasting

Malcolm Wolff, Elliott Zackrone, Souhaib Ben Taieb, Michael W. Mahoney, Kin G. OlivaresarXiv 2026 · arXiv

TL;DR

This paper introduces Continuous Horizon (CH) forecasting, a new paradigm that treats future trajectories as continuous functions rather than discrete vectors. By redefining the forecast horizon as a queryable variable, CH achieves lower estimation variance, enables $O(1)$ targeted horizon querying, and naturally supports interpolation and extrapolation to unseen time points.

What Problem Does This Paper Address?

For decades, multi-horizon forecasting has been locked into three discrete strategies:

  1. Recursive (REC): Predicting one step at a time and feeding it back. (Suffers from error accumulation).
  2. Direct (DIR): Training a separate model for every future step. (Statistically inefficient and high variance).
  3. Multi-Step (MS): Predicting a fixed-length vector of future values all at once. (Rigid output grid, unable to query arbitrary time points).

The authors argue that this discrete view is a "historical artifact." Real-world phenomena are inherently continuous. Existing methods struggle to predict "between" the grid points (interpolation) or "beyond" the trained window (extrapolation) without clunky workarounds. Furthermore, they lack a unified theoretical framework to explain why some strategies perform better than others in different noise regimes.

Figure 1: Multi-horizon forecast strategies and the continuous-horizon paradigm.

Methods

The core innovation is the Continuous Horizon (CH) strategy. Instead of a model $g$ outputting a vector, it outputs a continuous operator: $\hat{y}_{t+h} = g(h \mid \mathbf{y}_{:t})$.

To implement this, the authors use a bilinear parametrization (similar to "branch-trunk" architectures like DeepONet): $$g(h \mid \mathbf{y}_{:t}) = \sum_{k=1}^K \theta_k(\mathbf{y}_{:t}) \phi_k(h)$$ Here, $\theta_k$ are coefficients generated by an encoder (the "branch") based on historical data, and $\phi_k(h)$ are basis functions (the "trunk") that depend only on the horizon $h$. These basis functions can be learned embeddings, Fourier series, or polynomials.

The paper provides two major theoretical pillars:

  • Universal Operator Approximation Theorem: Proving that this bilinear form can approximate any continuous forecast function.
  • Continuous Bias-Variance Decomposition: A formal proof showing that CH leverages "continuous effective horizon information" to achieve strictly lower estimation variance than discrete MS or DIR strategies.
Figure 5: Continuous Horizon (CH) decoder within the MQForecaster architecture.

Datasets

The authors validated CH across a diverse set of benchmarks:

  • Simulated Autoregressive Processes: Linear (LAR), Nonlinear (NLAR), and Smooth-Transition (STAR) models to test bias-variance behavior.
  • Gaussian Processes (GP): Five different regimes (mean-reverting, periodic, etc.) to evaluate interpolation and extrapolation capabilities.
  • M-Series Benchmark: 16 large-scale real-world datasets from the famous M1, M3, M4, and Tourism competitions, totaling over 100,000 time series.

Key Insights and Ideas

  • Discrete is just a special case: The authors show that REC, DIR, and MS are actually just coarse discretizations of the CH operator.
  • The "Variance Dominance" Effect: Because CH treats the horizon as a continuum, it effectively uses more "information" from the training data to regularize the forecast. This leads to a smoother, more stable fit, especially in high-noise scenarios.
  • Targeted Querying: Because the basis functions $\phi_k(h)$ can be pre-cached, querying a specific future time point $h$ (even a fractional one like $h=2.5$) becomes a simple $O(1)$ dot product.
  • Aliasing Avoidance: Discrete models can suffer from aliasing if their output grid is too sparse to capture high-frequency oscillations. CH avoids this by learning the underlying continuous signal.
Figure 2: Effective information and estimation variance. CH dominates both MS and DIR.

Key Results

  • Accuracy: On the M-series benchmark, CH outperformed the standard Multi-Step strategy in 40 out of 64 encoder/frequency pairs, with a mean improvement of 2.6%.
  • Long Horizons: The advantage of CH grew with the horizon length. For M4 Hourly data ($H=48$), CH reduced error by up to 49% compared to MS when using a Transformer encoder.
  • Robustness: In high-noise simulations, CH showed 40% to 55% lower variance than the Direct strategy.
  • Zero-Shot Capabilities: CH successfully extrapolated to horizons twice as long as those seen during training, significantly outperforming the recurrent rollouts of REC models.

Limitations and Future Work

  • Point Forecasts: The current work focuses on point estimates. Extending this to probabilistic forecasting (e.g., predicting continuous density functions over time) is a logical next step.
  • Foundation Models: Most current "Time Series Foundation Models" still use fixed output grids. Integrating CH into these large-scale models could make them much more flexible.
  • Basis Constraints: The authors suggest that future work could explore constraining the learned basis functions (e.g., enforcing orthonormality) to improve interpretability and stability.
  • Very Long Horizons: For extremely long-term forecasting, hybrid strategies combining CH with recursive elements might be necessary to manage computational costs.

Summary updated

Abstract

Multi-horizon forecasting has been dominated by discrete forecast strategies that treat model outputs as fixed-vectors or recurrently create them. In this paper, we introduce the Continuous Horizon (CH) strategy that generalizes upon recursive, direct, and multi-step strategies by redefining forecasts as a continuous operator and the forecast horizon as a query variable rather than an index. We present the theoretical foundations for the CH strategy, a Universal Operator Approximation Theorem, and a continuous-horizon bias-variance decomposition that formally proves the estimation variance improvements of CH over the discrete strategies. We validate the CH strategy empirically through a simulation study, and on 16 large-scale datasets from the M-series benchmark, showing how CH achieves competitive RMSE accuracy, while uniquely enabling parallel inference, targeted horizon querying, and interpolation and extrapolation across unseen horizons.
BibTeX
@misc{wolff2026continuous,
  author = {Malcolm Wolff and Elliott Zackrone and Souhaib Ben Taieb and Michael W. Mahoney and Kin G. Olivares},
  title = {{Continuous Horizon Forecasting}},
  year = {2026},
  eprint = {2611.13228},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.13228},
}
Figure