Saved in:
Bibliographic Details
Main Authors: Jasra, Ajay, Yu, Fangyuan
Format: Preprint
Published: 2018
Subjects:
Online Access:https://arxiv.org/abs/1810.04900
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909989032951808
author Jasra, Ajay
Yu, Fangyuan
author_facet Jasra, Ajay
Yu, Fangyuan
contents In this article we prove a new central limit theorem (CLT) for coupled particle filters (CPFs). CPFs are used for the sequential estimation of the difference of expectations w.r.t. filters which are in some sense close. Examples include the estimation of the filtering distribution associated to different parameters (finite difference estimation) and filters associated to partially observed discretized diffusion processes (PODDP) and the implementation of the multilevel Monte Carlo (MLMC) identity. We develop new theory for CPFs and based upon several results, we propose a new CPF which approximates the maximal coupling (MCPF) of a pair of predictor distributions. In the context of ML estimation associated to PODDP with discretization $Δ_l$ we show that the MCPF and the approach in Jasra et al. (2018) have, under assumptions, an asymptotic variance that is upper-bounded by an expression that is (almost) $\mathcal{O}(Δ_l)$, uniformly in time. The $\mathcal{O}(Δ_l)$ rate preserves the so-called forward rate of the diffusion in some scenarios which is not the case for the CPF in Jasra et al (2017).
format Preprint
id arxiv_https___arxiv_org_abs_1810_04900
institution arXiv
publishDate 2018
record_format arxiv
spellingShingle Central Limit Theorems for Coupled Particle Filters
Jasra, Ajay
Yu, Fangyuan
Statistics Theory
Numerical Analysis
In this article we prove a new central limit theorem (CLT) for coupled particle filters (CPFs). CPFs are used for the sequential estimation of the difference of expectations w.r.t. filters which are in some sense close. Examples include the estimation of the filtering distribution associated to different parameters (finite difference estimation) and filters associated to partially observed discretized diffusion processes (PODDP) and the implementation of the multilevel Monte Carlo (MLMC) identity. We develop new theory for CPFs and based upon several results, we propose a new CPF which approximates the maximal coupling (MCPF) of a pair of predictor distributions. In the context of ML estimation associated to PODDP with discretization $Δ_l$ we show that the MCPF and the approach in Jasra et al. (2018) have, under assumptions, an asymptotic variance that is upper-bounded by an expression that is (almost) $\mathcal{O}(Δ_l)$, uniformly in time. The $\mathcal{O}(Δ_l)$ rate preserves the so-called forward rate of the diffusion in some scenarios which is not the case for the CPF in Jasra et al (2017).
title Central Limit Theorems for Coupled Particle Filters
topic Statistics Theory
Numerical Analysis
url https://arxiv.org/abs/1810.04900