Publications

BibTex format

@article{Míguez:2013:10.1007/s11222-011-9294-4,
author = {Míguez, J and Crisan, D and Djuri, PM},
doi = {10.1007/s11222-011-9294-4},
journal = {Statistics and Computing},
pages = {91--107},
title = {On the convergence of two sequential Monte Carlo methods for maximum a posteriori sequence estimation and stochastic global optimization},
url = {http://dx.doi.org/10.1007/s11222-011-9294-4},
volume = {23},
year = {2013}
}

Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - This paper addresses the problem of maximum a posteriori (MAP) sequence estimation in general state-space models. We consider two algorithms based on the sequential Monte Carlo (SMC) methodology (also known as particle filtering). We prove that they produce approximations of the MAP estimator and that they converge almost surely. We also derive a lower bound for the number of particles that are needed to achieve a given approximation accuracy. In the last part of the paper, we investigate the application of particle filtering and MAP estimation to the global optimization of a class of (possibly non-convex and possibly non-differentiable) cost functions. In particular, we show how to convert the cost-minimization problem into one of MAP sequence estimation for a state-space model that is "matched" to the cost of interest. We provide examples that illustrate the application of the methodology as well as numerical results. © 2011 Springer Science+Business Media, LLC.
AU  - Míguez,J
AU  - Crisan,D
AU  - Djuri,PM
DO  - 10.1007/s11222-011-9294-4
EP  - 107
PY  - 2013///
SN  - 0960-3174
SP  - 91
TI  - On the convergence of two sequential Monte Carlo methods for maximum a posteriori sequence estimation and stochastic global optimization
T2  - Statistics and Computing
UR  - http://dx.doi.org/10.1007/s11222-011-9294-4
VL  - 23
ER  -

Download

ProfessorDanCrisan

Contact

Location

Summary

Citation

BibTex format

RIS format (EndNote, RefMan)