At temperature , target a probability density function proportional to on a parameter region where it is normalizable, possibly with a specified proper base measure. A Metropolis–Hastings algorithm proposal has acceptance probability
For a symmetric proposal, improving moves are accepted and a loss is accepted with probability . Run updates while gradually lowering toward zero. This simulated annealing scheme initially permits exploration and increasingly favors high objective values. Appropriate cooling and mixing conditions are needed for a general global convergence theorem; a finite arbitrary schedule does not guarantee finding a global maximum.
To maximize a positive likelihood function, take , which has the same maximizers. The resulting likelihood-power annealing target is , and available Gibbs sampler conditional distributions can replace Metropolis proposals.

Articles by others on the same topic (0)

There are currently no matching articles.