Structured Region Graphs: Morphing EP into GBP

07/04/2012
by   Max Welling, et al.
0

GBP and EP are two successful algorithms for approximate probabilistic inference, which are based on different approximation strategies. An open problem in both algorithms has been how to choose an appropriate approximation structure. We introduce 'structured region graphs', a formalism which marries these two strategies, reveals a deep connection between them, and suggests how to choose good approximation structures. In this formalism, each region has an internal structure which defines an exponential family, whose sufficient statistics must be matched by the parent region. Reduction operators on these structures allow conversion between EP and GBP free energies. Thus it is revealed that all EP approximations on discrete variables are special cases of GBP, and conversely that some wellknown GBP approximations, such as overlapping squares, are special cases of EP. Furthermore, region graphs derived from EP have a number of good structural properties, including maxent-normality and overall counting number of one. The result is a convenient framework for producing high-quality approximations with a user-adjustable level of complexity

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/02/2018

Secretary problem: graphs, matroids and greedoids

In the paper the generalisation of the well known "secretary problem" is...
research
02/07/2023

Structured variational approximations with skew normal decomposable graphical models

Although there is much recent work developing flexible variational metho...
research
07/20/2017

Parameterized Approximation Algorithms for Directed Steiner Network Problems

(See paper for full abstract) Given an edge-weighted directed graph G=...
research
01/27/2023

Diffusive Representations for the Numerical Evaluation of Fractional Integrals

Diffusive representations of fractional differential and integral operat...
research
01/18/2019

Gambling and Rényi Divergence

For gambling on horses, a one-parameter family of utility functions is p...
research
07/05/2023

Independent Sets in Elimination Graphs with a Submodular Objective

Maximum weight independent set (MWIS) admits a 1/k-approximation in indu...
research
09/10/2019

Approximating Vertex Cover using Structural Rounding

In this work, we provide the first practical evaluation of the structura...

Please sign up or login with your details

Forgot password? Click here to reset