mlsanityData to 7 Oct 2026

Passage Ranking with Weak Supervision

arXiv 1905.05910 ↗First posted 15 May 2019cs.IR cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a textitweak supervision framework for neural ranking tasks based on the data programming paradigm citepRatner2016, which enables us to leverage multiple weak supervision signals from different sources. Empirically, we consider two sources of weak supervision signals, unsupervised ranking functions and semantic feature similarities. We train a BERT-based passage-ranking model (which achieves new state-of-the-art performances on two benchmark datasets with full supervision) in our weak supervision framework. Without using ground-truth training labels, BERT-PR models outperform BM25 baseline by a large margin on all three datasets and even beat the previous state-of-the-art results with full supervision on two of the datasets.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 2; 2023: 0; 2024: 1.

5 papers.