---
title: Entropy-Regularized Barycenter
url: https://www.emergentmind.com/topics/entropy-regularized-barycenter
type: topic
---

# Entropy-Regularized Barycenter

An entropy-regularized barycenter is a probability measure that arises as the unique solution to an optimization problem that averages a finite collection of input measures while incorporating entropy regularization into the optimal transport metric. This framework simultaneously ensures strict convexity, regularizes the geometry, enables computational efficiency through Sinkhorn-type algorithms, and yields strong regularity and statistical properties.

## 1. Variational Formulation and Existence

Given input measures $\mu_1, \dots, \mu_n$ on $\mathbb{R}^d$ (or a compact convex domain), weights $\lambda_1, \dots, \lambda_n>0$ with $\sum_{i=1}^n \lambda_i=1$, and entropy regularization parameter $\varepsilon>0$, the entropy-regularized barycenter $\nu^*$ is defined as the unique minimizer of
\[
J(\nu) := \sum_{i=1}^n \lambda_i\, W_{2,\varepsilon}^2(\nu, \mu_i) + \varepsilon H(\nu)
\]
over all $\nu$ in $\mathcal P_2(\mathbb{R}^d)$ with finite second moment. Here $W_{2,\varepsilon}^2(\nu, \mu_i)$ denotes the squared 2-Wasserstein distance regularized by entropy, i.e.,
\[
W_{2,\varepsilon}^2(\nu, \mu_i) = \min_{\gamma \in \Pi(\nu,\mu_i)}
   \int_{\mathbb{R}^d \times \mathbb{R}^d} \frac12 \|x-y\|^2 
   \,d\gamma(x,y) + \varepsilon\, \mathrm{Ent}(\gamma).
\]
The entropy functional can be the Boltzmann–Shannon entropy, Tsallis entropy, or more general convex functionals. Under mild regularity (strict convexity of $H$, lower semicontinuity), the barycenter problem possesses a unique minimizer [2012.10701, 2006.08743]. In Gaussian settings, the barycenter remains Gaussian with mean and covariance given by explicit fixed-point characterizations [2006.03416, 2006.08743].

## 2. Monge–Ampère and PDE Characterization

The entropy-regularized barycenter admits a PDE characterization via a coupled Monge–Ampère system. If $\nu^* \ll dx$ on $\mathbb{R}^d$ has density $\rho^*$, and $\phi_i$ denotes the unique (up to constants) Kantorovich potential transporting $\nu^*$ to $\mu_i$, then
\[
\rho^*(x) = \exp \left[ -\frac{1}{2\varepsilon}\|x\|^2 + \frac{1}{\varepsilon}\sum_{i=1}^n \lambda_i \phi_i(x) \right],
\]
with $x + \varepsilon \nabla\log\rho^*(x) = \sum_{i=1}^n \lambda_i \nabla \phi_i(x)$.
Each pair $(\phi_i,\rho^*)$ must satisfy the second boundary Monge–Ampère equation
\[
\det D^2\phi_i(x)\, \mu_i(\nabla\phi_i(x)) = \rho^*(x).
\]
This system characterizes the barycenter as the unique solution to a regularized coupled optimal transport problem [2012.10701].

## 3. Regularity and Stability Properties

Entropy regularization induces strong regularity in the barycenter:
- **Moment and Sobolev bounds:** For convex domains, $\sqrt{\rho^*}\in H^1$; in particular, $\rho^* \in L^\infty$ in one dimension, $L^q$ for all $q<\infty$ in $d=2$, and $L^{d/(d-2)}$ for $d\ge3$ [2012.10701].
- **Moment bounds:** If $\int m_p(\nu)dP(\nu)<\infty$ for $m_p(\nu) = \int \|x\|^p d\nu(x)$, then $m_p(\rho^*)<\infty$, with explicit estimates depending on $\varepsilon$ [2012.10701].
- **Higher regularity:** If input measures are supported on a $C^{k,\alpha}$ domain with $C^{k,\alpha}$ densities, then $\rho^* \in C^{k+2,\alpha}$ and potentials are $C^{k+2,\alpha}$ diffeomorphisms [2012.10701].
- **Log-concavity:** If each $\mu_i$ is log-concave, then $\rho^*$ satisfies Lipschitz and second-derivative bounds; log $\rho^* \in C^{1,1}$ with explicit spectral bounds [2012.10701].
- **Stability:** The barycenter mapping is Lipschitz-continuous in the input measures in Wasserstein or entropic divergence, robust under noise or perturbations [2006.08743, 1804.08962].

