A parameter-free hedging algorithm

Details A parameter-free hedging algorithm A parameter-free hedging algorithm

2009-03-16

arxiv.org/abs/0903.2851v2

Computer Science

Learning

Updated Version

Scientific paper

We study the problem of decision-theoretic online learning (DTOL). Motivated by practical applications, we focus on DTOL when the number of actions is very large. Previous algorithms for learning in this framework have a tunable learning rate parameter, and a barrier to using online-learning in practical applications is that it is not understood how to set this parameter optimally, particularly when the number of actions is large. In this paper, we offer a clean solution by proposing a novel and completely parameter-free algorithm for DTOL. We introduce a new notion of regret, which is more natural for applications with a large number of actions. We show that our algorithm achieves good performance with respect to this new notion of regret; in addition, it also achieves performance close to that of the best bounds achieved by previous algorithms with optimally-tuned parameters, according to previous notions of regret.

Affiliated with

Also associated with

No associations

Rating

A parameter-free hedging algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A parameter-free hedging algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A parameter-free hedging algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-490652