24th Annual Conference on Learning Theory (COLT), Budapest 2011

A simple multi-armed bandit algorithm with optimal variation-bounded regret

author: Elad Hazan, Technion - Israel Institute of Technology
published: Aug. 2, 2011, recorded: July 2011, views: 4643

Slides

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.

Description

We pose the question of whether it is possible to design a simple, linear-time algorithm for the basic multi-armed bandit problem in the adversarial setting which has a regret bound of O(√QlogT), where Q is the total quadratic variation of all the arms.

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:

Comment:
Name:
Email address:
URL:

make sure you have javascript enabled or clear this field: