Analysis of Double Covers of Factor Graphs
Information Theory
2016-07-06 v1 Discrete Mathematics
math.IT
Abstract
Many quantities of interest in communications, signal processing, artificial intelligence, and other areas can be expressed as the partition sum of some factor graph. Although the exact calculation of the partition sum is in many cases intractable, it can often be approximated rather well by the Bethe partition sum. In earlier work, we have shown that graph covers are a useful tool for expressing and analyzing the Bethe approximation. In this paper, we present a novel technique for analyzing double covers, a technique which ultimately leads to a deeper understanding of the Bethe approximation.
Keywords
Cite
@article{arxiv.1607.01124,
title = {Analysis of Double Covers of Factor Graphs},
author = {Pascal O. Vontobel},
journal= {arXiv preprint arXiv:1607.01124},
year = {2016}
}
Comments
Proceedings of the 2016 International Conference on Signal Processing and Communications, Bangalore, India, June 12-15, 2016