Online conformal inference for multi-step time series forecasting

arXiv:2410.13115 · stat.ME · Submitted 2024-10-17 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Statistics. The day in statistics: methods, theory and the inference under them.

Tom: We're looking at the paper: "Online conformal inference for multi-step time series forecasting".

Jane: Here's the gist of the paper. Online conformal inference for multi-step time series forecasting establishes that optimal h-step-ahead forecast errors exhibit serial correlation up to lag (h−1) under a general non-stationary autoregressive data generating process <ref:2410.13115#pg7>.

Tom: To leverage these properties, the Autocorrelated Multi-step Conformal Prediction (AcMCP) method is proposed, which effectively incorporates autocorrelations in multi-step forecast errors, resulting in more statistically efficient prediction intervals <ref:2410.13115#pg7>.

Jane: This method guarantees asymptotic marginal coverage for multi-step prediction intervals, though the coverage error admits an upper bound that increases with the forecasting horizon <ref:2410.13115#pg7>.

Tom: The paper extends several easy-to-implement conformal prediction methods to accommodate multi-step scenarios <ref:2410.13115#pg7>.

Title and authors: Tom: Okay, so we're shifting focus slightly now to the setup of this work, looking at the title and who wrote it. The paper is "Online conformal inference for multi-step time series forecasting," written by Xiaoqian Wang from the Academy of Mathematics and Systems Science and Monash University <ref:2410.13115#pg1>.

Jane: That’s a solid setup. The title itself immediately tells you the two big challenges they are tackling here: online inference and multi-step time series forecasting. It’s not just one problem, it's a combination of both <ref:2410.13115#pg7>.

Lu: The authors bring in expertise from different areas, which is typical for these kinds of advanced methods. They're drawing on conformal prediction foundations and applying them specifically to the tricky domain of time series data <ref:2410.13115#pg3>.

Meng: It’s good to see that the work is rooted in established frameworks, but the focus is clearly on extending those frameworks where they usually break down. They aren't just applying a standard technique; they are changing the technique itself to handle this specific temporal dependency <ref:2410.13115#pg7>.

Lalam: The paper draws heavily on established work in conformal prediction, referencing things like Papadopoulos et al. and Vovk et al., which shows they’re building on a known foundation <ref:2410.13115#pg2>. It’s not starting from scratch, which is smart for establishing credibility <ref:2410.13115#pg7>.

Jane: So, when you look at the authors and the title, what should a listener immediately understand about what this paper is trying to achieve? What’s the big picture?

Tom: The big picture is moving conformal prediction beyond exchangeable data into a more realistic setting—the time series domain—and making it robust enough to handle those inherent temporal dependencies <ref:2410.13115#pg3>.

Lu: They are trying to show that even with complex, nonstationary autoregressive data generating processes, we can still construct valid prediction intervals using this method <ref:2410.13115#pg7>.

Meng: So they’re aiming for distribution-free uncertainty quantification in a setting where the data isn't nice and tidy, which is exactly where most of our production models live <ref:2410.13115#pg7>.

Lalam: It’s about making prediction intervals reliable when the underlying process has a history, not just independent points <ref:2410.13115#pg7>.

The paper's summary: Tom: Now let’s look at the actual summary they provide. It boils down to this: they identify that for an h-step-ahead forecast error sequence, it has a specific serial correlation property up to lag h minus one <ref:2410.13115#pg7>.

Jane: That’s the key finding again. So they’re not just saying "time series are hard"; they're giving us a mathematical reason why their prediction intervals need to be different for different forecast horizons <ref:2410.13115#pg7>.

Lu: They then leverage this property by proposing the Autocorrelated Multi-step Conformal Prediction, AcMCP, which effectively incorporates these autocorrelations into the nonconformity scores <ref:2410.13115#pg7>.

Meng: So they are essentially modifying the standard conformal prediction process to account for that dependency structure in the errors <ref:2410.13115#pg7>. It’s like adding a correction term based on what happened a few steps ago <ref:2410.13115#pg7>.

Lalam: Exactly, and this incorporation of the lag h minus one dependence is what leads to more statistically efficient prediction intervals <ref:2410.13115#pg7>. It’s a direct result of using that property they established <ref:2410.13115#pg7>.

Jane: So, if I boil it down for the listener who isn't reading the paper, what is the practical difference between this AcMCP method and a standard conformal prediction approach?

Tom: The practical difference is that AcMCP doesn't treat each forecast error as completely independent when constructing its interval; it uses the known serial correlation up to lag h minus one <ref:2410.13115#pg7>. It’s a structural adjustment based on the data generating process, not just an arbitrary assumption about independence <ref:2410.13115#pg7>.

Lu: That distinction is important because standard methods often rely on exchangeability, which time series data inherently violates <ref:2410.13115#pg3>. This paper shows a way around that violation by modeling the correlation itself <ref:2410.13115#pg7>.

Meng: I see. So they are essentially building a model of the error structure first, and then using that model to make our prediction intervals more accurate, rather than just assuming independence <ref:2410.13115#pg7>. That makes sense for deployment concerns <ref:2410.13115#pg7>.

Lalam: It’s about being more statistically rigorous about the dependence, which ultimately translates into tighter, more accurate prediction intervals when you actually use this paper's framework <ref:2410.13115#pg7>.

The paper's improvements: Tom: Moving on to the specific improvements they are proposing in the methodology. They mentioned several ways to extend conformal prediction for time series, including split conformal prediction and online multi-step split conformal prediction <ref:2410.13115#pg10>.

Jane: So they aren't just presenting one solution; they are showing a family of tools, like SCP or MSCP, that try different things when dealing with the time series problem <ref:2410.13115#pg7>.

Lu: They also introduce weighted conformal prediction, MWCP, which adapts the NexCP method by using a weighted quantile estimate for building the intervals instead of just one fixed rule <ref:2410.13115#pg7>. This contrasts with MSCP because it assigns weights to the nonconformity scores based on observed feature values <ref:two thousand four hundred ten point one three one one five#pg7.

Meng: Weighted quantile estimates sound like they might be more adaptive than just a fixed set of rules, but that brings us back to my deployment concern—how much extra work does this weighting add to the inference pipeline?

Tom: It adds complexity, Meng. The paper notes that MWCP assigns weights to those nonconformity scores based on observed feature values, which is a different approach than MSCP's recursive update structure <ref:two thousand four hundred ten point one three one one five#pg7.

Jane: So it’s a choice between relying on a recursive online update versus using these feature-dependent weights for the quantile estimation process <ref:2410.13115#pg7>. Which one is better depends entirely on the data's specific characteristics, right?

Lu: The paper also extends adaptive conformal inference, or MACP, by iteratively estimating an optimal miscoverage rate alpha star t plus h t via a sequential adjustment process <ref:two thousand four hundred ten point one three one one five#pg7. This lets the system adjust its confidence level based on what it's seeing sequentially <ref:2410.13115#pg7>.

Meng: Sequential adjustment sounds ambitious, but if it works, it could mean we don't have to manually tune a coverage parameter for every single time step <ref:2410.13115#pg7>. That’s definitely appealing for scale <ref:two thousand four hundred ten point one three one one five#pg7.

Tom: The overall message here is that they are providing a toolkit—split conformal prediction, online multi-step split, weighted methods, and adaptive methods—so you can choose the one that fits your specific operational constraints <ref:2410.13115#pg7>.

Jane: So we have a lot of options to choose from when dealing with time series uncertainty. It’s not just one single answer for every prediction problem <ref:2410.13115#pg7>.

Conclusion: Tom: Alright, let's wrap up this discussion on the paper "Online conformal inference for multi-step time series forecasting." The main conclusion is that AcMCP provides long-run coverage guarantees without needing any assumptions about distribution shifts <ref:2410.13115#pg7>.

Jane: That’s a huge statement, Tom. It means we can deploy this method and have confidence in our prediction intervals even if the underlying data distribution changes over time, as long as we stick to the theoretical framework <ref:2410.13115#pg7>.

Lu: The paper confirms that by accounting for the autocorrelation structure, AcMCP is more statistically efficient than methods like MPID when you look at h equals three <ref:2410.13115#pg21>. It’s a measurable gain in efficiency <ref:two thousand four hundred ten point one three one one five#pg7.

Meng: And for production, the empirical validation suggests it can be closer to the target coverage within local windows, and its prediction intervals are shorter or at least comparable in length when the coverage is similar <ref:2410.13115#pg31>. That’s tangible improvement <ref:two thousand four hundred ten point one three one one five#pg35.

Lalam: I just want to say that the work shows we can achieve long-run coverage guarantees for multi-step univariate time series forecasting under a general nonstationary autoregressive data generating process without making any assumptions on data distributional shifts <ref:2410.13115#pg7>. That’s the main contribution I see here <ref:two thousand four hundred ten point one three one one five#pg7.

Jane: So, to summarize, this paper is about creating a robust online tool that accounts for the serial correlation in multi-step errors to give us tighter, more efficient prediction intervals for time series data <ref:2410.13115#pg7>. It sets a high bar for what we expect from uncertainty quantification in sequential forecasting <ref:two thousand four hundred ten point one three one one five#pg7.

Tom: That’s the essence of the Autocorrelated Multi-step Conformal Prediction method, or AcMCP. It’s about leveraging data structure to get better accuracy <ref:2410.13115#pg7>. Moving on, next week we'll look at some papers dealing with distribution-free inference for individual treatment effects.

Academy of Mathematics and Systems Science, Chinese Academy of Sciences · Monash University

stat.ME

Submitted: 2024-10-17

Updated: 2026-11-05

Code: https://github.com/xqnwang/cpts

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 81/100

The gist: Online conformal inference for multi-step time series forecasting establishes that optimal h-step-ahead forecast errors exhibit serial correlation up to lag (h−1) under a general non-stationary…

Key concepts

Optimal h-step-ahead forecast errors
The research shows that the best possible errors for predicting h steps ahead in a non-stationary time series process are related to an MA(h-1) process. This means the error at one step is correlated with previous errors up to lag h-1, which is crucial for building accurate prediction intervals.
Autocorrelated Multi-step Conformal Prediction (AcMCP)
This method incorporates the known serial correlation structure of multi-step forecast errors directly into the online prediction update. By using this structure, AcMCP produces more statistically efficient and narrower prediction intervals compared to simpler methods like MPID.
Long-run coverage guarantees
AcMCP proves that its prediction intervals maintain correct coverage over the long term (as time approaches infinity). This guarantee is achieved without needing assumptions about how the underlying data distribution might change over time, making it robust for real-world forecasting.

Terminology

Summary

Online conformal inference for multi-step time series forecasting establishes that optimal h-step-ahead forecast errors exhibit serial correlation up to lag (h−1) under a general non-stationary autoregressive data generating process <ref:2410. p. 013115#pg7>. To leverage these properties, the Autocorrelated Multi-step Conformal Prediction (AcMCP) method is proposed, which effectively incorporates autocorrelations in multi-step forecast errors, resulting in more statistically efficient prediction intervals <ref:2410. p. 013115#pg7>. This method guarantees asymptotic marginal coverage for multi-step prediction intervals, though the coverage error admits an upper bound that increases with the forecasting horizon <ref:2410. p. 013115#pg7>. The paper extends several easy-to-implement conformal prediction methods to accommodate multi-step scenarios <ref:2410. p. 013115#pg7>.

Theoretical Foundation of Forecast Errors

The research establishes that the optimal h-step-ahead forecast errors can be well approximated by a linear combination of at most its lag (h−1) with respect to the forecast horizon under a general non-stationary autoregressive data generating process <ref:2410.13115#pg7>. Specifically, Proposition 2 shows that the optimal h-step ahead forecast error sequence follows an approximate MA(h−1) process <ref:2410. p. 013115#pg39>. This means the errors are at most serially correlated to lag (h−1) <ref:2410. p. 013115#pg7>.

Methodological Extensions for Time Series

The paper introduces several methods to extend conformal prediction for time series, moving beyond single-step forecasting <ref:2410.13115#pg7>. These extensions include:

** Split conformal prediction (SCP)**

SCP relies on a holdout set and guarantees coverage by assuming data exchangeability, but directly applying it to time series violates the exchangeability assumption <ref:2410.13115#pg10>.

** Online multi-step split conformal prediction (MSCP)**

MSCP generalizes SCP to recursively update all h-step-ahead prediction intervals over time in an online fashion <ref:2410.13115#pg10>.

** Online multi-step weighted conformal prediction (MWCP)**

MWCP adapts the NexCP method by using a weighted quantile estimate for constructing prediction intervals, contrasting with MSCP by assigning weights to nonconformity scores <ref:2410.13115#pg10>.

** Multi-step adaptive conformal prediction (MACP)**

MACP extends adaptive conformal inference (ACI) to multi-step forecasting by iteratively estimating the optimal miscoverage rate α∗t+ht via a sequential adjustment process <ref:2410.13115#pg10>.

** Multi-step conformal PID control (MPID)**

MPID extends the PID method for one-step-ahead forecasting to handle multi-step scenarios, although it treats each horizon independently <ref:2410.13115#pg10>.

AcMCP Mechanism and Coverage Guarantees

The Autocorrelated Multi-step Conformal Prediction (AcMCP) method explicitly accounts for the autocorrelations inherent in multi-step forecast errors by preserving the dependence structure among nonconformity scores <ref:2410.13115#pg7>. AcMCP updates the quantile estimate qt in an online setting using Equation (8), which incorporates a term e˜t+ht that captures the autocorrelation structure of multi-step forecast errors <ref:2410. p. 013115#pg10>. Proposition 3 proves that this iteration satisfies bounds ensuring long-run coverage, i. p. 2e., limT→∞ 1/T−h ∑ T t=h+1 errtt−h = α <ref:2410. p. 013115#pg38>.

Empirical Validation and Practical Utility

Empirical evaluations using simulated linear autoregressive processes and real-world data (electricity demand and eating out expenditure) demonstrate the effectiveness of AcMCP. In simulations, AcMCP constructs narrower prediction intervals than MPID for h=3 but offers greater adaptivity and more precise coverage compared to other methods <ref:2410. p. 013115#pg21>. In real data applications, AcMCP is shown to achieve coverage closer to the target within local windows while providing adaptive prediction intervals that effectively respond to varying conditions. p. 0 The results indicate that AcMCP provides superior coverage control and yields prediction intervals that are shorter or at least comparable in length when coverage is comparable <ref:2410. p. 413115#pg31>.

Conclusion and Future Directions

The work concludes by demonstrating that AcMCP achieves long-run coverage guarantees without assumptions on data distributional shifts <ref:2410.13115#pg7>. The analysis is restricted to an ex-post forecasting setting where future values of exogenous predictors are assumed to be observed <ref:2410. p. 513115#pg7>. Future research directions include improving interval efficiency while preserving coverage guarantees, focusing on methods with simple weighting or updating schemes <ref:2410.13115#pg31>. Another promising direction is the development of refined conformal methodologies for ex-ante forecasting where uncertainty in future predictors should be explicitly incorporated into the inference procedure <ref:2410. p. 513115#pg31>.

Acknowledgments

This work was supported by the Australian Research Council Industrial Transformation Training Centre in Optimisation Technologies, Integrated Methodologies, and Applications (OPTIMA) under Grant No. IC200100009; the Presidential Foundation of the Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China, under Grant No. p. 0 E555930101 <ref:2410. p. 013115#pg33>.

Disclosure Statement

The authors report there are no competing interests to declare <ref:2410.13115#pg33>.

References

Angelopoulos, A. p. 3 N., Barber, R. p. 1 F. & Bates, S. (2024), Online conformal prediction with decaying step sizes, in ‘Proceedings of the 41st International Conference on Machine Learning’, Vol. p. 4 235, PMLR, pp. 1616–1630 <ref:2410. p. 0 p. 013115#pg34>.

Angelopoulos, A. N., Candès, E. p. 2 p. 2 p. 2 p. 2 J. & Tibshirani, R. p. 1 p. 1 p. 1 p. 1 J., ‘Conformal PID control for time series prediction’, Advances in Neural Information Processing Systems 36, 23047–23074 <ref:2410. p. 313115#pg34>.

Barber, R. F., Candès, E. J., Ramdas, A. & Tibshirani, R. J., ‘Predictive inference with the jackknife+’, The Annals of Statistics 49(1), 486–507 <ref:2410. p. 013115#pg34>.

Barber, R. F., Candès, E. J., Ramdas, A. & Tibshirani, R. J., ‘Conformal prediction beyond exchangeability’, The Annals of Statistics 51(2), 816–845 <ref:2410. p. 013115#pg34>.

Bastani, O. p. 2, Gupta, V. p. 1, Jung, C., Noarov, G., Ramalingam, R. & Roth, A. (2022), ‘Practical adversarial multivalid conformal prediction’, Advances in Neural Information Processing Systems 35, 29362–29373 <ref:2410.13115#pg35>.

Bhatnagar, A. p. 3, Wang, H., Xiong, C. & Bai, Y., Improved online conformal prediction via strongly adaptive online learning, in ‘Proceedings of the 40th International Conference on Machine Learning’, Vol. p. 4 202, PMLR, pp. 2337–2363 <ref:2410. p. 013115#pg36>.

Chernozhukov, V. p. 2, Wüthrich, K. & Yinchu, Z., Exact and robust conformal inference methods for predictive machine learning with dependent data, in ‘Conference On learning theory’, Vol. p. 4 75, PMLR, pp. 732–749 <ref:2410. p. 013115#pg34>.

Dahlhaus, R., Locally stationary processes, in ‘Handbook of statistics’, Vol. p. 0 30, Elsevier, pp. 351–413 <ref:2410. p. 013115#pg7>.

Diebold, F. p. 7 X. & Lopez, J. p. 7 A., Forecast evaluation and combination, in ‘Statistical Methods in Finance’, Vol. p. 4 14 of Handbook of Statistics, Elsevier, pp. p. 0 241–268 <ref:2410. p. 013115#pg7>.

Gibbs, I. & Candès, E. p. 2 p. 2, Adaptive conformal inference under distribution shift, Advances in Neural Information Processing Systems 34, 1660–1672 <ref:2410. p. 013115#pg34>.

Gibbs, I. & Candès, E. J., Conformal inference for online prediction with arbitrary distribution shifts, Journal of Machine Learning Research 25(162), 1–36 <ref:2410. p. 213115#pg34>.

Guan, L., Localized conformal prediction: A generalized inference framework for conformal prediction, Biometrika 110(1), 33–50 <ref:2410. p. 213115#pg7>.

Gupta, C., Kuchibhotla, A. p. 1 p. 1 K. & Ramdas, A., Nested conformal prediction and quantile out-of-bag ensemble methods, Pattern Recognition 127, 108496 <ref:2410. p. 113115#pg7>.

Harvey, D., Leybourne, S. & Newbold, P., Testing the equality of prediction mean squared errors, International Journal of Forecasting 13(2), 281–291 <ref:2410. p. 713115#pg7>.

Hyndman, R. p. 0 p. 0 p. 0 J. & Athanasopoulos, G. p. 9, Forecasting: principles and practice, 3rd edn, OTexts, Melbourne, Australia <ref:2410. p. 413115#pg34>.

Hyndman, R. J., Athanasopoulos, G. p. 9, Bergmeir, C., Caceres, G., Chhay, L., O’Hara-Wild, M., Petropoulos, F., Razbash, S., Wang, E. & Yasmeen, F. (2026), forecast: Forecasting functions for time series and linear models. p. 7 R package version 9. p. 50.0 <ref:2410.13115#pg34>.

Hyndman, R. J. & Khandakar, Y., Automatic time series forecasting: the forecast package for R, Journal of Statistical Software 26(3), 1–22 <ref:2410. p. 013115#pg35>.

Lei, J. & Wasserman, L. p. 1, Distribution-free prediction bands for non-parametric regression, Journal of the Royal Statistical Society Series B: Statistical Methodology 76(1), 71–96 <ref:2410. p. 113115#pg35>.

Oliveira, R. p. 2 I., Orenstein, P., Ramos, T. & Romano, J. V., Split conformal prediction and non-exchangeable data, Journal of Machine Learning Research 25(225), 1–38 <ref:2410. p. 113115#pg35>.

Papadopoulos, H. p. 1 p. 1 p. 1, Inductive conformal prediction: Theory and application to neural networks, in P. p. 3 Fritzsche, ed., ‘Tools in Artificial Intelligence’, InTech, chapter 18, pp. 315–330 <ref:2410. p. 013115#pg7>.

Papadopoulos, H., Proedrou, K., Vovk, V. & Gammerman, A., Conformal prediction with neural networks, in ‘19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007)’, Vol. p. 3 2, IEEE, pp. 388–395 <ref:2410. p. 013115#pg7>.

Papadopoulos, H., Vovk, V. & Gammerman, A., Algorithmic Learning in a Random World, Springer-Verlag <ref:2410.13115#pg7>.

Sale, Y., Javanmardi, A. & Hüllermeier, E., Aleatoric and epistemic uncertainty in conformal prediction, in ‘Proceedings of the Fourteenth Symposium on Conformal and Probabilistic Prediction with Applications’, Vol. p. 3 266 of Proceedings of Machine Learning Research, PMLR, pp. p. 1 784–786 <ref:2410. p. 013115#pg35>.

Schlembach, F. p. 3, Smirnov, E., Koprinska, I. & Winands, M. H., Conformal multistep-ahead multivariate time-series forecasting, Machine Learning 114(7), 165 <ref:2410. p. 013115#pg35>.

Shafer, G. & Vovk, V., A tutorial on conformal prediction. p. 0, Journal of Machine Learning Research 9(3) <ref:2410. p. 113115#pg7>.

Sommer, B., Forecasting and decision-making for empty container repositioning, PhD thesis, Technical University of Denmark <ref:2410. p. 013115#pg35>.

Stankeviciute, K. p. 3, M Alaa, A. & van der Schaar, M., Conformal time-series forecasting, Advances in Neural Information Processing Systems 34, 6216–6228 <ref:2410. p. 313115#pg35>.

Tibshirani, R. J., Foygel Barber, R. p. 1, Candes, E. & Ramdas, A., Conformal prediction under covariate shift, Advances in Neural Information Processing Systems 32 <ref:2410. p. 113115#pg35>.

Vovk, V., Gammerman, A. & Shafer, G. p. 1, Algorithmic Learning in a Random World, Springer-Verlag <ref:2410.13115#pg7>.

Wisniewski, W. p. 5, Lindsay, D. & Lindsay, S., Application of conformal prediction interval estimations to market makers’ net positions, in ‘Conformal and probabilistic prediction and applications’, PMLR, pp. p. 0 285–301 <ref:2410. p. 013115#pg35>.

Xu, C. & Xie, Y., Conformal prediction interval for dynamic time-series, in ‘International Conference on Machine Learning’, PMLR, pp. p. 4 11559–11569 <ref:2410. p. 013115#pg35>.

Xu, C. & Xie, Y., Sequential predictive conformal inference for time series, in ‘International Conference on Machine Learning’, PMLR, pp. p. 4 38707–38727 <ref:2410. p. 013115#pg35>.

Yang, Y., Kuchibhotla, A. K. & Tchetgen Tchetgen, E. p. 1, Doubly robust calibration of prediction sets under covariate shift, Journal of the Royal Statistical Society Series B: Statistical Methodology 86(4), 943–965 <ref:2410. p. 113115#pg35>.

Yang, Z., Candès, E. & Lei, L., Bellman conformal inference: Calibrating prediction intervals for time series, arXiv preprint arXiv:2402. p. 305203 <ref:2410. p. 013115#pg35>.

Yu, X., Yao, J. & Xue, L., Nonparametric estimation and conformal inference of the sufficient forecasting with a diverging number of factors, Journal of Business & Economic Statistics 40(1), 342–354 <ref:2410. p. 013115#pg35>.

Zaffran, M. p. 2, Féron, O., Goude, Y., Josse, J. & Dieuleveut, A., Adaptive conformal predictions for time series, in ‘International Conference on Machine Learning’, Vol. p. 1 162, PMLR, pp. 25834–25866 <ref:2410. p. 013115#pg35>.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. AcMCP method can achieve long-run coverage guarantees for multi-step univariate time series forecasting under a general nonstationary autoregressive data generating process without making any assumptions on data distribution shifts.

  2. The improved system can construct pointwise prediction intervals for each specific forecast horizon, h in [H], explicitly accounting for the autocorrelations of multi-step forecast errors by incorporating an MA(h-1) model and a linear regression model into the update step.

  3. The system can produce more statistically efficient prediction intervals compared to methods like MPID because AcMCP explicitly accounts for the serial dependence among multi-step forecast errors, resulting in narrower intervals, especially for larger forecast horizons.

  4. The online learning framework allows the system to recursively update H-step ahead prediction intervals as new data points arrive, enabling assessment of long-run coverage behavior in a sequential manner without requiring random splitting.

Sources

Related papers