Structured region graphs: Morphing EP into GBP

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 m...

Full description

Bibliographic Details
Main Authors: Welling, M, Minka, T, Teh, Y
Format: Journal article
Language:English
Published: 2005
_version_ 1826270682760085504
author Welling, M
Minka, T
Teh, Y
author_facet Welling, M
Minka, T
Teh, Y
author_sort Welling, M
collection OXFORD
description 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 suffcient 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.
first_indexed 2024-03-06T21:44:40Z
format Journal article
id oxford-uuid:492597ba-cdb3-4096-8ce8-8574ee89d8ee
institution University of Oxford
language English
last_indexed 2024-03-06T21:44:40Z
publishDate 2005
record_format dspace
spelling oxford-uuid:492597ba-cdb3-4096-8ce8-8574ee89d8ee2022-03-26T15:29:53ZStructured region graphs: Morphing EP into GBPJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:492597ba-cdb3-4096-8ce8-8574ee89d8eeEnglishSymplectic Elements at Oxford2005Welling, MMinka, TTeh, YGBP 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 suffcient 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.
spellingShingle Welling, M
Minka, T
Teh, Y
Structured region graphs: Morphing EP into GBP
title Structured region graphs: Morphing EP into GBP
title_full Structured region graphs: Morphing EP into GBP
title_fullStr Structured region graphs: Morphing EP into GBP
title_full_unstemmed Structured region graphs: Morphing EP into GBP
title_short Structured region graphs: Morphing EP into GBP
title_sort structured region graphs morphing ep into gbp
work_keys_str_mv AT wellingm structuredregiongraphsmorphingepintogbp
AT minkat structuredregiongraphsmorphingepintogbp
AT tehy structuredregiongraphsmorphingepintogbp