Sum-of-Squares Relaxations for Information Theory and Variational Inference
Francis Bach (SIERRA)

TL;DR
This paper develops sum-of-squares based convex relaxations for computing generalized divergences, enabling efficient approximation algorithms for problems like estimation, integration, and variational inference in probabilistic models.
Contribution
It introduces a novel sum-of-squares relaxation framework for f-divergences, providing polynomial-time computable approximations for complex information-theoretic and inference problems.
Findings
Sum-of-squares relaxations are effective for approximating f-divergences.
The proposed methods are computationally efficient and polynomial-time.
Illustrations demonstrate applicability to multivariate trigonometric polynomials and Boolean functions.
Abstract
We consider extensions of the Shannon relative entropy, referred to as -divergences.Three classical related computational problems are typically associated with these divergences: (a) estimation from moments, (b) computing normalizing integrals, and (c) variational inference in probabilistic models. These problems are related to one another through convex duality, and for all them, there are many applications throughout data science, and we aim for computationally tractable approximation algorithms that preserve properties of the original problem such as potential convexity or monotonicity. In order to achieve this, we derive a sequence of convex relaxations for computing these divergences from non-centered covariance matrices associated with a given feature vector: starting from the typically non-tractable optimal lower-bound, we consider an additional relaxation based on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsVariational Inference
