Exploration of Unranked Items in Safe Online Learning to Re-Rank

no code implementations • 2 May 2023 • Hiroaki Shiino, Kaito Ariu, Kenshi Abe, Togashi Riku

In this paper, we propose a safe OLTR algorithm that efficiently exchanges one of the items in the current ranking with an item outside the ranking (i. e., an unranked item) to perform exploration.

Learning-To-Rank Safe Exploration