PubMed · 11516361
A tighter bound for graphical models.
Abstract
We present a method to bound the partition function of a Boltzmann machine neural network with any odd-order polynomial. This is a direct extension of the mean-field bound, which is first order. We show that the third-order bound is strictly better than mean field. Additionally, we derive a third-order bound for the likelihood of sigmoid belief networks. Numerical experiments indicate that an error reduction of a factor of two is easily reached in the region where expansion-based approximations are useful.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M A Leisink, H J Kappen. 2001. A tighter bound for graphical models.. https://doi.org/10.1162/089976601750399344
Cite the original work for its findings. Save a collection to share your selection of sources.