Learning A Deep Listwise Context Model For Ranking Refinement
2018 · Qingyao Ai, Keping Bi, Jiafeng Guo, et al.
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 to re-rank the top results. There are three merits with our model: (1) Our model can capture the lo
Authors
(none)
Tags
Stats
Related papers
- Enhancing The Ranking Context Of Dense Retrieval Methods Through Reciprocal Nearest Neighbors (2023)4.52
- CODER: An Efficient Framework For Improving Retrieval Through Contextual Document Embedding Reranking (2021)7.16
- A Deep Look Into Neural Ranking Models For Information Retrieval (2019)17.73
- An Attention-based Deep Net For Learning To Rank (2017)0.00
- LOCORE: Image Re-ranking With Long-context Sequence Modeling (2025)2.26
- Hyqe: Ranking Contexts With Hypothetical Query Embeddings (2024)5.74
- Expertrank: A Multi-level Coarse-grained Expert-based Listwise Ranking Loss (2021)0.00
- Contextually Affinitive Neighborhood Refinery For Deep Clustering (2023)2.26