Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Adversarial Sub-sequence for Text Generation (1905.12835v1)

Published 30 May 2019 in cs.LG, cs.AI, and stat.ML

Abstract: Generative adversarial nets (GAN) has been successfully introduced for generating text to alleviate the exposure bias. However, discriminators in these models only evaluate the entire sequence, which causes feedback sparsity and mode collapse. To tackle these problems, we propose a novel mechanism. It first segments the entire sequence into several sub-sequences. Then these sub-sequences, together with the entire sequence, are evaluated individually by the discriminator. At last these feedback signals are all used to guide the learning of GAN. This mechanism learns the generation of both the entire sequence and the sub-sequences simultaneously. Learning to generate sub-sequences is easy and is helpful in generating an entire sequence. It is easy to improve the existing GAN-based models with this mechanism. We rebuild three previous well-designed models with our mechanism, and the experimental results on benchmark data show these models are improved significantly, the best one outperforms the state-of-the-art model.\footnote[1]{All code and data are available at https://github.com/liyzcj/seggan.git

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Xingyuan Chen (17 papers)
  2. Yanzhe Li (5 papers)
  3. Peng Jin (91 papers)
  4. Jiuhua Zhang (1 paper)
  5. Xinyu Dai (116 papers)
  6. Jiajun Chen (125 papers)
  7. Gang Song (4 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.