Assisting the Adversary to Improve GAN Training. Munk, A., Harvey, W., & Wood, F. In 2021 International Joint Conference on Neural Networks (IJCNN), pages 1-8, July, 2021.
Assisting the Adversary to Improve GAN Training [link]Arxiv  Assisting the Adversary to Improve GAN Training [link]Paper  doi  abstract   bibtex   3 downloads  
Some of the most popular methods for improving the stability and performance of GANs involve constraining or regularizing the discriminator. In this paper we consider a largely overlooked regularization technique which we refer to as the Adversary's Assistant (AdvAs). We motivate this using a different perspective to that of prior work. Specifically, we consider a common mismatch between theoretical analysis and practice: analysis often assumes that the discriminator reaches its optimum on each iteration. In practice, this is essentially never true, often leading to poor gradient estimates for the generator. To address this, AdvAs is a penalty imposed on the generator based on the norm of the gradients used to train the discriminator. This encourages the generator to move towards points where the discriminator is optimal. We demonstrate the effect of applying AdvAs to several GAN objectives, datasets and network architectures. The results indicate a reduction in the mismatch between theory and practice and that AdvAs can lead to improvement of GAN training, as measured by FID scores.
@InProceedings{9533449,  
	author={Munk, Andreas and Harvey, William and Wood, Frank},  
	booktitle={2021 International Joint Conference on Neural Networks (IJCNN)},   
	title={Assisting the Adversary to Improve GAN Training},   
	year={2021},
	pages={1-8},  
	abstract={Some of the most popular methods for improving the stability and performance of GANs involve constraining or regularizing the discriminator. In this paper we consider a largely overlooked regularization technique which we refer to as the Adversary's Assistant (AdvAs). We motivate this using a different perspective to that of prior work. Specifically, we consider a common mismatch between theoretical analysis and practice: analysis often assumes that the discriminator reaches its optimum on each iteration. In practice, this is essentially never true, often leading to poor gradient estimates for the generator. To address this, AdvAs is a penalty imposed on the generator based on the norm of the gradients used to train the discriminator. This encourages the generator to move towards points where the discriminator is optimal. We demonstrate the effect of applying AdvAs to several GAN objectives, datasets and network architectures. The results indicate a reduction in the mismatch between theory and practice and that AdvAs can lead to improvement of GAN training, as measured by FID scores.},  
	doi={10.1109/IJCNN52387.2021.9533449},  
	ISSN={2161-4407},  
	month={July},
	url_ArXiv = {https://arxiv.org/abs/2010.01274},
	url_Paper = {https://ieeexplore.ieee.org/document/9533449},
	support = {D3M,ETALUMIS}
}

Downloads: 3