On the convergence of an improved discrete simulated annealing via landscape modification

11/19/2020
by   Michael C. H. Choi, et al.
0

In this paper, we propose new Metropolis-Hastings and simulated annealing algorithms on finite state space via modifying the energy landscape. The core idea of landscape modification relies on introducing a parameter c, in which the landscape is modified once the algorithm is above this threshold parameter. We illustrate the power and benefits of landscape modification by investigating its effect on the classical Curie-Weiss model with Glauber dynamics and external magnetic field in the subcritical regime. This leads to a landscape-modified mean-field equation, and with appropriate choice of c the free energy landscape can be transformed from a double-well into a single-well, while the location of the global minimum is preserved on the convexified landscape. Consequently, running algorithms on the modified landscape can improve the convergence to the ground-state in the Curie-Weiss model. In the setting of simulated annealing, we demonstrate that landscape modification can yield improved mean tunneling time between global minima, and give convergence guarantee using an improved logarithmic cooling schedule with reduced critical height. Finally, we discuss connections between landscape modification and other acceleration techniques such as Catoni's energy transformation algorithm, preconditioning, importance sampling and quantum annealing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2022

Landscape modification meets spin systems: from torpid to rapid mixing, tunneling and annealing in the low-temperature regime

Given a target Gibbs distribution π^0_β∝ e^-βℋ to sample from in the low...
research
02/08/2023

Improved Langevin Monte Carlo for stochastic optimization via landscape modification

Given a target function H to minimize or a target Gibbs distribution π_β...
research
06/13/2022

Convergence of Simulated Annealing Using Kinetic Langevin Dynamics

We study the simulated annealing algorithm based on the kinetic Langevin...
research
01/29/2019

An accelerated variant of simulated annealing that converges under fast cooling

Given a target function U to minimize on a finite state space X, a propo...
research
01/25/2021

Variational Neural Annealing

Many important challenges in science and technology can be cast as optim...
research
05/31/2020

Global Convergence of MAML for LQR

The paper studies the performance of the Model-Agnostic Meta-Learning (M...

Please sign up or login with your details

Forgot password? Click here to reset