Search icon CANCEL
Subscription
0
Cart icon
Cart
Close icon
You have no products in your basket yet
Save more on your purchases!
Savings automatically calculated. No voucher code required
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
The Reinforcement Learning Workshop

You're reading from  The Reinforcement Learning Workshop

Product type Book
Published in Aug 2020
Publisher Packt
ISBN-13 9781800200456
Pages 822 pages
Edition 1st Edition
Languages
Authors (9):
Alessandro Palmas Alessandro Palmas
Profile icon Alessandro Palmas
Emanuele Ghelfi Emanuele Ghelfi
Profile icon Emanuele Ghelfi
Dr. Alexandra Galina Petre Dr. Alexandra Galina Petre
Profile icon Dr. Alexandra Galina Petre
Mayur Kulkarni Mayur Kulkarni
Profile icon Mayur Kulkarni
Anand N.S. Anand N.S.
Profile icon Anand N.S.
Quan Nguyen Quan Nguyen
Profile icon Quan Nguyen
Aritra Sen Aritra Sen
Profile icon Aritra Sen
Anthony So Anthony So
Profile icon Anthony So
Saikat Basak Saikat Basak
Profile icon Saikat Basak
View More author details
Toc

Table of Contents (14) Chapters close

Preface
1. Introduction to Reinforcement Learning 2. Markov Decision Processes and Bellman Equations 3. Deep Learning in Practice with TensorFlow 2 4. Getting Started with OpenAI and TensorFlow for Reinforcement Learning 5. Dynamic Programming 6. Monte Carlo Methods 7. Temporal Difference Learning 8. The Multi-Armed Bandit Problem 9. What Is Deep Q-Learning? 10. Playing an Atari Game with Deep Recurrent Q-Networks 11. Policy-Based Methods for Reinforcement Learning 12. Evolutionary Strategies for RL Appendix

N-Step TD and TD(λ) Algorithms

In the previous chapter, we looked at Monte Carlo methods, while in the previous sections of this chapter, we learned about TD(0) ones, which, as we will discover soon, are also known as one-step temporal difference methods. In this section, we'll unify them: in fact, they are at the extreme of a spectrum of algorithms (TD(0) on one side, with MC methods at the other end), and often, the best performing methods are somewhere in the middle of this spectrum.

N-step temporal difference algorithms extend one-step TD methods. More specifically, they generalize Monte Carlo and TD approaches, making it possible to smoothly transition between the two. As we already saw, MC methods must wait until the episode finishes to back the reward up into the previous states. One-step TD methods, on the other hand, make direct use of the first available future step to bootstrap and start updating the value function of states or state-action pairs. These extremes...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime