Pith. sign in

REVIEW 1 cited by

Theoretical Guarantees for Variational Inference with Fixed-Variance Mixture of Gaussians

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.04012 v2 pith:242J226L submitted 2024-06-06 stat.ML cs.LG

classification stat.MLcs.LG
keywords inferencevariationaldistributionfamilygaussiansmixturetheoreticalapproximation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Variational inference (VI) is a popular approach in Bayesian inference, that looks for the best approximation of the posterior distribution within a parametric family, minimizing a loss that is typically the (reverse) Kullback-Leibler (KL) divergence. Despite its empirical success, the theoretical properties of VI have only received attention recently, and mostly when the parametric family is the one of Gaussians. This work aims to contribute to the theoretical study of VI in the non-Gaussian case by investigating the setting of Mixture of Gaussians with fixed covariance and constant weights. In this view, VI over this specific family can be casted as the minimization of a Mollified relative entropy, i.e. the KL between the convolution (with respect to a Gaussian kernel) of an atomic measure supported on Diracs, and the target distribution. The support of the atomic measure corresponds to the localization of the Gaussian components. Hence, solving variational inference becomes equivalent to optimizing the positions of the Diracs (the particles), which can be done through gradient descent and takes the form of an interacting particle system. We study two sources of error of variational inference in this context when optimizing the mollified relative entropy. The first one is an optimization result, that is a descent lemma establishing that the algorithm decreases the objective at each iteration. The second one is an approximation error, that upper bounds the objective between an optimal finite mixture and the target distribution.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Stable Derivative Free Gaussian Mixture Variational Inference for Bayesian Inverse Problems

    cs.LG 2025-01 conditional novelty 6.0 of 10

    DF-GMVI approximates Bayesian posteriors with Gaussian mixtures using derivative-free quadrature that preserves covariance positivity and affine invariance.

Pith tools