Maximum Density Divergence for Domain Adaptation.

Area of Science:

• Machine Learning
• Artificial Intelligence
• Computer Vision

Background:

• Unsupervised domain adaptation (UDA) aims to transfer knowledge from labeled source domains to unlabeled target domains with differing data distributions.
• A key challenge in UDA is mitigating the distribution divergence between source and target domains.
• Current UDA methods often employ adversarial training or distribution gap metrics.

Purpose of the Study:

• To propose a novel UDA method, Adversarial Tight Match (ATM), that combines adversarial training and metric learning.
• To introduce a new distance metric, Maximum Density Divergence (MDD), for quantifying distribution divergence.
• To address equilibrium challenges in adversarial domain adaptation.

Main Methods:

• Developed Maximum Density Divergence (MDD) to quantify distribution divergence by minimizing inter-domain divergence and maximizing intra-class density.
• Integrated MDD into an adversarial domain adaptation framework to enhance knowledge transfer.
• Proposed the Adversarial Tight Match (ATM) method, leveraging MDD as a practical learning loss.

Main Results:

• Theoretical analysis and empirical evaluations demonstrate the effectiveness of the proposed ATM method.
• Experiments on four diverse benchmarks (classical and large-scale) show ATM achieving state-of-the-art performance.
• ATM successfully mitigates distribution divergence, enabling robust knowledge transfer in UDA.

Conclusions:

• The proposed Maximum Density Divergence (MDD) is an effective metric for quantifying distribution divergence in UDA.
• Adversarial Tight Match (ATM) offers a powerful new approach to unsupervised domain adaptation.
• ATM achieves superior performance, setting a new state-of-the-art on multiple UDA benchmarks.