## 4. Computational Methods and Convergence

Sinkhorn-type algorithms exploit the strong convexity from entropy regularization, allowing tractable computation:
- **Dual and Fixed Point Methods:** In the Gaussian case, the barycenter covariance solves a nonlinear fixed point $\Sigma^* = \mathcal F(\Sigma^*)$ where $\mathcal F$ uses a closed-form functional of $\Sigma_i$ and $\varepsilon$ [2006.03416, 2006.08743].
- **Sinkhorn Iterations:** In discrete or semi-discrete settings, alternating Bregman projections produce rapid geometric convergence for moderate $\varepsilon$ [1804.08962].
- **Decentralized Algorithms:** For large distributed systems, block coordinate descent on dual variables, possibly asynchronous, achieves convergence under network delays [2304.11653].
- **Noisy Particle Gradient Descent:** In grid-free settings, stochastic particle methods converge in mean-field with exponential rate to the barycenter, solving a nonlinear Fokker–Planck PDE [2303.11844].
- **Complexity:** Each iteration has polynomial time complexity in the number of support points, avoiding the curse of dimensionality typical of unregularized barycenter algorithms [1804.08962, 2303.11844].

## 5. Application and Statistical Properties

The entropic regularized barycenter serves as a geometric averaging tool in a variety of applications:
- **Data registration:** Used for point cloud and flow cytometry alignment, controlling smoothness of barycenters via $\varepsilon$ [1804.08962].
- **Sensor fusion:** Robust to misalignment and noise, enabling accurate source localization from spatial covariances [1810.10788].
- **Robust classification:** Extraction of barycentric coefficients yields robust features for discrimination under heavy corruption [2501.07446].
- **Rate-distortion-perception theory:** Enables efficient trade-off optimization with strong convergence guarantees and criticality analysis of constraints [2304.14611, 2404.04681].
- **Sample complexity:** Rates are dimension-free: convergence in relative entropy is $O(n^{-1/2})$ with $n$ samples, in contrast to $O(n^{-1/d})$ for the unregularized case [2303.11844, 2502.02726].
- **Central Limit Theorem:** The empirical barycenter (from $n$ i.i.d.\ samples from the law $P$ over measures) satisfies a CLT in $L^2$ with explicit covariance operator determined by the Fréchet derivative at $\rho^*$ [2012.10701].

## 6. Debiasing and Limit Regimes

The entropic barycenter interpolates between classical $2$-Wasserstein barycenter ($\varepsilon\to0$) and maximum-entropy average ($\varepsilon\to\infty$):
- As $\varepsilon\to0$, the barycenter converges to the unregularized Wasserstein barycenter, selecting among minimizers those with minimal overall entropy in the transport plans [2006.03416, 2304.14611].
- As $\varepsilon\to\infty$, the barycenter approaches a degenerate mean (e.g., convex combination of inputs) or kernel-based interpolant ("heat-death" regime) [2006.03416].
- **Debiased Barycenters:** The so-called doubly regularized barycenter, with matching inner and outer entropy parameters $\tau=\lambda/2$, admits $O(\lambda^2)$ bias and mitigates the excess smoothing, with provable minimal distortion to the classical barycenter in isotropic Gaussian scenarios [2303.11844].

## 7. Special Structures and Extensions

- **Multimarginal and Schrödinger Barycenters:** The entropy-regularized multimarginal OT formulation admits efficient iterative scaling algorithms and dimension-independent sample complexity. Pushforward of the entropic coupling via a weighted sum yields the multimarginal Schrödinger barycenter, providing statistical optimality and tractability in high dimensions [2502.02726].
- **Generalized Entropies:** Using Tsallis entropy yields $q$-Gaussian barycenters, with well-characterized closed-form solutions for means and covariances. Other convex entropy functionals provide additional flexibility in smoothing and regularization [2006.08743].
- **Non-Euclidean Costs and Manifold Constraints:** Energy-guided dual algorithms via energy-based models extend the barycenter paradigm to arbitrary cost functions, including non-Euclidean metrics and constraints to data manifolds (e.g., GAN image spaces), with rigorous duality gaps controlling plan optimality [2310.01105].

---

The entropy-regularized barycenter is thus a foundational object in modern computational optimal transport, enabling both efficient computations and strong analytical guarantees across a broad range of quantitative domains.

Source: https://www.emergentmind.com/topics/entropy-regularized-barycenter