Generalization of Concave and Convex Decomposition in Kikuchi Free Energy

Authors:
Yu Nishiyama;Sumio Watanabe
Affiliations:
Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, , Yokohama, Japan 226-8503;Precision and Intelligence Laboratory, Tokyo Institute of Technology, , Yokohama, Japan 226-8503
Venue:
ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part I
Year:
2008

Citing 4
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
The belief in TAP

Proceedings of the 1998 conference on Advances in neural information processing systems II
CCCP algorithms to minimize the Bethe and Kikuchi free energies: convergent alternatives to belief propagation

Neural Computation
Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagation

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing marginal probabilities from a high-dimensional distribution is generally an intractable task which arises in various probabilistic information processing. The minimum of Kikuchi free energy is known to yield more accurate marginals than that of Bethe free energy. Concave convex procedure (CCCP) proposed by Yuille is known to be an algorithm which guarantees to monotonically decrease both free energies.In this paper, we generalize CCCP algorithm for Kikuchi free energy and present a new CCCP (NCCCP) algorithm which includes a high-dimensional free vector. The free vector enables NCCCP to be more stable and to reduce enormous computational cost underlying CCCP. Moreover it seems that there exists an optimal series of free vectors that can minimize the huge computational cost. This means that there exists an optimal concave and convex decomposition schedule in Kikuchi free energy.