【论文阅读】Universal Domain Adaptation

Universal Domain Adaptation

SUMMARY@2020/3/27

---

Motivation

This paper focuses on its special setting of universal domain adaptation, where

• no prior information about the target label sets is provided.
• we know source domain with labeled data.

The following figure shows this motivation of this setting.

and the following show some settings of this universal domain adaptation:

Related Work

This work is partly based on some early works of partially set domain adaptation by Mingsheng Long group, like:

• SAN (Partial Transfer Learning with Selective Adversarial Networks)
  • utilizes multiple domain discriminators with class level and instance-level weighting mechanism to achieve per-class adversarial distribution matching.
• PADA (Partial adversarial domain adaptation)
  • only one adversarial network and jointly applying class-level weighting on the source classifier
  • haven’t yet read

and some of others’ relative work of :

• IWAN (Importance weighted adversarial nets for partial domain adaptation)
  • constructs an auxiliary domain discriminator to quantify the probability of a source sample being similar to the target domain.
  • haven’t yet read

And these works all partly applies the idea of adversarial network GAN and domain adaptation version GAN:

• GAN (Generative Adversarial Nets)
• DANN( Domain-Adversarial Training of Neural Networks)
  • adversarial-based, deep method domain adaptation

Challenges / Aims /Contribution

Under the universal domain adaptation setting, our goal now is to match the common categories in source and target domain. The main challenges of solving this universal problem are:

• how to deal with the $\overline{C_S}$ part which is unrelated part of source domain to circumvent negative transfer for target domain

• effective domain adaptation between related part of source domain and target domain

• learn model (feature extraction & classifier )to minimize the target risk in the common set $C$

Method Proposed

UAN(universal adaptation network) is composes of 4 parts in training phase as following figure shows.

Feature extractor $F$

• find good features that match source and target
• good features to be used by classifier

Label classifier $G$

• compute prediction label $\hat{y}=G(F(x))\in C_S$ (source domain label set)

• classification loss need to be minimized by good parameters of $F$ and $G$
  $$E_G={\mathbb{E}}_{(\mathrm{x},\mathrm{y})\sim p}L(\mathrm{y},G(F(\mathrm{x})))$$

Non-adversarial domain discriminator $D^{\prime }$

• compute similarity of each $\mathrm{x}$ to source domain

  • ${\hat{d}}^{\prime }=D^{\prime }(\mathrm{z})\in [0,1]$
  • $\hat d^\prime \rightarrow 1 $ if x is more similar to source

• domain classification loss need to be minimized, thus end up with good ${\hat{d}}^{\prime }$ output for every sample from both source and target domain:
  $$E_{D^{\prime }}=-{\mathbb{E}}_{\mathrm{x}\sim p}\mathrm{l}\mathrm{o}\mathrm{g}(D^{\prime }(F(\mathrm{x})))-{\mathbb{E}}_{\mathrm{x}\sim q}\mathrm{l}\mathrm{o}\mathrm{g}(1-D^{\prime }(F(\mathrm{x})))$$

• hypothesis: expectation of similarity value from different label set distribution will be used in weighting adversarial domain discriminator D:
  $${\mathbb{E}}_{\mathrm{x}\sim p_{\overline{C_S}}}{\hat{d}}^{\prime }>{\mathbb{E}}_{\mathrm{x}\sim p_C}{\hat{d}}^{\prime }>{\mathbb{E}}_{\mathrm{x}\sim q_C}{\hat{d}}^{\prime }>{\mathbb{E}}_{\mathrm{x}\sim q_{\overline{C_t}}}{\hat{d}}^{\prime }$$

• not used in adversarial, since it is the same as in DANN, which aims at matching the exactly same source and target label space. may cause negative transfer in universal setting.

Adversarial domain discriminator $D$

• aims at discriminate source and target in the common label set $C$

• domain discriminate loss: needs to be minimized for good discriminator; needs to be maximized which equals the good representation of feature extractor:
  $$E_D=-{\mathbb{E}}_{\mathrm{x}\sim p}{w}^s(\mathrm{x})\mathrm{l}\mathrm{o}\mathrm{g}(D^{\prime }(F(\mathrm{x})))-{\mathbb{E}}_{\mathrm{x}\sim q}{w}^t(\mathrm{x})\mathrm{l}\mathrm{o}\mathrm{g}(1-D^{\prime }(F(\mathrm{x})))$$

• add big weights for samples from common label set in both source and target domain , aims at maximally match the source and target domain specially in common label set.

• weights(called “sample level transferability criterion”) to be constructed:
  $$\begin{gathered} {\mathbb{E}}_{\mathrm{x}\sim p_C}{w}^s(\mathrm{x})>{\mathbb{E}}_{\mathrm{x}\sim {\bar{p}}_{C_s}}{w}^s(\mathrm{x}) \\ {\mathbb{E}}_{\mathrm{x}\sim q_C}{w}^t(\mathrm{x})>{\mathbb{E}}_{\mathrm{x}\sim {\bar{q}}_{C_t}}{w}^t(\mathrm{x}) \end{gathered}$$

• use entropy of predicted vector to measure uncertainty of prediction:
  $${\mathbb{E}}_{\mathrm{x}\sim q_{\overline{C_t}}}H(\hat{\mathrm{y}})>{\mathbb{E}}_{\mathrm{x}\sim q_C}H(\hat{\mathrm{y}})>{\mathbb{E}}_{\mathrm{x}\sim p_C}H(\hat{\mathrm{y}})>{\mathbb{E}}_{\mathrm{x}\sim p_{\overline{C_s}}}H(\hat{\mathrm{y}})$$

• use domain similarity and the prediction uncertainty of each sample, to develop a weighting mechanism for discovering label sets shared by both domains and promote common-class adaptation
  $$\begin{gathered} w^s(\mathrm{x})=\frac{H(\hat{\mathrm{y}})}{\mathrm{l}\mathrm{o}\mathrm{g}|C_s|}-{\hat{d}}^{\prime }(\mathrm{x}) \\ {w}^t(\mathrm{x})={\hat{d}}^{\prime }(\mathrm{x})-\frac{H(\hat{\mathrm{y}})}{\mathrm{l}\mathrm{o}\mathrm{g}|C_s|} \end{gathered}$$

  • normalized H
  • all together normalized when training

Training

• to write in GAN-based two stage, but in neural network implemented end-to-end by using the gradient reversal layer from DANN:

KaTeX parse error: Expected group after '_' at position 6: \max_̲\limits{D}\min_…

Testing

see figure below :

• no adversarial $D$
• calculate weight $w^t(x)$for sample $x$ from target
• set a validated threshold to argue whether x comes from common label set

Experiment

• $F$ is pretrained ResNet50
• all unknown in target labeled as a whole "unknow " big class
• better than prior setting methods