Neural Ranking Models With Weak Supervision
2017 · Mostafa Dehghani, Hamed Zamani, Aliaksei Severyn, et al.
Abstract
Despite the impressive improvements achieved by unsupervised deep neural networks in computer vision and NLP tasks, such improvements have not yet been observed in ranking for information retrieval. The reason may be the complexity of the ranking problem, as it is not obvious how to learn from queries and documents when no supervised signal is available. Hence, in this paper, we propose to train a neural ranking model using weak supervision, where labels are obtained automatically without human annotators or any external resources (e.g., click data). To this aim, we use the output of an unsupervised ranking model, such as BM25, as a weak supervision signal. We further train a set of simple yet effective ranking models based on feed-forward neural networks. We study their effectiveness under various learning scenarios (point-wise and pair-wise models) and using different input representations (i.e., from encoding query-document pairs into dense/sparse vectors to using word embedding rep
Authors
(none)
Tags
Stats
Related papers
- Learning More From Less: Towards Strengthening Weak Supervision For Ad-hoc Retrieval (2019)5.84
- Few-shot Prompting For Pairwise Ranking: An Effective Non-parametric Retrieval Model (2024)5.84
- Neural Ranking Models For Document Retrieval (2021)11.08
- A Deep Look Into Neural Ranking Models For Information Retrieval (2019)17.73
- Improving Neural Ranking Models With Traditional IR Methods (2023)0.00
- Domain Adaptation For Dense Retrieval Through Self-supervision By Pseudo-relevance Labeling (2022)0.00
- Neural Models For Information Retrieval (2017)0.00
- An Attention-based Deep Net For Learning To Rank (2017)0.00