Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2601.18509 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912862550622208 |
|---|---|
| author | Sabashvili, Andro |
| author_facet | Sabashvili, Andro |
| contents | Reliable uncertainty quantification is of critical importance in time series forecasting, yet traditional methods often rely on restrictive distributional assumptions. Conformal prediction (CP) has emerged as a promising distribution-free framework for generating prediction intervals with rigorous theoretical guarantees. However, applying CP to sequential data presents a primary challenge: the temporal dependencies inherent in time series fundamentally violate the core assumption of data exchangeability, upon which standard CP guarantees are built. This paper critically examines the main categories of algorithmic solutions designed to address this conflict. We survey and benchmark methods that relax the exchangeability assumption, those that redefine the data unit to be a collection of independent time series, approaches that explicitly model the dynamics of the prediction residuals, and online learning algorithms that adapt to distribution shifts to maintain long-run coverage. We use AutoARIMA as the base forecaster on a large-scale monthly sales dataset, evaluating marginal coverage, interval width, and the Winkler score. Our benchmark results show that multi-step split conformal prediction method meets the 90% coverage threshold and demonstrates the best efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_18509 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Conformal Prediction Algorithms for Time Series Forecasting: Methods and Benchmarking Sabashvili, Andro Machine Learning Reliable uncertainty quantification is of critical importance in time series forecasting, yet traditional methods often rely on restrictive distributional assumptions. Conformal prediction (CP) has emerged as a promising distribution-free framework for generating prediction intervals with rigorous theoretical guarantees. However, applying CP to sequential data presents a primary challenge: the temporal dependencies inherent in time series fundamentally violate the core assumption of data exchangeability, upon which standard CP guarantees are built. This paper critically examines the main categories of algorithmic solutions designed to address this conflict. We survey and benchmark methods that relax the exchangeability assumption, those that redefine the data unit to be a collection of independent time series, approaches that explicitly model the dynamics of the prediction residuals, and online learning algorithms that adapt to distribution shifts to maintain long-run coverage. We use AutoARIMA as the base forecaster on a large-scale monthly sales dataset, evaluating marginal coverage, interval width, and the Winkler score. Our benchmark results show that multi-step split conformal prediction method meets the 90% coverage threshold and demonstrates the best efficiency. |
| title | Conformal Prediction Algorithms for Time Series Forecasting: Methods and Benchmarking |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2601.18509 |