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
Python Reinforcement Learning

You're reading from   Python Reinforcement Learning Solve complex real-world problems by mastering reinforcement learning algorithms using OpenAI Gym and TensorFlow

Arrow left icon
Product type Course
Published in Apr 2019
Publisher Packt
ISBN-13 9781838649777
Length 496 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (4):
Arrow left icon
Yang Wenzhuo Yang Wenzhuo
Author Profile Icon Yang Wenzhuo
Yang Wenzhuo
Sean Saito Sean Saito
Author Profile Icon Sean Saito
Sean Saito
Sudharsan Ravichandiran Sudharsan Ravichandiran
Author Profile Icon Sudharsan Ravichandiran
Sudharsan Ravichandiran
Rajalingappaa Shanmugamani Rajalingappaa Shanmugamani
Author Profile Icon Rajalingappaa Shanmugamani
Rajalingappaa Shanmugamani
Arrow right icon
View More author details
Toc

Table of Contents (27) Chapters Close

Title Page
About Packt
Contributors
Preface
1. Introduction to Reinforcement Learning FREE CHAPTER 2. Getting Started with OpenAI and TensorFlow 3. The Markov Decision Process and Dynamic Programming 4. Gaming with Monte Carlo Methods 5. Temporal Difference Learning 6. Multi-Armed Bandit Problem 7. Playing Atari Games 8. Atari Games with Deep Q Network 9. Playing Doom with a Deep Recurrent Q Network 10. The Asynchronous Advantage Actor Critic Network 11. Policy Gradients and Optimization 12. Balancing CartPole 13. Simulating Control Tasks 14. Building Virtual Worlds in Minecraft 15. Learning to Play Go 16. Creating a Chatbot 17. Generating a Deep Learning Image Classifier 18. Predicting Future Stock Prices 19. Capstone Project - Car Racing Using DQN 20. Looking Ahead 1. Assessments 2. Other Books You May Enjoy Index

Chapter 6. Multi-Armed Bandit Problem

In the previous chapters, we have learned about fundamental concepts of reinforcement learning (RL) and several RL algorithms, as well as how RL problems can be modeled as the Markov Decision Process (MDP). We have also seen different model-based and model-free algorithms that are used to solve the MDP. In this chapter, we will see one of the classical problems in RL called the multi-armed bandit (MAB) problem. We will see what the MAB problem is and how to solve the problem with different algorithms followed by how to identify the correct advertisement banner that will receive most of the clicks using MAB. We will also learn about contextual bandit that is widely used for building recommendation systems.

In the chapter, you will learn about the following:

  • The MAB problem
  • The epsilon-greedy algorithm
  • The softmax exploration algorithm
  • The upper confidence bound algorithm
  • The Thompson sampling algorithm
  • Applications of MAB
  • Identifying the right advertisement banner...
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