Learning to Truncate Ranked Lists for Information Retrieval
Chen Wu, Ruqing Zhang, Jiafeng Guo, Yixing Fan, Yanyan Lan, and Xueqi, Cheng

TL;DR
This paper introduces AttnCut, a transformer-based model that directly optimizes user-defined objectives for ranked list truncation in information retrieval, outperforming existing sequential decision methods.
Contribution
The paper presents a novel global decision model for list truncation using transformers and RAML, directly optimizing practical user-defined objectives.
Findings
AttnCut outperforms state-of-the-art baselines on Robust04 and MQ2007 datasets.
Direct optimization of user objectives improves truncation effectiveness.
Transformer architecture captures global dependencies in ranked lists.
Abstract
Ranked list truncation is of critical importance in a variety of professional information retrieval applications such as patent search or legal search. The goal is to dynamically determine the number of returned documents according to some user-defined objectives, in order to reach a balance between the overall utility of the results and user efforts. Existing methods formulate this task as a sequential decision problem and take some pre-defined loss as a proxy objective, which suffers from the limitation of local decision and non-direct optimization. In this work, we propose a global decision based truncation model named AttnCut, which directly optimizes user-defined objectives for the ranked list truncation. Specifically, we take the successful transformer architecture to capture the global dependency within the ranked list for truncation decision, and employ the reward augmented…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsMulti-Criteria Decision Making · Domain Adaptation and Few-Shot Learning · Machine Learning and Algorithms
