A Tight Analysis of Bethe Approximation for Permanent

11/07/2018
by   Nima Anari, et al.
0

We prove that the permanent of nonnegative matrices can be deterministically approximated within a factor of √(2)^n in polynomial time, improving upon the previous deterministic approximations. We show this by proving that the Bethe approximation of the permanent, a quantity computable in polynomial time, is at least as large as the permanent divided by √(2)^n. This resolves a conjecture of Gurvits. Our bound is tight, and when combined with previously known inequalities lower bounding the permanent, fully resolves the quality of Bethe approximation for permanent.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/24/2020

Optimal Streaming Approximations for all Boolean Max-2CSPs

We prove tight upper and lower bounds on approximation ratios of all Boo...
04/12/2016

Loss Bounds and Time Complexity for Speed Priors

This paper establishes for the first time the predictive performance of ...
09/21/2020

(In)approximability of Maximum Minimal FVS

We study the approximability of the NP-complete Maximum Minimal Feedback...
05/06/2020

A Separation Theorem for Joint Sensor and Actuator Scheduling with Guaranteed Performance Bounds

We study the problem of jointly designing a sparse sensor and actuator s...
04/06/2020

The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood

In this paper we consider the problem of computing the likelihood of the...
12/17/2018

The Complexity of Factors of Multivariate Polynomials

The existence of string functions, which are not polynomial time computa...
07/10/2020

Vector Balancing in Lebesgue Spaces

A tantalizing conjecture in discrete mathematics is the one of Komlós, s...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.