Task Specific Adversarial Cost Function
arXiv:1609.08661
Abstract
The cost function used to train a generative model should fit the purpose of the model. If the model is intended for tasks such as generating perceptually correct samples, it is beneficial to maximise the likelihood of a sample drawn from the model, Q, coming from the same distribution as the training data, P. This is equivalent to minimising the Kullback-Leibler (KL) distance, KL[Q||P]. However, if the model is intended for tasks such as retrieval or classification it is beneficial to maximise the likelihood that a sample drawn from the training data is captured by the model, equivalent to minimising KL[P||Q]. The cost function used in adversarial training optimises the Jensen-Shannon entropy which can be seen as an even interpolation between KL[Q||P] and KL[P||Q]. Here, we propose an alternative adversarial cost function which allows easy tuning of the model for either task. Our task specific cost function is evaluated on a dataset of hand-written characters in the following tasks: Generation, retrieval and one-shot learning.
Submitted to TPAMI
References in corpus (10)
- Auto-Encoding Variational Bayes
- Conditional Generative Adversarial Nets
- Pixel Recurrent Neural Networks
- Energy-based Generative Adversarial Network
- Adversarial Feature Learning
- Adversarially Learned Inference
- Adversarial Autoencoders
- One-shot Learning with Memory-Augmented Neural Networks
- Domain-Adversarial Neural Networks
- How (not) to Train your Generative Model: Scheduled Sampling, Likelihood, Adversary?
Cited by in corpus (5)
- Image De-raining Using a Conditional Generative Adversarial Network
- Learning in Implicit Generative Models
- TWIST-GAN: Towards Wavelet Transform and Transferred GAN for Spatio-Temporal Single Image Super Resolution
- Inverting The Generator Of A Generative Adversarial Network (II)
- Synthesis of High-Quality Visible Faces from Polarimetric Thermal Faces using Generative Adversarial Networks