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

带漂移的选择采样

Selective Sampling with Drift

The Technion(以色列理工学院)

Edward Moroshko, Koby Crammer

摘要:

最近有很多关于选择性采样的工作,这是一种在线主动学习设置,其中算法在轮中工作。在每一轮中,算法接收输入并进行预测。然后,它可以决定是否查询标签,如果是,则更新其模型,否则丢弃输入。大部分的工作集中在平稳的情况下,它是假设有一个固定的目标模型,并比较算法的性能固定的模型。然而,在许多现实世界的应用中,例如垃圾邮件预测,最佳目标函数可能会随着时间的推移而漂移,或者不时地发生偏移。我们开发了一种新的选择性采样算法的漂移设置,分析它在没有假设的机制产生的序列的实例,并推导出新的错误界,依赖于漂移量的问题。模拟合成和真实世界的数据集上证明了我们的算法作为一个选择性采样算法在漂移设置的优越性。

英文摘要:

Recently there has been much work on selective sampling, an online active learning setting, in which algorithms work in rounds. On each round an algorithm receives an input and makes a prediction. Then, it can decide whether to query a label, and if so to update its model, otherwise the input is discarded. Most of this work is focused on the stationary case, where it is assumed that there is a fixed target model, and the performance of the algorithm is compared to a fixed model. However, in many real-world applications, such as spam prediction, the best target function may drift over time, or have shifts from time to time. We develop a novel selective sampling algorithm for the drifting setting, analyze it under no assumptions on the mechanism generating the sequence of instances, and derive new mistake bounds that depend on the amount of drift in the problem. Simulations on synthetic and real-world datasets demonstrate the superiority of our algorithms as a selective sampling algorithm in the drifting setting.

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

↑