Jeremy Heng

Jeremy Heng

Auto-generated profile, based on publicly available information

Jeremy Heng

ESSEC Business School 139408 Singapore SG

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
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.

28 February 2019 in Biometrika
Verified
Journal Article
Closed access
PDF file
JHJ Heng
J Heng
PJP E Jacob
P E Jacob
Summary: We propose a method for parallelization of Hamiltonian Monte Carlo estimators. Our approach involves constructing a pair of Hamiltonian Monte Carlo chains that are coupled in such a way that they meet exactly after some random number of iterations. These chains can then be combined so that the resulting estimators are unbiased. This allows us to produce independent replicates in parallel and average them to obtain estimators that are consistent in the limit of the number of replicates, rather than in the usual limit of the number of Markov chain iterations. We investigate the scalability of our coupling in high dimensions on a toy example. The choice of algorithmic parameters and the efficiency of our proposed approach are then illustrated on a logistic regression with 300 covariates and a log-Gaussian Cox point processes model with low- to fine-grained discretizations.

15 June 2020 in Statistics and Computing
Verified
Journal Article
Closed access
PDF file
AJAjay Jasra
Ajay Jasra
FYFangyuan Yu
Fangyuan Yu
JHJeremy Heng
Jeremy Heng

9 June 2020 in arXiv
Verified
Preprint
Open access
PDF file
AJAjay Jasra
Ajay Jasra
FYFangyuan Yu
Fangyuan Yu
JHJeremy Heng
Jeremy Heng
In the following article we consider the numerical approximation of the non-linear filter in continuous-time, where the observations and signal follow diffusion processes. Given access to high-frequency, but discrete-time observations, we resort to a first order time discretization of the non-linear filter, followed by an Euler discretization of the signal dynamics. In order to approximate the associated discretized non-linear filter, one can use a particle filter (PF). Under assumptions, this can achieve a mean square error of $\mathcal{O}(\epsilon^2)$, for $\epsilon>0$ arbitrary, such that the associated cost is $\mathcal{O}(\epsilon^{-4})$. We prove, under assumptions, that the multilevel particle filter (MLPF) of Jasra et al (2017) can achieve a mean square error of $\mathcal{O}(\epsilon^2)$, for cost $\mathcal{O}(\epsilon^{-3})$. This is supported by numerical simulations in several examples.