Universal Prediction of Selected Bits

Details Universal Prediction of Selected Bits Universal Prediction of Selected Bits

2011-07-27

arxiv.org/abs/1107.5531v1

Proc. 22nd International Conf. on Algorithmic Learning Theory (ALT-2011) pages 262-276

Computer Science

Learning

17 LaTeX pages

Scientific paper

Many learning tasks can be viewed as sequence prediction problems. For example, online classification can be converted to sequence prediction with the sequence being pairs of input/target data and where the goal is to correctly predict the target data given input data and previous input/target pairs. Solomonoff induction is known to solve the general sequence prediction problem, but only if the entire sequence is sampled from a computable distribution. In the case of classification and discriminative learning though, only the targets need be structured (given the inputs). We show that the normalised version of Solomonoff induction can still be used in this case, and more generally that it can detect any recursive sub-pattern (regularity) within an otherwise completely unstructured sequence. It is also shown that the unnormalised version can fail to predict very simple recursive sub-patterns.

Affiliated with

Also associated with

No associations

Rating

Universal Prediction of Selected Bits 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 Universal Prediction of Selected Bits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Prediction of Selected Bits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-113687