Adversarial Imitation Learning with Controllable Rewards for Text Generation | SpringerLink
Skip to main content

Adversarial Imitation Learning with Controllable Rewards for Text Generation

  • Conference paper
  • First Online:
Machine Learning and Knowledge Discovery in Databases: Research Track (ECML PKDD 2023)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14169))

  • 1886 Accesses

Abstract

Supervised fine-tuning of large language models (LMs) does not always provide good text-generation performance in terms of quality and diversity. This is because such models maximize the likelihood of correct subsequent words based on previous contexts encountered in the training phase, instead of evaluating the entire structure of the generated texts. In this context, fine-tuning methods for LMs using adversarial imitation learning (AIL) have been proposed to improve the trade-off relationship between quality and diversity. This method leverages the evaluations of the discriminators without requiring manually designed metrics. Previously proposed AIL methods cannot control the shapes of the reward functions and constrain updates of LMs using fixed ranges, independent of the quality, e.g., proximal policy optimization. This study proposes a combination of an AIL method and an approximation of mixture distributions (AMDAIL), synergizing with LMs for text generation. AMDAIL exhibits two features: (1) controlling the distribution of the bounded reward values by varying the shape of the bounded reward function, and (2) a variable constraint to promote updates using the confidence of the discriminator as the quality of the texts. The proposed method exhibits stable behavior in the training phases and improves the trade-off relationship between the quality and diversity in the inference phases.

The source code is available at https://github.com/zabu-nishiki/amdail.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11210
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14013
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Kaplan, J., et al.: Scaling Laws for Neural Language Models (2020), arXiv:2001.08361

  2. I. Solaiman, M. Brundage, J. Clark, A. Askell, A. Herbert-Voss, J. Wu, A. Radford, G. Krueger, J. W. Kim, S. Kreps, M. McCain, A. Newhouse, J. Blazakis, K. McGuffie, and J. Wang, "Release Strategies and the Social Impacts of Language Models," 2019, arXiv:1908.09203

  3. Brown, T.B., et al.: Language Models are Few-Shot Learners (2020), arXiv:2005.14165

  4. Holtzman, A., Buys, J., Du, L., Forbes, M., Choi, Y.: The curious case of neural text degeneration. Presented at the International Conference on Learning Representations (2020)

    Google Scholar 

  5. Welleck, S., Kulikov, I., Roller, S., Dinan, E., Cho, K., Weston, J.: Neural Text Generation With Unlikelihood Training. Presented at the International Conference on Learning Representations (2020)

    Google Scholar 

  6. Ouyang, L.: Training language models to follow instructions with human feedback. In: Advances in Neural Information Processing Systems (2022)

    Google Scholar 

  7. Stiennon, N., et al.: Learning to summarize with human feedback. In Advances in Neural Information Processing Systems 33, pp. 3008–3021 (2020)

    Google Scholar 

  8. Torabi, F., Warnell, G., Stone, P.: Recent Advances in Imitation Learning from Observation In: Proceedings of 28th International Joint Conference on Artificial Intelligence, pp. 6325–6331 (2019)

    Google Scholar 

  9. Zhou, W., Ge, T., Xu, K., Wei, F., Zhou, M.: Self-Adversarial Learning with Comparative Discrimination for Text Generation. In: International Conference on Learning Representations (2020)

    Google Scholar 

  10. Wu, Q., Li, L., Yu, Z.: TextGAIL: generative adversarial imitation learning for text generation. In: Proceedings of AAAI Conference on Artificial Intelligence, vol. 35(16), pp. 14067–14075 (2021)

    Google Scholar 

  11. Lamprier, S., et al.: Generative cooperative networks for natural language generation. In: Proceedings of 39th International Conference on Machine Learning, vol. 162, pp. 11891–11905. PMLR (2022)

    Google Scholar 

  12. Goodfellow, I., et al.: Generative adversarial nets. In: Advances in Neural Information Processing Systems, vol. 27 (2014)

    Google Scholar 

  13. Lin, K., Li, D., He, X., Zhang, Z., Sun, M.: Adversarial Ranking for Language Generation. In Advances in Neural Information Processing Systems, vol. 30 (2017)

    Google Scholar 

  14. Guo, J., Lu, S., Cai, H., Zhang, W., Yu, Y., Wang, J.: Long text generation via adversarial training with leaked information. In: Proceedings of AAAI Conference on Artificial Intelligence, vol. 32(1) (2018)

    Google Scholar 

  15. Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal Policy Optimization Algorithms, arXiv:1707.06347 (2017)

  16. Ho, J., Ermon, S.: Generative Adversarial Imitation Learning. In: Advances in Neural Information Processing Systems, vol. 29 (2016)

    Google Scholar 

  17. Kloek, T., van Dijk, H.K.: Bayesian estimates of equation system parameters: an application of integration by Monte Carlo. Econometrica 46(1), 1–19 (1978)

    Article  MATH  Google Scholar 

  18. Fu, J., Luo, K., Levine, S.: Learning robust rewards with adverserial inverse reinforcement learning. In: International Conference on Learning Representations (2018)

    Google Scholar 

  19. Ghasemipour, S.K.S., Zemel, R.S., Gu, S.: A divergence minimization perspective on imitation learning methods, In: 3rd Annual Conference on Robot Learning, Proceedings of Machine Learning Research, vol. 100, pp. 1259–1277. PMLR (2019)

    Google Scholar 

  20. Zhao, M., Cong, Y., Dai, S., Carin, L.: Bridging maximum likelihood and adversarial learning via \(\alpha \)-divergence. In: Proceedings of AAAI Conference on Artificial Intelligence, vol. 34(04), pp. 6901–6908 (2020)

    Google Scholar 

  21. Kirkpatrick, J., et al.: Overcoming catastrophic forgetting in neural networks. Proc. Nat. Academy Sci. 114(13), 3521–3526 (2017)

    Google Scholar 

  22. Schulman, J., Levine, S., Abbeel, P., Jordan, M., Moritz, P.: Trust region policy optimization. In: The 32nd International Conference on Machine Learning, In Proc. Machine Learning Research, vol. 37, pp. 1889–1897. PMLR (2015)

    Google Scholar 

  23. Lin, B.Y., et al.: CommonGen: a constrained text generation challenge for generative commonsense reasoning. In: Findings of the Association for Computational Linguistics: EMNLP 2020, pp. 1823–1840. Association for Computational Linguistics (2020)

    Google Scholar 

  24. Mostafazadeh, N., et al.: A corpus and cloze evaluation for deeper understanding of commonsense stories. In: Proceedings of 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 839–849. Association for Computational Linguistics (2016)

    Google Scholar 

  25. Wu, Y., et al.: Google’s Neural Machine Translation System: Bridging the Gap between Human and Machine Translation, arXiv:1609.08144 (2016)

  26. Li, J., Galley, M., Brockett, C., Gao, J., Dolan, B.: A diversity-promoting objective function for neural conversation models. In: Proceedings of 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 110–119. Association for Computational Linguistics (2016)

    Google Scholar 

  27. Zhang, S.,et al.: OPT: Open Pre-trained Transformer Language Models, arxiv:2205.01068 (2022)

  28. He, P., Liu, X., Gao, J., Chen, W.: DeBERTa: Decoding-enhanced BERT with Disentangled Attention, arxiv:2006.03654 (2021)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Keizaburo Nishikino .

Editor information

Editors and Affiliations

Ethics declarations

Ethical Statement

In this study, we utilized pretrained LMs for text generation. Pretrained LMs, e.g., GPTs, may contain personal data in the weight parameters. Thus, LMs should be tested in advance and the personal information should be removed from both datasets and models. In this study, we utilized public datasets and models to avoid the misuse of personal information. We confirm that the models did not generate any texts, including any personal information. However, this study can be utilized in deception involving fake documents, news, etc., even though we only intend to improve the quality and diversity of LMs for text generation. Hence, we intend to manage and survey the utilization of this study, to ensure that its negative influences are monitored and constrained.

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nishikino, K., Kobayashi, K. (2023). Adversarial Imitation Learning with Controllable Rewards for Text Generation. In: Koutra, D., Plant, C., Gomez Rodriguez, M., Baralis, E., Bonchi, F. (eds) Machine Learning and Knowledge Discovery in Databases: Research Track. ECML PKDD 2023. Lecture Notes in Computer Science(), vol 14169. Springer, Cham. https://doi.org/10.1007/978-3-031-43412-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43412-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43411-2

  • Online ISBN: 978-3-031-43412-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics