Estimation and Marginalization Using the Kikuchi Approximation Methods

DOI10.1162/0899766054026693zbMATH Open1114.90162OpenAlexW2133442732WikidataQ46499951 ScholiaQ46499951MaRDI QIDQ5696509FDOQ5696509

Authors: Payam Pakzad, Venkat Anantharam 

Publication date: 18 October 2005

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/0899766054026693

Recommendations

• Convexity arguments for efficient minimization of the Bethe and Kikuchi free energies
• Approximate methods for calculating marginals and likelihoods
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
• A New Class of Upper Bounds on the Log Partition Function
• Tree-based reparameterization framework for analysis of sum-product and related algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• On Representatives of Subsets
• The capacity of low-density parity-check codes under message-passing decoding
• A recursive approach to low complexity codes
• A Theory of Cooperative Phenomena
• Design of capacity-approaching irregular low-density parity-check codes
• The generalized distributive law
• The geometry of turbo-decoding dynamics
• A New Look at the Generalized Distributive Law

Cited In (4)

• Image labeling based on graphical models using Wasserstein messages and geometric assignment
• Cycle-based cluster variational method for direct and inverse inference
• On Kikuchi's path probability method
• Method of Kim-zam: An algorithm for computing the maximum likelihood estimator

This page was built for publication: Estimation and Marginalization Using the Kikuchi Approximation Methods

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