Unsupervised Distribution Matching: Given all word embeddings X and Y, the unsupervised loss L W |D aims to match the distribution of both embedding spaces.
for our formulation, we use an adversarial distribution matching objective, similar to the work of Lample et al.