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

Learning the AC algorithm

Simple REINFORCE has the notable property of being unbiased, but it exhibits high variance. Adding a baseline reduces the variance, while keeping it unbiased (asymptotically, the algorithm will converge to a local minimum). A major drawback of REINFORCE with baseline is that it'll converge very slowly, requiring a consistent number of interactions with the environment.

An approach to speed up training is called bootstrapping. This is a technique that we've already seen many times throughout the book. It allows the estimation of the return values from the subsequent state values. The policy gradient algorithms that use this techniques is called actor-critic (AC). In the AC algorithm, the actor is the policy, and the critic is the value function (typically, a state-value function) that "critiques" the behavior of the actor, to help...

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