Show simple item record

dc.contributor.authorChertkov, Michael
dc.contributor.authorYedidia, Adam B.
dc.date.accessioned2013-10-18T12:46:22Z
dc.date.available2013-10-18T12:46:22Z
dc.date.issued2013-07
dc.date.submitted2013-01
dc.identifier.issn1532-4435
dc.identifier.issn1533-7928
dc.identifier.urihttp://hdl.handle.net/1721.1/81423
dc.description.abstractWe 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 Conjectures are verified in experiments, and some new theoretical relations, bounds and Conjectures are proposed. The fractional free energy (FFE) function is parameterized by a scalar parameter y ∈ [−1;1], where y = −1 corresponds to the BP limit and y = 1 corresponds to the exclusion principle (but ignoring perfect matching constraints) mean-field (MF) limit. FFE shows monotonicity and continuity with respect to g. For every non-negative matrix, we define its special value y∗ ∈ [−1;0] to be the g for which the minimum of the y-parameterized FFE function is equal to the permanent of the matrix, where the lower and upper bounds of the g-interval corresponds to respective bounds for the permanent. Our experimental analysis suggests that the distribution of y∗ varies for different ensembles but y∗ always lies within the [−1;−1/2] interval. Moreover, for all ensembles considered, the behavior of y∗ is highly distinctive, offering an empirical practical guidance for estimating permanents of non-negative matrices via the FFE approach.en_US
dc.description.sponsorshipLos Alamos National Laboratory (Undergraduate Research Assistant Program)en_US
dc.description.sponsorshipUnited States. National Nuclear Security Administration (Los Alamos National Laboratory Contract DE C52-06NA25396)en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionofhttp://jmlr.org/papers/volume14/chertkov13a/chertkov13a.pdfen_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceMIT Pressen_US
dc.titleApproximating the Permanent with Fractional Belief Propagationen_US
dc.typeArticleen_US
dc.identifier.citationChertkov, Michael, and Adam B. Yedidia. “Approximating the Permanent with Fractional Belief Propagation.” Journal of Machine Learning Research 14 (2013): 2029–2066.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorYedidia, Adam B.en_US
dc.relation.journalJournal of Machine Learning Researchen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsChertkov, Michael; Yedidia, Adam B.en_US
dc.identifier.orcidhttps://orcid.org/0000-0002-9814-9879
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record