Domain adaptation with regularized optimal transport - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Domain adaptation with regularized optimal transport


We present a new and original method to solve the domain adaptation problem using optimal transport. By searching for the best transportation plan between the probability distribution functions of a source and a target domain, a non-linear and invertible transformation of the learning samples can be estimated. Any standard machine learning method can then be applied on the transformed set, which makes our method very generic. We propose a new optimal transport algorithm that incorporates label information in the optimization: this is achieved by combining an efficient matrix scaling technique together with a majoration of a non-convex regularization term. By using the proposed optimal transport with label regularization, we obtain significant increase in performance compared to the original transport solution. The proposed algorithm is computationally efficient and effective, as illustrated by its evaluation on a toy example and a challenging real life vision dataset, against which it achieves competitive results with respect to state-of-the-art methods.
Fichier principal
Vignette du fichier
paper.pdf (1.92 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01018698 , version 1 (04-07-2014)


  • HAL Id : hal-01018698 , version 1


Nicolas Courty, Rémi Flamary, Devis Tuia. Domain adaptation with regularized optimal transport. ECML/PKDD 2014, Sep 2014, Nancy, France. pp.1-16. ⟨hal-01018698⟩
903 View
848 Download


Gmail Facebook Twitter LinkedIn More