= Boltzmann encoder demonstration
{c}
<David H. Ackley>, <Geoffrey Hinton> and <Terrence J. Sejnowski> tested their 1985 algorithm on a simulated 4–2–4 encoder. Two four-unit visible groups communicated through two <hidden units>, with no direct connections between the groups. Preparation set weights to zero and supplied corresponding one-active-unit patterns. Noisy clamping and annealed settling generated pair-coactivation readouts, compared with freely running readouts to choose weight changes. Learned hidden codes were the outcome. Equal sampling effort in clamped and free conditions supplied the comparison; noise limited weight growth. Finite settling was assumed to reach equilibrium, limiting the evidence for exact <likelihood> learning.<A Learning Algorithm for Boltzmann Machines by David H. Ackley and others>[1985, sec. 4 and sec. 4.1, pp. 157–160, Figs. 2–3; finite settling assumption p. 159]{ref}
Back to article page
