mlsanityData to 7 Oct 2026

Deep Optimal Transport for Domain Adaptation on SPD Manifolds

arXiv 2201.05745 ↗First posted 15 Jan 2022cs.LG cs.AI eess.SPcited by 6

Not on the map. Why?

Abstract (arXiv)

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 often suffer from distribution shifts across sessions. These data, typically represented as covariance matrices of brain signals, inherently lie on SPD manifolds due to their symmetry and positive definiteness. However, conventional domain adaptation methods often overlook this geometric structure when applied directly to covariance matrices, which can result in suboptimal performance. To address this issue, we introduce a new geometric deep learning framework that combines optimal transport theory with the geometry of SPD manifolds. Our approach aligns data distributions while respecting the manifold structure, effectively reducing both marginal and conditional discrepancies. We validate our method on three cross-session brain computer interface datasets, KU, BNCI2014001, and BNCI2015001, where it consistently outperforms baseline approaches while maintaining the intrinsic geometry of the data. We also provide quantitative results and visualizations to better illustrate the behavior of the learned embeddings.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 16 of its 86 references that are in the map. First posted on arXiv 15 Jan 2022.

Builds on

16 of 86 references.

References · 16

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
  3. 2018Computational Optimal Transportcited by 765
  4. 2018Deep Visual Domain Adaptation: A Surveycited by 634
  5. 2015Optimal Transport for Domain Adaptationcited by 457
  6. 2018A Survey of Unsupervised Deep Domain Adaptationcited by 361
  7. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  8. 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
  9. 2016A Riemannian Network for SPD Matrix Learningcited by 162
  10. 2016Correlation Alignment for Unsupervised Domain Adaptationcited by 146
  11. 2019Riemannian batch normalization for SPD neural networkscited by 72
  12. 2016Deep Learning on Lie Groups for Skeleton-based Action Recognitioncited by 42
4 more
  1. 2020Federated Transfer Learning for EEG Signal Classificationcited by 36
  2. 2020Multi-source Domain Adaptation via Weighted Joint Distributions Optimal Transportcited by 28
  3. 2018Parallel Transport on the Cone Manifold of SPD Matrices for Domain Adaptationcited by 20
  4. 2021On the interpretation of linear Riemannian tangent space model parameters in M/EEGcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1; 2026: 2.

6 papers.