Search icon CANCEL
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

Implementation

You'll develop the code as you work along this chapter, but keep in mind that I've provided the whole implementation of Thompson Sampling for this application; you have it available on the GitHub page (https://github.com/PacktPublishing/AI-Crash-Course) of this book. If you want to try and run the code, you can do it on Colaboratory, Spyder in Anaconda, or simply your favorite IDE.

Thompson Sampling vs. Random Selection

While implementing Thompson Sampling, you'll also implement the Random Selection algorithm, which will simply select a random strategy at each round. This will be your benchmark to evaluate the performance of your Thompson Sampling model. Of course, Thompson Sampling and the Random Selection algorithm will be competing on the same simulation, that is, on the same environment matrix.

Performance measure

In the end, after the whole simulation is done, you can assess the performance of Thompson Sampling by computing...

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 AU $24.99/month. Cancel anytime