Distance between configurations in MCMC simulations and the geometrical optimization of the tempering algorithms
arXiv:2001.02028
Abstract
For a given Markov chain Monte Carlo (MCMC) algorithm, we define the distance between configurations that quantifies the difficulty of transitions. This distance enables us to investigate MCMC algorithms in a geometrical way, and we investigate the geometry of the simulated tempering algorithm implemented for an extremely multimodal system with highly degenerate vacua. We show that the large scale geometry of the extended configuration space is given by an asymptotically anti-de Sitter metric, and argue in a simple, geometrical way that the tempering parameter should be best placed exponentially to acquire high acceptance rates for transitions in the extra dimension. We also discuss the geometrical optimization of the tempered Lefschetz thimble method, which is an algorithm towards solving the numerical sign problem.
arXiv comment7 pages, 3 figures, talk presented at the 37th International Symposium on Lattice Field Theory (Lattice 2019), 16-22 June 2019, Wuhan, China
References in corpus (7)
- Simulated Tempering: A New Monte Carlo Scheme
- A Monte Carlo algorithm for simulating fermions on Lefschetz thimbles
- Parallel tempering algorithm for integration over Lefschetz thimbles
- Tempered transitions between thimbles
- Applying the tempered Lefschetz thimble method to the Hubbard model away from half-filling
- Implementation of the HMC algorithm on the tempered Lefschetz thimble method
- Emergence of AdS geometry in the simulated tempering algorithm