TL;DR
This paper introduces a deep listwise context model that refines ranking results by leveraging the feature distribution of top documents, improving retrieval performance over existing methods.
Contribution
It proposes a novel neural network-based approach that captures local ranking context and enhances initial rankings using an attention-based loss function.
Findings
Significant improvement over state-of-the-art ranking methods
Effective modeling of local context with neural networks
Compatible with existing learning-to-rank frameworks
Abstract
Learning to rank has been intensively studied and widely applied in information retrieval. Typically, a global ranking function is learned from a set of labeled data, which can achieve good performance on average but may be suboptimal for individual queries by ignoring the fact that relevant documents for different queries may have different distributions in the feature space. Inspired by the idea of pseudo relevance feedback where top ranked documents, which we refer as the \textit{local ranking context}, can provide important information about the query's characteristics, we propose to use the inherent feature distributions of the top results to learn a Deep Listwise Context Model that helps us fine tune the initial ranked list. Specifically, we employ a recurrent neural network to sequentially encode the top results using their feature vectors, learn a local context model and use it…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
