Title: UNSUPERVISED DOMAIN ADAPTATION THROUGH SELF-SUPERVISION

Abstract: This paper addresses unsupervised domain adaptation, the setting where labeled training data is available on a source domain, but the goal is to have good performance on a target domain with only unlabeled data. Like much of previous work, we seek to align the learned representations of the source and target domains while preserving discriminability. The way we accomplish alignment is by learning to perform auxiliary self-supervised task(s) on both domains simultaneously. Each self-supervised task brings the two domains closer together along the direction relevant to that task. Training this jointly with the main task classifier on the source domain is shown to successfully generalize to the unlabeled target domain. The presented objective is straightforward to implement and easy to optimize. We achieve state-of-the-art results on four out of seven standard benchmarks, and competitive results on segmentation adaptation. We also demonstrate that our method composes well with another popular pixel-level adaptation method.

1. INTRODUCTION:

Visual distribution shifts are fundamental to our constantly evolving world. We humans face them all the time, e.g. when we navigate a foreign city, read text in a new font, or recognize objects in an environment we have never encountered before. These real-world challenges to the human visual perception have direct parallels in computer vision. Formally, a distribution shift happens when a model is trained on data from one distribution (source), but the goal is to make good predictions on some other distribution (target) that shares the label space with the source. Often computational models struggle even for pairs of distributions that humans find intuitively similar.

Our paper studies the setting of unsupervised domain adaptation, with labeled data in the source domain, but only unlabeled data in the target domain. The general philosophy of the field is to induce alignment of the source and target domains through some transformation. In the context of deep learning, a convolutional neural network maps images to learned representations in some feature space, so inducing alignment is done by making the distribution shifts small between the source and target in this shared feature space (Csurka, 2017; Wang & Deng, 2018; Gopalan et al., 2011) . If, in addition, such representations preserve discriminability on the source domain, then we can learn a good classifier on the source, which now generalizes to the target under the reasonable assumption that the representations of the two domains have the same ground truth.

Most existing approaches implement this philosophy of alignment by minimizing a measurement of distributional discrepancy in the feature space (details in section 2), often some form of maximum mean discrepancy (MMD) e.g. Long et al. (2017) , or a learned discriminator of the source and target as an approximation to the total variation distance e.g. Ganin et al. (2016) . Both measurements lead to the formulation of the training objective as a minimax optimization problem a.k.a. adversarial learning, which is known to be very difficult to solve. Unless carefully balanced, the push and pull in opposite directions can often cause wild fluctuations in the discrepancy loss and lead to sudden divergence (details in section 2). Therefore, we propose to avoid minimax optimization altogether through a very different approach.

Our main idea is to achieve alignment between the source and target domains by training a model on the same task in both domains simultaneously. Indeed, if we had labels in both domains, we could simply use our original classification task for this. However, since we lack labels in the target domain, we propose to use a self-supervised auxiliary task, which creates its own labels directly from Source classifier T < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3

e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > S < l a t e x i t s h a _ b a s e = " w O L Z B U A I V s b y K z R K w u B x I c A = " > A A A B n i c b V D L S s N A F L p r p f V Z d u B o v g q i Q i L L g p s u K g F t K J P p p B m Y S Z G G E f o Y b F q W v c + T d O i y c D A Z x m X N P k E h h H W / n d L G t b T n m s r d / c H h U P T p m D j V j L d Z L G P d C j h U i j e R o G S x L N a R R I g m d n f f e L a i F g i z h f k T H S o S C U b R S f x B R n D A q s f s F p z + C Z J B a l B g d a w + j U Y x S y N u E I m q T F z Q z h G w S S f V w a p Q l l U z r m f U s V j b j x s X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I m U c q u / u f U w x v / U y o J E W u P K j M J U E Y L f T Z C c Z y Z g l l W t i s h E o p g x t S x V b g r d j r p X N U t + d X c a z a K O M p z B O V y C B z f Q g C a o A M Y n i G V h z H l x p P W j J K X Z O Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a _ b a s e = " w O L Z B U A I V s b y K z R K w u B x I c A = " > A A A B n i c b V D L S s N A F L p r p f V Z d u B o v g q i Q i L L g p s u K g F t K J P p p B m Y S Z G G E f o Y b F q W v c + T d O i y c D A Z x m X N P k E h h H W / n d L G t b T n m s r d / c H h U P T p m D j V j L d Z L G P d C j h U i j e R o G S x L N a R R I g m d n f f e L a i F g i z h f k T H S o S C U b R S f x B R n D A q s f s F p z + C Z J B a l B g d a w + j U Y x S y N u E I m q T F z Q z h G w S S f V w a p Q l l U z r m f U s V j b j x s X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I m U c q u / u f U w x v / U y o J E W u P K j M J U E Y L f T Z C c Z y Z g l l W t i s h E o p g x t S x V b g r d j r p X N U t + d X c a z a K O M p z B O V y C B z f Q g C a o A M Y n i G V h z H l x p P W j J K X Z O Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a _ b a s e = " w O L Z B U A I V s b y K z R K w u B x I c A = " > A A A B n i c b V D L S s N A F L p r p f V Z d u B o v g q i Q i L L g p s u K g F t K J P p p B m Y S Z G G E f o Y b F q W v c + T d O i y c D A Z x m X N P k E h h H W / n d L G t b T n m s r d / c H h U P T p m D j V j L d Z L G P d C j h U i j e R o G S x L N a R R I g m d n f f e L a i F g i z h f k T H S o S C U b R S f x B R n D A q s f s F p z + C Z J B a l B g d a w + j U Y x S y N u E I m q T F z Q z h G w S S f V w a p Q l l U z r m f U s V j b j x s X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I m U c q u / u f U w x v / U y o J E W u P K j M J U E Y L f T Z C c Z y Z g l l W t i s h E o p g x t S x V b g r d j r p X N U t + d X c a z a K O M p z B O V y C B z f Q g C a o A M Y n i G V h z H l x p P W j J K X Z O Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a _ b a s e = " w O L Z B U A I V s b y K z R K w u B x I c A = " > A A A B n i c b V D L S s N A F L p r p f V Z d u B o v g q i Q i L L g p s u K g F t K J P p p B m Y S Z G G E f o Y b F q W v c + T d O i y c D A Z x m X N P k E h h H W / n d L G t b T n m s r d / c H h U P T p m D j V j L d Z L G P d C j h U i j e R o G S x L N a R R I g m d n f f e L a i F g i z h f k T H S o S C U b R S f x B R n D A q s f s F p z + C Z J B a l B g d a w + j U Y x S y N u E I m q T F z Q z h G w S S f V w a p Q l l U z r m f U s V j b j x s X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I m U c q u / u f U w x v / U y o J E W u P K j M J U E Y L f T Z C c Z y Z g l l W t i s h E o p g x t S x V b g r d j r p X N U t + d X c a z a K O M p z B O V y C B z f Q g C a o A M Y n i G V h z H l x p P W j J K X Z O Q + c z x + N d p F v < / l a t e x i t > (a) Source classifier only Self-supervised classifier #1 T < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > S < l a t e x i t s h a 1 _ b a s e 6 4 = " w O L Z B U A I 8 V 3 s 6 b y K z R K w u B 0 x I c A = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i Q i 6 L L g p s u K 9 g F t K J P p p B 0 6 m Y S Z G 6 G E f o Y b F 4 q 4 9 W v c + T d O 2 i y 0 9 c D A 4 Z x 7 m X N P k E h h 0 H W / n d L G 5 t b 2 T n m 3 s r d / c H h U P T 7 p m D j V j L d Z L G P d C 6 j h U i j e R o G S 9 x L N a R R I 3 g 2 m d 7 n f f e L a i F g 9 4 i z h f k T H S o S C U b R S f x B R n D A q s 4 f 5 s F p z 6 + 4 C Z J 1 4 B a l B g d a w + j U Y x S y N u E I m q T F 9 z 0 3 Q z 6 h G w S S f V w a p 4 Q l l U z r m f U s V j b j x s 0 X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I 7 m U c 0 q 1 4 u / u f 1 U w x v / U y o J E W u 2 P K j M J U E Y 5 L f T 0 Z C c 4 Z y Z g l l W t i s h E 2 o p g x t S x V b g r d 6 8 j r p X N U 9 t + 7 d X 9 c a z a K O M p z B O V y C B z f Q g C a 0 o A 0 M Y n i G V 3 h z 0 H l x 3 p 2 P 5 W j J K X Z O 4 Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " w O L Z B U A I 8 V 3 s 6 b y K z R K w u B 0 x I c A = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i Q i 6 L L g p s u K 9 g F t K J P p p B 0 6 m Y S Z G 6 G E f o Y b F 4 q 4 9 W v c + T d O 2 i y 0 9 c D A 4 Z x 7 m X N P k E h h 0 H W / n d L G 5 t b 2 T n m 3 s r d / c H h U P T 7 p m D j V j L d Z L G P d C 6 j h U i j e R o G S 9 x L N a R R I 3 g 2 m d 7 n f f e L a i F g 9 4 i z h f k T H S o S C U b R S f x B R n D A q s 4 f 5 s F p z 6 + 4 C Z J 1 4 B a l B g d a w + j U Y x S y N u E I m q T F 9 z 0 3 Q z 6 h G w S S f V w a p 4 Q l l U z r m f U s V j b j x s 0 X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I 7 m U c 0 q 1 4 u / u f 1 U w x v / U y o J E W u 2 P K j M J U E Y 5 L f T 0 Z C c 4 Z y Z g l l W t i s h E 2 o p g x t S x V b g r d 6 8 j r p X N U 9 t + 7 d X 9 c a z a K O M p z B O V y C B z f Q g C a 0 o A 0 M Y n i G V 3 h z 0 H l x 3 p 2 P 5 W j J K X Z O 4 Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " w O L Z B U A I 8 V 3 s 6 b y K z R K w u B 0 x I c A = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i Q i 6 L L g p s u K 9 g F t K J P p p B 0 6 m Y S Z G 6 G E f o Y b F 4 q 4 9 W v c + T d O 2 i y 0 9 c D A 4 Z x 7 m X N P k E h h 0 H W / n d L G 5 t b 2 T n m 3 s r d / c H h U P T 7 p m D j V j L d Z L G P d C 6 j h U i j e R o G S 9 x L N a R R I 3 g 2 m d 7 n f f e L a i F g 9 4 i z h f k T H S o S C U b R S f x B R n D A q s 4 f 5 s F p z 6 + 4 C Z J 1 4 B a l B g d a w + j U Y x S y N u E I m q T F 9 z 0 3 Q z 6 h G w S S f V w a p 4 Q l l U z r m f U s V j b j x s 0 X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I 7 m U c 0 q 1 4 u / u f 1 U w x v / U y o J E W u 2 P K j M J U E Y 5 L f T 0 Z C c 4 Z y Z g l l W t i s h E 2 o p g x t S x V b g r d 6 8 j r p X N U 9 t + 7 d X 9 c a z a K O M p z B O V y C B z f Q g C a 0 o A 0 M Y n i G V 3 h z 0 H l x 3 p 2 P 5 W j J K X Z O 4 Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " w O L Z B U A I 8 V 3 s 6 b y K z R K w u B 0 x I c A = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i Q i 6 L L g p s u K 9 g F t K J P p p B 0 6 m Y S Z G 6 G E f o Y b F 4 q 4 9 W v c + T d O 2 i y 0 9 c D A 4 Z x 7 m X N P k E h h 0 H W / n d L G 5 t b 2 T n m 3 s r d / c H h U P T 7 p m D j V j L d Z L G P d C 6 j h U i j e R o G S 9 x L N a R R I 3 g 2 m d 7 n f f e L a i F g 9 4 i z h f k T H S o S C U b R S f x B R n D A q s 4 f 5 s F p z 6 + 4 C Z J 1 4 B a l B g d a w + j U Y x S y N u E I m q T F 9 z 0 3 Q z 6 h G w S S f V w a p 4 Q l l U z r m f U s V j b j x s 0 X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I 7 m U c 0 q 1 4 u / u f 1 U w x v / U y o J E W u 2 P K j M J U E Y 5 L f T 0 Z C c 4 Z y Z g l l W t i s h E 2 o p g x t S x V b g r d 6 8 j r p X N U 9 t + 7 d X 9 c a z a K O M p z B O V y C B z f Q g C a 0 o A 0 M Y n i G V 3 h z 0 H l x 3 p 2 P 5 W j J K X Z O 4 Q + c z x + N d p F v < / l a t e x i t > Source classifier (b) adding a self-supervised task Self-supervised classifier #2 T < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " H I 9 D L v k 6 V 7 o g J c f + 1 h b m c M 3 R v 9 0 = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u g k V w V R I R d F l w 0 2 W F v q A N Z T K d t E M n M 2 H m R i i h n + H G h S J u / R p 3 / o 2 T N g t t P T B w O O d e 5 t w T J o I b 9 L x v p 7 S 1 v b O 7 V 9 6 v H B w e H Z 9 U T 8 + 6 R q W a s g 5 V Q u l + S A w T X L I O c h S s n 2 h G 4 l C w X j h 7 y P 3 e E 9 O G K 9 n G e c K C m E w k j z g l a K X B M C Y 4 p U R k 7 c W o W v P q 3 h L u J v E L U o M C r V H 1 a z h W N I 2 Z R C q I M Q P f S z D I i E Z O B V t U h q l h C a E z M m E D S y W J m Q m y Z e S F e 2 W V s R s p b Z 9 E d 6 n + 3 s h I b M w 8 D u 1 k H t G s e 7 n 4 n z d I M b o P M i 6 T F J m k q 4 + i V L i o 3 P x + d 8 w 1 o y j m l h C q u c 3 q 0 i n R h K J t q W J L 8 N d P 3 i T d m 7 r v 1 f 3 H 2 1 q j W d R R h g u 4 h G v w 4 Q 4 a 0 I Q W d I C C g m d 4 h T c H n R f n 3 f l Y j Z a c Y u c c / s D 5 / A G O + 5 F w < / l a t e x i t > S < l a t e x i t s h a 1 _ b a s e 6 4 = " w O L Z B U A I 8 V 3 s 6 b y K z R K w u B 0 x I c A = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i Q i 6 L L g p s u K 9 g F t K J P p p B 0 6 m Y S Z G 6 G E f o Y b F 4 q 4 9 W v c + T d O 2 i y 0 9 c D A 4 Z x 7 m X N P k E h h 0 H W / n d L G 5 t b 2 T n m 3 s r d / c H h U P T 7 p m D j V j L d Z L G P d C 6 j h U i j e R o G S 9 x L N a R R I 3 g 2 m d 7 n f f e L a i F g 9 4 i z h f k T H S o S C U b R S f x B R n D A q s 4 f 5 s F p z 6 + 4 C Z J 1 4 B a l B g d a w + j U Y x S y N u E I m q T F 9 z 0 3 Q z 6 h G w S S f V w a p 4 Q l l U z r m f U s V j b j x s 0 X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I 7 m U c 0 q 1 4 u / u f 1 U w x v / U y o J E W u 2 P K j M J U E Y 5 L f T 0 Z C c 4 Z y Z g l l W t i s h E 2 o p g x t S x V b g r d 6 8 j r p X N U 9 t + 7 d X 9 c a z a K O M p z B O V y C B z f Q g C a 0 o A 0 M Y n i G V 3 h z 0 H l x 3 p 2 P 5 W j J K X Z O 4 Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " w O L Z B U A I 8 V 3 s 6 b y K z R K w u B 0 x I c A = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i Q i 6 L L g p s u K 9 g F t K J P p p B 0 6 m Y S Z G 6 G E f o Y b F 4 q 4 9 W v c + T d O 2 i y 0 9 c D A 4 Z x 7 m X N P k E h h 0 H W / n d L G 5 t b 2 T n m 3 s r d / c H h U P T 7 p m D j V j L d Z L G P d C 6 j h U i j e R o G S 9 x L N a R R I 3 g 2 m d 7 n f f e L a i F g 9 4 i z h f k T H S o S C U b R S f x B R n D A q s 4 f 5 s F p z 6 + 4 C Z J 1 4 B a l B g d a w + j U Y x S y N u E I m q T F 9 z 0 3 Q z 6 h G w S S f V w a p 4 Q l l U z r m f U s V j b j x s 0 X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I 7 m U c 0 q 1 4 u / u f 1 U w x v / U y o J E W u 2 P K j M J U E Y 5 L f T 0 Z C c 4 Z y Z g l l W t i s h E 2 o p g x t S x V b g r d 6 8 j r p X N U 9 t + 7 d X 9 c a z a K O M p z B O V y C B z f Q g C a 0 o A 0 M Y n i G V 3 h z 0 H l x 3 p 2 P 5 W j J K X Z O 4 Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " w O L Z B U A I 8 V 3 s 6 b y K z R K w u B 0 x I c A = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i Q i 6 L L g p s u K 9 g F t K J P p p B 0 6 m Y S Z G 6 G E f o Y b F 4 q 4 9 W v c + T d O 2 i y 0 9 c D A 4 Z x 7 m X N P k E h h 0 H W / n d L G 5 t b 2 T n m 3 s r d / c H h U P T 7 p m D j V j L d Z L G P d C 6 j h U i j e R o G S 9 x L N a R R I 3 g 2 m d 7 n f f e L a i F g 9 4 i z h f k T H S o S C U b R S f x B R n D A q s 4 f 5 s F p z 6 + 4 C Z J 1 4 B a l B g d a w + j U Y x S y N u E I m q T F 9 z 0 3 Q z 6 h G w S S f V w a p 4 Q l l U z r m f U s V j b j x s 0 X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I 7 m U c 0 q 1 4 u / u f 1 U w x v / U y o J E W u 2 P K j M J U E Y 5 L f T 0 Z C c 4 Z y Z g l l W t i s h E 2 o p g x t S x V b g r d 6 8 j r p X N U 9 t + 7 d X 9 c a z a K O M p z B O V y C B z f Q g C a 0 o A 0 M Y n i G V 3 h z 0 H l x 3 p 2 P 5 W j J K X Z O 4 Q + c z x + N d p F v < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " w O L Z B U A I 8 V 3 s 6 b y K z R K w u B 0 x I c A = " > A A A B 8 n i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i Q i 6 L L g p s u K 9 g F t K J P p p B 0 6 m Y S Z G 6 G E f o Y b F 4 q 4 9 W v c + T d O 2 i y 0 9 c D A 4 Z x 7 m X N P k E h h 0 H W / n d L G 5 t b 2 T n m 3 s r d / c H h U P T 7 p m D j V j L d Z L G P d C 6 j h U i j e R o G S 9 x L N a R R I 3 g 2 m d 7 n f f e L a i F g 9 4 i z h f k T H S o S C U b R S f x B R n D A q s 4 f 5 s F p z 6 + 4 C Z J 1 4 B a l B g d a w + j U Y x S y N u E I m q T F 9 z 0 3 Q z 6 h G w S S f V w a p 4 Q l l U z r m f U s V j b j x s 0 X k O b m w y o i E s b Z P I V m o v z c y G h k z i w I 7 m U c 0 q 1 4 u / u f 1 U w x v / U y o J E W u 2 P K j M J U E Y 5 L f T 0 Z C c 4 Z y Z g l l W t i s h E 2 o p g x t S x V b g r d 6 8 j r p X N U 9 t + 7 d X 9 c a z a K O M p z B O V y C B z f Q g C a 0 o A 0 M Y n i G V 3 h z 0 H l x 3 p 2 P 5 W j J K X Z O 4 Q + c z x + N d p F v < / l a t e x i t >

Source classifier:

Self-supervised classifier #1 (c) adding more tasks the data (see section 3). In fact, we can use multiple self-supervised tasks, each one aligning the two domains along a direction of variation relevant to that task. Jointly training all the self-supervised tasks on both domains together with the original task on the source domain produces well-aligned representations as shown in Figure 1 .

Like all of deep learning, we can only empirically verify that at least in our experiments, the model does not overfit by internally creating a different decision boundary for each domain along different dimensions, which would then yield bad results. Recent research suggests that stochastic gradient descent is indeed unlikely to find such overfitting solutions with a costly decision boundary of high complexity (implicit regularization), even though the models have enough capacity (Zhang et al., 2016a; Neyshabur et al., 2017b; Arora et al., 2018) .

The key contribution of our work is to draw a connection between unsupervised domain adaptation and self-supervised learning. While we do not propose any fundamentally new self-supervised tasks, we offer insights in section 3 on how to select the right ones for adaptation, and propose in section 4 a novel training algorithm on those tasks, using batches of samples from both domains. Additionally, we demonstrate that domain alignment could be achieved with a simple and stable algorithm, without the need for adversarial learning. In section 5, we report state-of-the-art results on several standard benchmarks.

2. RELATED WORK:

In this section we provide a brief overview of the two fields that our work would like to bridge.

