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

基于经验观测统计量的序贯分类

Sequential Classification with Empirically Observed Statistics

University of Toronto(多伦多大学);National University of Singapore(新加坡国立大学)

Mahdi Haghifam, Vincent Y. F. Tan, Ashish Khisti

摘要:

受现实世界的机器学习应用的启发,我们考虑了测试样本顺序到达的顺序设置中的统计分类任务。此外,生成的分布是未知的,只有一组经验采样序列可供决策者使用。决策者的任务是分类的测试序列,这是已知的根据任一分布生成。特别地,对于二元情况,决策者希望用最少数量的测试样本执行分类任务,因此,在每一步,她声明假设1为真,假设2为真,或者她请求额外的测试样本。我们提出了一个分类器,并分析了第一和第二类错误的概率。我们证明了显着的优势,我们的顺序计划相比,现有的非顺序分类古特曼提出的。最后,我们将我们的设置和结果扩展到多类分类场景,并再次证明了问题的可变长度性质提供了显着的优势,因为人们可以实现与古特曼的固定长度设置相同的指数集,但没有拒绝选项。

英文摘要:

Motivated by real-world machine learning applications, we consider a statistical classification task in a sequential setting where test samples arrive sequentially. In addition, the generating distributions are unknown and only a set of empirically sampled sequences are available to a decision maker. The decision maker is tasked to classify a test sequence which is known to be generated according to either one of the distributions. In particular, for the binary case, the decision maker wishes to perform the classification task with minimum number of the test samples, so, at each step, she declares that either hypothesis 1 is true, hypothesis 2 is true, or she requests for an additional test sample. We propose a classifier and analyze the type-I and type-II error probabilities. We demonstrate the significant advantage of our sequential scheme compared to an existing non-sequential classifier proposed by Gutman. Finally, we extend our setup and results to the multi-class classification scenario and again demonstrate that the variable-length nature of the problem affords significant advantages as one can achieve the same set of exponents as Gutman's fixed-length setting but without having the rejection option.

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

↑