Online Randomized Distributionally Robust Forecast Combination for Dependent Data

ABSTRACT We develop an online framework for forecast combination that integrates distributional robustness with randomized weights in dependent time‐series settings. Unlike deterministic approaches that update a single weight vector, our approach models the weights as random draws from parametric families, with parameters updated sequentially to minimize a worst‐case expected loss over a Wasserstein ambiguity set centered at the empirical joint distribution of forecasts and realizations. Randomization facilitates adaptive exploration of alternative weight configurations and improves calibration by accounting for combination uncertainty, while distributional robustness provides protection against heavy tails and model misspecification. We establish finite‐sample concentration bounds for ‐mixing processes, derive oracle‐type excess risk and online regret guarantees, and characterize the bias‐variance trade‐off induced by randomization. In addition, we show that a batch version of the estimator is asymptotically normal under standard identification and mixing conditions. Monte Carlo experiments across a variety of data‐generating processes demonstrate that the proposed method achieves lower worst‐case error, faster post‐break adjustment, and improved predictive coverage relative to existing forecast combination methods. An empirical application to macroeconomic forecasting further illustrates its robustness and effectiveness under dependence and evolving dynamics.

Authors

Institutions

Publication Details

Journal
Journal of Time Series Analysis
Published
2026-03-15
DOI
https://doi.org/10.1111/jtsa.70056
Primary Topic
Forecasting Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online Randomized Distributionally Robust Forecast Combination for Dependent Data

Tao Wang
Journal of Time Series Analysis
Forecasting Techniques and Applications
article

Online Randomized Distributionally Robust Forecast Combination for Dependent Data

Tao Wang
article en

Abstract

ABSTRACT We develop an online framework for forecast combination that integrates distributional robustness with randomized weights in dependent time‐series settings. Unlike deterministic approaches that update a single weight vector, our approach models the weights as random draws from parametric families, with parameters updated sequentially to minimize a worst‐case expected loss over a Wasserstein ambiguity set centered at the empirical joint distribution of forecasts and realizations. Randomization facilitates adaptive exploration of alternative weight configurations and improves calibration by accounting for combination uncertainty, while distributional robustness provides protection against heavy tails and model misspecification. We establish finite‐sample concentration bounds for ‐mixing processes, derive oracle‐type excess risk and online regret guarantees, and characterize the bias‐variance trade‐off induced by randomization. In addition, we show that a batch version of the estimator is asymptotically normal under standard identification and mixing conditions. Monte Carlo experiments across a variety of data‐generating processes demonstrate that the proposed method achieves lower worst‐case error, faster post‐break adjustment, and improved predictive coverage relative to existing forecast combination methods. An empirical application to macroeconomic forecasting further illustrates its robustness and effectiveness under dependence and evolving dynamics.

Journal of Time Series Analysis
University of Victoria (CA)
Openalex Percentile: Top 25%
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.