Robust Best Point Selection under Unreliable User Feedback

Author:

Chen Qixu1,Wong Raymond Chi-Wing1

Affiliation:

1. The Hong Kong University of Science and Technology, Kowloon, Hong Kong

Abstract

The task of finding a user's utility function (representing the user's preference) by asking them to compare pairs of points through a series of questions, each requiring him/her to compare 2 points for choosing a more preferred one, to find the best point in the database is a common problem in the database community. However, in real-world scenarios, users may provide unreliable answers due to two major types of errors, namely persistent errors and random errors. Existing interaction algorithms either simply assume that all answers provided by the user are reliable, or are capable of handling random errors only, which can lead to finding undesirable points, ignoring persistent errors. To address this challenge, we propose more generalized algorithms that are robust to both persistent and random errors made by the user. Specifically, we propose (1) an algorithm that asks an asymptotically optimal number of questions, and (2) an algorithm that asks an even smaller number of questions empirically, with provable performance guarantee. Our experiments on both real and synthetic datasets demonstrate that our algorithms outperform existing methods in terms of accuracy, even with a small number of questions asked.

Publisher

Association for Computing Machinery (ACM)

Reference48 articles.

1. Pankaj K Agarwal, Nirman Kumar, Stavros Sintos, and Subhash Suri. 2017. Efficient algorithms for k-regret minimizing sets. arXiv preprint arXiv:1702.01446 (2017).

2. The economic cost of a fat finger mistake: a comparative case study from Samsung Securities's ghost stock blunder;Ahn Yongkil;Journal of Operational Risk,2019

3. Domination in the Probabilistic World

4. Ilaria Bartolini Paolo Ciaccia and Florian Waas. 2001. FeedbackBypass: A new approach to interactive similarity query processing. In VLDB. 201--210.

5. The Skyline operator

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3