Under certain precise conditions, as described in (Abney, 2004), we can analyze Algorithm 1 as minimizing the entropy of the distribution over translations of U .
this is true only when the functions Estimate, Score and Select have very prescribed definitions.