Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

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

Hands-On Reinforcement Learning with Python

By : Sudharsan Ravichandiran
2.6 (18)
close
Hands-On Reinforcement Learning with Python

Hands-On Reinforcement Learning with Python

2.6 (18)
By: Sudharsan Ravichandiran

Overview of this book

Reinforcement Learning (RL) is the trending and most promising branch of artificial intelligence. Hands-On Reinforcement learning with Python will help you master not only the basic reinforcement learning algorithms but also the advanced deep reinforcement learning algorithms. The book starts with an introduction to Reinforcement Learning followed by OpenAI Gym, and TensorFlow. You will then explore various RL algorithms and concepts, such as Markov Decision Process, Monte Carlo methods, and dynamic programming, including value and policy iteration. This example-rich guide will introduce you to deep reinforcement learning algorithms, such as Dueling DQN, DRQN, A3C, PPO, and TRPO. You will also learn about imagination-augmented agents, learning from human preference, DQfD, HER, and many more of the recent advancements in reinforcement learning. By the end of the book, you will have all the knowledge and experience needed to implement reinforcement learning and deep reinforcement learning in your projects, and you will be all set to enter the world of artificial intelligence.
Table of Contents (16 chapters)
close

Chapter 3

  1. The Markov property states that the future depends only on the present and not on the past.
  2. MDP is an extension of the Markov chain. It provides a mathematical framework for modeling decision-making situations. Almost all RL problems can be modeled as MDP.
  3. Refer section Discount factor.
  4. The discount factor decides how much importance we give to the future rewards and immediate rewards.
  5. We use Bellman function for solving the MDP.
  6. Refer section Deriving the Bellman equation for value and Q functions.
  7. Value function specifies goodness of a state and Q function specifies goodness of an action in that state.
  8. Refer section Value iteration and Policy iteration.

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech
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