An Adaptive Resample-Move Algorithm for Estimating Normalizing Constants

04/07/2016
by   Marco Fraccaro, et al.
0

The estimation of normalizing constants is a fundamental step in probabilistic model comparison. Sequential Monte Carlo methods may be used for this task and have the advantage of being inherently parallelizable. However, the standard choice of using a fixed number of particles at each iteration is suboptimal because some steps will contribute disproportionately to the variance of the estimate. We introduce an adaptive version of the Resample-Move algorithm, in which the particle set is adaptively expanded whenever a better approximation of an intermediate distribution is needed. The algorithm builds on the expression for the optimal number of particles and the corresponding minimum variance found under ideal conditions. Benchmark results on challenging Gaussian Process Classification and Restricted Boltzmann Machine applications show that Adaptive Resample-Move (ARM) estimates the normalizing constant with a smaller variance, using less computational resources, than either Resample-Move with a fixed number of particles or Annealed Importance Sampling. A further advantage over Annealed Importance Sampling is that ARM is easier to tune.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/04/2012

Toward Practical N2 Monte Carlo: the Marginal Particle Filter

Sequential Monte Carlo techniques are useful for state estimation in non...
research
06/13/2012

Sampling First Order Logical Particles

Approximate inference in dynamic systems is the problem of estimating th...
research
03/20/2019

Adaptive importance sampling by kernel smoothing

A key determinant of the success of Monte Carlo simulation is the sampli...
research
03/01/2023

Efficient Solution to 3D-LiDAR-based Monte Carlo Localization with Fusion of Measurement Model Optimization via Importance Sampling

This paper presents an efficient solution to 3D-LiDAR-based Monte Carlo ...
research
09/16/2020

Bayesian phase estimation with adaptive grid refinement

We introduce a novel Bayesian phase estimation technique based on adapti...
research
01/27/2022

Adaptive exact-approximate sequential Monte Carlo

Exact-approximate sequential Monte Carlo (SMC) methods target the exact ...
research
12/17/2017

Distributed SMC-PHD Fusion for Partial, Arithmetic Average Consensus

We propose an average consensus approach for distributed SMC-PHD (sequen...

Please sign up or login with your details

Forgot password? Click here to reset