Nicolas Chopin

  1. Some discussions of D. Fearnhead and D. Prangle's Read Paper "Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation".

    Authors: Arnaud Doucet, Sumeetpal S. Singh, Christian P. Robert, Nicolas Chopin, Jean-Michel Marin, Julien Cornebise, Ioannis Kosmidis, Christophe Andrieu, Pierre Pudlo, Ajay Jasra, Anthony Lee, Simon Barthelme, Mark Girolami, Mohammed Sedki.
    Subjects: Methodology
    Abstract

    This report is a collection of comments on the Read Paper of Fearnhead and
    Prangle (2011), to appear in the Journal of the Royal Statistical Society
    Series B, along with a reply from the authors.

  2. Expectation-Propagation for Summary-Less, Likelihood-Free Inference.

    Authors: Nicolas Chopin, Simon Barthelmé
    Subjects: Computation
    Abstract

    Many models of interest in the natural and social sciences have no
    closed-form likelihood function, which means that they cannot be treated using
    the usual techniques of statistical inference. In the case where such models
    can be efficiently simulated, Bayesian inference is still possible thanks to
    the Approximate Bayesian Computation (ABC) algorithm. Although many refinements
    have since been suggested, the technique suffers from three major shortcomings.
    First, it requires introducing a vector of "summary statistics", the choice of
    which is arbitrary and may lead to strong biases.

  3. Sequential Monte Carlo on large binary sampling spaces.

    Authors: Nicolas Chopin, Christian Schäfer
    Subjects: Statistics
    Abstract

    A Monte Carlo algorithm is said to be adaptive if it automatically calibrates
    its current proposal distribution using past simulations. The choice of the
    parametric family that defines the set of proposal distributions is critical
    for a good performance. In this paper, we present such a parametric family for
    adaptive sampling on high-dimensional binary spaces. A practical motivation for
    this problem is variable selection in a linear regression context. We want to
    sample from a Bayesian posterior distribution on the model space using an
    appropriate version of Sequential Monte Carlo.

  4. SMC^2: A sequential Monte Carlo algorithm with particle Markov chain Monte Carlo updates.

    Authors: Nicolas Chopin, Omiros Papaspiliopoulos, Pierre E. Jacob
    Subjects: Computation
    Abstract

    We consider the generic problem of performing sequential Bayesian inference
    in a state-space model with observation process $(y_{t})$, state process
    $(x_{t})$ and fixed parameter $\theta$. An idealized approach would be to apply
    the \emph{iterated batch importance sampling} (IBIS) algorithm of
    \citet{Chopin:IBIS}. This is a sequential Monte Carlo algorithm \emph{in the

  5. Discussions on "Riemann manifold Langevin and Hamiltonian Monte Carlo methods".

    Authors: Arnaud Doucet, Christian P. Robert, Nicolas Chopin, Jean-Michel Marin, Pierre Jacob, Simon Barthelme, Magali Beffy, Adam M. Johansen
    Subjects: Computation
    Abstract

    This is a collection of discussions of `Riemann manifold Langevin and
    Hamiltonian Monte Carlo methods" by Girolami and Calderhead, to appear in the
    Journal of the Royal Statistical Society, Series B.

  6. Adaptive Monte Carlo on multivariate binary sampling spaces.

    Authors: Nicolas Chopin, Christian Schäfer
    Subjects: Statistics
    Abstract

    A Monte Carlo algorithm is said to be adaptive if it can adjust automatically
    its current proposal distribution, using past simulations. The choice of the
    parametric family that defines the set of proposal distributions is critical
    for a good performance. We treat the problem of constructing such parametric
    families for adaptive sampling on multivariate binary spaces.

  7. Bayesian nonparametric estimation of the spectral density of a long or intermediate memory Gaussian process.

    Authors: Judith Rousseau, Nicolas Chopin, Brunero Liseo
    Subjects: Methodology
    Abstract

    A stationary Gaussian process is said to be long-range dependent (resp.
    anti-persistent) if its spectral density $f(\lambda)$ can be written as
    $f(\lambda)=|\lambda|^{-2d}g(|\lambda|)$, where $0< d < 1/2 (resp. -1/2 < d <
    0), and g is continuous. We propose a novel Bayesian nonparametric approach for
    the estimation of the spectral density of such processes. Within this approach,
    we prove posterior consistency for both d and g, under appropriate conditions
    on the prior distribution.

  8. Free energy Sequential Monte Carlo, application to mixture modelling.

    Authors: Nicolas Chopin, Pierre Jacob
    Subjects: Computation
    Abstract

    We introduce a new class of Sequential Monte Carlo (SMC) methods, which we
    call free energy SMC. This class is inspired by free energy methods, which
    originate from Physics, and where one samples from a biased distribution such
    that a given function $\xi(\theta)$ of the state $\theta$ is forced to be
    uniformly distributed over a given interval.

  9. On Particle Learning.

    Authors: Christian P. Robert, Nicolas Chopin, Jean-Michel Marin, Alessandra Iacobucci, Kerrie Mengersen, Robin Ryder, Christian Sch&#xe4;fer
    Subjects: Methodology
    Abstract

    This document is the aggregation of several discussions of Lopes et al.
    (2010) we submitted to the proceedings of the Ninth Valencia Meeting, held in
    Benidorm, Spain, on June 3-8, 2010, in conjunction with Hedibert Lopes' talk at
    this meeting. The main point in those discussions is the potential for
    degeneracy in the particle learning methodology, related with the exponential
    forgetting of the past simulations. We illustrate the resulting difficulties in
    the case of mixtures.

  10. Free energy methods for efficient exploration of mixture posterior densities.

    Authors: Nicolas Chopin, Gabriel Stoltz, Tony Lelievre
    Subjects: Computation
    Abstract

    Because of their multimodality, mixture posterior densities are difficult to
    sample with standard Markov chain Monte Carlo (MCMC) methods. We propose a
    strategy to enhance the sampling of MCMC in this context, using a biasing
    procedure which originates from computational statistical physics. The
    principle is first to choose a "reaction coordinate", that is, a direction in
    which the target density is multimodal. In a second step, the marginal
    log-density of the reaction coordinate is estimated; this quantity is called
    "free energy" in the computational statistical physics literature.

  11. Harold Jeffreys's Theory of Probability Revisited.

    Authors: Judith Rousseau, Christian P. Robert, Nicolas Chopin
    Subjects: Statistics
    Abstract

    Published exactly seventy years ago, Jeffreys's Theory of Probability (1939)
    has had a unique impact on the Bayesian community and is now considered to be
    one of the main classics in Bayesian Statistics as well as the initiator of the
    objective Bayes school. In particular, its advances on the derivation of
    noninformative priors as well as on the scaling of Bayes factors have had a
    lasting impact on the field. However, the book reflects the characteristics of
    the time, especially in terms of mathematical rigor.

  12. Comments on "Particle Markov chain Monte Carlo" by C. Andrieu, A. Doucet, and R. Hollenstein.

    Authors: Christian P. Robert, Nicolas Chopin, Pierre Jacob, Havard Rue
    Subjects: Computation
    Abstract

    This is the compilation of our comments submitted to the Journal of the Royal
    Statistical Society, Series B, to be published within the discussion of the
    Read Paper of Andrieu, Doucet and Hollenstein.

  13. Stability of Feynman-Kac formulae with path-dependent potentials.

    Authors: Pierre Del Moral, Nicolas Chopin, Sylvain Rubenthaler
    Subjects: Probability
    Abstract

    Several particle algorithms admit a Feynman-Kac representation such that the
    potential function may be expressed as a recursive function which depends on
    the complete state trajectory. An important example is the mixture Kalman
    filter, but other models and algorithms of practical interest fall in this
    category. We study the asymptotic stability of such particle algorithms as time
    goes to infinity. As a corollary, practical conditions for the stability of the
    mixture Kalman filter, and a mixture GARCH filter, are derived.

  14. Harold Jeffreys' Theory of Probability revisited: a reply.

    Authors: Judith Rousseau, Christian P. Robert, Nicolas Chopin
    Subjects: Methodology
    Abstract

    We are grateful to all discussants (Bernardo, Gelman, Kass, Lindley, Senn,
    and Zellner) of our re-visitation for their strong support in our enterprise
    and for their overall agreement with our perspective. Further discussions with
    them and other leading statisticians showed that the legacy of Theory of
    Probability is alive and lasting.

  15. Harold Jeffreys' Theory of Probability revisited: a reply.

    Authors: Judith Rousseau, Christian P. Robert, Nicolas Chopin
    Subjects: Methodology
    Abstract

    We are grateful to all discussants (Bernardo, Gelman, Kass, Lindley, Senn,
    and Zellner) of our re-visitation for their strong support in our enterprise
    and for their overall agreement with our perspective. Further discussions with
    them and other leading statisticians showed that the legacy of Theory of
    Probability is alive and lasting.

RSS-материал