paper-with-me

홈 › Papers

Scalable Exploration for Neural Online Learning to Rank with Perturbed Feedback

2022-06-13 · Yiling Jia, Hongning Wang

Deep neural networks (DNNs) demonstrate significant advantages in improving ranking performance in retrieval tasks. Driven by the recent technical developments in optimization and generalization of DNNs, learning a neural ranking model online from its interactions with users becomes possible. However, the required exploration for model learning has to be performed in the entire neural network parameter space, which is prohibitively expensive and limits the application of such online solutions in practice. In this work, we propose an efficient exploration strategy for online interactive neural ranker learning based on the idea of bootstrapping. Our solution employs an ensemble of ranking models trained with perturbed user click feedback. The proposed method eliminates explicit confidence set construction and the associated computational overhead, which enables the online neural rankers' training to be efficiently executed in practice with theoretical guarantees. Extensive comparisons with an array of state-of-the-art OL2R algorithms on two public learning to rank benchmark datasets demonstrate the effectiveness and computational efficiency of our proposed neural OL2R solution.

📄 PDF Abstract BibTeX arXiv:2206.05954

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyEfficient ExplorationLearning-To-RankRetrieval

Similar Papers 제목 키워드 기반

BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback

2018-06-15 · Chang Li, Branislav Kveton, Tor Lattimore, Ilya Markov 외

In this paper, we study the problem of safe online learning to re-rank, where user feedback is used to improve the quality of displayed lists. Learning to rank has traditionally been studied in two settings. In the offli…

Learning-To-RankRe-RankingSafe Exploration

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

2023-05-02 · Hiroaki Shiino, Kaito Ariu, Kenshi Abe, Togashi Riku

Bandit algorithms for online learning to rank (OLTR) problems often aim to maximize long-term revenue by utilizing user feedback. From a practical point of view, however, such algorithms have a high risk of hurting user …

Learning-To-RankSafe Exploration

Data-dependent Exploration for Online Reinforcement Learning from Human Feedback

2026-05-06 · Zhen-Yu Zhang, Yuting Tang, Jiandong Zhang, Lanjihong Ma 외 arxiv

Online reinforcement learning from human feedback (RLHF) has emerged as a promising paradigm for aligning large language models (LLMs) by continuously collecting new preference feedback during training. A foundational ch…

Reinforcement Learning

Calibrating Explore-Exploit Trade-off for Fair Online Learning to Rank

2021-11-01 · Yiling Jia, Hongning Wang

Online learning to rank (OL2R) has attracted great research interests in recent years, thanks to its advantages in avoiding expensive relevance labeling as required in offline supervised ranking model learning. Such a so…

FairnessLearning-To-Rank

Efficient Exploration of Gradient Space for Online Learning to Rank

2018-05-18 · Huazheng Wang, Ramsey Langley, Sonwoo Kim, Eric McCord-Snook 외

Online learning to rank (OL2R) optimizes the utility of returned search results based on implicit feedback gathered directly from users. To improve the estimates, OL2R algorithms examine one or more exploratory gradient …

Efficient ExplorationLearning-To-Rank