{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T09:19:43Z","timestamp":1780996783228,"version":"3.54.1"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"abstract":"<jats:p>Domain  Adaptation  aims  at  benefiting  from  a  labeled dataset drawn from a source distribution to learn a model from examples generated from a different  but  related target distribution. Creating  a domain-invariant  representation  between  the  two source and target domains is the most widely technique  used. A  simple  and  robust  way  to  perform this task consists in (i) representing the two domains by  subspaces  described  by  their  respective eigenvectors and (ii) seeking a mapping function  which  aligns  them. In  this  paper,  we  propose to use Optimal Transport (OT) and its associated Wassertein distance to perform this alignment. While the idea of using OT in domain adaptation is not new, the original contribution of this paper is two-fold:  (i) we derive a generalization bound on the  target  error  involving  several  Wassertein  distances.   This  prompts  us  to  optimize  the  ground metric  of  OT  to  reduce  the  target  risk;  (ii)  from this  theoretical  analysis,  we  design  an  algorithm (MLOT) which optimizes a Mahalanobis distance leading to a transportation plan that adapts better. Extensive  experiments  demonstrate  the  effectiveness of this original approach.<\/jats:p>","DOI":"10.24963\/ijcai.2020\/299","type":"proceedings-article","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T12:12:10Z","timestamp":1594210330000},"page":"2162-2168","source":"Crossref","is-referenced-by-count":17,"title":["Metric Learning in Optimal Transport for Domain Adaptation"],"prefix":"10.24963","author":[{"given":"Tanguy","family":"Kerdoncuff","sequence":"first","affiliation":[{"name":"Univ Lyon, UJM-Saint-Etienne, CNRS, Institut d Optique Graduate School, Laboratoire Hubert Curien UMR 5516, F-42023, SAINT-ETIENNE, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00e9mi","family":"Emonet","sequence":"additional","affiliation":[{"name":"Univ Lyon, UJM-Saint-Etienne, CNRS, Institut d Optique Graduate School, Laboratoire Hubert Curien UMR 5516, F-42023, SAINT-ETIENNE, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Sebban","sequence":"additional","affiliation":[{"name":"Univ Lyon, UJM-Saint-Etienne, CNRS, Institut d Optique Graduate School, Laboratoire Hubert Curien UMR 5516, F-42023, SAINT-ETIENNE, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"10584","event":{"name":"Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}","theme":"Artificial Intelligence","location":"Yokohama, Japan","acronym":"IJCAI-PRICAI-2020","number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2020,7,11]]},"end":{"date-parts":[[2020,7,17]]}},"container-title":["Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T02:14:21Z","timestamp":1594260861000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2020\/299"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2020\/299","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}