Learning to Rank for Multiple Retrieval-Augmented Models through Iterative Utility Maximization

Alireza Salemi, Hamed Zamani
10/13/2024
cs.CLcs.IR

No confident code implementation found for this paper.

Abstract

This paper investigates the design of a unified search engine to serve multiple retrieval-augmented generation (RAG) agents, each with a distinct task, backbone large language model (LLM), and RAG strategy. We introduce an iterative approach where the search engine generates retrieval results for the RAG agents and gathers feedback on the quality of the retrieved documents during an offline phase. This feedback is then used to iteratively optimize the search engine using an expectation-maximization algorithm, with the goal of maximizing each agent's utility function. Additionally, we adapt this to an online setting, allowing the search engine to refine its behavior based on real-time individual agents feedback to better serve the results for each of them. Experiments on datasets from the Knowledge-Intensive Language Tasks (KILT) benchmark demonstrates that our approach significantly on average outperforms baselines across 18 RAG models. We demonstrate that our method effectively ``personalizes'' the retrieval for each RAG agent based on the collected feedback. Finally, we provide a comprehensive ablation study to explore various aspects of our method.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{salemi2024learning,
  title  = {Learning to Rank for Multiple Retrieval-Augmented Models through Iterative Utility Maximization},
  author = {Alireza Salemi and Hamed Zamani},
  year   = {2024},
  eprint = {2410.09942},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.09942v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.09942.svg)](https://codeofpaper.com/paper/2410.09942)

Discussion