Switching between Hidden Markov Models using Fixed Share

Details Switching between Hidden Markov Models using Fixed Share Switching between Hidden Markov Models using Fixed Share

2010-08-26

arxiv.org/abs/1008.4532v1

Computer Science

Learning

Scientific paper

In prediction with expert advice the goal is to design online prediction algorithms that achieve small regret (additional loss on the whole data) compared to a reference scheme. In the simplest such scheme one compares to the loss of the best expert in hindsight. A more ambitious goal is to split the data into segments and compare to the best expert on each segment. This is appropriate if the nature of the data changes between segments. The standard fixed-share algorithm is fast and achieves small regret compared to this scheme. Fixed share treats the experts as black boxes: there are no assumptions about how they generate their predictions. But if the experts are learning, the following question arises: should the experts learn from all data or only from data in their own segment? The original algorithm naturally addresses the first case. Here we consider the second option, which is more appropriate exactly when the nature of the data changes between segments. In general extending fixed share to this second case will slow it down by a factor of T on T outcomes. We show, however, that no such slowdown is necessary if the experts are hidden Markov models.

Affiliated with

Also associated with

No associations

Rating

Switching between Hidden Markov Models using Fixed Share 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 Switching between Hidden Markov Models using Fixed Share, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Switching between Hidden Markov Models using Fixed Share will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704251