Related papers: Algorithmic and optimization aspects of Brascamp-L…
We consider two non-convex formulations for computing the optimal constant in the Brascamp-Lieb inequality corresponding to a given datum, and show that they are geodesically log-concave on the manifold of positive definite matrices endowed…
This paper studies algorithms for efficiently computing Brascamp-Lieb constants, a task that has recently received much interest. In particular, we reduce the computation to a nonlinear matrix-valued iteration, whose convergence we analyze…
The Brascamp-Lieb inequality in harmonic analysis was proved by Brascamp and Lieb in the rank one case in 1976, and by Lieb in 1990. It says that in a certain inequality, the optimal constant can be determined by checking the inequality for…
H\"older-Brascamp-Lieb inequalities provide upper bounds for a class of multilinear expressions, in terms of $L^p$ norms of the functions involved. They have been extensively studied for functions defined on Euclidean spaces.…
We show that the Brascamp-Lieb (BL) constant BL(-,p) is a semi-algebraic function on the set of feasible data. Consequently, it is algebraic in the sense that it satisfies a polynomial relation of the form P(V, BL(V,p))=0 for a non-zero…
We establish a nonlinear generalisation of the classical Brascamp-Lieb inequality in the case where the Lebesgue exponents lie in the interior of the finiteness polytope. As a corollary we show that the best constant in Young's convolution…
In this work we consider dimensional improvements of the logarithmic Sobolev, Talagrand and Brascamp-Lieb inequalities. For this we use optimal transport methods and the Borell-Brascamp-Lieb inequality. These refinements can be written as a…
The capacity of completely positive operators and the Brascamp--Lieb constant can both be interpreted in terms of unconstrained geometric programming up to an additional minimisation over a compact group. We shine light on this perspective…
We derive two concentration inequalities for linear functions of log-concave distributions: an enhanced version of the classical Brascamp--Lieb concentration inequality, and an inequality quantifying log-concavity of marginals in a manner…
This work studies the application of the discrete Holder-Brascamp-Lieb (HBL) inequalities to the design of communication optimal algorithms. In particular, it describes optimal tiling (blocking) strategies for nested loops that lack data…
We consider regularized Brascamp-Lieb inequalities using the theory of optimal transportation, more precisely an anisotropic version of Caffarelli's contraction theorem. Furthermore, we provide a full picture concerning the issues of…
The H\"older-Brascamp-Lieb inequalities are a collection of multilinear inequalities generalizing a convolution inequality of Young and the Loomis-Whitney inequalities. The full range of exponents was classified in Bennett et al. (2008). In…
Bayesian Optimization (BO) is widely used for optimising black-box functions but requires us to specify the length scale hyperparameter, which defines the smoothness of the functions the optimizer will consider. Most current BO algorithms…
Brascamp-Lieb inequalities have been important in analysis, mathematical physics and neighboring areas. Recently, these inequalities have had a deep influence on Fourier analysis and, in particular, on Fourier restriction theory. In this…
We study stability issues for the so-called Borell-Brascamp-Lieb inequalities, proving that when near equality is realized, the involved functions must be $L^1$-close to be $p$-concave and to coincide up to homotheties of their graphs.
Brascamp-Lieb inequality is an important mathematical tool in analysis, geometry and information theory. There are various ways to prove Brascamp-Lieb inequality such as heat flow method, Brownian motion and subadditivity of the entropy.…
Augmented Lagrangian (AL) methods are a well known class of algorithms for solving constrained optimization problems. They have been extended to the solution of saddle-point systems of linear equations. We study an AL (SPAL) algorithm for…
The Borell-Brascamp-Lieb inequality is a classical extension of the Pr\'ekopa-Leindler inequality, which in turn is a functional counterpart of the Brunn-Minkowski inequality. The stability of these inequalities has received significant…
A recent breakthrough in Edmonds' problem showed that the noncommutative rank can be computed in deterministic polynomial time, and various algorithms for it were devised. However, only quite complicated algorithms are known for finding a…
Abstract H\"{o}lder-Brascamp-Lieb inequalities have become a ubiquitous tool in Fourier analysis in recent years, due in large part to a theorem of Bennett, Carbery, Christ, and Tao (2008,2010) characterizing finiteness of the…