重温离群值定理
The Outlier Theorem Revisited
AI总结:
本文为算法信息论中的离群值定理提供了指数级改进的简单证明,将其扩展至遍历动力学系统,展示了函数去随机化方法,并证明了Cantor空间大测度开集的性质。
摘要:
离群值是指脱离样本总体的数据点。算法信息论中的离群值定理指出,给定一种可计算的采样方法,离群值必然出现。我们为离群值定理提供了一个简单的证明,并具有指数级改进的界限。我们将离群值定理扩展到遍历动力学系统,保证其会命中越来越大的离群值状态,且测度递减。我们展示了如何从随机函数构造确定性函数,即函数去随机化。我们还证明,Cantor空间中具有大一致测度的所有开集,要么包含一个简单的可计算成员,要么与停机序列具有高互信息。
英文摘要:
An outlier is a datapoint that is set apart from a sample population. The outlier theorem in algorithmic information theory states that given a computable sampling method, outliers must appear. We present a simple proof to the outlier theorem, with exponentially improved bounds. We extend the outlier theorem to ergodic dynamical systems which are guaranteed to hit ever larger outlier states with diminishing measures. We show how to construct deterministic functions from random ones, i.e. function derandomization. We also prove that all open sets of the Cantor space with large uniform measure will either have a simple computable member or high mutual information with the halting sequence.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。