On Large Lag Smoothing for Hidden Markov Models
From MaRDI portal
Publication:5203791
Abstract: In this article we consider the smoothing problem for hidden Markov models (HMM). Given a hidden Markov chain and observations , our objective is to compute for some real-valued, integrable functional and fixed, and for some realisation of . 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 , for arbitrary with a cost of . This is in contrast to the same direct Monte Carlo method, which requires a cost of 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.
Recommendations
- On approximation of smoothing probabilities for hidden Markov models
- Recursive smoothers for hidden discrete-time Markov chains
- A correction to ``On approximation of smoothing probabilities for hidden Markov models
- Exact smoothing in hidden conditionally Markov switching linear models
- Consistent Estimation of the Filtering and Marginal Smoothing Distributions in Nonparametric Hidden Markov Models
- Likelihood computation for hidden Markov models via generalized two-filter smoothing
- Sequential Monte Carlo smoothing for general state space hidden Markov models
- Reduced-Complexity Estimation for Large-Scale Hidden Markov Models
- Risk-sensitive filtering and smoothing for hidden Markov models
- scientific article; zbMATH DE number 2144803
Cites work
- scientific article; zbMATH DE number 5919872 (Why is no real title available?)
- scientific article; zbMATH DE number 4160608 (Why is no real title available?)
- scientific article; zbMATH DE number 2000348 (Why is no real title available?)
- A backward particle interpretation of Feynman-Kac formulae
- A multiscale strategy for Bayesian inference using transport maps
- Chebyshev and Fourier spectral methods.
- Efficient particle-based online smoothing in general hidden Markov models: the PaRIS algorithm
- Gibbs Flow for Approximate Transport with Applications to Bayesian Computation
- Inference in hidden Markov models.
- Inference via low-dimensional couplings
- Multilevel Monte Carlo Path Simulation
- Multilevel Particle Filters
- Multilevel ensemble Kalman filtering
- Multilevel ensemble transform particle filtering
- On particle Gibbs sampling
- On particle methods for parameter estimation in state-space models
- On the Kantorovich-Rubinstein theorem
- On the behaviour of the backward interpretation of Feynman-Kac formulae under verifiable conditions
- Particle Gibbs with ancestor sampling
- Particle Markov Chain Monte Carlo Methods
- Smoothing with couplings of conditional particle filters
- Unbiased estimation with square root convergence for SDE models
Cited in
(2)
This page was built for publication: On Large Lag Smoothing for Hidden Markov Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203791)