Inference on Graphs: Iterative Maximization of Pseudo log-MAP functions - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

Inference on Graphs: Iterative Maximization of Pseudo log-MAP functions

(1)
1

Abstract

In this paper, we formalize and study the properties of a new kind of iterative estimation algorithm which has recently appeared in the literature in e.g. [1, 2, 3]. We refer to this algorithm as the ”iterative pseudo log-MAP function maximization (IPLFM) algorithm. We give a definition of the pseudo log-MAP function (PLF) in terms of regions of a factor graph and prove some of its properties. In particular, we provide a correspondence between the zeroth, first and second order behaviors of the PLF and the (minimum) Bethe free energy associated to the considered factor graph. Based on these properties, we prove some results pertaining to the fixed points and the local convergence of the IPLFMalgorithm. In particular, we relate the fixed points of the IPLFM-algorithm to the stationary points of the Bethe free energy and to the fixed points of the EM algorithm. Moreover, we provide necessary and sufficient conditions for the local convergence of the IPLFM algorithm.
Fichier principal
Vignette du fichier
PI-1867.pdf (414.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00203454 , version 1 (10-01-2008)
inria-00203454 , version 2 (10-01-2008)

Identifiers

  • HAL Id : inria-00203454 , version 2

Cite

Cédric Herzet. Inference on Graphs: Iterative Maximization of Pseudo log-MAP functions. [Research Report] PI 1867, 2008, pp.31. ⟨inria-00203454v2⟩
134 View
80 Download

Share

Gmail Facebook Twitter LinkedIn More