Algorithmic aspects of Brascamp-Lieb inequalities

The celebrated Brascamp-Lieb (BL) inequalities (and their extensions) are an important mathematical tool, unifying and generalizing numerous inequalities in analysis, convex geometry and information theory. While their structural theory is very well understood, far less is known about computing their main parameters. We give polynomial time algorithms to compute feasibility of BL-datum, the optimal BL-constant and a weak separation oracle for the BL-polytope. The same result holds for the so-called Reverse BL inequalities of Barthe. The best known algorithms for any of these tasks required at least exponential time. The algorithms are obtained by a simple efficient reduction of a given BL-datum to an instance of the Operator Scaling problem defined by Gurvits, for which the present authors have provided a polynomial time algorithm. This reduction implies algorithmic versions of many of the known structural results, and in some cases provide proofs that are different or simpler than existing ones. Of particular interest is the fact that the operator scaling algorithm is continuous in its input. Thus as a simple corollary of our reduction we obtain explicit bounds on the magnitude and continuity of the BL-constant in terms of the BL-data. To the best of our knowledge no such bounds were known, as past arguments relied on compactness. The continuity of BL-constants is important for developing non-linear BL inequalities that have recently found so many applications.

[1]  T. Tao,et al.  Finite bounds for Hölder-Brascamp-Lieb multilinear inequalities , 2005, math/0505691.

[2]  Larry Guth,et al.  Proof of the main conjecture in Vinogradov's mean value theorem for degrees higher than three , 2015, 1512.01565.

[3]  E. Lieb,et al.  Best Constants in Young's Inequality, Its Converse, and Its Generalization to More than Three Functions , 1976 .

[4]  Ciprian Demeter,et al.  Mean value estimates for Weyl sums in two dimensions , 2015, J. Lond. Math. Soc..

[5]  T. Tao,et al.  The Brascamp–Lieb Inequalities: Finiteness, Structure and Extremals , 2005, math/0505065.

[6]  Mátyás Domokos,et al.  Semi-invariants of quivers as determinants , 2001 .

[7]  Harm Derksen,et al.  Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients , 2000 .

[8]  Leonid Gurvits,et al.  Classical complexity and quantum entanglement , 2004, J. Comput. Syst. Sci..

[9]  Stefán Ingi Valdimarsson The Brascamp–Lieb Polyhedron , 2010, Canadian Journal of Mathematics.

[10]  Neal Bez,et al.  Behaviour of the Brascamp–Lieb constant , 2016, 1605.08603.

[11]  Harm Derksen,et al.  Polynomial degree bounds for matrix semi-invariants , 2015, ArXiv.

[12]  Katherine Yelick,et al.  On Holder-Brascamp-Lieb inequalities for torsion-free discrete Abelian groups , 2015, 1510.04190.

[13]  Michel Van den Bergh,et al.  Semi-invariants of quivers for arbitrary dimension vectors , 1999 .

[14]  Man-Duen Choi Completely positive linear maps on complex matrices , 1975 .

[15]  Richard Sinkhorn A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .

[16]  Jonathan Bennett,et al.  Stability of the Brascamp-Lieb constant and applications , 2015, 1508.07502.

[17]  Harm Derksen,et al.  The combinatorics of quiver representations , 2006, math/0608288.

[18]  James Demmel,et al.  Communication lower bounds and optimal algorithms for programs that reference arrays - Part 1 , 2013, ArXiv.

[19]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[20]  F. Barthe On a reverse form of the Brascamp-Lieb inequality , 1997, math/9705210.

[21]  Avi Wigderson,et al.  A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[22]  Neal Bez,et al.  Some nonlinear Brascamp–Lieb inequalities and applications to harmonic analysis , 2009, 0906.2064.

[23]  E. Lieb Gaussian kernels have only Gaussian maximizers , 1990 .

[24]  K. Ball Volumes of sections of cubes and related problems , 1989 .

[25]  Youming Qiao,et al.  Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics , 2015, ArXiv.