广义可计算泛先验及其收敛性
On Generalized Computable Universal Priors and their Convergence
摘要:
所罗门诺夫将奥卡姆剃刀和伊壁鸠鲁的多重解释原则统一为一个优雅的、形式化的、普遍的归纳推理理论,开创了算法信息论的领域。他的中心结果是,后普遍半措施M收敛迅速的真实序列产生后亩,如果后者是可计算的。因此,在未知μ的情况下,M有资格作为通用预测因子。本文的第一部分研究了可计算性类的层次结构的可计算通用(半)措施的存在性和收敛性:递归,估计,可估计,可逼近。例如,已知M是可枚举的,但不可估计,并且支配所有可枚举半测度。我们提出了离散和连续半测度的证明。第二部分调查更密切的类型的收敛,可能隐含的普遍性:在差异和比例,概率为1,平均和,并为马丁-洛夫随机序列。我们引入了一个广义的概念,个别序列的随机性,并使用它来表现出这些问题的困难。特别是,我们证明了收敛失败(持有)广义随机序列的缺口(密集)伯努利类。
英文摘要:
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the posterior of the universal semimeasure M converges rapidly to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a universal predictor in case of unknown mu. The first part of the paper investigates the existence and convergence of computable universal (semi)measures for a hierarchy of computability classes: recursive, estimable, enumerable, and approximable. For instance, M is known to be enumerable, but not estimable, and to dominate all enumerable semimeasures. We present proofs for discrete and continuous semimeasures. The second part investigates more closely the types of convergence, possibly implied by universality: in difference and in ratio, with probability 1, in mean sum, and for Martin-Loef random sequences. We introduce a generalized concept of randomness for individual sequences and use it to exhibit difficulties regarding these issues. In particular, we show that convergence fails (holds) on generalized-random sequences in gappy (dense) Bernoulli classes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。