mlsanityData to 14 Oct 2026

A Relaxed Wasserstein Distance Formulation for Mixtures of Radially Contoured Distributions

arXiv 2503.13893 ↗First posted 18 Mar 2025math.OC stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Recently, a Wasserstein-type distance for Gaussian mixture models has been proposed. However, that framework can only be generalized to identifiable mixtures of general elliptically contoured distributions whose components come from the same family and satisfy marginal consistency. In this paper, we propose a simple relaxed Wasserstein distance for identifiable mixtures of radially contoured distributions whose components can come from different families. We show some properties of this distance and that its definition does not require marginal consistency. We apply this distance in color transfer tasks and compare its performance with the Wasserstein-type distance for Gaussian mixture models in an experiment. The error of our method is more stable and the color distribution of our output image is more desirable.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 35 references that are in the map. First posted on arXiv 18 Mar 2025.

Builds on

10 of 35 references.

References · 10

  1. 2021Convex optimizationcited by 2,515
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  3. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  4. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
  5. 2018Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithmcited by 112
  6. 2019A Wasserstein-type distance in the space of Gaussian Mixture Modelscited by 75
  7. 2019On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithmscited by 62
  8. 2015Diffeomorphic density matching by optimal information transportcited by 7
  9. 2016Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transportcited by 7
  10. 2024Optimal Transport and Wasserstein Barycenter for Radially Contoured Distributionscited by 1

Built on by

Not cited yet.