Grant: Discovery Grants Program - Individual
Université de Montréal
$12,000.00
Efficiency of Markov chain Monte Carlo methods
EF 2007-08
Résumé
Metropolis-Hastings algorithms, an important class of MCMC algorithms, allow for data generation from highly complex distributions (the target distribution). In applying Metropolis-Hastings algorithms, it is necessary to choose a proposal density; due to its simplicity, the normal density is a very popular choice. In order to have some level of optimality in the performance of the algorithm, it then becomes necessary to select the variance of the normal distribution. Results about the optimal scaling issue are available in the literature for high-dimensional target distributions with independent components.My goal is to improve the efficiency of Metropolis-Hastings algorithms by extending current optimal scaling results to the case where the components of the target distribution assume a nontrivial correlation structure. This shall be achieved by first considering hierarchical target models, which are interesting in themselves due to their popularity in Bayesian statistics. There also exist many variations of the Metropolis-Hastings algorithms that work beautifully in practice, but which have not been studied theoretically. One of them is the Delayed Rejection Metropolis-Hastings algorithm, which allow us to "freeze time" and adjust the proposal scaling upon the rejection of a move. I would like to study the weak convergence and optimal scaling theory of such variations.Recently, adaptive algorithms have become quite popular and I intend to use my optimal scaling results to derive an efficient adaptive method to be used by researchers and practitioners in various fields of application. I shall also study some applications of MCMC algorithms, specifically in statistical inference (to compare frequentist and Bayesian methods) and engineering (in a problem related to the control of air traffic).
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
346215-2007
Name nom
Bédard, Mylène
Department département
Mathématiques et de statistique
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2007
Award amount
12000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
14
Committee name en
Statistical Sciences
Committee name fr
Statistique
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
3000
Research subject group en
Statistics and probability
Research subject group fr
Statistique et probabilité
Research subject en
Statistics and probability
Research subject fr
Statistique et probabilité
Partie
1
Nb partie
3
Application title
Efficiency of Markov chain Monte Carlo methods
Keyword
NA
Application summary
Metropolis-Hastings algorithms, an important class of MCMC algorithms, allow for data generation from highly complex distributions (the target distribution). In applying Metropolis-Hastings algorithms, it is necessary to choose a proposal density; due to its simplicity, the normal density is a very popular choice. In order to have some level of optimality in the performance of the algorithm, it then becomes necessary to select the variance of the normal distribution. Results about the optimal scaling issue are available in the literature for high-dimensional target distributions with independent components.My goal is to improve the efficiency of Metropolis-Hastings algorithms by extending current optimal scaling results to the case where the components of the target distribution assume a nontrivial correlation structure. This shall be achieved by first considering hierarchical target models, which are interesting in themselves due to their popularity in Bayesian statistics. There also exist many variations of the Metropolis-Hastings algorithms that work beautifully in practice, but which have not been studied theoretically. One of them is the Delayed Rejection Metropolis-Hastings algorithm, which allow us to "freeze time" and adjust the proposal scaling upon the rejection of a move. I would like to study the weak convergence and optimal scaling theory of such variations.Recently, adaptive algorithms have become quite popular and I intend to use my optimal scaling results to derive an efficient adaptive method to be used by researchers and practitioners in various fields of application. I shall also study some applications of MCMC algorithms, specifically in statistical inference (to compare frequentist and Bayesian methods) and engineering (in a problem related to the control of air traffic).