Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Deep Reinforcement Learning Hands-On

You're reading from   Deep Reinforcement Learning Hands-On A practical and easy-to-follow guide to RL from Q-learning and DQNs to PPO and RLHF

Arrow left icon
Product type Paperback
Published in Nov 2024
Publisher Packt
ISBN-13 9781835882702
Length 716 pages
Edition 3rd Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Maxim Lapan Maxim Lapan
Author Profile Icon Maxim Lapan
Maxim Lapan
Arrow right icon
View More author details
Toc

Table of Contents (29) Chapters Close

Preface 1. Part 1 Introduction to RL FREE CHAPTER
2. What Is Reinforcement Learning? 3. OpenAI Gym API and Gymnasium 4. Deep Learning with PyTorch 5. The Cross-Entropy Method 6. Part 2 Value-based methods
7. Tabular Learning and the Bellman Equation 8. Deep Q-Networks 9. Higher-Level RL Libraries 10. DQN Extensions 11. Ways to Speed Up RL 12. Stocks Trading Using RL 13. Part 3 Policy-based methods
14. Policy Gradients 15. Actor-Critic Method: A2C and A3C 16. The TextWorld Environment 17. Web Navigation 18. Part 4 Advanced RL
19. Continous Action Space 20. Trust Region Methods 21. Black-Box Optimizations in RL 22. Advanced Exploration 23. Reinforcement Learning with Human Feedback 24. AlphaGo Zero and MuZero 25. RL in Discrete Optimization 26. Multi-Agent RL 27. Bibliography
28. Index

Prioritized replay buffer

The next very useful idea on how to improve DQN training was proposed in 2015 in the paper Prioritized experience replay [Sch+15]. This method tries to improve the efficiency of samples in the replay buffer by prioritizing those samples according to the training loss.

The basic DQN used the replay buffer to break the correlation between immediate transitions in our episodes. As we discussed in Chapter 6, the examples we experience during the episode will be highly correlated, as most of the time, the environment is ”smooth” and doesn’t change much according to our actions. However, the stochastic gradient descent (SGD) method assumes that the data we use for training has an iid property. To solve this problem, the classic DQN method uses a large buffer of transitions, randomly and uniformly sampled to get the next training batch.

The authors of the paper questioned this uniform random sample policy and proved that...

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 $19.99/month. Cancel anytime