This work studies Gaussian-restricted barycenters for quadratic two-sided Kullback--Leibler unbalanced optimal transport with independent marginal penalties and no coupling entropy to establish global attainment, derive the stationary moment equations, and construct a reverse-KL majorization--minimization iteration.
Abstract
We study Gaussian-restricted barycenters for quadratic two-sided Kullback--Leibler unbalanced optimal transport with independent marginal penalties and no coupling entropy. Exact profiling of the barycenter mass reduces the problem to a smooth Gaussian shape functional with endogenous Gibbs weights. We establish global attainment, derive the stationary moment equations, and construct a reverse-KL majorization--minimization (MM) iteration whose full sequence converges from every nondegenerate Gaussian initialization to a stationary fixed point. The diagonal second variation induces a parallel-sum tensor coupling the Bures--Wasserstein and Fisher--Rao metrics; its finite-mass extension admits a radial cone representation. Under common penalty scaling, global minimizers converge to a Gaussian Wasserstein barycenter with effective weights; for sufficiently large penalties, the minimizer is unique and admits a first-order analytic expansion. In the small-penalty regime, the distance of every global minimizer to the compact maximizer set of a weighted Chernoff affinity functional vanishes with respect to the mean--covariance parameter distance. Numerical experiments illustrate MM descent, local contraction, and the two penalty limits.
We study high-dimensional random-matrix limits of Gaussian Kullback--Leibler unbalanced optimal transport (KL-UOT). Under equal marginal penalties, the covariance action admits an exact log-determinant representation in terms of a nonlinear ridge product, together with a positive-semidefinite extension that remains fin...
We study the computation of static mean-field equilibria on a compact state space by formulating the equilibrium condition as a variational inequality over probability measures. We propose an entropic variant of Korpelevich's extragradient algorithm---the Kullback--Leibler Mirror-Prox method---in which Euclidean projec...
Erhan Bayraktar, Ibrahim Ekren, Lukianiuk Vy et al.· 0 citations
We propose a robust barycenter for distribution-valued data by incorporating the Huber loss directly into the optimal transport cost. In contrast to metric-space Huber means, which apply the Huber loss to the Wasserstein distance after optimization, our construction acts on individual transport displacements, preservin...
Carlos Cardoso-Perelló, Alberto González-Sanz· 0 citations
This work proposes a Projected RGD algorithm that achieves dimension-independent linear convergence at unit step size and identifies as unit-step RGD on a totally geodesic submanifold, thereby extending the dimension-independent guarantee to that setting verbatim.
Optimal transport and Gromov--Wasserstein distances are useful tools for comparing probability measures and metric measure spaces, but their balanced formulations force all mass to be matched. This constraint is often too strong for data with outliers, missing parts, or only partial overlap. In this paper, we develop e...
This work proposes PRISM-ZO, a projection-robust framework that samples low-dimensional random tangent subspaces and combines symmetric finite differences with median-of-means or Huber aggregation and establishes the unbiasedness of the correctly rescaled projected direction in expectation over the random subspace.
Yin-Pu Ma, Cunlin Li, Shiyue Zhang· Journal of King Saud Univers...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.