Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Reinforcement Learning Algorithms with Python
  • Toc
  • feedback
Reinforcement Learning Algorithms with Python

Reinforcement Learning Algorithms with Python

By : Lonza
3 (3)
close
Reinforcement Learning Algorithms with Python

Reinforcement Learning Algorithms with Python

3 (3)
By: Lonza

Overview of this book

Reinforcement Learning (RL) is a popular and promising branch of AI that involves making smarter models and agents that can automatically determine ideal behavior based on changing requirements. This book will help you master RL algorithms and understand their implementation as you build self-learning agents. Starting with an introduction to the tools, libraries, and setup needed to work in the RL environment, this book covers the building blocks of RL and delves into value-based methods, such as the application of Q-learning and SARSA algorithms. You'll learn how to use a combination of Q-learning and neural networks to solve complex problems. Furthermore, you'll study the policy gradient methods, TRPO, and PPO, to improve performance and stability, before moving on to the DDPG and TD3 deterministic algorithms. This book also covers how imitation learning techniques work and how Dagger can teach an agent to drive. You'll discover evolutionary strategies and black-box optimization techniques, and see how they can improve RL algorithms. Finally, you'll get to grips with exploration approaches, such as UCB and UCB1, and develop a meta-algorithm called ESBAS. By the end of the book, you'll have worked with key RL algorithms to overcome challenges in real-world applications, and be part of the RL research community.
Table of Contents (19 chapters)
close
Free Chapter
1
Section 1: Algorithms and Environments
5
Section 2: Model-Free RL Algorithms
11
Section 3: Beyond Model-Free Algorithms and Improvements
17
Assessments
chevron up

Assessments

Chapter 3

  • What's a stochastic policy?
    • It's a policy defined in terms of a probability distribution
  • How can a return be defined in terms of the return at the next time step?
  • Why is the Bellman equation so important?
    • Because it provides a general formula to compute the value of a state using the current reward and the value of the subsequent state.
  • Which are the limiting factors of DP algorithms?
    • Due to a complexity explosion with the number of states, they have to be limited. The other constraint is that the dynamics of the system have to be fully known.
  • What's policy evaluation?
    • Is an iterative method to compute the value function for a given policy using the Bellman equations.
  • How does policy iteration and value iteration differs?
    • Policy iteration alternate between policy evaluation and policy improvement, value iteration instead...
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete