[MINI] Multi-armed Bandit Problems
Data Skeptic2 Loka 2015

[MINI] Multi-armed Bandit Problems

The multi-armed bandit problem is named with reference to slot machines (one armed bandits). Given the chance to play from a pool of slot machines, all with unknown payout frequencies, how can you maximize your reward? If you knew in advance which machine was best, you would play exclusively that machine. Any strategy less than this will, on average, earn less payout, and the difference can be called the "regret".

You can try each slot machine to learn about it, which we refer to as exploration. When you've spent enough time to be convinced you've identified the best machine, you can then double down and exploit that knowledge. But how do you best balance exploration and exploitation to minimize the regret of your play?

This mini-episode explores a few examples including restaurant selection and A/B testing to discuss the nature of this problem. In the end we touch briefly on Thompson sampling as a solution.

Tämä jakso on lisätty Podme-palveluun avoimen RSS-syötteen kautta eikä se ole Podmen omaa tuotantoa. Siksi jakso saattaa sisältää mainontaa.

Jaksot(601)

Video Recommendations in Industry

Video Recommendations in Industry

In this episode, Kyle Polich sits down with Cory Zechmann, a content curator working in streaming television with 16 years of experience running the music blog "Silence Nogood." They explore the inter...

26 Joulu 202538min

Eye Tracking in Recommender Systems

Eye Tracking in Recommender Systems

In this episode, Santiago de Leon takes us deep into the world of eye tracking and its revolutionary applications in recommender systems. As a researcher at the Kempelin Institute and Brno University,...

18 Joulu 202552min

Cracking the Cold Start Problem

Cracking the Cold Start Problem

In this episode of Data Skeptic, we dive deep into the technical foundations of building modern recommender systems. Unlike traditional machine learning classification problems where you can simply ap...

8 Joulu 202539min

Designing Recommender Systems for Digital Humanities

Designing Recommender Systems for Digital Humanities

In this episode of Data Skeptic, we explore the fascinating intersection of recommender systems and digital humanities with guest Florian Atzenhofer-Baumgartner, a PhD student at Graz University of Te...

23 Marras 202536min

DataRec Library for Reproducible in Recommend Systems

DataRec Library for Reproducible in Recommend Systems

In this episode of Data Skeptic's Recommender Systems series, host Kyle Polich explores DataRec, a new Python library designed to bring reproducibility and standardization to recommender systems resea...

13 Marras 202532min

Shilling Attacks on Recommender Systems

Shilling Attacks on Recommender Systems

In this episode of Data Skeptic's Recommender Systems series, Kyle sits down with Aditya Chichani, a senior machine learning engineer at Walmart, to explore the darker side of recommendation algorithm...

5 Marras 202534min

Music Playlist Recommendations

Music Playlist Recommendations

In this episode, Rebecca Salganik, a PhD student at the University of Rochester with a background in vocal performance and composition, discusses her research on fairness in music recommendation syste...

29 Loka 202552min

Bypassing the Popularity Bias

Bypassing the Popularity Bias

15 Loka 202534min

Suosittua kategoriassa Tiede

rss-mita-tulisi-tietaa
rss-poliisin-mieli
tiedekulma-podcast
rss-duodecim-lehti
menologeja-tutkimusmatka-vaihdevuosiin
docemilia
rss-astetta-parempi-elama-podcast
rss-tiedetta-vai-tarinaa
rss-lapsuuden-rakentajat-podcast
utelias-mieli
sotataidon-ytimessa
radio-antro
filocast-filosofian-perusteet
rss-ranskaa-raakana
rss-kasvatuspsykologiaa-kaikille
rss-sosiopodi