Recursive Adaptive Importance Sampling with Optimal Replenishment

Increased access to computing resources has led to the development of algorithms that can run efficiently on multi-core processing units or in distributed computing environments. In the context of Bayesian inference, many parallel computing approaches to fit statistical models have been proposed in the context of Markov Chain Monte Carlo methods, but they either have limited gains due to high latency cost or rely on model-specific decompositions. Alternatively, adaptive importance sampling, sequential Monte Carlo, and recursive Bayesian methods provide a parallel-friendly and asymptotically exact framework with well-developed theory for error estimation. We propose a recursive adaptive importance sampling approach that alternates between fast recursive weight updates and sample replenishment steps to balance computational efficiency while ensuring sample quality. We derive theoretical results to determine the optimal allocation of replenishing steps, and demonstrate the efficacy of our method in simulated experiments and an application of sea surface temperature prediction in the Gulf of Mexico using Gaussian processes.