Regret to the best vs. regret to the average

Eyal Even-Dar, Michael Kearns, Yishay Mansour, Jennifer Wortman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the average of all experts, the regret to any fixed mixture of experts, and the regret to the worst expert. This study leads both to new understanding of the limitations of existing no-regret algorithms, and to new algorithms with novel performance guarantees. More specifically, we show that any algorithm that achieves only O(√T) cumulative regret to the best expert on a sequence of T trials must, in the worst case, suffer regret Ω(√T) to the average, and that for a wide class of update rules that includes many existing no-regret algorithms (such as Exponential Weights and Follow the Perturbed Leader), the product of the regret to the best and the regret to the average is Ω(T). We then describe and analyze a new multi-phase algorithm, which achieves cumulative regret only O(√T log T) to the best expert and has only constant regret to any fixed distribution over experts (that is, with no dependence on either T or the number of experts N). The key to the new algorithm is the gradual increase in the " aggressiveness" of updates in response to observed divergences in expert performances.

Original languageEnglish
Title of host publicationLearning Theory - 20th Annual Conference on Learning Theory, COLT 2007, Proceedings
PublisherSpringer Verlag
Pages233-247
Number of pages15
ISBN (Print)9783540729259
DOIs
StatePublished - 2007
Event20th Annual Conference on Learning Theory, COLT 2007 - San Diego, CA, United States
Duration: 13 Jun 200715 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4539 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th Annual Conference on Learning Theory, COLT 2007
Country/TerritoryUnited States
CitySan Diego, CA
Period13/06/0715/06/07

Fingerprint

Dive into the research topics of 'Regret to the best vs. regret to the average'. Together they form a unique fingerprint.

Cite this