Improving Conditional Sequence Generative Adversarial Networks By Stepwise Evaluation | Awesome LLM Papers Contribute to Awesome LLM Papers

Awesome LLM Papers

A curated collection of research papers on Large Language Models (LLMs), transformers, prompting, fine-tuning, and multi-modal systems. Maintained by Sean Moran.

Contact Sean Moran about this survey or website. Made with Jekyll and Hyde.

Improving Conditional Sequence Generative Adversarial Networks By Stepwise Evaluation

Yi-Lin Tuan, Hung-Yi Lee . IEEE/ACM Transactions on Audio, Speech, and Language Processing 2019 – 55 citations

[Paper]   Search on Google Scholar   Search on Semantic Scholar
Evaluation Reinforcement Learning Security Training Techniques

Sequence generative adversarial networks (SeqGAN) have been used to improve conditional sequence generation tasks, for example, chit-chat dialogue generation. To stabilize the training of SeqGAN, Monte Carlo tree search (MCTS) or reward at every generation step (REGS) is used to evaluate the goodness of a generated subsequence. MCTS is computationally intensive, but the performance of REGS is worse than MCTS. In this paper, we propose stepwise GAN (StepGAN), in which the discriminator is modified to automatically assign scores quantifying the goodness of each subsequence at every generation step. StepGAN has significantly less computational costs than MCTS. We demonstrate that StepGAN outperforms previous GAN-based methods on both synthetic experiment and chit-chat dialogue generation.

Similar Work