9,490 research outputs found

    Weight-Preserving Simulated Tempering

    Get PDF
    Simulated tempering is popular method of allowing MCMC algorithms to move between modes of a multimodal target density {\pi}. One problem with simulated tempering for multimodal targets is that the weights of the various modes change for different inverse-temperature values, sometimes dramatically so. In this paper, we provide a fix to overcome this problem, by adjusting the mode weights to be preserved (i.e., constant) over different inverse-temperature settings. We then apply simulated tempering algorithms to multimodal targets using our mode weight correction. We present simulations in which our weight-preserving algorithm mixes between modes much more successfully than traditional tempering algorithms. We also prove a diffusion limit for an version of our algorithm, which shows that under appropriate assumptions, our algorithm mixes in time O(d [log d]^2)

    N-fold way simulated tempering for pairwise interaction point processes

    Get PDF
    Pairwise interaction point processes with strong interaction are usually difficult to sample. We discuss how Besag lattice processes can be used in a simulated tempering MCMC scheme to help with the simulation of such processes. We show how the N-fold way algorithm can be used to sample the lattice processes efficiently and introduce the N-fold way algorithm into our simulated tempering scheme. To calibrate the simulated tempering scheme we use the Wang-Landau algorithm

    Replica-Exchange Simulated Tempering Method for Simulations of Frustrated Systems

    Full text link
    We propose a new method for the determination of the weight factor for the simulated tempering method. In this method a short replica-exchange simulation is performed and the simulated tempering weight factor is obtained by the multiple-histogram reweighting techniques. The new algorithm is particularly useful for studying frustrated systems with rough energy landscape where the determination of the simulated tempering weight factor by the usual iterative process becomes very difficult. The effectiveness of the method is illustrated by taking an example for protein folding.Comment: 8 pages, (ReVTeX), 5 figures, Chem. Phys. Lett., submitte

    Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions

    Full text link
    We give conditions under which a Markov chain constructed via parallel or simulated tempering is guaranteed to be rapidly mixing, which are applicable to a wide range of multimodal distributions arising in Bayesian statistical inference and statistical mechanics. We provide lower bounds on the spectral gaps of parallel and simulated tempering. These bounds imply a single set of sufficient conditions for rapid mixing of both techniques. A direct consequence of our results is rapid mixing of parallel and simulated tempering for several normal mixture models, and for the mean-field Ising model.Comment: Published in at http://dx.doi.org/10.1214/08-AAP555 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Simulated-tempering approach to spin-glass simulations

    Full text link
    After developing an appropriate iteration procedure for the determination of the parameters, the method of simulated tempering has been successfully applied to the 2D Ising spin glass. The reduction of the slowing down is comparable to that of the multicanonical algorithm. Simulated tempering has, however, the advantages to allow full vectorization of the programs and to provide the canonical ensemble directly.Comment: 12 pages (LaTeX), 4 postscript figures, uufiles encoded, submitted to Physical Review

    Simulated Tempering: A New Monte Carlo Scheme

    Full text link
    We propose a new global optimization method ({\em Simulated Tempering}) for simulating effectively a system with a rough free energy landscape (i.e. many coexisting states) at finite non-zero temperature. This method is related to simulated annealing, but here the temperature becomes a dynamic variable, and the system is always kept at equilibrium. We analyze the method on the Random Field Ising Model, and we find a dramatic improvement over conventional Metropolis and cluster methods. We analyze and discuss the conditions under which the method has optimal performances.Comment: 12 pages, very simple LaTeX file, figures are not included, sorr

    Feedback-optimized parallel tempering Monte Carlo

    Full text link
    We introduce an algorithm to systematically improve the efficiency of parallel tempering Monte Carlo simulations by optimizing the simulated temperature set. Our approach is closely related to a recently introduced adaptive algorithm that optimizes the simulated statistical ensemble in generalized broad-histogram Monte Carlo simulations. Conventionally, a temperature set is chosen in such a way that the acceptance rates for replica swaps between adjacent temperatures are independent of the temperature and large enough to ensure frequent swaps. In this paper, we show that by choosing the temperatures with a modified version of the optimized ensemble feedback method we can minimize the round-trip times between the lowest and highest temperatures which effectively increases the efficiency of the parallel tempering algorithm. In particular, the density of temperatures in the optimized temperature set increases at the "bottlenecks'' of the simulation, such as phase transitions. In turn, the acceptance rates are now temperature dependent in the optimized temperature ensemble. We illustrate the feedback-optimized parallel tempering algorithm by studying the two-dimensional Ising ferromagnet and the two-dimensional fully-frustrated Ising model, and briefly discuss possible feedback schemes for systems that require configurational averages, such as spin glasses.Comment: 12 pages, 14 figure
    • ‚Ķ