arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.02287stat.MLcs.LG
收藏

超越良图灵:初步报告

Outperforming Good-Turing: Preliminary Report

Amichai Painsky, Meir Feder

摘要:

从有限数量的样本中估计大字母表概率分布是机器学习和统计学中的基本问题。多年来,人们提出了各种各样的估计方案,主要是受到拉普拉斯早期工作以及古德和图灵开创性贡献的启发。最常用的估计器共享的基本假设之一是符号的采样频率和其估计概率之间的唯一对应关系。在这项工作中,我们解决了这一范式假设,我们声称,符号与“相似”的频率应被分配相同的估计概率值。通过这种方式,我们调整了参数的数量并提高了泛化能力。在这份初步报告中,我们表明,通过应用这样的监管估计的合奏,我们引入了显着的增强估计精度(通常高达50%),目前已知的方法相比。我们建议的方法的实现是公开的第一作者的网页。

英文摘要:

Estimating a large alphabet probability distribution from a limited number of samples is a fundamental problem in machine learning and statistics. A variety of estimation schemes have been proposed over the years, mostly inspired by the early work of Laplace and the seminal contribution of Good and Turing. One of the basic assumptions shared by most commonly-used estimators is the unique correspondence between the symbol's sample frequency and its estimated probability. In this work we tackle this paradigmatic assumption; we claim that symbols with "similar" frequencies shall be assigned the same estimated probability value. This way we regulate the number of parameters and improve generalization. In this preliminary report we show that by applying an ensemble of such regulated estimators, we introduce a dramatic enhancement in the estimation accuracy (typically up to 50%), compared to currently known methods. An implementation of our suggested method is publicly available at the first author's web-page.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