Research
Doubly Outlier-Robust Online Infinite Hidden Markov Model
arXiv:2604.14322v1 Announce Type: cross Abstract: We derive a robust update rule for the online infinite hidden Markov model (iHMM) for when the streaming data contains outliers and the model is missp
arXiv:2604.14322v1 Announce Type: cross Abstract: We derive a robust update rule for the online infinite hidden Markov model (iHMM) for when the streaming data contains outliers and the model is misspecified. Leveraging recent advances in generalised Bayesian inference, we define robustness via the posterior influence function (PIF), and provide conditions under which the online iHMM has bounded PIF. Imposing robustness inevitably induces an adaptation lag for regime switching. Our method, which is called Batched Robust iHMM (BR-iHMM), balances adaptivity and robustness with two additional tunable parameters. Across limit order book data, hourly electricity demand, and a synthetic high-dimensional linear system, BR-iHMM reduces one-step-ahead forecasting error by up to 67% relative to competing online Bayesian methods. Together with theoretical guarantees of bounded PIF, our results highlight the practicality of our approach for both forecasting and interpretable online learning.
Related
- A Predictive View on Streaming Hidden Markov Models
- Minimax Optimality and Spectral Routing for Majority-Vote Ensembles under Markov Dependence
- PAC learning PDFA from data streams
- Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning
Source: arXiv cs.LG | 2026-04-17