2.1. UNSUPERVISED DOMAIN ADAPTATION:

Methods for unsupervised domain adaptation in computer vision can be divided into three broad classes. The dominant class, which our work belongs to, aims to induce alignment between the source and the target domains in some feature space. This has been done by optimizing for some measurement of distributional discrepancy. One popular measurement is the maximum mean discrepancy (MMD) -the distance between the mean of the two domains in some reproducing kernel Hilbert space, where the kernel is chosen to maximize the distance (Bousmalis et al., 2016; Long et al., 2015; 2017) . Another way to obtain a measurement of discrepancy is to train an adversarial discriminator that distinguishes between the two domains (Ganin & Lempitsky, 2014; Ganin et al., 2016; Tzeng et al., 2017) . However, both MMD and adversarial training are formulated as minimax optimization problems, which are widely known, both in theory and practice, to be very difficult (Fedus et al., 2017; Duchi et al., 2016; Liang, 2017; Jin et al., 2019) . Since the optimization landscape is much more complex than in standard supervised learning, training often does not converge or converges to a bad local minimum (Goodfellow, 2016; Nagarajan & Kolter, 2017; Li et al., 2017) , and requires carefully balancing the two sets of parameters (for minimization and maximization) so one does not dominate the other (Salimans et al., 2016; Neyshabur et al., 2017a) .

To make minimax optimization easier, researchers have proposed numerous modifications to the loss function, network design, and training procedure (Arjovsky et al., 2017; Gulrajani et al., 2017; Karras et al., 2017; Courty et al., 2017; Sun & Saenko, 2016; Shu et al., 2018; Sener et al., 2016) .

Over the years, these modifications have yielded practical improvements on many standard benchmarks, but have also made the state-of-the-art algorithms very complicated. Often practitioners are not sure which tricks are necessary for which applications, and implementing these tricks can be bug-prone and frustrating. To make matters worse, since there is no labeled target data available for a validation set, practitioners have no way to perform hyper-parameter tuning or early stopping.

The second class of methods directly transforms the source images to resemble the target images with generative models (Taigman et al., 2016; Hoffman et al., 2017; Bousmalis et al., 2017) . While similar to the first class in the philosophy of alignment, these methods operate on image pixels directly instead of an intermediate representation space, and therefore can benefit from an additional round of adaptation in some representation space. In subsection 5.2 we demonstrate that composing our method with a popular pixel-level method yields stronger performance than either alone.

The third class of methods uses a model trained on the labeled source data to estimate labels on the target data, then trains on some of those estimated pseudo-labels (e.g. the most confident ones), therefore bootstrapping through the unlabeled target data. Sometimes called self-ensembling (French et al., 2017) , this technique is borrowed from semi-supervised learning, where it is called co-training (Saito et al., 2017; Zou et al., 2018; Chen et al., 2018; 2011) . In contrast, our method uses joint training (of the main and self-supervised tasks), different from co-training in every aspect except the name.

2.2. SELF-SUPERVISED FEATURE LEARNING:

The emerging field of self-supervised learning uses the machinery of supervised learning on problems where external supervision is not available. The idea is to use data itself as supervision for auxiliary (also called "pretext") tasks that learn deep feature representations which will hopefully be informative for downstream "real" tasks. Many such auxiliary tasks have been proposed in the literature, including colorization (predicting the chrominance channels of an image given its luminance) (Zhang et al., 2016b; Larsson et al., 2017; Zhang et al., 2017) , image inpainting Pathak et al. (2016) , spatial context prediction (Doersch et al., 2015) , solving jigsaw puzzles (Noroozi & Favaro, 2016) , image rotation prediction (Gidaris et al., 2018) , predicting audio from video (Owens et al., 2016) , contrastive predictive coding (Oord et al., 2018) , etc. Researchers have also experimented with self-supervision on videos (Wang & Gupta, 2015; Wang et al., 2019) , and combining multiple self-supervised tasks together (Doersch & Zisserman, 2017) .

Typically, self-supervision is used as a pre-training step on unlabeled data (e.g. the ImageNet training set without labels) to initialize a deep learning model, followed by fine-tuning on a labeled training set (e.g. PASCAL VOC) and evaluating on the corresponding test set. Instead, in this paper, we train the self-supervised tasks together with the main supervised task, encouraging a consistent representation that both aligns the two domains and does well on the main task1 .

Recently, self-supervision has also been used for other problem settings, such as improving robustness (Hendrycks et al., 2019) , domain generalization (Carlucci et al., 2019) and few-short learning (Su et al., 2019) . The most relevant paper to us is Ghifary et al. (2016) , which uses self-supervision for unsupervised domain adaptation, but not through alignment. Their algorithm trains a denoising autoencoder Vincent et al. (2008) only on the target data, together with the main classifier only on the labeled source data. They argue theoretically that this is better than training the autoencoder on both domains together. However, their theory is based on the critical assumption that the domains are already aligned, which is rarely true in practice. Consequently, their empirical results are much weaker than ours, as discussed in section 5. Please see Appendix A for more detailed comparisons with these works.

