Lighter, Better, Faster Multi-Source Domain Adaptation with Gaussian Mixture Models and Optimal Transport
Not on the map. Why?
Abstract (arXiv)
In this paper, we tackle Multi-Source Domain Adaptation (MSDA), a task in transfer learning where one adapts multiple heterogeneous, labeled source probability measures towards a different, unlabeled target measure. We propose a novel framework for MSDA, based on Optimal Transport (OT) and Gaussian Mixture Models (GMMs). Our framework has two key advantages. First, OT between GMMs can be solved efficiently via linear programming. Second, it provides a convenient model for supervised learning, especially classification, as components in the GMM can be associated with existing classes. Based on the GMM-OT problem, we propose a novel technique for calculating barycenters of GMMs. Based on this novel algorithm, we propose two new strategies for MSDA: GMM-Wasserstein Barycenter Transport (WBT) and GMM-Dataset Dictionary Learning (DaDiL). We empirically evaluate our proposed methods on four benchmarks in image classification and fault diagnosis, showing that we improve over the prior art while being faster and involving fewer parameters. Our code is publicly available at https://github.com/eddardd/gmm_msda
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 16 of its 34 references that are in the map. First posted on arXiv 16 Apr 2024.
Builds on
16 of 34 references.
References · 16
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2019A Wasserstein-type distance in the space of Gaussian Mixture Modelscited by 75
- 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
- 2020Learning to Combine: Knowledge Aggregation for Multi-Source Domain Adaptationcited by 53
- 2020KD3A: Unsupervised Multi-Source Decentralized Domain Adaptation via Knowledge Distillationcited by 50
- 2017Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learningcited by 35
- 2020Multi-source Domain Adaptation via Weighted Joint Distributions Optimal Transportcited by 28
4 more
- 2023Multi-Source Domain Adaptation through Dataset Dictionary Learning in Wasserstein Spacecited by 12
- 2023Multi-Source Domain Adaptation meets Dataset Distillation through Dataset Dictionary Learningcited by 5
- 2023Federated Dataset Dictionary Learning for Multi-Source Domain Adaptationcited by 4
- 2024Optimal Transport for Domain Adaptation through Gaussian Mixture Modelscited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 1.
5 papers.
- 2025Slicing the Gaussian Mixture Wasserstein Distancecited by 7
- 2025Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computationcited by 1
- 2024Online Multi-Source Domain Adaptation through Gaussian Mixtures and Dataset Dictionary Learningcited by 0
- 2025Differentiable Expectation-Maximisation and Applications to Gaussian Mixture Model Optimal Transportcited by 0
- 2026DeFed-GMM-DaDiL: A Decentralized Federated Framework for Domain Adaptationcited by 0
- 2026DeFed-GMM-DaDiL: A Decentralized Federated Framework for Domain Adaptation5 May 2026
- 2025Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computation6 Oct 2025
- 2025Differentiable Expectation-Maximisation and Applications to Gaussian Mixture Model Optimal Transport2 Sep 2025
- 2025Slicing the Gaussian Mixture Wasserstein Distance11 Apr 2025
- 2024Online Multi-Source Domain Adaptation through Gaussian Mixtures and Dataset Dictionary Learning29 Jul 2024