Uncertainty Quantification and Its Improvement in Machine Learning Using GARCH and DBPS for Time Series Forecasting

This study proposes a novel approach to improve forecast accuracy and uncertainty quantification in time series forecasting through the synthesis of Machine Learning (ML) models with Dynamic Bayesian Predictive Synthesis (DBPS). We synthesize predictive distributions from three ML models—LightGBM, LSTM, and Prophet—through DBPS, notably employing Generalized Autoregressive Conditional Heteroskedasticity (GARCH) models to estimate uncertainties for ML forecasts. Empirical analysis using meteorological data from Delhi, India, demonstrates that our proposed method outperforms individual ML models and conventional ensemble methods, achieving improvements of up to 25.2% in RMSE and 25.4% in MAE. Furthermore, evaluating predictive distributions using Log Predictive Density Ratio (LPDR) reveals superior performance to other models, indicating a more accurate capture of observational uncertainty. Analysis of DBPS weights reveals that the offsetting effect of prediction biases is one of the factors contributing to improved forecast accuracy. These findings suggest that the synthesis of ML models and DBPS enables more reliable forecasting and improved uncertainty quantification.

Authors

Institutions

Publication Details

Journal
Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications
Published
2025-10-28
DOI
https://doi.org/10.5687/sss.2025.7
Primary Topic
Forecasting Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Uncertainty Quantification and Its Improvement in Machine Learning Using GARCH and DBPS for Time Series Forecasting

Naoto Nakano, Ryota Hashiura, Akihiro Omori
Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications
Forecasting Techniques and Applications
article

Uncertainty Quantification and Its Improvement in Machine Learning Using GARCH and DBPS for Time Series Forecasting

Naoto Nakano, Ryota Hashiura, Akihiro Omori
article en

Abstract

This study proposes a novel approach to improve forecast accuracy and uncertainty quantification in time series forecasting through the synthesis of Machine Learning (ML) models with Dynamic Bayesian Predictive Synthesis (DBPS). We synthesize predictive distributions from three ML models—LightGBM, LSTM, and Prophet—through DBPS, notably employing Generalized Autoregressive Conditional Heteroskedasticity (GARCH) models to estimate uncertainties for ML forecasts. Empirical analysis using meteorological data from Delhi, India, demonstrates that our proposed method outperforms individual ML models and conventional ensemble methods, achieving improvements of up to 25.2% in RMSE and 25.4% in MAE. Furthermore, evaluating predictive distributions using Log Predictive Density Ratio (LPDR) reveals superior performance to other models, indicating a more accurate capture of observational uncertainty. Analysis of DBPS weights reveals that the offsetting effect of prediction biases is one of the factors contributing to improved forecast accuracy. These findings suggest that the synthesis of ML models and DBPS enables more reliable forecasting and improved uncertainty quantification.

Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its ApplicationsVol. 2025(0)
Meiji University (JP)
Japan Society for the Promotion of Science
Climate action
Openalex Percentile: Top 29%
Forecasting Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.