Multiple Queries as Bandit Arms

被引:7
|
作者
Li, Cheng [1 ]
Resnick, Paul [1 ]
Mei, Qiaozhu [1 ]
机构
[1] Univ Michigan, Sch Informat, Ann Arbor, MI 48109 USA
基金
美国国家科学基金会;
关键词
Query pooling; multi-armed bandits;
D O I
10.1145/2983323.2983816
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Existing retrieval systems rely on a single active query to pull documents from the index. Relevance feedback may be used to iteratively refine the query, but only one query is active at a time. If the user's information need has multiple aspects, the query must represent the union of these aspects. We consider a new paradigm of retrieval where multiple queries are kept "active" simultaneously. In the presence of rate limits, the active queries take turns accessing the index to retrieve another "page" of results. Turns are assigned by a multi-armed bandit based on user feedback. This allows the system to explore which queries return more relevant results and to exploit the best ones. In empirical tests, query pools outperform solo, combined queries. Significant improvement is observed both when the subtopic queries are known in advance and when the queries are generated in a user-interactive process.
引用
收藏
页码:1089 / 1098
页数:10
相关论文
共 50 条
  • [31] CONTROLLING MULTIPLE ROBOT ARMS
    MORRIS, HM
    CONTROL ENGINEERING, 1986, 33 (09) : 144 - 147
  • [32] On Regret with Multiple Best Arms
    Zhu, Yinglun
    Nowak, Robert
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [33] A Bandit Approach to Multiple Testing with False Discovery Control
    Jamieson, Kevin
    Jain, Lalit
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [34] The K-armed bandit problem with multiple priors
    Li, Jian
    JOURNAL OF MATHEMATICAL ECONOMICS, 2019, 80 : 22 - 38
  • [35] An Optimal Algorithm for Adversarial Bandit Problem with Multiple Plays
    Vural, N. Mert
    Ozturk, Bugra
    Kozat, Suleyman S.
    2020 28TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2020,
  • [36] COMBINATORIAL MULTI-ARMED BANDIT PROBLEM WITH PROBABILISTICALLY TRIGGERED ARMS: A CASE WITH BOUNDED REGRET
    Saritac, A. Omer
    Tekin, Cem
    2017 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP 2017), 2017, : 111 - 115
  • [37] Dynamic Pricing under Binary Demand Uncertainty: A Multi-Armed Bandit with Correlated Arms
    Zhai, Yixuan
    Tehrani, Pouya
    Li, Lin
    Zhao, Jiang
    Zhao, Qing
    2011 CONFERENCE RECORD OF THE FORTY-FIFTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS (ASILOMAR), 2011, : 1597 - 1601
  • [38] ON CHECKING VERSUS EVALUATION OF MULTIPLE QUERIES
    GASARCH, WI
    HEMACHANDRA, LA
    HOENE, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 260 - 268
  • [39] Correlated Gaussian Multi-Objective Multi-Armed Bandit across Arms Algorithm
    Yahyaa, Saba Q.
    Drugan, Madalina M.
    2015 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2015, : 593 - 600
  • [40] Scheduling multiple queries in symmetric multiprocessors
    Tan, KL
    Lu, HJ
    INFORMATION SCIENCES, 1996, 95 (1-2) : 125 - 153