Scalable Exploration for Neural Online Learning to Rank with Perturbed Feedback
Yiling Jia, Hongning Wang
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on9
- Neural Contextual Bandits with UCB-based ExplorationDongruo Zhou, Lihong Li, Quanquan GuICML 2020 · 329 citations
- Generalization Error Bounds of Gradient Descent for Learning Over-Parameterized Deep ReLU NetworksYuan Cao, Quanquan GuAAAI 2020 · 168 citations
- Neural Thompson SamplingWeitong Zhang, Dongruo Zhou, Lihong Li, Quanquan GuICLR 2021 · 152 citations
- How Much Over-parameterization Is Sufficient to Learn Deep ReLU Networks?Zixiang Chen, Yuan Cao, Difan Zou, Quanquan GuICLR 2021 · 29 citations
- PairRank: Online Pairwise Learning to Rank by Divide-and-ConquerYiling Jia, Huazheng Wang, Stephen D. Guo, Hongning WangWWW 2021 · 24 citations
Related papers
- Learning Neural Ranking Models Online from Implicit User FeedbackYiling Jia, Hongning WangWWW 2022 · 6 citations
- LT2R: Learning to Online Learning to Rank for Web SearchXiaokai Chu, Changying Hao, Shuaiqiang Wang, Dawei Yin et al.ICDE 2024 · 1 citation
- How do Online Learning to Rank Methods Adapt to Changes of Intent?Shengyao Zhuang, Guido ZucconSIGIR 2021 · 6 citations
- Unified Off-Policy Learning to Rank: a Reinforcement Learning PerspectiveZeyu Zhang, Yi Su, Hui Yuan, Yiran Wu et al.NeurIPS 2023 · 9 citations
- Deep Ranking Ensembles for Hyperparameter OptimizationAbdus Salam Khazi, Sebastian Pineda-Arango, Josif GrabockaICLR 2023 · 1 citation
