arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.06092cs.LGstat.ML
收藏

一种自适应双探索折衷的离群点检测算法

Adaptive Double-Exploration Tradeoff for Outlier Detection

The Chinese University of Hong Kong(香港中文大学);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Tencent(腾讯)

Xiaojin Zhang, Honglei Zhuang, Shengyu Zhang, Yuan Zhou

摘要:

我们研究了一个变种的阈值强盗问题(TBP)的背景下,离群值检测,其目标是确定离群值的奖励高于阈值。与传统的TBP算法不同的是,阈值被定义为所有臂的回报的函数,这是由识别异常值的标准所驱动的。学习者需要探索手臂的回报以及门槛。我们把这个问题称为“离群点检测的双重探索”。我们构造一个自适应更新的置信区间的阈值,在前几轮的阈值的估计值的基础上。此外,通过自动权衡探索各个臂和探索离群阈值,我们提供了一个有效的算法的样本复杂度。在人工数据集和真实数据集上的实验结果表明了该算法的有效性。

英文摘要:

We study a variant of the thresholding bandit problem (TBP) in the context of outlier detection, where the objective is to identify the outliers whose rewards are above a threshold. Distinct from the traditional TBP, the threshold is defined as a function of the rewards of all the arms, which is motivated by the criterion for identifying outliers. The learner needs to explore the rewards of the arms as well as the threshold. We refer to this problem as "double exploration for outlier detection". We construct an adaptively updated confidence interval for the threshold, based on the estimated value of the threshold in the previous rounds. Furthermore, by automatically trading off exploring the individual arms and exploring the outlier threshold, we provide an efficient algorithm in terms of the sample complexity. Experimental results on both synthetic datasets and real-world datasets demonstrate the efficiency of our algorithm.

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

↑