Cooling schedule for simulated annealing 2026-10-18
A cooling schedule for simulated annealing specifies successive effective temperatures and how many proposals to attempt at each. For example, with , using the geometric sequence, can define stages of equal chosen length. Changing changes the transition matrix: if the state probability distribution is , then , which generally differs from . Time spent at one temperature must be compared with its mixing time before equilibrium intuition is justified.
In the five-state barrier example for simulated annealing, fixed gives a finite irreducible Markov chain, so is eventually visited with probability one. That unbounded-time statement gives no fixed finite deadline. Over any finite number of trials starting at , the probability of staying at throughout isEach factor is the rejection probability at . This is an explicit failure event even when every is positive: the best visited objective function value remains , above the global minimum value . More exploratory proposals can help cross a barrier; cooling before those moves occur can preserve a poor local minimum. Successful asymptotic schedules need additional analysis of the allowed moves and barriers.
Historically, Scott Kirkpatrick, Charles Daniel Gelatt Jr. and Mario P. Vecchi connected statistical mechanics with mathematical optimization in 1983. They adapted the Metropolis–Hastings algorithm to cooling searches with symmetric proposals and illustrated computer-design problems.[ref]
Optimization by Simulated Annealing by Scott Kirkpatrick and others. Printed pp. 672–673 and 675: Metropolis procedure, cooling schedule, logic partitioning
By Scott Kirkpatrick, Charles Daniel Gelatt Jr. and Mario P. Vecchi. Science 220(4598), 671–680 (13 May 1983).
Cited passages: pp. 672–673 and 675.
Sherrington-Kirkpatrick model 2026-10-18
The Sherrington-Kirkpatrick model couples every distinct pair of Ising spins using independent standard normal random variables for , with . Here and have units of energy. David Sherrington and Scott Kirkpatrick introduced this scaling in 1975; their original replica-symmetric calculation gave an unphysical negative low-temperature entropy. The model and that initial proposed solution must be distinguished.[ref]
Solvable Model of a Spin-Glass by David Sherrington and Scott Kirkpatrick. pp. 1793 and 1795, coupling scaling (2), replica-symmetric assumption and acknowledged negative entropy