Abstract
Particle Gibbs with ancestor sampling is an efficient and statistically principled algorithm for learning of dynamic systems. However, the ancestor sampling step used to improve mixing of the Markov chain requires the possibly expensive calculation of a set of ancestor weights for the complete particle system. In this paper, we propose a rejection-sampling-based algorithm for ancestor sampling in particle Gibbs that mitigates this problem. Additionally, performance guarantees and a fallback strategy to prevent suffering from high rejection rates are discussed. The performance of the method is illustrated in two numerical examples.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 29th IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2019 |
| Publisher | IEEE |
| Number of pages | 6 |
| ISBN (Electronic) | 9781728108247 |
| DOIs | |
| Publication status | Published - 1 Oct 2019 |
| MoE publication type | A4 Conference publication |
| Event | IEEE International Workshop on Machine Learning for Signal Processing - Pittsburgh, United States Duration: 13 Oct 2019 → 16 Oct 2019 Conference number: 29 |
Publication series
| Name | IEEE International Workshop on Machine Learning for Signal Processing |
|---|---|
| Publisher | IEEE |
| ISSN (Print) | 2161-0363 |
| ISSN (Electronic) | 2161-0371 |
Workshop
| Workshop | IEEE International Workshop on Machine Learning for Signal Processing |
|---|---|
| Abbreviated title | MLSP |
| Country/Territory | United States |
| City | Pittsburgh |
| Period | 13/10/2019 → 16/10/2019 |
Funding
Financial support by the Academy of Finland is gratefully acknowledged.
Keywords
- Particle filters
- Particle Markov chain Monte Carlo
- Statistical learning
Fingerprint
Dive into the research topics of 'Rejection-Sampling-Based Ancestor Sampling for Particle Gibbs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver