arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.00616cs.LGstat.ML
收藏

SPD矩阵流形上的最优传输领域自适应

Domain Adaptation with Optimal Transport on the Manifold of SPD matrices

Technion, Israel Institute of Technology(以色列理工学院);Technical University of Munich(慕尼黑工业大学);Johns Hopkins University(约翰斯·霍普金斯大学)

Or Yair, Felix Dietrich, Ronen Talmon, Ioannis G. Kevrekidis

摘要:

在本文中,我们解决的问题,领域自适应(DA)使用最佳运输(OT)黎曼流形。我们模型的两个域之间的差异,通过一个同构和使用极分解定理,声称OT确实是最佳的DA在一个定义明确的意义上,体积保持地图。然后,我们专注于流形的对称和正定(SPD)矩阵,其结构提供了一个有用的背景下,在最近的应用。证明了该流形上的极分解定理。由于加权黎曼平均的唯一性,并利用现有的正则化OT算法,我们制定了一个简单的算法,将源域映射到目标域。我们在两个脑机接口(BCI)数据集上测试了我们的算法,并观察了最先进的性能。

英文摘要:

In this paper, we address the problem of Domain Adaptation (DA) using Optimal Transport (OT) on Riemannian manifolds. We model the difference between two domains by a diffeomorphism and use the polar factorization theorem to claim that OT is indeed optimal for DA in a well-defined sense, up to a volume preserving map. We then focus on the manifold of Symmetric and Positive-Definite (SPD) matrices, whose structure provided a useful context in recent applications. We demonstrate the polar factorization theorem on this manifold. Due to the uniqueness of the weighted Riemannian mean, and by exploiting existing regularized OT algorithms, we formulate a simple algorithm that maps the source domain to the target domain. We test our algorithm on two Brain-Computer Interface (BCI) data sets and observe state of the art performance.

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

↑