Nick Whiteley

Prof. Nick Whiteley

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2013 in The Annals of Applied Probability
Verified
Journal Article
Open access
PDF file
NWNick Whiteley
Nick Whiteley
Under multiplicative drift and other regularity conditions, it is established that the asymptotic variance associated with a particle filter approximation of the prediction filter is bounded uniformly in time, and the nonasymptotic, relative variance associated with a particle approximation of the normalizing constant is bounded linearly in time. The conditions are demonstrated to hold for some hidden Markov models on noncompact state spaces. The particle stability results are obtained by proving $v$-norm multiplicative stability and exponential moment results for the underlying Feynman–Kac formulas.

1 August 2019 in The Annals of Statistics
Verified
Journal Article
Closed access
PDF file
MGMathieu Gerber
Mathieu Gerber
NCNicolas Chopin
Nicolas Chopin
NWNick Whiteley
Nick Whiteley
We study convergence and convergence rates for resampling schemes. Our first main result is a general consistency theorem based on the notion of negative association, which is applied to establish the almost sure weak convergence of measures output from Kitagawa’s [J. Comput. Graph. Statist. 5 (1996) 1–25] stratified resampling method. Carpenter, Ckiffird and Fearnhead’s [IEE Proc. Radar Sonar Navig. 146 (1999) 2–7] systematic resampling method is similar in structure but can fail to converge depending on the order of the input samples. We introduce a new resampling algorithm based on a stochastic rounding technique of [In 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001) (2001) 588–597 IEEE Computer Soc.], which shares some attractive properties of systematic resampling, but which exhibits negative association and, therefore, converges irrespective of the order of the input samples. We confirm a conjecture made by [J. Comput. Graph. Statist. 5 (1996) 1–25] that ordering input samples by their states in $\mathbb{R}$ yields a faster rate of convergence; we establish that when particles are ordered using the Hilbert curve in $\mathbb{R}^{d}$, the variance of the resampling error is ${\scriptstyle\mathcal{O}}(N^{-(1+1/d)})$ under mild conditions, where $N$ is the number of particles. We use these results to establish asymptotic properties of particle algorithms based on resampling schemes that differ from multinomial resampling.

3 July 2022 in Journal of the American Statistical Association
Verified
Journal Article
Closed access
CDChenguang Dai
Chenguang Dai
JHJeremy Heng
Jeremy Heng
PJPierre Jacob
Pierre Jacob
NWNick Whiteley
Nick Whiteley
Statisticians often use Monte Carlo methods to approximate probability distributions, primarily with Markov chain Monte Carlo and importance sampling. Sequential Monte Carlo samplers are a class of algorithms that combine both techniques to approximate distributions of interest and their normalizing constants. These samplers originate from particle filtering for state space models and have become general and scalable sampling techniques. This article describes sequential Monte Carlo samplers and their possible implementations, arguing that they remain under-used in statistics, despite their ability to perform sequential inference and to leverage parallel processing resources among other potential benefits. Supplementary materials for this article are available online.

26 June 2018 in Biometrika
Verified
Journal Article
Closed access
ALA Lee
A Lee
NWNick Whiteley
Nick Whiteley

1 February 2016 in Bernoulli
Verified
Journal Article
Open access
PDF file
NWNick Whiteley
Nick Whiteley
ALAnthony Lee
Anthony Lee
KHKari Heine
Kari Heine
Project Euclid - mathematics and statistics online

9 August 2010 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
NWNick Whiteley
Nick Whiteley
SSSumeetpal Singh
Sumeetpal Singh
SGSimon Godsill
Simon Godsill
Optimal Bayesian multi-target filtering is, in general, computationally impractical owing to the high dimensionality of the multi-target state. The probability hypothesis density (PHD) filter propagates the first moment of the multi-target posterior distribution. While this reduces the dimensionality of the problem, the PHD filter still involves intractable integrals in many cases of interest. Several authors have proposed sequential Monte Carlo (SMC) implementations of the PHD filter. However these implementations are the equivalent of the bootstrap particle filter, and the latter is well known to be inefficient. Drawing on ideas from the auxiliary particle filter (APF), we present an SMC implementation of the PHD filter, which employs auxiliary variables to enhance its efficiency. Numerical examples are presented for two scenarios, including a challenging nonlinear observation model.