Book Image

Hands-On Q-Learning with Python

By : Nazia Habib
Book Image

Hands-On Q-Learning with Python

By: Nazia Habib

Overview of this book

Q-learning is a machine learning algorithm used to solve optimization problems in artificial intelligence (AI). It is one of the most popular fields of study among AI researchers. This book starts off by introducing you to reinforcement learning and Q-learning, in addition to helping you become familiar with OpenAI Gym as well as libraries such as Keras and TensorFlow. A few chapters into the book, you will gain insights into model-free Q-learning and use deep Q-networks and double deep Q-networks to solve complex problems. This book will guide you in exploring use cases such as self-driving vehicles and OpenAI Gym’s CartPole problem. You will also learn how to tune and optimize Q-networks and their hyperparameters. As you progress, you will understand the reinforcement learning approach to solving real-world problems. You will also explore how to use Q-learning and related algorithms in scientific research. Toward the end, you’ll gain insight into what’s in store for reinforcement learning. By the end of this book, you will be equipped with the skills you need to solve reinforcement learning problems using Q-learning algorithms with OpenAI Gym, Keras, and TensorFlow.
Table of Contents (14 chapters)
Free Chapter
1
Section 1: Q-Learning: A Roadmap
6
Section 2: Building and Optimizing Q-Learning Agents
9
Section 3: Advanced Q-Learning Challenges with Keras, TensorFlow, and OpenAI Gym

Probability distributions and ongoing knowledge

In a reinforcement learning task, our goal is to take our increasing knowledge of a problem and use it to our advantage. We are not simply trying to gain the clearest possible picture of a problem; we are trying to benefit from the knowledge we currently have and not get distracted by potentially interesting alternative paths that might not be to our advantage to follow, and that in fact may harm us.

Let's briefly discuss what our ongoing investigation of a probability distribution looks like:

The preceding diagram shows what our current success rate might look like at any particular time in a bandit problem for all of the arms available to us. If we had conducted 1,000 trials already, for example, we might have discovered these success rates for each arm. On any particular trial, we would use that knowledge to decide which...