Beyond Mapping : Domain-Invariant Representations via Spectral Embedding of Optimal Transport Plans

Abdel Djalil Sad Saoud, Fred Maurice Ngolè Mboula, Hanane Slimani
1/19/2026
cs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{saoud2026beyond,
  title  = {Beyond Mapping : Domain-Invariant Representations via Spectral Embedding of Optimal Transport Plans},
  author = {Abdel Djalil Sad Saoud and Fred Maurice Ngolè Mboula and Hanane Slimani},
  year   = {2026},
  eprint = {2601.13350},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.13350v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.13350.svg)](https://codeofpaper.com/paper/2601.13350)

Discussion