Generalization Bounds for Unsupervised Cross-Domain Mapping with WGANs

07/23/2018 ∙ by Tomer Galanti, et al. ∙ 0

The recent empirical success of cross-domain mapping algorithms, between two domains that share common characteristics, is not well-supported by theoretical justifications. This lacuna is especially troubling, given the clear ambiguity in such mappings. We work with the adversarial training method called the Wasserstein GAN. We derive a novel generalization bound, which limits the risk between the learned mapping h and the target mapping y, by a sum of two terms: (i) the risk between h and the most distant alternative mapping that has a small Wasserstein GAN divergence, and (ii) the Wasserstein GAN divergence between the target domain and the domain obtained by applying h on the samples of the source domain. The bound is directly related to Occam's razor and it encourages the selection of the minimal architecture that supports a small Wasserstein GAN divergence. From the bound, we derive algorithms for hyperparameter selection and early stopping in cross-domain mapping GANs. We also demonstrate a novel capability of estimating confidence in the mapping of every specific sample. Lastly, we show how non-minimal architectures can be effectively trained by an inverted knowledge distillation in which a minimal architecture is used to train a larger one, leading to higher quality outputs.



There are no comments yet.


page 32

page 33

page 34

page 35

page 36

page 37

page 38

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.