A strategy to avoid particle depletion in recursive Bayesian inference

TL;DR

This paper introduces a novel approach to recursive Bayesian inference that mitigates particle depletion by generating proposals from a smoothed empirical distribution, improving accuracy in streaming data applications.

Contribution

The paper proposes a new proposal generation method using smoothed empirical distributions to prevent particle depletion in recursive Bayesian inference.

Findings

Method reduces particle depletion effectively.

Demonstrated improved accuracy in simulations.

Applicable to logistic and hierarchical models.

Abstract

Recursive Bayesian inference, in which posterior beliefs are updated in light of accumulating data, is a tool for implementing Bayesian models in applications with streaming and/or very large data sets. As the posterior of one iteration becomes the prior for the next, beliefs are updated sequentially instead of all-at-once. Thus, recursive inference is relevant for both streaming data and settings where data too numerous to be analyzed together can be partitioned into manageable pieces. In practice, posteriors are characterized by samples obtained using, e.g., acceptance/rejection sampling in which draws from the posterior of one iteration are used as proposals for the next. While simple to implement, such filtering approaches suffer from particle depletion, degrading each sample's ability to represent its target posterior. As a remedy, we investigate generating proposals from a smoothed version of the preceding sample's empirical distribution. The method retains computationally valuable properties of similar methods, but without particle depletion, and we demonstrate its accuracy in simulation. We apply the method to data simulated from both a simple, logistic regression model as well as a hierarchical model originally developed for classifying forest vegetation in New Mexico using satellite imagery.