Simulated Annealing using Hybrid Monte Carlo
R. Salazar, R. Toral
Abstract
We propose a variant of the Simulated Annealing method for optimization in the multivariate analysis of differentiable functions. The method uses global actualizations via the Hybrid Monte Carlo algorithm in their generalized version for the proposal of new configurations. We show how this choice can improve upon the performance of simulated annealing methods (mainly when the number of variables is large) by allowing a more effective searching scheme and a faster annealing schedule.
Create a lesson
Related papers
Absolute area under a scaled Brownian motion with resetting
Vicenç Méndez, Javier Cristín
Understanding the Mpemba Effect through a Rule of Thumb
Ran Yaacoby
Beyond the lemon: Spectra of random Lindblad operators with a Hamiltonian component
Mykhailo Hontarenko, Wojciech Tarnowski, Sergey Denisov et al.
Towards synergy between theory and experiments: First-passage processes under resetting with stochastic return protocols
Ashutosh Dubey, Arnab Pal
Emergent Loop Geometry in Gauge-Equivariant Graph Neural Networks
Ali Rayat, Gia-Wei Chern
Extending the mean first-passage-time formalism to the reconstruction of high free-energy barriers: A top-start approach
Ying Jiang, Ivan Saika-Voivod