On geodesically convex formulations for the brascamp-lieb constant
© 2018 Aditya Bhaskara and Srivatsan Kumar. 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 with the Riemann...
Format: | Article |
---|---|
Language: | English |
Published: |
2021-11-04T15:02:47Z.
|
Subjects: | |
Online Access: | Get fulltext |
LEADER | 01382 am a22001453u 4500 | ||
---|---|---|---|
001 | 137339 | ||
042 | |a dc | ||
245 | 0 | 0 | |a On geodesically convex formulations for the brascamp-lieb constant |
260 | |c 2021-11-04T15:02:47Z. | ||
856 | |z Get fulltext |u https://hdl.handle.net/1721.1/137339 | ||
520 | |a © 2018 Aditya Bhaskara and Srivatsan Kumar. 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 with the Riemannian metric corresponding to the Hessian of the log-determinant function. The first formulation is present in the work of Lieb [15] and the second is new and inspired by the work of Bennett et al. [5]. Recent work of Garg et al. [12] also implies a geodesically log-concave formulation of the Brascamp-Lieb constant through a reduction to the operator scaling problem. However, the dimension of the arising optimization problem in their reduction depends exponentially on the number of bits needed to describe the Brascamp-Lieb datum. The formulations presented here have dimensions that are polynomial in the bit complexity of the input datum. | ||
546 | |a en | ||
655 | 7 | |a Article | |
773 | |t 10.4230/LIPIcs.APPROX-RANDOM.2018.25 | ||
773 | |t Leibniz International Proceedings in Informatics, LIPIcs |