In UDA, the adaptation task does not vary between the source and target domains.
we can use S L to learn a projection for the source domain S prj where the separation between an instance x ∈ S L and its opposite-labelled nearest neighbours is maximised.