Random scattering of bits by prediction

Details Random scattering of bits by prediction Random scattering of bits by prediction

2009-09-20

arxiv.org/abs/0909.3648v2

Computer Science

Artificial Intelligence

Scientific paper

We investigate a population of binary mistake sequences that result from learning with parametric models of different order. We obtain estimates of their error, algorithmic complexity and divergence from a purely random Bernoulli sequence. We study the relationship of these variables to the learner's information density parameter which is defined as the ratio between the lengths of the compressed to uncompressed files that contain the learner's decision rule. The results indicate that good learners have a low information density$\rho$ while bad learners have a high $\rho$. Bad learners generate mistake sequences that are atypically complex or diverge stochastically from a purely random Bernoulli sequence. Good learners generate typically complex sequences with low divergence from Bernoulli sequences and they include mistake sequences generated by the Bayes optimal predictor. Based on the static algorithmic interference model of \cite{Ratsaby_entropy} the learner here acts as a static structure which "scatters" the bits of an input sequence (to be predicted) in proportion to its information density $\rho$ thereby deforming its randomness characteristics.

Affiliated with

Also associated with

No associations

Rating

Random scattering of bits by 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 Random scattering of bits by prediction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random scattering of bits by prediction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-296373