MLMar 13, 2018

Optimal Transport for Multi-source Domain Adaptation under Target Shift

arXiv:1803.04899v3165 citations
Originality Incremental advance
AI Analysis

This addresses a critical but often ignored problem in real-world applications like satellite image segmentation, though it is incremental as it builds on existing optimal transport techniques.

The paper tackles multi-source domain adaptation under target shift, where label proportions differ across domains, by proposing an optimal transport-based method that simultaneously corrects target shift and aligns distributions. Experiments on synthetic and real-world satellite image segmentation data demonstrate the method's superiority over state-of-the-art approaches.

In this paper, we propose to tackle the problem of reducing discrepancies between multiple domains referred to as multi-source domain adaptation and consider it under the target shift assumption: in all domains we aim to solve a classification problem with the same output classes, but with labels' proportions differing across them. This problem, generally ignored in the vast majority papers on domain adaptation papers, is nevertheless critical in real-world applications, and we theoretically show its impact on the adaptation success. To address this issue, we design a method based on optimal transport, a theory that has been successfully used to tackle adaptation problems in machine learning. Our method performs multi-source adaptation and target shift correction simultaneously by learning the class probabilities of the unlabeled target sample and the coupling allowing to align two (or more) probability distributions. Experiments on both synthetic and real-world data related to satellite image segmentation task show the superiority of the proposed method over the state-of-the-art.

Code Implementations3 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes