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
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
AI Crash Course

You're reading from   AI Crash Course A fun and hands-on introduction to machine learning, reinforcement learning, deep learning, and artificial intelligence with Python

Arrow left icon
Product type Paperback
Published in Nov 2019
Publisher Packt
ISBN-13 9781838645359
Length 360 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Hadelin de Ponteves Hadelin de Ponteves
Author Profile Icon Hadelin de Ponteves
Hadelin de Ponteves
Arrow right icon
View More author details
Toc

Table of Contents (17) Chapters Close

Preface 1. Welcome to the Robot World FREE CHAPTER 2. Discover Your AI Toolkit 3. Python Fundamentals – Learn How to Code in Python 4. AI Foundation Techniques 5. Your First AI Model – Beware the Bandits! 6. AI for Sales and Advertising – Sell like the Wolf of AI Street 7. Welcome to Q-Learning 8. AI for Logistics – Robots in a Warehouse 9. Going Pro with Artificial Brains – Deep Q-Learning 10. AI for Autonomous Vehicles – Build a Self-Driving Car 11. AI for Business – Minimize Costs with Deep Q-Learning 12. Deep Convolutional Q-Learning 13. AI for Games – Become the Master at Snake 14. Recap and Conclusion 15. Other Books You May Enjoy 16. Index

The Thompson Sampling model

You're going to build this model straight away. Right now, you'll build a simple implementation of this method, and later you will be shown the theory behind it. Let's get right into it!

As we defined previously, our problem is trying to find the best slot machine with the highest winning chance out of many. A not-so-optimal solution would be to play 100 rounds on each of our slot machines and see which one has the highest winning rate. A better solution is a method called Thompson Sampling.

I won't go too deeply into the theory behind it; we'll cover that later. For now, it is enough to say that Thompson Sampling uses a distribution function (distributions will be explained further in this chapter), called Beta, that takes two arguments. For simplicity's sake, let's say that the higher the first argument is, the better our slot machine is, and the higher the second argument is, the worse our slot machine...

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