Compressed Monte Carlo with application in particle filtering Articles uri icon

authors

  • MARTINO, LUCA
  • ELVIRA ARREGUI, VICTOR

publication date

  • October 2020

start page

  • 331

end page

  • 352

volume

  • 553

International Standard Serial Number (ISSN)

  • 0020-0255

Electronic International Standard Serial Number (EISSN)

  • 1872-6291

abstract

  • Bayesian models have become very popular over the last years in several fields such as signal processing, statistics, and machine learning. Bayesian inference requires the approximation of complicated integrals involving posterior distributions. For this purpose, Monte Carlo (MC) methods, such as Markov Chain Monte Carlo and importance sampling algorithms, are often employed. In this work, we introduce the theory and practice of a Compressed MC (C-MC) scheme to compress the statistical information contained in a set of random samples. In its basic version, C-MC is strictly related to the stratification technique, a well-known method used for variance reduction purposes. Deterministic C-MC schemes are also presented, which provide very good performance. The compression problem is strictly related to the moment matching approach applied in different filtering techniques, usually called as Gaussian quadrature rules or sigma-point methods. C-MC can be employed in a distributed Bayesian inference framework when cheap and fast communications with a central processor are required. Furthermore, C-MC is useful within particle filtering and adaptive IS algorithms, as shown by three novel schemes introduced in this work. Six numerical results confirm the benefits of the introduced schemes, outperforming the corresponding benchmark methods. A related code is also provided. (The code is provided at http://www.lucamartino.altervista.org/CMC_CODE_pub_EX1.zip)

keywords

  • bayesian inference; distributed algorithms; gaussian quadrature; herding algorithms; importance sampling; mcmc; particle filtering; sigma points