News & Events

Subscribe to email list

Please select the email list(s) to which you wish to subscribe.
CAPTCHA
This question is for testing whether or not you are a human visitor and to prevent automated spam submissions.
Image CAPTCHA

Enter the characters shown in the image.

User menu

You are here

Iterated Block Particle Filter for High-dimensional Parameter Learning: Beating the Curse of Dimensionality

Tuesday, March 8, 2022 - 11:00 to 12:00
Ning Ning (Patricia), Postdoctoral Research Fellow, Department of Statistics, University of Michigan, Ann Arbor
Statistics Seminar
Zoom

To join via Zoom: To join this seminar, please request Zoom connection details from headsec [at] stat.ubc.ca

Title: Iterated Block Particle Filter for High-dimensional Parameter Learning: Beating the Curse of Dimensionality

Abstract: Parameter learning for high-dimensional, partially observed, and nonlinear stochastic processes is a methodological challenge. Spatiotemporal disease transmission systems provide examples of such processes giving rise to open inference problems. We propose the iterated block particle filter (IBPF) algorithm for learning high-dimensional parameters over graphical state space models with general state spaces, measures, transition densities and graph structure. Theoretical performance guarantees are obtained on beating the curse of dimensionality (COD), algorithm convergence, and likelihood maximization. Experiments on a highly nonlinear and non-Gaussian spatiotemporal model for measles transmission reveal that the iterated ensemble Kalman filter algorithm (Li et al. (2020), Science) is ineffective and the iterated filtering algorithm (Ionides et al. (2015), PNAS) suffers from the COD, while our IBPF algorithm beats COD consistently across various experiments with different metrics.