Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00230195" target="_blank" >RIV/68407700:21230/15:00230195 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1109/TPAMI.2014.2363833" target="_blank" >http://dx.doi.org/10.1109/TPAMI.2014.2363833</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TPAMI.2014.2363833" target="_blank" >10.1109/TPAMI.2014.2363833</a>

Result language

angličtina

Original language name

Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings

Original language description

Many inference tasks in pattern recognition and artificial intelligence lead to partition functions in which addition and multiplication are abstract binary operations forming a commutative semiring. By generalizing max-sum diffusion (one of convergent message passing algorithms for approximate MAP inference in graphical models), we propose an iterative algorithm to upper bound such partition functions over commutative semirings. The iteration of the algorithm is remarkably simple: change any two factors of the partition function such that their product remains the same and their overlapping marginals become equal. In many commutative semirings, repeating this iteration for different pairs of factors converges to a fixed point when the overlapping marginals of every pair of factors coincide. We call this state marginal consistency. During that, an upper bound on the partition function monotonically decreases. This abstract algorithm unifies several existing algorithms, including max-su

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2015

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

IEEE Transactions on Pattern Analysis and Machine Intelligence

ISSN

0162-8828

e-ISSN

—

Volume of the periodical

37

Issue of the periodical within the volume

7

Country of publishing house

US - UNITED STATES

Number of pages

14

Pages from-to

1455-1468

UT code for WoS article

000355931100012

EID of the result in the Scopus database

—