Beyond Mapping : Domain-Invariant Representations via Spectral Embedding of Optimal Transport Plans
Not on the map. Why?
Abstract (arXiv)
Distributional shifts between training and inference time data remain a central challenge in machine learning, often leading to poor performance. It motivated the study of principled approaches for domain alignment, such as optimal transport based unsupervised domain adaptation, that relies on approximating Monge map using transport plans, which is sensitive to the transport problem regularization strategy and hyperparameters, and might yield biased domains alignment. In this work, we propose to interpret smoothed transport plans as adjacency matrices of bipartite graphs connecting source to target domain and derive domain-invariant samples' representations through spectral embedding. We evaluate our approach on acoustic adaptation benchmarks for music genre recognition, music-speech discrimination, as well as electrical cable defect detection and classification tasks using time domain reflection in different diagnosis settings, achieving overall strong performances.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 23 references that are in the map. First posted on arXiv 19 Jan 2026.
Builds on
8 of 23 references.
References · 8
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2018Optimal Transport for Multi-source Domain Adaptation under Target Shiftcited by 68
- 2020Multi-source Domain Adaptation via Weighted Joint Distributions Optimal Transportcited by 28
- 2023SPA: A Graph Spectral Alignment Perspective for Domain Adaptationcited by 22
- 2021Label Propagation Through Optimal Transportcited by 4
Built on by
Not cited yet.