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

• URL: http://arxiv.org/abs/2601.13350v1
• Date: Mon, 19 Jan 2026 19:38:59 GMT
• Title: Beyond Mapping : Domain-Invariant Representations via Spectral Embedding of Optimal Transport Plans
• Authors: Abdel Djalil Sad Saoud, Fred Maurice Ngolè Mboula, Hanane Slimani,
• Abstract summary: We propose to interpret smoothed transport plans as adjacency matrices of bipartite graphs connecting source to target domain.<n>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.
• Score: 3.075071396300441
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Cross-Domain Diffusion with Progressive Alignment for Efficient Adaptive Retrieval [52.67656818203429]
  Unsupervised efficient domain adaptive retrieval aims to transfer knowledge from a labeled source domain to an unlabeled target domain.<n>Existing methods fail to address potential noise in the target domain, and directly align high-level features across domains.<n>We propose a novel Cross-Domain Diffusion with Progressive Alignment method (COUPLE) to address these challenges.
  arXiv  Detail & Related papers  (2025-05-20T04:17:39Z)
• Robust Distribution Alignment for Industrial Anomaly Detection under Distribution Shift [51.24522135151649]
  Anomaly detection plays a crucial role in quality control for industrial applications.<n>Existing methods attempt to address domain shifts by training generalizable models.<n>Our proposed method demonstrates superior results compared with state-of-the-art anomaly detection and domain adaptation methods.
  arXiv  Detail & Related papers  (2025-03-19T05:25:52Z)
• Weakly supervised covariance matrices alignment through Stiefel matrices estimation for MEG applications [64.20396555814513]
  This paper introduces a novel domain adaptation technique for time series data, called Mixing model Stiefel Adaptation (MSA) We exploit abundant unlabeled data in the target domain to ensure effective prediction by establishing pairwise correspondence with equivalent signal variances between domains. MSA outperforms recent methods in brain-age regression with task variations using magnetoencephalography (MEG) signals from the Cam-CAN dataset.
  arXiv  Detail & Related papers  (2024-01-24T19:04:49Z)
• CHATTY: Coupled Holistic Adversarial Transport Terms with Yield for Unsupervised Domain Adaptation [1.87446486236017]
  We propose a new technique called CHATTY: Coupled Holistic Adversarial Transport Terms with Yield for Unsupervised Domain Adaptation. Adversarial training is commonly used for learning domain-invariant representations by reversing the gradients from a domain discriminator head to train the feature extractor layers of a neural network. We introduce a sub-network which displaces the outputs of the source and target domain samples in a learnable manner.
  arXiv  Detail & Related papers  (2023-04-19T13:00:23Z)
• Label Alignment Regularization for Distribution Shift [63.228879525056904]
  Recent work has highlighted the label alignment property (LAP) in supervised learning, where the vector of all labels in the dataset is mostly in the span of the top few singular vectors of the data matrix. We propose a regularization method for unsupervised domain adaptation that encourages alignment between the predictions in the target domain and its top singular vectors. We report improved performance over domain adaptation baselines in well-known tasks such as MNIST-USPS domain adaptation and cross-lingual sentiment analysis.
  arXiv  Detail & Related papers  (2022-11-27T22:54:48Z)
• Hierarchical Optimal Transport for Unsupervised Domain Adaptation [0.0]
  We propose a novel approach for unsupervised domain adaptation, that relates notions of optimal transport, learning probability measures and unsupervised learning. The proposed approach, HOT-DA, is based on a hierarchical formulation of optimal transport. Experiments on a toy dataset with controllable complexity and two challenging visual adaptation datasets show the superiority of the proposed approach over the state-of-the-art.
  arXiv  Detail & Related papers  (2021-12-03T18:37:23Z)
• Unsupervised Noise Adaptive Speech Enhancement by Discriminator-Constrained Optimal Transport [25.746489468835357]
  This paper presents a novel discriminator-constrained optimal transport network (DOTN) that performs unsupervised domain adaptation for speech enhancement (SE) The DOTN aims to estimate clean references of noisy speech in a target domain, by exploiting the knowledge available from the source domain.
  arXiv  Detail & Related papers  (2021-11-11T17:15:37Z)
• Unsupervised Domain Adaptation for Retinal Vessel Segmentation with Adversarial Learning and Transfer Normalization [22.186070895966022]
  We propose an entropy-based adversarial learning strategy to reduce the distribution discrepancy between source and target domains. A new transfer normalization layer is proposed to further boost the transferability of the deep network. Our approach yields significant performance gains compared to other state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-08-04T02:45:37Z)
• Coarse to Fine: Domain Adaptive Crowd Counting via Adversarial Scoring Network [58.05473757538834]
  This paper proposes a novel adversarial scoring network (ASNet) to bridge the gap across domains from coarse to fine granularity. Three sets of migration experiments show that the proposed methods achieve state-of-the-art counting performance.
  arXiv  Detail & Related papers  (2021-07-27T14:47:24Z)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.