(Non-)Equivalence of Universal Priors

Details (Non-)Equivalence of Universal Priors (Non-)Equivalence of Universal Priors

2011-11-16

arxiv.org/abs/1111.3854v1

Computer Science

Information Theory

10 LaTeX pages, 1 figure

Scientific paper

Ray Solomonoff invented the notion of universal induction featuring an aptly termed "universal" prior probability function over all possible computable environments. The essential property of this prior was its ability to dominate all other such priors. Later, Levin introduced another construction --- a mixture of all possible priors or `universal mixture'. These priors are well known to be equivalent up to multiplicative constants. Here, we seek to clarify further the relationships between these three characterisations of a universal prior (Solomonoff's, universal mixtures, and universally dominant priors). We see that the the constructions of Solomonoff and Levin define an identical class of priors, while the class of universally dominant priors is strictly larger. We provide some characterisation of the discrepancy.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-68798