Selective Weak Supervision for Neural Information Retrieval
Not on the map. Why?
Abstract (arXiv)
This paper democratizes neural information retrieval to scenarios where large scale relevance training signals are not available. We revisit the classic IR intuition that anchor-document relations approximate query-document relevance and propose a reinforcement weak supervision selection method, ReInfoSelect, which learns to select anchor-document pairs that best weakly supervise the neural ranker (action), using the ranking performance on a handful of relevance labels as the reward. Iteratively, for a batch of anchor-document pairs, ReInfoSelect back propagates the gradients through the neural ranker, gathers its NDCG reward, and optimizes the data selection network using policy gradients, until the neural ranker's performance peaks on target relevance metrics (convergence). In our experiments on three TREC benchmarks, neural rankers trained by ReInfoSelect, with only publicly available anchor data, significantly outperform feature-based learning to rank methods and match the effectiveness of neural rankers trained with private commercial search logs. Our analyses show that ReInfoSelect effectively selects weak supervision signals based on the stage of the neural ranker training, and intuitively picks anchor-document pairs similar to query-document pairs.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 1; 2024: 3.
10 papers.
- 2021MS MARCO: Benchmarking Ranking Models in the Large-Data Regimecited by 28
- 2024Utilizing BERT for Information Retrieval: Survey, Applications, Resources, and Challengescited by 20
- 2022ClueWeb22: 10 Billion Web Documents with Visual and Semantic Informationcited by 19
- 2022Low-Resource Dense Retrieval for Open-Domain Question Answering: A Comprehensive Surveycited by 14
- 2022P^3 Ranker: Mitigating the Gaps between Pre-training and Ranking Fine-tuning with Prompt-based Learning and Pre-finetuningcited by 7
- 2021Domain-Specific Pretraining for Vertical Search: Case Study on Biomedical Literaturecited by 6
- 2024Selecting Subsets of Source Data for Transfer Learning with Applications in Metal Additive Manufacturingcited by 3
- 2023Unsupervised Dense Retrieval Training with Web Anchorscited by 1
- 2022Coherence-Based Distributed Document Representation Learning for Scientific Documentscited by 0
- 2024Domain Adaptation of Multilingual Semantic Search -- Literature Reviewcited by 0
- 2024Utilizing BERT for Information Retrieval: Survey, Applications, Resources, and Challenges18 Feb 2024
- 2024Domain Adaptation of Multilingual Semantic Search -- Literature Review5 Feb 2024
- 2024Selecting Subsets of Source Data for Transfer Learning with Applications in Metal Additive Manufacturing16 Jan 2024
- 2023Unsupervised Dense Retrieval Training with Web Anchors10 May 2023
- 2022ClueWeb22: 10 Billion Web Documents with Visual and Semantic Information29 Nov 2022
- 2022Low-Resource Dense Retrieval for Open-Domain Question Answering: A Comprehensive Survey5 Aug 2022
- 2022P^3 Ranker: Mitigating the Gaps between Pre-training and Ranking Fine-tuning with Prompt-based Learning and Pre-finetuning4 May 2022
- 2022Coherence-Based Distributed Document Representation Learning for Scientific Documents8 Jan 2022
- 2021Domain-Specific Pretraining for Vertical Search: Case Study on Biomedical Literature25 Jun 2021
- 2021MS MARCO: Benchmarking Ranking Models in the Large-Data Regime9 May 2021