Thompson Sampling for the Duelling Bandits Problem

author: Noel Welsh, Untyped Ltd.
published: May 28, 2013,   recorded: September 2012,   views: 3314

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


In surprisingly many situations, absolute rewards are not available (or nonstationary) while relative preferences are easy to collect (or stable). This variation of the bandit problem is known at the duelling bandits (or, dueling bandits in the US; see My talk will cover our preliminary work developing a Thompson sam piing algorithm for the duelling (or dueling) bandit problem.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: