Skip to Main content Skip to Navigation
Conference papers

Domain adaptation with regularized optimal transport

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Nicolas Courty Connect in order to contact the contributor
Submitted on : Friday, July 4, 2014 - 4:44:48 PM
Last modification on : Tuesday, October 19, 2021 - 11:58:58 PM
Long-term archiving on: : Saturday, October 4, 2014 - 1:00:35 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads