Reinforcement Learning for Effective Few-Shot Ranking
Neural rankers have achieved strong retrieval effectiveness but require large amounts of labeled data, limiting their applicability in few-shot settings. In this paper, we address the sample inefficiency of neural ranking methods by introducing a Reinforcement Learning (RL)-based re-ranking model that achieves high effectiveness with minimal training data. Built on a Deep Q-learning Network (DQN) framework, our approach is designed for few-shot settings, maximizing sample efficiency to ensure robust generalization from limited interactions. Extensive experiments show that our model significantly outperforms data-intensive methods and existing few-shot baselines, demonstrating RL's potential to enhance IR capabilities in few-shot scenarios.
Authors
- Shirin Seyedsalehi (ORCID: https://orcid.org/0009-0006-1467-1659)
- Ebrahim Bagheri (ORCID: https://orcid.org/0000-0002-5148-6237)
- Fattane Zarrinkalam (ORCID: https://orcid.org/0000-0002-2102-9190)
- Sajad Ebrahimi (ORCID: https://orcid.org/0009-0003-1630-3938)
- Shiva Soleimany (ORCID: https://orcid.org/0009-0006-8518-7514)
Institutions
- University of Toronto (CA)
- Toronto Metropolitan University (CA)
- University of Guelph (CA)
Publication Details
- Published
- 2025-07-13
- DOI
- https://doi.org/10.1145/3726302.3730243
- Primary Topic
- Advanced Bandit Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00