Regret to the Best vs. Regret to the Average

author: Eyal Even Dar, Department of Computer and Information Science, University of Pennsylvania
published: Feb. 25, 2007,   recorded: December 2006,   views: 162

Slides

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.
  Bibliography

Description

We study regret minimization algorithms, focusing not only on their regret to the best expert, but also on their regret to the average of all experts and to the worst expert. We show that any algorithm that achieves only O(pT) regret to the best expert must, in the worst case, suffer regret (pT) to the average, and that for a wide class of update rules that includes many existing no-regret algorithms (such as weighted majority, exponential weights, follow the perturbed leader, and others), the product of the regret to the best and the regret to the average is (T). We describe and analyze a new algorithm, based on the exponential weights algorithm, that achieves cumulative regret only O(pT log(T)) to the best expert and has a constant regret to the average (with no dependence on either T or N). We also give a simple algorithm whose payoff is always better (or equal) to the worst expert and has regret of O(pT) to the best expert.

See Also:

Download slides icon Download slides: otee06_dar_rbvra_01.ppt (149.5┬áKB)


Help icon Streaming Video Help

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: