Yves F. Atchade

Yves F. Atchade

Auto-generated profile, based on publicly available information

Yves F. Atchade

Department of Statistics University of Michigan

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
1 October 2005 in Bernoulli
Verified
Journal Article
Open access
YAYves F. Atchadé
Yves F. Atchadé
JRJeffrey S. Rosenthal
Jeffrey S. Rosenthal
We look at adaptive Markov chain Monte Carlo algorithms that generate stochastic processes based on sequences of transition kernels, where each transition kernel is allowed to depend on the history of the process. We show under certain conditions that the stochastic process generated is ergodic, with appropriate stationary distribution. We use this result to analyse an adaptive version of the random walk Metropolis algorithm where the scale parameter σ is sequentially adapted using a Robbins-Monro type algorithm in order to find the optimal scale parameter σopt. We close with a simulation example.

1 June 2006 in Methodology and Computing in Applied Probability
Verified
Journal Article
Closed access
PDF file
YAYves F. Atchadé
Yves F. Atchadé

7 January 2015 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
PDF file
EIEdward L. Ionides
Edward L. Ionides
DNDao Nguyen
Dao Nguyen
YAYves Atchadé
Yves Atchadé
SSStilian Stoev
Stilian Stoev
AKAaron A. King
Aaron A. King
Significance: Many scientific challenges involve the study of stochastic dynamic systems for which only noisy or incomplete measurements are available. Inference for partially observed Markov process models provides a framework for formulating and answering questions about these systems. Except when the system is small, or approximately linear and Gaussian, state-of-the-art statistical methods are required to make efficient use of available data. Evaluation of the likelihood for a partially observed Markov process model can be formulated as a filtering problem. Iterated filtering algorithms carry out repeated Monte Carlo filtering operations to maximize the likelihood. We develop a new theoretical framework for iterated filtering and construct a new algorithm that dramatically outperforms previous approaches on a challenging inference problem in disease ecology.

3 July 2010 in Statistics and Computing
Verified
Journal Article
Closed access
PDF file
YAYves F. Atchadé
Yves F. Atchadé
GRGareth O. Roberts
Gareth O. Roberts
JRJeffrey S. Rosenthal
Jeffrey S. Rosenthal

1 June 2011 in The Annals of Statistics
Verified
Journal Article
Open access
EIEdward L. Ionides
Edward L. Ionides
ABAnindya Bhadra
Anindya Bhadra
YAYves Atchadé
Yves Atchadé
AKAaron King
Aaron King
Inference for partially observed Markov process models has been a longstanding methodological challenge with many scientific and engineering applications. Iterated filtering algorithms maximize the likelihood function for partially observed Markov process models by solving a recursive sequence of filtering problems. We present new theoretical results pertaining to the convergence of iterated filtering algorithms implemented via sequential Monte Carlo filters. This theory complements the growing body of empirical evidence that iterated filtering algorithms provide an effective inference strategy for scientific models of nonlinear dynamic systems. The first step in our theory involves studying a new recursive approach for maximizing the likelihood function of a latent variable model, when this likelihood is evaluated via importance sampling. This leads to the consideration of an iterated importance sampling algorithm which serves as a simple special case of iterated filtering, and may have applicability in its own right.

1 February 2010 in Bernoulli
Verified
Journal Article
Open access
PDF file
YAYves Atchadé
Yves Atchadé
GFGersende Fort
Gersende Fort
Project Euclid - mathematics and statistics online