序列概率的一个更好的Good-Turing估计
A Better Good-Turing Estimator for Sequence Probabilities
摘要:
我们考虑的问题估计的概率所观察到的字符串绘制i.i.d.来自未知的分布。我们的研究的关键特征是,所观察到的字符串的长度被假设为与底层字母表的大小相同的数量级。在这种情况下,许多字母是看不见的,经验分布往往高估了观察到的字母的概率。为了克服这个问题,传统的概率估计方法是使用经典的Good-Turing估计。我们引入了一个自然的尺度模型,并使用它来证明古德图灵序列概率估计是不一致的。然后,我们介绍了一种新的序列概率估计,确实是一致的自然尺度模型下。
英文摘要:
We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of the underlying alphabet. In this setting, many letters are unseen and the empirical distribution tends to overestimate the probability of the observed letters. To overcome this problem, the traditional approach to probability estimation is to use the classical Good-Turing estimator. We introduce a natural scaling model and use it to show that the Good-Turing sequence probability estimator is not consistent. We then introduce a novel sequence probability estimator that is indeed consistent under the natural scaling model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。