Revisiting Boltzmann learning: parameter estimation in Markov random fields
Lars Kai Hansen, Lars Nonboe Andersen, Ulrik Kjems, Jan Otto Larsen · 2002
This article presents a generalization of the Boltzmann machine that allows us to use the learning rule for a much wider class of maximum likelihood and maximum a posteriori problems, including both supervised and unsupervised learning. Furthermore, the approach allows us to discuss regularization and generalization in the context of Boltzmann machines. We provide an illustrative example concerning parameter estimation in an inhomogeneous Markov field. The regularized adaptation produces a parameter set that closely resembles the "teacher" parameters, hence, will produce segmentations that closely reproduce those of the inhomogeneous teacher network.