arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1611.04076cs.CV

Least Squares Generative Adversarial Networks

City University of Hong Kong(香港城市大学);The Education University of Hong Kong(香港教育大学);Northwestern Polytechnical University(西北工业大学);CodeHatch Corp.(CodeHatch公司)

Xudong Mao, Qing Li, Haoran Xie, Raymond Y. K. Lau, Zhen Wang, Stephen Paul Smolley

英文摘要:

Unsupervised learning with generative adversarial networks (GANs) has proven hugely successful. Regular GANs hypothesize the discriminator as a classifier with the sigmoid cross entropy loss function. However, we found that this loss function may lead to the vanishing gradients problem during the learning process. To overcome such a problem, we propose in this paper the Least Squares Generative Adversarial Networks (LSGANs) which adopt the least squares loss function for the discriminator. We show that minimizing the objective function of LSGAN yields minimizing the Pearson $χ^2$ divergence. There are two benefits of LSGANs over regular GANs. First, LSGANs are able to generate higher quality images than regular GANs. Second, LSGANs perform more stable during the learning process. We evaluate LSGANs on five scene datasets and the experimental results show that the images generated by LSGANs are of better quality than the ones generated by regular GANs. We also conduct two comparison experiments between LSGANs and regular GANs to illustrate the stability of LSGANs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