Normalized Wasserstein for Mixture Distributions With Applications in Adversarial Learning and Domain Adaptation
Yogesh Balaji, Rama Chellappa, Soheil Feizi
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext df079b0d-6cff-4d4e-b420-12840b424070Cited by top-tier papers5
- Robust Optimal Transport with Applications in Generative Modeling and Domain AdaptationYogesh Balaji, Rama Chellappa, Soheil FeiziNeurIPS 2020 · 141 citations
- Make the U in UDA Matter: Invariant Consistency Learning for Unsupervised Domain AdaptationZhongqi Yue, Qianru Sun, Hanwang ZhangNeurIPS 2023 · 39 citations
- Characterizing Out-of-Distribution Error via Optimal TransportYuzhe Lu, Yilong Qin, Runtian Zhai, Andrew Shen et al.NeurIPS 2023 · 22 citations
- CODA: Temporal Domain Generalization via Concept Drift SimulatorChia-Yuan Chang, Yu-Neng Chuang, Zhimeng Jiang, Kwei-Herng Lai et al.KDD 2025
- Optimal Transport-Guided Source-Free Adaptation for Face Anti-SpoofingZhuowei Li, Tianchen Zhao, Xiang Xu, Zheng Zhang et al.CVPR 2025
Related papers
- Wasserstein Distance Regularized Sequence Representation for Text Matching in Asymmetrical DomainsWeijie Yu, Chen Xu, Jun Xu, Liang Pang et al.EMNLP 2020 · 10 citations
- The Unbalanced Gromov Wasserstein Distance: Conic Formulation and RelaxationThibault Séjourné, François-Xavier Vialard, Gabriel PeyréNeurIPS 2021 · 106 citations
- Differentially Private Sliced Wasserstein DistanceAlain Rakotomamonjy, Liva RalaivolaICML 2021 · 26 citations
- Stein Latent Optimization for Generative Adversarial NetworksUiwon Hwang, Heeseung Kim, Dahuin Jung, Hyemi Jang et al.ICLR 2022 · 2 citations
- Distributional Sliced-Wasserstein and Applications to Generative ModelingKhai Nguyen, Nhat Ho, Tung Pham, Hung BuiICLR 2021 · 111 citations
