Selective Weak Supervision for Neural Information Retrieval

38Citations
Citations of this article
60Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Zhang, K., Xiong, C., Liu, Z., & Liu, Z. (2020). Selective Weak Supervision for Neural Information Retrieval. In The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020 (pp. 474–485). Association for Computing Machinery, Inc. https://doi.org/10.1145/3366423.3380131

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free