3. DESIGNING SELF-SUPERVISED TASKS FOR ADAPTATION:

Task Images and self-supervised labels

Rotation 0°90°180°270°L ocation (0, 0) (1, 0) (0, 1) (1, 1)

Table 1 : Transformations and labels on a sample input image created by two of the self-supervised tasks used in our work.

The design of auxiliary self-supervised tasks is an exciting area of research in itself, with many successful examples listed in section 2. However, not all of them are suitable for unsupervised domain adaptation. In order to induce alignment between the source and target, the labels created by selfsupervision should not require capturing information on the very factors where the domains are meaninglessly different, i.e. the factors of variation that we are trying to eliminate through adaptation.

A particularly unsuitable tasks are these that try to predict pixels of the original image, as image inpainting (Pathak et al., 2016) , colorization (Zhang et al., 2016b; Larsson et al., 2017; Zhang et al., 2017) or denoising autoencoder (Vincent et al., 2008) . The success of pixel-wise reconstruction depends strongly on brightness information, or other factors of variation in overall appearance (e.g. sunny vs. coudy) that are typically irrelevant to high-level visual concepts. Thus, instead of inducing alignment, learning a pixel reconstruction task would instead serve to further separate the domains. We have experimented with using the colorization task and the denoising autoencoder for our training algorithm, and found their performance little better than the source only baseline, sometimes even worse!2 

In general, classification tasks that predict structural labels seems better suited for our purpose than reconstruction tasks that predict pixels. Therefore, we have settled on three classification-based self-supervised tasks that combine simplicity with high performance:

Rotation Prediction: (Gidaris et al., 2018) An input image is rotated in 90-degree increments i.e. 0°, 90°, 180°, and 270°; the task is to predict the angle of rotation as a four-way classification problem.

Flip Prediction: An input image is randomly flipped vertically; the task is to predict whether the image is flipped or not3 .

Patch Location Prediction: Patches are randomly cropped out of an input image; the task is to predict where the patches come from4 . Consider a trivial illustrative example where the source and target are exactly the same except that the target pixels are all scaled down by a constant factor (e.g. daylight to dusk transition). All three of the aforementioned forms of self-supervision are suitable for this example, because pixel scaling i.e. brightness is "orthogonal" to the prediction of rotation, flip and location.

4. METHOD:

Our training algorithm is simple once a set of K self-supervised tasks are selected. We already have the loss function on the main prediction task, denoted L 0 , that we do not have target labels for. Each self-supervised task corresponds to a loss function L k for k = 1...K. So altogether, our optimization problem is set up as a combination of these K + 1 loss functions, as is done for standard multi-task learning (see Figure 2 ). Implementation details are included in Appendix B.

Each loss function corresponds to a different "head" h k for k = 0...K, which produces predictions in the respective label space. All the task-specific heads (including h 0 for the actual prediction task) share a common feature extractor φ. Altogether, the parameters of φ and h k , k = 0, ..k are the learned variables i.e. the free parameters of our optimization problem.

In our paper, φ is a deep convolutional neural network, and every h k is simply a linear layer i.e. multiplication by a matrix of size output space dimension × feature space dimension. If kth task is classification in nature, then h k also has a softmax or sigmoid (for multi-class or binary) following the linear layer. The output space dimension is only four for rotation and location classification, and two for flip and location regression. Depending on the network architecture used, the feature space dimension ranges between 64 and 512. The point is to make every h k low capacity, so the heads are forced to share high-level features, as is desirable for inducing alignment. A linear map from the highest-level features to the output is the smallest possible head and performs well empirically.

Let S = {(x i , y i ), i = 1...m} contain the labeled source data, and T = {(x i ), i = 1...n} contain the unlabeled target data. L 0 for the main prediction task takes in the labeled source data, and produces the following term in our objective:

L 0 (S; φ, h 0 ) = (x,y)∈S L 0 (h 0 (φ(x)), y).

Each self-supervised task F k for k = 1...K modifies the input samples with some transformation f k and creates labels ỹ. Denote F k (S) = {(f k (x i ), ỹi ), i = 1...m} as the self-supervised samples generated from the source samples (with the original labels discarded), and

F k (T ) = {(f k (x i ), ỹi ), i = 1.

..n} from the target. Then the loss L k of each task k = 1...K produces the following term:

L k (S, T ; φ, h k ) = (f k (x),ỹ)∈F (S) L k (h k (φ(f k (x))), ỹ) + (f k (x),ỹ)∈F (T ) L k (h k (φ(f k (x))), ỹ). (1)

Note that L k (S, T ; φ, h k ) for k = 1...K, unlike L 0 (S; φ, h 0 ), take in both the source and target data; as we emphasize for many times throughout the paper, this is critical for inducing alignment. Altogether, our optimization problem can be formalized as in multi-task learning5 : min.

φ,h k ,k=1...K L 0 (S; φ, h 0 ) + K k=1 L k (S, T ; φ, h k ).

(2) Test error converges smoothly on the source and target domains for the main task as well as the self-supervised task. This kind of smooth convergence is often seen in supervised learning, but rarely in adversarial learning. The centroid distance (linear MMD) between the feature distributions of the two domains converges alongside, even though it is never explicitly optimized for.

At test-time, we discard the self-supervised heads and use h 0 (φ(x)).

4.1. A HEURISTIC FOR HYPER-PARAMETER TUNING AND EARLY STOPPING:

As previously mentioned, in the unsupervised domain adaptation setting, there is no target label available and therefore no target validation set, so typical strategies for hyper-parameter tuning and early stopping that require a validation set cannot be applied. This problem remains underappreciated; in fact, it is often unclear how previous works select their hyper-parameters or detemine when training is finished, both of which can be important factors that impact performance, especially for complex algorithms using adversarial learning. In this subsection we describe a simple heuristic6 , merely as rule-of-thumb to make things work instead of a technical innovation. Like almost all of deep learning, there is no statistical guarantee on this heuristic, but it is shown to be practically effective in our experiments (see Figure 3 ). We only hope that it serves as the first guess of a solution towards this underappreciated problem.

The main idea is that, because our method never explicitly optimizes for any measurement of distributional discrepancy, these measurements can instead be used for hyper-parameter tuning and early stopping. Since it would be counterproductive to introduce additional parameters in order to perform hyper-parameter tuning, we simply use the distance between the mean of the source and target samples in the learned representation space, as produced by φ. Formally, this can be expressed as

