English

On Large Lag Smoothing for Hidden Markov Models

Methodology 2018-04-20 v1

Abstract

In this article we consider the smoothing problem for hidden Markov models (HMM). Given a hidden Markov chain {Xn}n0\{X_n\}_{n\geq 0} and observations {Yn}n0\{Y_n\}_{n\geq 0}, our objective is to compute E[φ(X0,,Xk)y0,,yn]\mathbb{E}[\varphi(X_0,\dots,X_k)|y_{0},\dots,y_n] for some real-valued, integrable functional φ\varphi and kk fixed, knk \ll n and for some realisation (y0,,yn)(y_0,\dots,y_n) of (Y0,,Yn)(Y_0,\dots,Y_n). We introduce a novel application of the multilevel Monte Carlo (MLMC) method with a coupling based on the Knothe-Rosenblatt rearrangement. We prove that this method can approximate the afore-mentioned quantity with a mean square error (MSE) of O(ϵ2)\mathcal{O}(\epsilon^2), for arbitrary ϵ>0\epsilon>0 with a cost of O(ϵ2)\mathcal{O}(\epsilon^{-2}). This is in contrast to the same direct Monte Carlo method, which requires a cost of O(nϵ2)\mathcal{O}(n\epsilon^{-2}) for the same MSE. The approach we suggest is, in general, not possible to implement, so the optimal transport methodology of \cite{span} is used, which directly approximates our strategy. We show that our theoretical improvements are achieved, even under approximation, in several numerical examples.

Keywords

Cite

@article{arxiv.1804.07117,
  title  = {On Large Lag Smoothing for Hidden Markov Models},
  author = {Jeremie Houssineau and Ajay Jasra and Sumeetpal S. Singh},
  journal= {arXiv preprint arXiv:1804.07117},
  year   = {2018}
}
R2 v1 2026-06-23T01:28:37.376Z