Maximum-Likelihood Augmented Discrete Generative Adversarial Networks
Tong Che Affiliation: Montreal Institute for Learning Algorithms, Université de Montréal, Montréal, QC H3T 1J4, Canada Correspondence to: Yanran Li Affiliation: Department of Computing, The Hong Kong Polytechnic University, Hong Kong Ruixiang Zhang Affiliation: The Hong Kong University of Science and Technology R Devon Hjelm Affiliation: Montreal Institute for Learning Algorithms, Université de Montréal, Montréal, QC H3T 1J4, Canada Affiliation: IVADO Wenjie Li Affiliation: Department of Computing, The Hong Kong Polytechnic University, Hong Kong Yangqiu Song Affiliation: The Hong Kong University of Science and Technology Yoshua Bengio Affiliation: Montreal Institute for Learning Algorithms, Université de Montréal, Montréal, QC H3T 1J4, Canada
Abstract
Despite the successes in capturing continuous distributions, the application of generative adversarial networks (GANs) to discrete settings, like natural language tasks, is rather restricted. The fundamental reason is the difficulty of back-propagation through discrete random variables combined with the inherent instability of the GAN training objective. To address these problems, we propose Maximum-Likelihood Augmented Discrete Generative Adversarial Networks. Instead of directly optimizing the GAN objective, we derive a novel and low-variance objective using the discriminator’s output that follows corresponds to the log-likelihood. Compared with the original, the new objective is proved to be consistent in theory and beneficial in practice. The experimental results on various discrete datasets demonstrate the effectiveness of the proposed approach.
原文 arXiv:1702.07983;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1702.07983v1