EQUATION

where S and T are unlabeled source and target validation sets7 .

Our heuristic combines D(S , T ; φ) and the main task error on the (labeled) source validation set. Denote v = (v 1 , ..., v T ) and w = (w 1 , ..., w T ) the measurement vectors of those two quantities respectively over T epochs. The final measurement vector is u = v/ min(v) + w/ min(w) i.e. a normalized sum of the two vectors; the epoch at which we perform early stopping is then simply arg min t∈{1...T } u t . Intuitively, this heuristic roughly corresponds to our goal of inducing alignment while preserving discriminability.

Source MNIST MNIST SVHN MNIST USPS CIFAR-10 STL-10 Target MNIST-M SVHN MNIST USPS MNIST STL-10 CIFAR-10 DANN (Ganin et al., 2016) 81.5 35.7 73.6 ----DRCN (Ghifary et al., 2016) -40.1 82.0 --66.4 58.7 DSN (Bousmalis et al., 2016) 83.2 -82.7 ----kNN-Ad (Sener et al., 2016) 86.7 40.3 78.8 ----PixelDA (Bousmalis et al., 2017) 98.2 ------ATT (Saito et al., 2017) 94 (Shu et al., 2018) 97.7 47.5 97.9 --80.0 73.5 DIRT-T (Shu et al., 2018) 98.9 54.5 99.4 ---75.3 VADA (IN) (Shu et al., 2018) 95 Table 2 : Test accuracy (%) on standard domain adaptation benchmarks. Our results are organized according to the self-supervised task(s) used: R for rotation, L for location, and F for flip. We achieve state-of-the-art accuracy on four out of the seven benchmarks.

5. EXPERIMENTS:



5.1. SEVEN BENCHMARKS FOR OBJECT RECOGNITION:

The seven benchmarks are based on the six datasets described in Appendix D, each with a predefined training set / test set split, and labels are available on both splits. Previous works (cited in Table 2 ) have created those seven benchmarks by picking pairs of datasets with the same label space, treating one as the source and the other as the target, and training on the training set of the source with labels revealed and of the target with labels hidden. Following the standard setup of the field, labels on the target test set should only be used for evaluation, not for hyper-parameter tuning or early stopping; therefore we apply the heuristic described in subsection 4.1.

For the two natural scene benchmarks, we use all three tasks described in section 3: rotation, location and flip prediction. For the five benchmarks on digits we do not use location because it yields trivial solutions that do not encourage the learning of semantic concepts. Given the image of a digit cropped into the four quadrants, location prediction can be trivially solved by looking at the four corners where a white stroke determines the category. Adding flip to the digits does not hurt performance, but does not improve significantly either, so we do not report those results separately.

As shown in Table 2 , despite the simplicity of our method, we achieve state-of-the-art accuracy on four out of the seven benchmarks. In addition, we show the source only results from our closest competitor (VADA and DIRT-T), and note that our source only results are in fact lower than theirs on those very benchmarks that we perform the best on; this indicates that our success is indeed due to effectiveness in adaptation instead of the base architecture.

Our method fails on the pair of benchmarks with SVHN, on which rotation yields trivial solutions.

Because SVHN digits are cropped from house numbers with multiple digits, majority of the images have parts of the adjacent digits on the side. The main task head needs to look at the center, but the rotation head learns to look at the periphery and cheat. This failure case shows that the success of our method is tied to how well the self-supervised task fits the application. Practioners should use their domain knowledge evaluate how well the task fits, instead of blithely apply it to everything.

Also seen in Table 2 is that our method excels at object recognition in natural scenes, especially with all three tasks together. For STL-10→CIFAR-10, our base model is considerably worse than that of VADA and DIRT-T, but still beats all the baselines. Adding location and flip gives an improvement of 8%, on top of the 8% already over source only. This is not surprising since those tasks were

We will make our code public once the paper is accepted. Table 3 : Test accuracy (%) on GTA5 → Cityscapes. Our method significantly improves over source only, and also over CyCADA when combined. This indicates that additional self-supervision using our training algorithm further aligns the domains.

originally developed for ImageNet pre-training i.e. object recognition in natural scenes -our method is very successful when the task fits the application well.

5.2. BENCHMARK FOR SEMANTIC SEGMENTATION:

To experiment with our method in more diverse applications, we also evaluate on a challenging simulation-to-real benchmark for semantic segmentation -GTA5 → Cityscapes. GTA5 (Richter et al., 2016) contains 24,966 video frames taken from the computer game, where dense segmentation labels are automatically given by the game engine. Cityscapes (Cordts et al., 2016) contains 5,000 video frames taken from real-world dash-cams. The main task is to classify every pixel in an image as one of the 19 classes shared across both datasets, and accuracy is measured by intersection over union (IoU). The best possible results are given as the oracle, when the labels on Cityscapes are available for training, so typical supervised learning methods are applicable.

Our results are shown in Table 3 , and implementation details in Appendix F. Our self-supervised tasks were designed for classification, where the label on an image depends on its global content, while in segmentation the labels tend to be highly local. Nevertheless, with very little modification, we see significant improvements over the source only baseline. In Appendix G we provide visualizations of the segmentation results, and make qualitative comparisons between those produced by the baseline and our method.

We also experiment with combining our method with another popular unsupervised domain adaptation method -CyCADA (Hoffman et al., 2017) , designed specifically for segmentation. Surprisingly, when operating on top of images produced by this already very strong baseline, our method further improves performance. This demonstrates that pixel-level adaptation methods might still benefit from an additional round of adaptation by inducing alignment through self-supervision. We emphasize that these results are obtained with a very simple instantiation of our method, as a start towards the development of self-supervised tasks more suitable for semantic segmentation.

6. DISCUSSION:

We hope that this work encourages future researchers in unsupervised domain adaptation to consider the study of self-supervision as an alternative to adversarial learning, and researchers in selfsupervision to consider designing tasks and evaluating them in our problem setting. Most selfsupervised tasks today were originally designed for pre-training and evaluated in terms of accuracy gains on a downstream recognition, localization or detection tasks. It will be interesting to see if new self-supervised tasks can arise from the motivation of adaptation, for which alignment is the key objective. Moreover, domain experts could perhaps incorporate their dataset specific knowledge into the design of a self-supervised task specifically for their application.

One additional advantage of our method, not considered in this paper, is that it might be particularly amenable to very small target sample size, when those other methods based on adversarial learning cannot accurately estimate the target distribution. We leave this topic for the future work.

APPENDIX:

