After training, given a converged energy model E θ θ , the Metropolis–Hastings algorithm can be used to draw new samples. The acceptance probability is given by: P a c c ( x i → → x ∗ ∗ ) = min ( 1 , P θ θ ( x ∗ ∗ ) P θ θ ( x i ) ) .