Skip to main navigation Skip to search Skip to main content

Rejection-Sampling-Based Ancestor Sampling for Particle Gibbs

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

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 languageEnglish
Title of host publicationProceedings of the 29th IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2019
PublisherIEEE
Number of pages6
ISBN (Electronic)9781728108247
DOIs
Publication statusPublished - 1 Oct 2019
MoE publication typeA4 Conference publication
EventIEEE International Workshop on Machine Learning for Signal Processing - Pittsburgh, United States
Duration: 13 Oct 201916 Oct 2019
Conference number: 29

Publication series

NameIEEE International Workshop on Machine Learning for Signal Processing
PublisherIEEE
ISSN (Print)2161-0363
ISSN (Electronic)2161-0371

Workshop

WorkshopIEEE International Workshop on Machine Learning for Signal Processing
Abbreviated titleMLSP
Country/TerritoryUnited States
CityPittsburgh
Period13/10/201916/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