Sequential Kernel Herding: Frank-Wolfe Optimization for Particle Filtering
arXiv:1501.02056
Abstract
Recently, the Frank-Wolfe optimization algorithm was suggested as a procedure to obtain adaptive quadrature rules for integrals of functions in a reproducing kernel Hilbert space (RKHS) with a potentially faster rate of convergence than Monte Carlo integration (and "kernel herding" was shown to be a special case of this procedure). In this paper, we propose to replace the random sampling step in a particle filter by Frank-Wolfe optimization. By optimizing the position of the particles, we can obtain better accuracy than random or quasi-Monte Carlo sampling. In applications where the evaluation of the emission probabilities is expensive (such as in robot localization), the additional computational cost to generate the particles through optimization can be justified. Experiments on standard synthetic examples as well as on a robot localization task indicate indeed an improvement of accuracy over random and quasi-Monte Carlo sampling.
in 18th International Conference on Artificial Intelligence and Statistics (AISTATS), May 2015, San Diego, United States. 38, JMLR Workshop and Conference Proceedings
Cited by in corpus (11)
- Kernel Mean Embedding of Distributions: A Review and Beyond
- Learning Decentralized Controllers for Robot Swarms with Graph Neural Networks
- Compressed Monte Carlo with application in particle filtering
- Randomized Block Frank-Wolfe for Convergent Large-Scale Learning
- Adaptive quadrature schemes for Bayesian inference via active learning
- Control functionals for Monte Carlo integration
- Kernel interpolation with continuous volume sampling
- Safe Screening for the Generalized Conditional Gradient Method
- Generalized Kernel Thinning
- Nearly Consistent Finite Particle Estimates in Streaming Importance Sampling
- Bayesian posterior approximation via greedy particle optimization