In Online Learning to Rank (OLTR) the aim is to find an optimal ranking model by interacting with users. When learning from user behavior, systems must interact with users while simultaneously learning from those interactions. Unlike other Learning to Rank (LTR) settings, existing research in this field has been limited to linear models. This is due to the speed-quality tradeoff that arises when selecting models: complex models are more expressive and can find the best rankings but need more user interactions to do so, a requirement that risks frustrating users during training. Conversely, simpler models can be optimized on fewer interactions and thus provide a better user experience, but they will converge towards suboptimal rankings. This tradeoff creates a deadlock, since novel models will not be able to improve either the user experience or the final convergence point, without sacrificing the other. Our contribution is twofold. First, we introduce a fast OLTR model called Sim-MGD that addresses the speed aspect of the speed-quality tradeoff. Sim-MGD ranks documents based on similarities with reference documents. It converges rapidly and, hence, gives a better user experience but it does not converge towards the optimal rankings. Second, we contribute Cascading Multileave Gradient Descent (C-MGD) for OLTR that directly addresses the speed-quality tradeoff by using a cascade that enables combinations of the best of two worlds: fast learning and high quality final convergence. C-MGD can provide the better user experience of Sim-MGD while maintaining the same convergence as the state-of-the-art MGD model. This opens the door for future work to design new models for OLTR without having to deal with the speed-quality tradeoff.
Asymmetric Dynamic Routing: Balancing Reasoning Depth and Computational Efficiency in Hypergraph RAG
School of Software Engineering, Xi'an Jiaotong University(西安交通大学软件学院);EHV Power Transmission Company of China Southern Power Grid Co., Ltd.(中国南方电网有限责任公司超高压输电公司)
Research on the Online Update Method for Retrieval-Augmented Generation (RAG) Model with Incremental Learning
School of Engineering and Applied Science(工程与应用科学学院);School of Business(商学院);University of Pennsylvania(宾夕法尼亚大学);Stevens Institute of Technology(史蒂文斯理工学院);College of Engineering(工程学院);College of Computer Sciences(计算机科学学院);Peking University(北京大学);Northeastern University(东北大学);Syracuse University(雪城大学);College of Engineering and Computer Science(工程与计算机科学学院)
GORAG: Graph-based Online Retrieval Augmented Generation for Dynamic Few-shot Social Media Text Classification
The Hong Kong University of Science and Technology(香港科学与技术大学);The Hong Kong Polytechnic University(香港理工大学);Guangzhou HKUST Fok Ying Tung Research Institute(广州HKUST福ying顿研究 institute)
EndoFinder: Online Image Retrieval for Explainable Colorectal Polyp Diagnosis
Digital Medical Research Center, School of Basic Medical Sciences, Fudan University(复旦大学基础医学院数字医学研究中心);Shanghai Institute for Advanced Study of Zhejiang University(浙江大学上海高等研究院);Endoscopy Center and Endoscopy Research Institute, Zhongshan Hospital, Fudan University(复旦大学附属中山医院内镜中心及内镜研究所);School of Computer Science and Engineering, Nanjing University of Science and Technology(南京理工大学计算机科学与工程学院);Alliance Manchester Business School, The University of Manchester(曼彻斯特大学联盟曼彻斯特商学院)
PinView: Implicit Feedback in Content-Based Image Retrieval
University College London(伦敦大学学院);Aalto University(阿尔托大学);University of Helsinki(赫尔辛基大学);University of Leoben(莱奥本大学);King Mongkut’s Institute of Technology Ladkrabang(先皇理工学院)
LightRetriever: A LLM-based Text Retrieval Architecture with Extremely Faster Query Inference
Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);School of Cyber Security, University of Chinese Academy of Sciences(中国科学院大学网络安全学院);Langboat Technology(兰舟科技)