arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2003.00389cs.CV
收藏

联合Wasserstein分布匹配

Joint Wasserstein Distribution Matching

South China University of Technology(华南理工大学);Guangzhou Laboratory(广州实验室);Tencent AI Lab(腾讯人工智能实验室)

JieZhang Cao, Langyuan Mo, Qing Du, Yong Guo, Peilin Zhao, Junzhou Huang, Mingkui Tan

摘要:

联合分布匹配(Joint Distribution Matching,JDM)问题是指在机器学习和计算机视觉等应用中,通过学习双向映射来匹配两个域的联合分布的问题。然而,由于两个关键挑战,这个问题非常困难:(i)通常难以利用来自联合分布的足够信息来进行匹配;(ii)这个问题难以公式化和优化。在本文中,依靠最优运输理论,我们提出解决JDM问题的最小化Wasserstein距离的联合分布在两个区域。然而,由此产生的优化问题仍然是棘手的。在此基础上,我们提出了一个重要的定理,将这个复杂的问题转化为一个简单的优化问题,并提出了一种新的方法(称为联合Wasserstein分布匹配(JWDM))来解决这个问题。定性和定量的比较表明,我们的方法优于几个国家的最先进的性能。

英文摘要:

Joint distribution matching (JDM) problem, which aims to learn bidirectional mappings to match joint distributions of two domains, occurs in many machine learning and computer vision applications. This problem, however, is very difficult due to two critical challenges: (i) it is often difficult to exploit sufficient information from the joint distribution to conduct the matching; (ii) this problem is hard to formulate and optimize. In this paper, relying on optimal transport theory, we propose to address JDM problem by minimizing the Wasserstein distance of the joint distributions in two domains. However, the resultant optimization problem is still intractable. We then propose an important theorem to reduce the intractable problem into a simple optimization problem, and develop a novel method (called Joint Wasserstein Distribution Matching (JWDM)) to solve it. In the experiments, we apply our method to unsupervised image translation and cross-domain video synthesis. Both qualitative and quantitative comparisons demonstrate the superior performance of our method over several state-of-the-arts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