On Large Lag Smoothing for Hidden Markov Models

Abstract

In this article we consider the smoothing problem for hidden Markov models (HMM). Given a hidden Markov chain \Xn\n≥ 0 and observations \Yn\n≥ 0, our objective is to compute E[(X0,…,Xk)|y0,…,yn] for some real-valued, integrable functional and k fixed, k n and for some realisation (y0,…,yn) of (Y0,…,Yn). 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), for arbitrary ε>0 with a cost of O(ε-2). This is in contrast to the same direct Monte Carlo method, which requires a cost of O(nε-2) for the same MSE. The approach we suggest is, in general, not possible to implement, so the optimal transport methodology of span is used, which directly approximates our strategy. We show that our theoretical improvements are achieved, even under approximation, in several numerical examples.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…