On geodesically convex formulations for the brascamp-lieb constant
Author(s)
Sra, Suvrit; Vishnoi, Nisheeth K.; Yildiz, Ozan
DownloadPublished version (424.7Kb)
Publisher with Creative Commons License
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
© 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.
Date issued
2018-04Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Institute for Data, Systems, and SocietyJournal
Leibniz International Proceedings in Informatics, LIPIcs
Citation
2018. "On geodesically convex formulations for the brascamp-lieb constant." Leibniz International Proceedings in Informatics, LIPIcs, 116.
Version: Final published version