Metric entropy in competitive on-line prediction

Details Metric entropy in competitive on-line prediction Metric entropy in competitive on-line prediction

2006-09-09

arxiv.org/abs/cs/0609045v1

Computer Science

Learning

41 pages

Scientific paper

Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way the observations are generated. The predictor's goal is to compete with a benchmark class of prediction rules, which is often a proper Banach function space. Metric entropy provides a unifying framework for competitive on-line prediction: the numerous known upper bounds on the metric entropy of various compact sets in function spaces readily imply bounds on the performance of on-line prediction strategies. This paper discusses strengths and limitations of the direct approach to competitive on-line prediction via metric entropy, including comparisons to other approaches.

Affiliated with

Also associated with

No associations

Rating

Metric entropy in competitive on-line prediction 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 Metric entropy in competitive on-line prediction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Metric entropy in competitive on-line prediction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154868