mlsanityData to 7 Oct 2026

Normalized Wasserstein Distance for Mixture Distributions with Applications in Adversarial Learning and Domain Adaptation

arXiv 1902.00415 ↗First posted 1 Feb 2019cs.LG stat.MLcited by 23

Not on the map. Why?

Abstract (arXiv)

Understanding proper distance measures between distributions is at the core of several learning tasks such as generative models, domain adaptation, clustering, etc. In this work, we focus on mixture distributions that arise naturally in several application domains where the data contains different sub-populations. For mixture distributions, established distance measures such as the Wasserstein distance do not take into account imbalanced mixture proportions. Thus, even if two mixture distributions have identical mixture components but different mixture proportions, the Wasserstein distance between them will be large. This often leads to undesired results in distance-based learning methods for mixture distributions. In this paper, we resolve this issue by introducing the Normalized Wasserstein measure. The key idea is to introduce mixture proportions as optimization variables, effectively normalizing mixture proportions in the Wasserstein formulation. Using the proposed normalized Wasserstein measure leads to significant performance gains for mixture distributions with imbalanced mixture proportions compared to the vanilla Wasserstein distance. We demonstrate the effectiveness of the proposed measure in GANs, domain adaptation and adversarial clustering in several benchmark datasets.

Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Feb 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 4; 2023: 5; 2024: 3; 2025: 3; 2026: 1.

23 papers.

Sort:

By area:

  1. 2021Domain Generalization: A Surveycited by 760
  2. 2021Aggregating From Multiple Target-Shifted Sourcescited by 24
  3. 2022VoLTA: Vision-Language Transformer with Weakly-Supervised Local-Feature Alignmentcited by 20
  4. 2023Characterizing Out-of-Distribution Error via Optimal Transportcited by 20
  5. 2022An Optimal Transport Approach to Personalized Federated Learningcited by 12
  6. 2023Make the U in UDA Matter: Invariant Consistency Learning for Unsupervised Domain Adaptationcited by 12
  7. 2021SLOSH: Set LOcality Sensitive Hashing via Sliced-Wasserstein Embeddingscited by 9
  8. 2021Graphical Modeling for Multi-Source Domain Adaptationcited by 7
  9. 2022Dynamic Instance Domain Adaptationcited by 6
  10. 2023CODA: Temporal Domain Generalization via Concept Drift Simulatorcited by 6
  11. 2024Domain Generalization with Small Datacited by 6
  12. 2025Optimal Transport-Guided Source-Free Adaptation for Face Anti-Spoofingcited by 5
11 more
  1. 2021Domain Attention Consistency for Multi-Source Domain Adaptationcited by 4
  2. 2025Is There a Better Source Distribution than Gaussian? Exploring Source Distributions for Image Flow Matchingcited by 4
  3. 2022Robust Target Training for Multi-Source Domain Adaptationcited by 3
  4. 2024Fast, accurate and lightweight sequential simulation-based inference using Gaussian locally linear mappingscited by 3
  5. 2021MetaPix: Domain Transfer for Semantic Segmentation by Meta Pixel Weightingcited by 2
  6. 2023Pruning for Better Domain Generalizabilitycited by 2
  7. 2024Contrastive Conditional Alignment based on Label Shift Calibration for Imbalanced Domain Adaptationcited by 2
  8. 2025Geometric Moment Alignment for Domain Adaptation via Siegel Embeddingscited by 2
  9. 2023Generative Model Based Noise Robust Training for Unsupervised Domain Adaptationcited by 1
  10. 2021Graceful Degradation and Related Fieldscited by 0
  11. 2026Graph-Informed Adversarial Modeling: Infimal Subadditivity of Interpolative Divergencescited by 0