README 637 B

123456789101112
  1. An implementation of a simulated annealing sampler.
  2. A simulated annealing sampler can be used for approximate Boltzmann
  3. sampling or heuristic optimization. This implementation approaches
  4. the equilibrium distribution by performing updates at a sequence of
  5. increasing beta values, beta_schedule, terminating at the target
  6. beta. Each spin is updated once in a fixed order per point in the
  7. beta_schedule according to a Metropolis- Hastings update. When beta
  8. is large the target distribution concentrates, at equilibrium,
  9. over ground states of the model. Samples are guaranteed to match
  10. the equilibrium for long 'smooth' beta schedules.