A tighter bound for graphical models

DOI10.1162/089976601750399344MaRDI QIDQ2784813zbMATH OpenOpenAlexWikidataFDO

Authors M. A. R. Leisink, Hilbert J. Kappen

Publication date 24 April 2002

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2066/112682, https://hdl.handle.net/2066/112680

zbMATH Keywords

Boltzmann machine neural network

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A New Class of Upper Bounds on the Log Partition Function
• New closed-form bounds on the partition function
• scientific article; zbMATH DE number 2000820
• Higher-order Boltzmann machines and entropy bounds
• Approximate inference in Boltzmann machines

Cites work

• Connectionist learning of belief networks

Cited in

(8)

• Bayesian methods for neural networks and related models
• New closed-form bounds on the partition function
• Implications of faithfulness in graphical models
• Chordal Graphs to Identify Graphical Model Solutions of Maximum of Entropy Under Constraints on Marginals
• A New Class of Upper Bounds on the Log Partition Function
• Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
• scientific article; zbMATH DE number 5247142 (Why is no real title available?)
• Uncovering latent structure in valued graphs: a variational approach

This page was built for publication: A tighter bound for graphical models

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