.png){kind=icon}
.png){kind=icon}
Return
Adversarial subsequences for unconditional text generation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.csl.2021.101242.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Generative Adversarial Nets (GAN) has been successfully introduced to unconditional generating text to alleviate exposure bias. However, the discriminator in this model only evaluates the entire sequence, which causes feedback sparsity and mode collapse. To tackle these problems, we propose a novel mechanism. The mechanism first segments the entire sequence into several subsequences. Then, these subsequences, together with the entire sequence, are evaluated individually by the discriminator. Finally, these feedback signals are all used to guide the learning of GAN. This mechanism learns the generation of both the entire sequence and the subsequences simultaneously. Learning to generate subsequences is easy and is helpful in generating an entire sequence. It is easy to improve the existing GAN-based models with this mechanism. Although Li et al. (2017) segments the generated responses in a conditional text generation task, i.e., a dialogue system, they conclude it is weaker than the Monte Carlo search. However, for unconditional text generation, we observe that adversarial learning on subsequences works well. We rebuild three previous models with our mechanism, and the experimental results on two benchmark datasets show these models are improved greatly and outperform the state-of-the-art model. (c) 2021 Elsevier Ltd. All rights reserved.
Keywords:
Unconditional text generation
GAN
Subsequences
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.4
Papers:
1.5K
Citations:
2.6K