s-way parallel finite time Gibbs classification

Abstract

Gibbs classification is usually performed by annealing relative to the Metropolis scheme. When the number of compute cycles is bounded, Azencott demonstrated that parallel annealing is a viable approach. Here we describe an s-way finite time schedule with a post-annealing merge strategy.