A New Class of Upper Bounds on the Log Partition Function

DOI10.1109/TIT.2005.850091zbMath1310.94028arXiv1301.0610MaRDI QIDQ3547761

Alan S. Willsky, Martin J. Wainwright, Tommi S. Jaakkola

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.0610

Mathematics Subject Classification ID

Random fields (60G60) Random fields; image analysis (62M40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13)

Related Items (21)

A family of CCCP algorithms which minimize the TRW free energy ⋮ Universality of the mean-field for the Potts model ⋮ Applicability of \(n\)-vicinity method for calculation of free energy of Ising model ⋮ Margin losses for training conditional random fields ⋮ Fast structured prediction using large margin sigmoid belief networks ⋮ Spatio-temporal random fields: compressible representation and distributed estimation ⋮ Model-based machine learning ⋮ A structured variational learning approach for switching latent factor models ⋮ Recursive sum-product algorithm for generalized outer-planar graphs ⋮ Discrete temporal models of social networks ⋮ Piecewise training for structured prediction ⋮ Message-passing algorithms for inference and optimization ⋮ Spectral bounds for the Ising ferromagnet on an arbitrary given graph ⋮ Multiscale stochastic modeling for tractable inference and data assimilation ⋮ New closed-form bounds on the partition function ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ Gauging variational inference ⋮ Bucket renormalization for approximate inference ⋮ Tractable minor-free generalization of planar zero-field Ising models ⋮ Belief propagation: accurate marginals or accurate partition function—where is the difference? ⋮ Unnamed Item

This page was built for publication: A New Class of Upper Bounds on the Log Partition Function