Towards optimality of the parallel tempering algorithm

0044 English OPEN
Tawn, Nicholas;
  • Subject: QA

Markov Chain Monte Carlo (MCMC) techniques for sampling from complex probability distributions have become mainstream. Big data and high model complexity demand more scalable and robust algorithms. A famous problem with MCMC is making it robust to situations when the ta... View more
  • References (10)

    Andrieu, C., Jasra, A., Doucet, A. and Del Moral, P. (2007) Convergence of the Equi-energy Sampler. In ESAIM: Proceedings, vol. 19, 1{5. EDP Sciences.

    Atchade, Y. F. and Liu, J. S. (2004) The Wang-Landau Algorithm for Monte Carlo Computation in General State Spaces. Statistica Sinica, 20, 209{33.

    Atchade, Y. F., Roberts, G. O. and Rosenthal, J. S. (2011) Towards Optimal Scaling of Metropolis-Coupled Markov chain Monte Carlo. Statistics and Computing, 21, 555{568.

    Barndor -Nielsen, O. E. and Nielsen, O. E. B. (1989) Asymptotic Techniques; for use in Statistics. Tech. rep.

    Friedman, J., Hastie, T. and Tibshirani, R. (2001) The Elements of Statistical Learning, vol. 1. Springer Series in Statistics New York.

    Wang, F. and Landau, D. (2001) Determining the Density of States for Classical Statistical Models: A Random Walk Algorithm to Produce a at Histogram. Physical Review E, 64, 056101.

    Woodard, D. B., Schmidler, S. C. and Huber, M. (2009a) Conditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions. The Annals of Applied Probability, 617{640.

    Woodard, D. B., Schmidler, S. C. and Huber, M. (2009b) Su cient Conditions for Torpid Mixing of Parallel and Simulated Tempering. Electronic Journal of Probability, 14, 780{804.

    Zalik, K. R. (2008) An E cient K-means Clustering Algorithm. Pattern Recognition Letters, 29, 1385{1391.

    Zhao, W., Ma, H. and He, Q. (2009) Parallel k-means Clustering Based on Mapreduce. In IEEE International Conference on Cloud Computing, 674{679. Springer.

  • Metrics
Share - Bookmark