PAWL-Forced Simulated Tempering

05/22/2013
by   Luke Bornn, et al.
0

In this short note, we show how the parallel adaptive Wang-Landau (PAWL) algorithm of Bornn et al. (2013) 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2023

A Note on Noisy Reservoir Computation

In this note we extend the definition of the Information Processing Capa...
research
05/31/2023

A short note on the stability of a class of parallel Runge-Kutta methods

With this short note, we close a gap in the linear stability theory of b...
research
03/09/2020

Adaptive Fibonacci and Pairing Heaps

This brief note presents two adaptive heap data structures and conjectur...
research
08/26/2020

A note on data splitting with e-values: online appendix to my comment on Glenn Shafer's "Testing by betting"

This note reanalyzes Cox's idealized example of testing with data splitt...
research
08/09/2018

A note on optimal design for hierarchical generalized group testing

Choosing an optimal strategy for hierarchical group testing is an import...
research
05/31/2023

A Note On Interpreting Canary Exposure

Canary exposure, introduced in Carlini et al. is frequently used to empi...
research
08/02/2017

Maximum-Area Quadrilateral in a Convex Polygon, Revisited

In this note we show by example that the algorithm presented in 1979 by ...

Please sign up or login with your details

Forgot password? Click here to reset