Scalable Exploration For Neural Online Learning To Rank With Perturbed Feedback

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

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyjia2022scalable

Related papers

• On The Calibration And Uncertainty Of Neural Learning To Rank Models (2021)0.00
• GUITAR: Gradient Pruning Toward Fast Neural Ranking (2023)2.26
• Neural Ranking Models With Weak Supervision (2017)17.02
• An Attention-based Deep Net For Learning To Rank (2017)0.00
• A Deep Look Into Neural Ranking Models For Information Retrieval (2019)17.73
• Towards Axiomatic Explanations For Neural Ranking Models (2021)10.35
• Pylate: Flexible Training And Retrieval For Late Interaction Models (2025)3.58
• Optimization Of Rank Losses For Image Retrieval (2023)9.43