Identifiability and consistent estimation of nonparametric translation hidden Markov models with general state space

02/04/2019
by   Elisabeth Gassiat, et al.
0

In this paper, we consider partially observed dynamical systems where the observations are given as the sum of latent variables lying in a general state space and some independent noise with unknown distribution. In the case of dependent latent variables such as Markov chains, it is shown that this fully nonparametric model is identifiable with respect to both the distribution of the latent variables and the distribution of the noise, under mostly a light tail assumption on the latent variables. Two nonparametric estimation methods are proposed and we prove that the corresponding estimators are consistent for the weak convergence topology. These results are illustrated with numerical experiments.

READ FULL TEXT
research
05/28/2022

High-dimensional factor copula models with estimation of latent variables

Factor models are a parsimonious way to explain the dependence of variab...
research
03/03/2022

Interpretable Latent Variables in Deep State Space Models

We introduce a new version of deep state-space models (DSSMs) that combi...
research
09/21/2016

Learning HMMs with Nonparametric Emissions via Spectral Decompositions of Continuous Matrices

Recently, there has been a surge of interest in using spectral methods f...
research
06/20/2018

Estimation of component reliability in repairable series systems with masked cause of failure by means of latent variables

In this work, we propose two methods, a Bayesian and a maximum likelihoo...
research
10/15/2020

Towards sharp error analysis of extended Lagrangian molecular dynamics

The extended Lagrangian molecular dynamics (XLMD) method provides a usef...
research
04/20/2022

Stability Preserving Data-driven Models With Latent Dynamics

In this paper, we introduce a data-driven modeling approach for dynamics...
research
12/23/2013

Using Latent Binary Variables for Online Reconstruction of Large Scale Systems

We propose a probabilistic graphical model realizing a minimal encoding ...

Please sign up or login with your details

Forgot password? Click here to reset