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
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Reinforcement Learning Algorithms with Python

You're reading from   Reinforcement Learning Algorithms with Python Learn, understand, and develop smart algorithms for addressing AI challenges

Arrow left icon
Product type Paperback
Published in Oct 2019
Publisher Packt
ISBN-13 9781789131116
Length 366 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Andrea Lonza Andrea Lonza
Author Profile Icon Andrea Lonza
Andrea Lonza
Arrow right icon
View More author details
Toc

Table of Contents (19) Chapters Close

Preface 1. Section 1: Algorithms and Environments FREE CHAPTER
2. The Landscape of Reinforcement Learning 3. Implementing RL Cycle and OpenAI Gym 4. Solving Problems with Dynamic Programming 5. Section 2: Model-Free RL Algorithms
6. Q-Learning and SARSA Applications 7. Deep Q-Network 8. Learning Stochastic and PG Optimization 9. TRPO and PPO Implementation 10. DDPG and TD3 Applications 11. Section 3: Beyond Model-Free Algorithms and Improvements
12. Model-Based RL 13. Imitation Learning with the DAgger Algorithm 14. Understanding Black-Box Optimization Algorithms 15. Developing the ESBAS Algorithm 16. Practical Implementation for Resolving RL Challenges 17. Assessments
18. Other Books You May Enjoy

Combining policy gradient optimization with Q-learning

Throughout this book, we approach two main types of model-free algorithms: the ones based on the gradient of the policy, and the ones based on the value function. From the first family, we saw REINFORCE, actor-critic, PPO, and TRPO. From the second, we saw Q-learning, SARSA, and DQN. As well as the way in which the two families learn a policy (that is, policy gradient algorithms use stochastic gradient ascent toward the steepest increment on the estimated return, and value-based algorithms learn an action value for each state-action to then build a policy), there are key differences that let us prefer one family over the other. These are the on-policy or off-policy nature of the algorithms, and their predisposition to manage large action spaces. We already discussed the differences between on-policy and off-policy in the previous...

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
Banner background image