New closed-form bounds on the partition function

DOI10.1007/S10994-008-5072-8MaRDI QIDQ2036261zbMATH OpenOpenAlexFDO

Authors Dvijotham Krishnamurthy, Soumen Chakrabarti, Subhasis Chaudhuri

Publication date 28 June 2021

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-008-5072-8

zbMATH Keywords

approximate inferenceassociative potentialbelief propagationgraphical modelpartition functionvariational methods

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A New Class of Upper Bounds on the Log Partition Function
• A tighter bound for graphical models
• scientific article; zbMATH DE number 2000820
• Harnessing the Bethe free energy
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming

Cites work

• A New Class of Upper Bounds on the Log Partition Function
• Convex analysis and nonlinear optimization. Theory and examples.
• Graphical models, exponential families, and variational inference
• scientific article; zbMATH DE number 2107186 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)

Cited in

(7)

• A tighter bound for graphical models
• Two New Representations of the Partition Function
• A New Class of Upper Bounds on the Log Partition Function
• scientific article; zbMATH DE number 1989999 (Why is no real title available?)
• scientific article; zbMATH DE number 2000820 (Why is no real title available?)
• Gauging variational inference
• Tight bounds on the coefficients of partition functions via stability

This page was built for publication: New closed-form bounds on the partition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036261)