Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species

2011 ◽  
Vol 25 (3) ◽  
pp. 1194-1211 ◽  
Author(s):  
Daniel Štefankovič ◽  
Eric Vigoda
2011 ◽  
Vol 39 (6) ◽  
pp. 3262-3289 ◽  
Author(s):  
G. Fort ◽  
E. Moulines ◽  
P. Priouret

Biometrika ◽  
2020 ◽  
Author(s):  
J E Griffin ◽  
K G Łatuszyński ◽  
M F J Steel

Summary The availability of datasets with large numbers of variables is rapidly increasing. The effective application of Bayesian variable selection methods for regression with these datasets has proved difficult since available Markov chain Monte Carlo methods do not perform well in typical problem sizes of interest. We propose new adaptive Markov chain Monte Carlo algorithms to address this shortcoming. The adaptive design of these algorithms exploits the observation that in large-$p$, small-$n$ settings, the majority of the $p$ variables will be approximately uncorrelated a posteriori. The algorithms adaptively build suitable nonlocal proposals that result in moves with squared jumping distance significantly larger than standard methods. Their performance is studied empirically in high-dimensional problems and speed-ups of up to four orders of magnitude are observed.


Sign in / Sign up

Export Citation Format

Share Document