A ADDITIONAL DISCUSSION ON SPECIFIC PAPERS RELATED TO OURS

In this section we discuss the four papers mentioned in section 2 that are related to ours, but different in training algorithm, philosophy or problem setting.

Deep Reconstruction-Classification Networks (Ghifary et al., 2016) . This method works in unsupervised domain adaptation, the same problem setting as ours. It learns a denoising autoencoder on the target, together with the main classifier on the source. However, they use only the target domain for reconstruction, claiming both empirically and theoretically that it is better than using both domains together. In contrast, we use both the source and target for self-supervision. These two algorithmic differences really reflect our fundamental difference in philosophy. They take the target data as analogous to the unlabeled (source) data in semi-supervised learning, so any form of self-supervision suitable for semi-supervised learning is good enough; their theoretical analysis is also directly borrowed from that of semi-supervised learning, which concludes that it is necessary and sufficient to only use the target data for self-supervision. We take data from both domains for self-supervision in order to align their feature distributions; also, both conceptually and empirically, we cannot use reconstruction tasks because they are unsuitable for inducing alignment (see section 3).

Empirical experiments further support our arguments in three ways: 1) If we were to only use the target for our self-supervision tasks, we would perform barely better than the source only baseline, even on MNIST→MNIST-M, the easiest benchmark where we would otherwise observe a huge improvement. 2) If we were to use the reconstruction task i.e. a denoising autoencoder, we would again perform barely better than the source only baseline, and sometimes even worse, as described in section 3. 3) As shown in Table 2 , our results are much better than theirs on all of the benchmarks by a large margin. This shows that implementing the philosophy of alignment, developed for unsupervised domain adaptation, is much superior in our problem setting to blithely borrowing from semi-supervised learning.

In addition to the three classes of methods covered in section 2, unsupervised domain adaptation has also been studied using sample-to-sample correspondence through graph matching (Das & George Lee, 2018; Das & Lee, 2018) ; these methods are less relevant to ours and not discussed in detail.

Using Self-Supervised Learning Can Improve Model Robustness and Uncertainty (Hendrycks et al., 2019) . This paper studies the setting of robustness, where there is no sample provided, even unlabeled, from the target domain. Their method jointly trains for the main task and the self-supervised task only on the source domain, really because there is no target data of any kind. Because their problem setting is very challenging (with so little information provided on the target), their primary evaluation is on a dataset of CIFAR-10 images with the addition of 15 types of common corruptions (e.g. impulse noise, JPEG compression, snow weather, motion blur and pixelation), simulated by an algorithm. No idea on unsupervised domain adaptation is mentioned.

Domain Generalization by Solving Jigsaw Puzzles (Carlucci et al., 2019) . This paper studies two setting. The first is the robustness setting, exactly the same as in Hendrycks et al. (2019) , except that evaluation is done on MNIST→MNIST-M and MNIST→SVHN. Their baseline is also a method from the robustness community that trains on adversarial examples and uses no target data. Again, because their problem setting is very challenging, the accuracy is low for both their proposed method and the baseline. The second setting is called domain generalization, which is very similar to meta-learning. The goal is to perform well simultaenously on multiple distributions, all labeled. Evaluation is done using the mean accuracy on all the domains. Beside the name, there is little similarity between the setting of unsupervised domain adaptation and domain generalization, which has no unsupervised component.

Boosting Supervision with Self-Supervision for Few-shot Learning (Su et al., 2019) . As evident from the title, this paper studies the setting of few-shot learning, where the goal is to perform well on a very small dataset. Again, there is no unsupervised component and little connection to our setting.

Most of our results have already been produced when Carlucci et al. (2019) and Su et al. (2019) were presented at a conference. Hendrycks et al. (2019) was submitted to NeurIPS 2019 and should be considered concurrent work.

B ADDITIONAL ALGORITHMIC DETAILS:

In practice and for our experiments, the source and target datasets are often imbalanced in size. If we were to blithely solve for the objective in Equation 2, the domain with a larger dataset would carry more weight for every L k (S, T ; φ, h k ), k = 1...K because we are summing over all samples in both datasets. We would like to keep the two sums inside L k roughly balanced such that in terms of features produced by φ, neither of the two domains would dominate the other. This is easy to achieve in our implementation through balanced batches. When we need to sample a batch for task k, we simply sample half the batch from the source, and another half from the target, then put them together. In the end, our implementation requires little change on top of an existing supervised learning codebase. Each self-supervised task is defined as a module, and adding a new one only amounts to defining the structural modifications and the loss function.

We optimize the objective in Equation 2 with stochastic gradient descent (SGD). One can simply take a joint step on Equation 2, which covers all the losses for k = 0 and k = 1...K. However, the implementation would then have to store the gradients with respect to all K + 1 losses together.

For memory efficiency, our implementation loops over k = 1...K; for each self-supervised task k, it samples a batch of combined source and target data (without their original labels), structurally modifies the images by f k , creates new labels according to the modification, and obtains a loss for h k and φ on this batch. So a gradient step is taken for each k = 1...K, before finally a batch of original source images and labels are sampled for a gradient step on h 0 and φ. In terms of test accuracy, these two implementations make little difference (usually less than 1%), and the choice simply comes down to a time-memory trade-off.

Because our source only baseline on STL-10 → CIFAR-10 is considerably worse than the closest competitor DIRT-T, we borrow from their implementation and use dropout regularization (Srivastava et al., 2014) with p = 0.5, only on this benchmark. This makes our source only baseline closer to theirs, so to allow for a fair comparison of the adaptation methods. Without this modification, our accuracy for source only, R, and R+L+F are respectively 56.1, 65.6 and 74.0%.

C ADDITIONAL DISCUSSION ON THE MEAN DISTANCE:

In this section we answer some potential questions about our selection rule, which uses the mean distance, from the perspective of a possibly confused reader.

Q: The motivation of the paper is that methods based on minimax optimization, such as those using kernel-MMD, are difficult to optimize. Since you are using the mean distance (MMD under the linear kernel) for hyper-parameter tuning and early stopping, which is a form of model selection, how are you different from those other methods and why is optimization easy for you?

A: Our method is fundamentally different from those other methods based on MMD, and therefore more amenable to optimization in the following two ways: 1) Even though we use the mean distance, which is a form of MMD, we never pose a minimax optimization problem. The model parameters minimize the loss functions of the tasks, which we hope makes the mean distance small (see Figure 3 ). Model selection using subsection 4.1 also minimizes the mean distance. In our method, all the loss functions, for model parameters and hyper-parameters, work towards the same goal of inducing alignment, so optimization is easier. 2) Even though hyper-parameter tuning and early stopping are a forms of model selection just like training, there is a qualitative difference in the degrees of freedom involved. For subsection 4.1, when performing early stopping for example, optimization amounts to a grid search over the epochs after training is finished, and there is only one degree of freedom.

