Papers › Robust Sequential Online Prediction with Dynamic Ensemble of Multiple Models: A Review
Robust Sequential Online Prediction with Dynamic Ensemble of Multiple Models: A Review
Bin Liu
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The use of time series for sequential online prediction (SOP) has long been a research topic, but achieving robust and computationally efficient SOP with non-stationary time series remains a challenge. This paper reviews a framework, called Bayesian Dynamic Ensemble of Multiple Models (BDEMM), which addresses SOP in a theoretically elegant way, and have found widespread use in various fields. BDEMM utilizes a model pool of weighted candidate models, adapted online using Bayesian formalism to capture possible temporal evolutions of the data. This review comprehensively describes BDEMM from five perspectives: its theoretical foundations, algorithms, practical applications, connections to other research, and strengths, limitations, and potential future directions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections