Skip to main content

Intra-task Curriculum Learning for Faster Reinforcement Learning in Video Games

  • Conference paper
  • First Online:
AI 2018: Advances in Artificial Intelligence (AI 2018)

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

Included in the following conference series:

  • 2317 Accesses

Abstract

In this paper we present a new method for improving reinforcement learning training times under the following two assumptions: (1) we know the conditions under which the environment gives reward; and (2) we can control the initial state of the environment at the beginning of a training episode. Our method, called intra-task curriculum learning, presents the different episode starting states to an agent in order of increasing distance to immediate reward.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Notes

  1. 1.

    Eligibility traces are recorded for each value in value function based reinforcement learning. We use the term “state” here, but in practice the values can also be stored for state-action pairs (e.g. in Q-learning).

  2. 2.

    For the purpose of this paper, we define the distance form state \(s_a\) to state \(s_b\) as the minimum number of transitions required to get from \(s_a\) to \(s_b\). This definition is sufficient because the environments we use have deterministic transitions, but a different definition would be required for stochastic environments.

  3. 3.

    We have a \(5 \times 5\) grid with 7 walls; leaving 18 free spaces.

  4. 4.

    We number the states in the 2D environment from left to right, bottom to top.

References

  1. Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, vol. 1. MIT Press, Cambridge (1998)

    Google Scholar 

  2. Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518, 529–533 (2015)

    Article  Google Scholar 

  3. Pathak, D., et al.: Curiosity-driven exploration by self-supervised prediction. In: ICML (2017)

    Google Scholar 

  4. Chentanez, N., Barto, A.G., Singh, S.P.: Intrinsically motivated reinforcement learning. In: NIPS, pp. 1281–1288 (2005)

    Google Scholar 

  5. Dosovitskiy, A., Koltun, V.: Learning to act by predicting the future. In: ICLR (2017)

    Google Scholar 

  6. Bengio, Y., et al.: Curriculum learning. In: ICML, pp. 41–48 (2009)

    Google Scholar 

  7. van Hasselt, H., Guez, A., Silver, D.: Deep reinforcement learning with double q-learning. In: AAAI (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nathaniel du Preez-Wilkinson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

du Preez-Wilkinson, N., Gallagher, M., Hu, X. (2018). Intra-task Curriculum Learning for Faster Reinforcement Learning in Video Games. In: Mitrovic, T., Xue, B., Li, X. (eds) AI 2018: Advances in Artificial Intelligence. AI 2018. Lecture Notes in Computer Science(), vol 11320. Springer, Cham. https://doi.org/10.1007/978-3-030-03991-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03991-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03990-5

  • Online ISBN: 978-3-030-03991-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics