On sequential Monte Carlo sampling methods for Bayesian filtering
Statistics and Computing
Minimax Optimization of Investment Portfolio by Quantile Criterion
Automation and Remote Control
Journal of Global Optimization
Particle filters for positioning, navigation, and tracking
IEEE Transactions on Signal Processing
A Basic Convergence Result for Particle Filtering
IEEE Transactions on Signal Processing
A Minimax Approach for the Joint Design of Acoustic Crosstalk Cancellation Filters
IEEE Transactions on Audio, Speech, and Language Processing
Hi-index | 0.00 |
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.