A new Hedging algorithm and its application to inferring latent random variables

Details A new Hedging algorithm and its application to inferring latent random variables A new Hedging algorithm and its application to inferring latent random variables

2008-06-30

arxiv.org/abs/0806.4802v1

Computer Science

Computer Science and Game Theory

Scientific paper

We present a new online learning algorithm for cumulative discounted gain. This learning algorithm does not use exponential weights on the experts. Instead, it uses a weighting scheme that depends on the regret of the master algorithm relative to the experts. In particular, experts whose discounted cumulative gain is smaller (worse) than that of the master algorithm receive zero weight. We also sketch how a regret-based algorithm can be used as an alternative to Bayesian averaging in the context of inferring latent random variables.

Affiliated with

Also associated with

No associations

Rating

A new Hedging algorithm and its application to inferring latent random variables 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 new Hedging algorithm and its application to inferring latent random variables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new Hedging algorithm and its application to inferring latent random variables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154443