Efficiently Generating Correlated Sample Paths from Multi-step Time Series Foundation Models
cs.LG, stat.ML
Submitted: 2025-10-02
Updated: 2025-10-02
Journal ref: Recent Advances in Time Series Foundation Models: Have We Reached the BERT Moment? (NeurIPS 2025 Workshop)
Project page: https://milets18.github.io/papers/milets18_paper_14.pdf
License: http://creativecommons.org/licenses/by/4.0/
The gist: Many time series applications require access to multi-step forecast trajectories in the form of sample paths.
Terminology
Abstract
Many time series applications require access to multi-step forecast trajectories in the form of sample paths. Recently, time series foundation models have leveraged multi-step lookahead predictions to improve the quality and efficiency of multi-step forecasts. However, these models only predict independent marginal distributions for each time step, rather than a full joint predictive distribution. To generate forecast sample paths with realistic correlation structures, one typically resorts to autoregressive sampling, which can be extremely expensive. In this paper, we present a copula-based approach to efficiently generate accurate, correlated sample paths from existing multi-step time series foundation models in one forward pass. Our copula-based approach generates correlated sample paths orders of magnitude faster than autoregressive sampling, and it yields improved sample path quality by mitigating the snowballing error phenomenon.
Sources
- An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling
- From Tables to Time: Extending TabPFN-v2 to Time Series Forecasting
- Deep Generative Quantile-Copula Models for Probabilistic Forecasting
- From Predictions to Decisions: The Importance of Joint Predictive Distributions
- Multivariate Forecasting Evaluation: On Sensitive and Strictly Proper Scoring Rules
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks