Hedging Memory Horizons for Non-Stationary Prediction via Online Aggregation
Yutong Wang, Yannig Goude, Qiwei Yao

TL;DR
This paper introduces MELO, a model-agnostic online aggregation method that adaptively hedges memory horizons to improve non-stationary prediction accuracy under distribution shifts.
Contribution
It proposes a novel online aggregation technique combining multiple adaptation scales with theoretical guarantees and practical effectiveness demonstrated on electricity load forecasting.
Findings
MELO reduces RMSE by 34.7% compared to base predictors.
It outperforms models using external COVID policy covariates.
Requires only lightweight recursive updates without retraining.
Abstract
We study online prediction under distribution shift, where inputs arrive chronologically and outcomes are revealed only after prediction. In this setting, predictors must remain stable in quiet regimes yet adapt when regimes shift, and the right adaptation memory is unknown in advance. We propose MELO (Memory-hedged Exponentially Weighted Least-Squares Online aggregation), a model-agnostic method that hedges across adaptation scales: it wraps any non-anticipating base-predictor pool with exponentially weighted least-squares (EWLS) adaptation experts at multiple forgetting factors, and aggregates raw and EWLS-adapted forecasts with MLpol, a parameter-free online aggregation rule. Under boundedness conditions, we establish deterministic oracle inequalities showing that it competes with both the best raw predictor and the best bounded, time-varying affine combinations of the base…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
