Workshop: Subset Selection in Machine Learning: From Theory to Applications

Selective Focusing Learning in Conditional GANs

Suk-Ju Kang · Woo-jin Song · Kyunghun Kim · Kyeongbo Kong

Keywords: [ Gaussian Processes and Bayesian non-parametrics ]

[ Abstract ]
Sat 24 Jul 12:23 p.m. PDT — 12:27 p.m. PDT


Conditional generative adversarial networks (cGANs) have demonstrated remarkable success due to their class-wise controllability and superior quality for complex generation tasks. Typical cGANs solve the joint distribution matching problem by decomposing two easier sub-problems: marginal matching and conditional matching. From our toy experiments, we found that it is the best to apply only conditional matching to certain samples due to the content-aware optimization of the discriminator. This paper proposes a simple (a few lines of code) but effective training methodology, selective focusing learning, which enforces the discriminator and generator to learn easy samples of each class rapidly while maintaining diversity. Our key idea is to selectively apply conditional and joint matching for the data in each mini-batch. We conducted experiments on recent cGAN variants in ImageNet (64x64 and 128x128), CIFAR-10, and CIFAR-100 datasets, and improved the performance significantly (up to 35.18% in terms of FID) without sacrificing diversity.