Double-cover-based analysis of the Bethe permanent of non-negative matrices

05/30/2022
by   Kit Shing Ng, et al.
0

The permanent of a non-negative matrix appears naturally in many information processing scenarios. Because of the intractability of the permanent beyond small matrices, various approximation techniques have been developed in the past. In this paper, we study the Bethe approximation of the permanent and add to the body of literature showing that this approximation is very well behaved in many respects. Our main technical tool are topological double covers of the normal factor graph whose partition function equals the permanent of interest, along with a transformation of these double covers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2023

Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix

The permanent of a non-negative square matrix can be well approximated b...
research
09/09/2023

Two-State Spin Systems with Negative Interactions

We study the approximability of computing the partition functions of two...
research
12/04/2018

A Parallel Double Greedy Algorithm for Submodular Maximization

We study parallel algorithms for the problem of maximizing a non-negativ...
research
01/17/2019

Sparse Non-Negative Recovery from Biased Subgaussian Measurements using NNLS

We investigate non-negative least squares (NNLS) for the recovery of spa...
research
11/19/2018

Domain of Inverse Double Arcsine Transformation

To combine the proportions from different studies for meta-analysis, Fre...
research
09/29/2022

Improved estimates for the number of non-negative integer matrices with given row and column sums

The number of non-negative integer matrices with given row and column su...
research
08/19/2020

Structure-preserving function approximation via convex optimization

Approximations of functions with finite data often do not respect certai...

Please sign up or login with your details

Forgot password? Click here to reset