Domain Adaptation with Optimal Transport on the Manifold of SPD matrices
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Brain Computer InterfaceDomain AdaptationSimilar Papers 제목 키워드 기반
Deep Optimal Transport for Domain Adaptation on SPD Manifolds
Recent progress in geometric deep learning has drawn increasing attention from the machine learning community toward domain adaptation on symmetric positive definite (SPD) manifolds, especially for neuroimaging data that…
Brain Computer InterfaceDomain AdaptationElectroencephalogram (EEG)Transfer LearningParallel Transport on the Cone Manifold of SPD Matrices for Domain Adaptation
In this paper, we consider the problem of domain adaptation. We propose to view the data through the lens of covariance matrices and present a method for domain adaptation using parallel transport on the cone manifold of…
Domain AdaptationGeometry-aware Domain Adaptation for Unsupervised Alignment of Word Embeddings
We propose a novel manifold based geometric approach for learning unsupervised alignment of word embeddings between the source and the target languages. Our approach formulates the alignment learning problem as a domain …
Bilingual Lexicon InductionDomain AdaptationWord EmbeddingsCorrelation Alignment by Riemannian Metric for Domain Adaptation
Domain adaptation techniques address the problem of reducing the sensitivity of machine learning methods to the so-called domain shift, namely the difference between source (training) and target (test) data distributions…
Domain AdaptationUnsupervised Domain AdaptationRiemannian block SPD coupling manifold and its application to optimal transport
In this work, we study the optimal transport (OT) problem between symmetric positive definite (SPD) matrix-valued measures. We formulate the above as a generalized optimal transport problem where the cost, the marginals,…
Riemannian optimization