4.5 Article

All Sampling Methods Produce Outliers

期刊

IEEE TRANSACTIONS ON INFORMATION THEORY
卷 67, 期 11, 页码 7568-7578

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2021.3109779

关键词

Kolmogorov complexity; statistics

向作者/读者索取更多资源

There is no computable, randomized method to produce a sample that does not contain outliers of a given computable probability measure P. Additionally, the minimum length of a program that computes a complete extension of a binary predicate gamma is bounded by the size of the domain of gamma and the information it has with the halting sequence.
Given a computable probability measure P over natural numbers or infinite binary sequences, there is no computable, randomized method that can produce an arbitrarily large sample such that none of its members are outliers of P. In addition, given a binary predicate gamma, the length of the smallest program that computes a complete extension of gamma is less than the size of the domain of gamma plus the amount of information that gamma has with the halting sequence.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据