Optimize What You Evaluate With: Search Result Diversification Based on Metric Optimization
Hai-Tao Yu
Abstract
Most of the existing methods for search result diversification (SRD) appeal to the greedy strategy for generating diversified results, which is formulated as a sequential process of selecting documents one-by-one, and the locally optimal choice is made at each round. Unfortunately, this strategy suffers from the following shortcomings: (1) Such a one-by-one selection process is rather time-consuming for both training and inference. (2) It works well on the premise that the preceding choices are optimal or close to the optimal solution. (3) The mismatch between the objective function used in training and the final evaluation measure used in testing has not been taken into account. We propose a novel framework through direct metric optimization for SRD (referred to as MO4SRD) based on the score-and-sort strategy. Specifically, we represent the diversity score of each document that determines its rank position based on a probability distribution. These distributions over scores naturally give rise to expectations over rank positions. Armed with this advantage, we can get the differentiable variants of the widely used diversity metrics. Thanks to this, we are able to directly optimize the evaluation measure used in testing. Moreover, we have devised a novel probabilistic neural scoring function. It jointly scores candidate documents by taking into account both cross-document interaction and permutation equivariance, which makes it possible to generate a diversified ranking via a simple sorting. The experimental results on benchmark collections show that the proposed method achieves significantly improved performance over the state-of-the-art results.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on7
- SetRank: Learning a Permutation-Invariant Ranking Model for Information RetrievalLiang Pang, Jun Xu, Qingyao Ai, Yanyan Lan et al.SIGIR 2020 · 113 citations
- Diversified Interactive Recommendation with Implicit FeedbackYong Liu, Yingtai Xiao, Qiong Wu, Chunyan Miao et al.AAAI 2020 · 67 citations
- Diversification-Aware Learning to Rank using Distributed RepresentationLe Yan, Zhen Qin, Rama Kumar Pasumarthi, Xuanhui Wang et al.WWW 2021 · 44 citations
- Are Neural Rankers still Outperformed by Gradient Boosted Decision Trees?Zhen Qin, Le Yan, Honglei Zhuang, Yi Tay et al.ICLR 2021 · 41 citations
- Modeling Intent Graph for Search Result DiversificationZhan Su, Zhicheng Dou, Yutao Zhu, Xubo Qin et al.SIGIR 2021 · 32 citations
Related papers
- Reinforcement Learning to Rank with Pairwise Policy GradientJun Xu, Zeng Wei, Long Xia, Yanyan Lan et al.SIGIR 2020 · 32 citations
- DVGAN: A Minimax Game for Search Result Diversification Combining Explicit and Implicit FeaturesJiongnan Liu, Zhicheng Dou, Xiaojie Wang, Shuqi Lu et al.SIGIR 2020 · 32 citations
- Multi-Objective Ranking Optimization for Product Search Using Stochastic Label AggregationDavid Carmel, Elad Haramaty, Arnon Lazerson, Liane Lewin-EytanWWW 2020 · 48 citations
- IncDSI: Incrementally Updatable Document RetrievalVarsha Kishore, Chao Wan, Justin Lovelace, Yoav Artzi et al.ICML 2023 · 19 citations
- Topic-oriented Adversarial Attacks against Black-box Neural Ranking ModelsYu-An Liu, Ruqing Zhang, Jiafeng Guo, Maarten de Rijke et al.SIGIR 2023 · 20 citations
