Skip to main content

PAWL-Forced Simulated Tempering

  • Conference paper
  • First Online:
The Contribution of Young Researchers to Bayesian Statistics

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 63))

  • 1145 Accesses

Abstract

In this short note, we show how the parallel adaptive Wang–Landau (PAWL) algorithm of Bornn et al. (J Comput Graph Stat, to appear) can be used to automate and improve simulated tempering algorithms. While Wang–Landau and other stochastic approximation methods have frequently been applied within the simulated tempering framework, this note demonstrates through a simple example the additional improvements brought about by parallelization, adaptive proposals, and automated bin splitting.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Atchade Y, Liu J (2010) The Wang-Landau algorithm for Monte Carlo computation in general state spaces. Stat Sin 20:209–233

    MathSciNet  MATH  Google Scholar 

  2. Bornn L, Shaddick G, Zidek J (2012) Modeling nonstationary processes through dimension expansion. J Am Stat Assoc 107(497):281–289

    Article  MathSciNet  MATH  Google Scholar 

  3. Bornn L, Jacob PE, Del Moral P, Doucet A (2013) An adaptive interacting Wang-Landau algorithm for automatic density exploration. J Comput Graph Stat 22(3):749–773

    Article  Google Scholar 

  4. Geyer C, Thompson E (1995) Annealing Markov chain Monte Carlo with applications to ancestral inference. J Am Stat Assoc 90(431):909–920

    Article  MATH  Google Scholar 

  5. Marinari E, Parisi G (1992) Simulated tempering: a new Monte Carlo scheme. Europhys Lett 19(6):451

    Article  Google Scholar 

  6. Wang F, Landau DP (2001) Efficient, multiple-range random walk algorithm to calculate the density of states. Phys Rev Lett 86(10):2050–2053

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Luke Bornn .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bornn, L. (2014). PAWL-Forced Simulated Tempering. In: Lanzarone, E., Ieva, F. (eds) The Contribution of Young Researchers to Bayesian Statistics. Springer Proceedings in Mathematics & Statistics, vol 63. Springer, Cham. https://doi.org/10.1007/978-3-319-02084-6_12

Download citation

Publish with us

Policies and ethics