Regularized Wasserstein Means for Aligning Distributional Data
Liang Mi, Wen Zhang, Yalin Wang
Abstract
We propose to align distributional data from the perspective of Wasserstein means. We raise the problem of regularizing Wasserstein means and propose several terms tailored to tackle different problems. Our formulation is based on the variational transportation to distribute a sparse discrete measure into the target domain. The resulting sparse representation well captures the desired property of the domain while reducing the mapping cost. We demonstrate the scalability and robustness of our method with examples in domain adaptation, point set registration, and skeleton layout.
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 fe9ad82f-b0ea-48fb-9c2b-855b996c1317Cited by top-tier papers1
Ask how each one uses itRelated papers
- Adversarial Support AlignmentShangyuan Tong, Timur Garipov, Yang Zhang, Shiyu Chang et al.ICLR 2022 · 10 citations
- Graph Optimal Transport for Cross-Domain AlignmentLiqun Chen, Zhe Gan, Yu Cheng, Linjie Li et al.ICML 2020 · 193 citations
- Fast Regularized Discrete Optimal Transport with Group-Sparse RegularizersYasutoshi Ida, Sekitoshi Kanai, Kazuki Adachi, Atsutoshi Kumagai et al.AAAI 2023 · 3 citations
- Theoretical Performance Guarantees for Partial Domain Adaptation via Partial Optimal TransportJayadev Naram, Fredrik Hellström, Ziming Wang, Rebecka Jörnsten et al.ICML 2025
- Wasserstein Barycenter for Multi-Source Domain AdaptationEduardo Fernandes Montesuma, Fred Maurice Ngolè MboulaCVPR 2021
