Nicolas Chopin

Prof. Nicolas Chopin

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
1 April 2009 in Journal of the Royal Statistical Society Series B: Statistical Methodology
Verified
Journal Article
Open access
PDF file
HRHåvard Rue
Håvard Rue
SMSara Martino
Sara Martino
NCNicolas Chopin
Nicolas Chopin
Summary. Structured additive regression models are perhaps the most commonly used class of models in statistical applications. It includes, among others, (generalized) linear models, (generalized) additive models, smoothing spline models, state space models, semiparametric regression, spatial and spatiotemporal models, log-Gaussian Cox processes and geostatistical and geoadditive models. We consider approximate Bayesian inference in a popular subset of structured additive regression models, latent Gaussian models, where the latent field is Gaussian, controlled by a few hyperparameters and with non-Gaussian response variables. The posterior marginals are not available in closed form owing to the non-Gaussian response variables. For such models, Markov chain Monte Carlo methods can be implemented, but they are not without problems, in terms of both convergence and computational time. In some practical applications, the extent of these problems is such that Markov chain Monte Carlo sampling is simply not an appropriate tool for routine analysis. We show that, by using an integrated nested Laplace approximation and its simplified version, we can directly compute very accurate approximations to the posterior marginals. The main benefit of these approximations is computational: where Markov chain Monte Carlo algorithms need hours or days to run, our approximations provide more precise estimates in seconds or minutes. Another advantage with our approach is its generality, which makes it possible to perform Bayesian analysis in an automatic, streamlined way, and to compute model comparison criteria and various predictive measures so that models can be compared and the model under study can be challenged.

1 August 2002 in Biometrika
Verified
Journal Article
Closed access
PDF file
NCNicolas Chopin
Nicolas Chopin
Particle filter methods are complex inference procedures, which combine importance sampling and Monte Carlo schemes in order to explore consistently a sequence of multiple distributions of interest. We show that such methods can also offer an efficient estimation tool in ‘static’ set‐ups, in which case π(θ | y1, …, yN) (n < N) is the only posterior distribution of interest but the preliminary exploration of partial posteriors π(θ | y1, …, yn) makes it possible to save computing time. A complete algorithm is proposed for independent or Markov models. Our method is shown to challenge other common estimation procedures in terms of robustness and execution time, especially when the sample size is important. Two classes of examples, mixture models and discrete generalised linear models, are discussed and illustrated by numerical results.

1 August 2015 in Statistical Science
Verified
Journal Article
Open access
PDF file
NKNikolas Kantas
Nikolas Kantas
ADArnaud Doucet
Arnaud Doucet
SSSumeetpal S. Singh
Sumeetpal S. Singh
JMJan Maciejowski
Jan Maciejowski
NCNicolas Chopin
Nicolas Chopin
Nonlinear non-Gaussian state-space models are ubiquitous in statistics, econometrics, information engineering and signal processing. Particle methods, also known as Sequential Monte Carlo (SMC) methods, provide reliable numerical approximations to the associated state inference problems. However, in most applications, the state-space model of interest also depends on unknown static parameters that need to be estimated from the data. In this context, standard particle methods fail and it is necessary to rely on more sophisticated algorithms. The aim of this paper is to present a comprehensive review of particle methods that have been proposed to perform static parameter estimation in state-space models. We discuss the advantages and limitations of these methods and illustrate their performance on simple models.

12 October 2012 in Journal of the Royal Statistical Society Series B: Statistical Methodology
Verified
Journal Article
Closed access
PDF file
NCNicolas Chopin
Nicolas Chopin
PJP. E. Jacob
P. E. Jacob
OPO. Papaspiliopoulos
O. Papaspiliopoulos

1 December 2004 in The Annals of Statistics
Verified
Journal Article
Open access
PDF file
NCNicolas Chopin
Nicolas Chopin
The term “sequential Monte Carlo methods” or, equivalently, “particle filters,” refers to a general class of iterative algorithms that performs Monte Carlo approximations of a given sequence of distributions of interest (πt). We establish in this paper a central limit theorem for the Monte Carlo estimates produced by these computational methods. This result holds under minimal assumptions on the distributions πt, and applies in a general framework which encompasses most of the sequential Monte Carlo methods that have been considered in the literature, including the resample-move algorithm of Gilks and Berzuini [J. R. Stat. Soc. Ser. B Stat. Methodol. 63 (2001) 127–146] and the residual resampling scheme. The corresponding asymptotic variances provide a convenient measurement of the precision of a given particle filter. We study, in particular, in some typical examples of Bayesian applications, whether and at which rate these asymptotic variances diverge in time, in order to assess the long term reliability of the considered algorithm.

23 May 2016 in Journal of the Royal Statistical Society Series B: Statistical Methodology
Verified
Journal Article
Closed access
PDF file
COChris J. Oates
Chris J. Oates
MGMark Girolami
Mark Girolami
NCNicolas Chopin
Nicolas Chopin