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

60G60: Random fields

62M40: Random fields; image analysis

94A12: Signal theory (characterization, reconstruction, filtering, etc.)

94A13: Detection theory in information and communication theory

Related Items

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?, A family of CCCP algorithms which minimize the TRW free energy, Margin losses for training conditional random fields, Spatio-temporal random fields: compressible representation and distributed estimation, Recursive sum-product algorithm for generalized outer-planar graphs, A structured variational learning approach for switching latent factor models, Message-passing algorithms for inference and optimization, Multiscale stochastic modeling for tractable inference and data assimilation, Applicability of \(n\)-vicinity method for calculation of free energy of Ising model, Fast structured prediction using large margin sigmoid belief networks, Discrete temporal models of social networks, Piecewise training for structured prediction, New closed-form bounds on the partition function, Universality of the mean-field for the Potts model, Unnamed Item, Model-based machine learning, Spectral bounds for the Ising ferromagnet on an arbitrary given graph