Approximating the Permanent with Fractional Belief Propagation
We discuss schemes for exact and approximate computations of permanents, and compare them with each other. Specifically, we analyze the belief propagation (BP) approach and its fractional belief propagation (FBP) generalization for computing the permanent of a non-negative matrix. Known bounds and C...
Main Authors: | Chertkov, Michael, Yedidia, Adam B. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2013
|
Online Access: | http://hdl.handle.net/1721.1/81423 https://orcid.org/0000-0002-9814-9879 |
Similar Items
-
Belief Propagation and Revision in Networks with Loops
by: Weiss, Yair
Published: (2004) -
Nonparametric Belief Propagation and Facial Appearance Estimation
by: Sudderth, Erik B., et al.
Published: (2004) -
Sequential auxiliary particle belief propagation
by: Briers, M, et al.
Published: (2005) -
Fast memory-efficient generalized belief propagation
by: Kumar, MP, et al.
Published: (2006) -
Counting Independent Sets Using the Bethe Approximation
by: Chandrasekaran, Venkat, et al.
Published: (2011)