(Non-)Equivalence of universal priors
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...[Show more]
|Collections||ANU Research Publications|
|Wood et al Non Equivalence of Universal Priors 2011.pdf||119.83 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.