Approximating Posterior Predictive Distributions by Averaging Output From Many Particle Filters

06/27/2020
by   Taylor R. Brown, et al.
0

This paper introduces the particle swarm algorithm, a recursive and embarrassingly parallel algorithm that targets an approximation to the sequence of posterior predictive distributions by averaging expectation approximations from many particle filters. A law of large numbers and a central limit theorem are provided, as well as an numerical study of simulated data from a stochastic volatility model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2023

An overview of differentiable particle filters for data-adaptive sequential Bayesian inference

By approximating posterior distributions with weighted samples, particle...
research
04/16/2021

Multilevel Bootstrap Particle Filter

We consider situations where the applicability of sequential Monte Carlo...
research
07/21/2017

Graphical posterior predictive classifier: Bayesian model averaging with particle Gibbs

In this study, we present a multi-class graphical Bayesian predictive cl...
research
03/24/2023

GAPSLAM: Blending Gaussian Approximation and Particle Filters for Real-Time Non-Gaussian SLAM

Inferring the posterior distribution in SLAM is critical for evaluating ...
research
10/11/2018

Central Limit Theorems for Coupled Particle Filters

In this article we prove a new central limit theorem (CLT) for coupled p...
research
02/02/2023

Unsupervised Learning of Sampling Distributions for Particle Filters

Accurate estimation of the states of a nonlinear dynamical system is cru...
research
12/17/2020

Simulation of conditional expectations under fast mean-reverting stochastic volatility models

In this short paper, we study the simulation of a large system of stocha...

Please sign up or login with your details

Forgot password? Click here to reset