Some Remarks on Replicated Simulated Annealing

09/30/2020
by   Vincent Gripon, et al.
0

Recently authors have introduced the idea of training discrete weights neural networks using a mix between classical simulated annealing and a replica ansatz known from the statistical physics literature. Among other points, they claim their method is able to find robust configurations. In this paper, we analyze this so-called "replicated simulated annealing" algorithm. In particular, we explicit criteria to guarantee its convergence, and study when it successfully samples from configurations. We also perform experiments using synthetic and real data bases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2022

Convergence of Simulated Annealing Using Kinetic Langevin Dynamics

We study the simulated annealing algorithm based on the kinetic Langevin...
research
09/19/2007

Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains

Simulated annealing is a popular method for approaching the solution of ...
research
03/22/2019

Pressure and flow statistics of Darcy flow from simulated annealing

The pressure and flow statistics of Darcy flow through a random permeabl...
research
02/06/2023

Unified Software Design Patterns for Simulated Annealing

Any optimization algorithm programming interface can be seen as a black-...
research
07/15/2019

Shadow Simulated Annealing algorithm: a new tool for global optimisation and statistical inference

This paper develops a new global optimisation method that applies to a f...
research
01/25/2021

Variational Neural Annealing

Many important challenges in science and technology can be cast as optim...
research
03/17/2018

A simulated annealing procedure based on the ABC Shadow algorithm for statistical inference of point processes

Recently a new algorithm for sampling posteriors of unnormalised probabi...

Please sign up or login with your details

Forgot password? Click here to reset