Q: Why is the mean distance suitable for model selection when it comes to hyper-parameter tuning and early stopping, but not regular training?

A: Again, we agree that hyper-parameter tuning and early stopping are a forms of model selection. However, unlike model parameters ranging in the hundred of thousands, there are at most a few hyper-parameters and only one parameter for early stopping. Model parameters can easily overfit to the mean distance while those few degrees of freedom we use cannot. This is precisely also the reason why previous works using MMD resort to minimax optimization.

Image Ground truth label Baseline prediction Our prediction:

Table 4 : Qualitative comparison of segmentation results using our method, the baseline, and the ground truth label.

G QUALITATIVE COMPARISON ON GTA5 → CITYSCAPES

We thank the anonymous Reviewer 3 for suggeting us to add these visualizations. This section shows segmentation results produced before and after adaptation(as shown in Table 4 ), alongside the original input image and the ground truth label.

Qualitatively, from visual inspection of these images, we can see that the quality of produced segmentations improves drastically after adaptation with our method. In particular, we note that location prediction as a self-supervised task helps to prevent nonsensical label configurations, which are often produced by the baseline. For example, the baseline model sometimes predicts "building" or "terrain" for pixels directly in front of a car. These errors are largely corrected for by our proposed adaptation method, leading to more accurate "road" predictions.

:

Note that it is possible to apply the standard pre-training followed by fine-tuning regime to unsupervised domain adaptation, doing self-supervised pre-training on the target domain (or both the source and the target) and then fine-tuning on the source. However, this gives almost no benefit over no-adaptation baseline, and is far from being competitive.

It is interesting to note that works borrowing from semi-supervised learning, e.g.Ghifary et al. (2016), use denoising autoencoder for their training algorithm and obtain performance better than source only (but still not competitive with ours). As explained in Appendix A, this difference is due to the difference in training algorithms -we use self-supervision on both domains while they only use on the target. This further reflects the difference in philosophy, as we use target data for alignment whereas they use it simply as extra data as in semi-supervised learning.

We do not use horizontal flips, which is a common data augmentation technique, since it is typically desirable for natural scene features to be invariant to horizontal flips.

For large images (e.g. segmentation), the crop comes from a continuous set of coordinates, and the task is a regression problem in two dimensions, trained with the square loss. For small images (e.g. object recognition), the crop comes from one of the four quadrants, and the task is a four-way classification problem; this distinction exists only for ease of implementation.

We have experimented with trade-off hyper-parameters λi, i = 1...K for the loss terms inside the sum and found them unnecessary. Since a labeled target validation set might not be available, it can be beneficial to reduce the number of hyper-parameters.

Appendix C contains some additional explanation of why this heuristic cannot be used for regular training. The short answer is given by the famous Goodhardt's law in economics and dynamical systems: "When a measurement becomes an objective, it ceases to be a good measurement."

D above is also known as the discrepancy under the linear kernel from the perspective of kernel MMD. Appendix C contains some additional explanation of why the mean distance is suitable for our heuristic, even though it is a specific form of MMD, which we claim to be difficult to optimize. The short answer is that it does not require minimax optimization.

Figures and Tables:

Figure1: We propose a method for unsupervised domain adaptation that uses self-supervision to align the learned representations of two domains in a shared feature space. Here we visualize how these representations might be aligned in the feature space. a) Without our method, the source domain is far away from the target domain, and a source classifier cannot generalize to the target. b) Training a shared representation to support one self-supervised task on both domains can align the source and target along one direction. c) Using multiple self-supervised tasks can further align the domains along multiple directions. Now the source and target are close in this shared feature space, and the source classifier can hope to generalize to the target.

Figure2: Our method jointly trains a supervised head on labeled source data and self-supervised heads on unbaled data from both domains. The heads use high-level features from a shared encoder, which learns to align the feature distributions.

Figure3: Results on MNIST→MNIST-M (left) and CIFAR-10→STL-10 (right). Test error converges smoothly on the source and target domains for the main task as well as the self-supervised task. This kind of smooth convergence is often seen in supervised learning, but rarely in adversarial learning. The centroid distance (linear MMD) between the feature distributions of the two domains converges alongside, even though it is never explicitly optimized for.

Peer review (iclr2020):
This paper presents a novel unsupervised domain adaptation framework for neural networks. Similarly to existing approaches, it performs adaptation by aligning representations of the source and the target domains. The main difference is that this alignment is achieved not through explicitly minimizing some distribution discrepancy (this usually leads to challenging minimax optimization problems). Instead, the authors propose to use a battery of auxiliary self-supervised learning (SSL) tasks for both domains simultaneously. Each task is meant to align the source and the target representations along a direction of variation relevant to that task. Assuming that the battery is diverse enough, optimizing the representation for all the tasks leads to matching of the distributions. Pros: + The paper is well-written and easy to read. + I like the simplicity of the idea and the fact that it achieves competitive performance without any adversarial learning (which may be very tricky to deal with). + The paper presents a reasonable procedure for hyper-parameter tuning and early stopping which seems to work well in practice. Cons: - The paper is purely practical with no theory backing the approach. As a result, the discussion of guarantees and limitations is quite brief. - It’s unclear how easy it is to come up with a reasonable set of SSL tasks for a particular pair of domains. It seems that it may become a serious problem when the method is applied to something other than benchmarks. Table 2 reveals that there is no consistent improvement over the existing approaches which suggests that the chosen battery of SSL tasks is not universal (as the authors themselves admit). On a related note, it’s a bit disappointing that the authors mention SVHN results as a failure case but never provide a way to address the issue. - It would be nice to some results for the Office dataset for completeness. The authors could use a pre-trained network as a starting points just like it’s done in other papers. According to the last paragraph of Section 6 this experiment should be feasible. Notes/questions: * Table 2, last column: The performance of DIRT-T seems to be better than that of the proposed method and yet the latter is highlighted and not the former. Overall, I think it’s a good paper presenting a thought-provoking idea. In my opinion, the weakest point of the work is the lack of any (neither principled nor practical) guidance as to how to choose the set of self-supervised tasks. Despite this I feel that this submission should be accepted but at the same time I’m curious to see what the authors have to say regarding the concerns I raised in my review.