| title | slug | tags | date | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Multi-armed Bandit Problem |
multi-armed-bandit-problem |
|
2022-01-27T07:24 |
In Computer Science, one of the most popular problem in the realm of [[04f52b1f|Explore-exploit trade-off]] is the Multi-armed bandit problem. The term derived from the casino slot machine "one-armed bandit", and as the name suggests, the problem entails multiple slot machines and how to win as much as possible.1
The real problem, however, is getting an idea of the odds of each slot machine to know when to keep playing or move on to the next one.
Multi-Armed Bandits: A Cartoon Introduction - DCBA #12
<iframe width="100%" height="315" src="https://www.youtube.com/embed/bkw6hWvh_3k" frameborder="0" allow="autoplay;encrypted-media" allowfullscreen></iframe>
Footnotes
-
Algorithms to Live By by Brian Christian and Tom Griffiths - Explore/Exploit ↩
-
https://www.youtube.com/watch?v=bkw6hWvh_3k&ab_channel=AcademicGamer (Multi-Armed Bandits: A Cartoon Introduction - DCBA) ↩