Fast filtering with new sparse transition Markov chains - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Fast filtering with new sparse transition Markov chains

Résumé

We put forward a novel Markov chain approximation method with regard to the filtering problem. The novelty consists in making use of the sparse grid theory which deals with the curse of dimensionality. Our method imitates the marginal distribution of the latent continuous process with a discrete probability distribution on a sparse grid. The grid points may be seen as the states of a Markov chain which we construct to imitate the whole process. The transition probabilities are then chosen to preserve the joint moments of the underlying continuous process. We provide a simulation study on a multivariate stochastic volatility filtering problem to compare the proposed methodology with a similar technique and the particle filtering
Fichier non déposé

Dates et versions

hal-01358384 , version 1 (31-08-2016)

Identifiants

Citer

Ivan Gorynin, Emmanuel Monfrini, Wojciech Pieczynski. Fast filtering with new sparse transition Markov chains. SSP 2016 : IEEE worshop on Statistical Signal Processing, Jun 2016, Palma De Mallorca, Spain. pp.1 - 5, ⟨10.1109/SSP.2016.7551839⟩. ⟨hal-01358384⟩
39 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More