While Cycle GAN got a lot of attention from all parts, their extension Cycala got relatively unnoticed even after being a very interesting read in itself. Domain Adaptation is the problem where we want to adapt a model trained on task to perform well for another related task as well. In this space most of the recent works have been feature space alignment models where some measure of discrepancy between the source and target features is minimized, this paper proposed a new model that reduces pixel level discrepancy while preserving the semantic meaning. Note that the classes must remain the same in both datasets so its essentially an adaptation over datasets than tasks. The model consists of multiple steps and losses as explained in the following points but the general idea is to transform the data from source dataset to target dataset and then train a model on this augmented data set. Then use this learned model for testing on samples from target dataset. This leads to significant improvement over a model that was trained on the source dataset only. Loss 1 GAN loss of . This means that a discriminator is trained along with the generator. The discriminator has to detect points from target dataset as real and ones transformed from source by generator as fake. Similarly a symmetric GAN loss for as well. Eq 2 Loss 2 The cycle GAN loss. This is same as the cycle loss used in the Cycle GAN paper [1]. It is essentially the reconstrution loss of a data point that is first transformed from source to target via and then back with . Again symmetric loss for a target data point. This is the reason is trained even though its not needed for the end goal. Eq 3 Loss 5 Finally there is a task loss that actually trains a model to for the given task. This model is trained on source images transformed with All these losses are then clubbed together to train the several involved models! [1] Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks (link])CyCADA: Cycle-Consistent Adversarial Domain Adaptation
Paper Details
Summary
Problem
How it is solved