SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2501.15228 · NeurIPS · 2025

Improving Retrieval-Augmented Generation through Multi-Agent Reinforcement Learning

Yiming Yang, Yi Zhang, Weiwei Sun, Shuaiqiang Wang, Dawei Yin, Xinyu Ma, Lingyong Yan, Yiqun Chen, Jiaxin Mao

arXiv · PDF · Open in the Atlas

Code that ran

4 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 failures of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2501.15228.json · badge: /api/ran/2501.15228.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
chenyiqun/MMOA-RAG canonical (classifier label)
classifier basis: classifier_2025
4 ran · 1 no recorded run
FunctionStatusWhere it lives
calculate_match_ratio Ran
ran, honoured the contract we drafted
chenyiqun/MMOA-RAG/LLaMA-Factory/src/llamafactory/train/ppo/trainer_qr_s_g.py
pointer only (licence: NONE) · get_code("56f425db8dfd78ff")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, chenyiqun/MMOA-RAG when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

clean_and_split Ran
ran; our contract draft was wrong, not the code
chenyiqun/MMOA-RAG/LLaMA-Factory/src/llamafactory/train/ppo/trainer_qr_s_g.py
pointer only (licence: NONE) · get_code("3446d6ee423d9310")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, chenyiqun/MMOA-RAG when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

mean_pooling Ran
ran; our contract draft was wrong, not the code
chenyiqun/MMOA-RAG/evaluate_qr_s_g.py
pointer only (licence: NONE) · get_code("fe0e2df4d9cb5edd")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, chenyiqun/MMOA-RAG when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

remove_punctuation Ran
ran; our contract draft was wrong, not the code
chenyiqun/MMOA-RAG/LLaMA-Factory/src/llamafactory/train/ppo/trainer_qr_s_g.py
pointer only (licence: NONE) · get_code("a6d95c1b612d9b81")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, chenyiqun/MMOA-RAG when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

normalize_answer_final Not yet run
unverified (harvested, no recorded run)
chenyiqun/MMOA-RAG/evaluate_qr_s_g.py
pointer only (licence: NONE) · get_code("8d8661f12921b6ce")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, chenyiqun/MMOA-RAG when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 1 later) and 4 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
mean_pooling 15 other papers
8 dated earlier, 6 later, 1 same year, order not determinable
2304.11406 (2023-04)
LaMP: When Large Language Models Meet Personalization
2305.18395 (2023-05)
Knowledge-Augmented Reasoning Distillation for Small Language Models in Knowledge-Intensive Tasks
2308.04275 (2023-08)
In-Context Alignment: Chat with Vanilla Language Models Before Fine-Tuning
and 12 more not named here

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Retrieval-augmented generation (RAG) is widely utilized to incorporate external knowledge into large language models, thereby enhancing factuality and reducing hallucinations in question-answering (QA) tasks. A standard RAG pipeline consists of several components, such as query rewriting, document retrieval, document filtering, and answer generation. However, these components are typically optimized separately through supervised fine-tuning, which can lead to misalignments between the objectives of individual components and the overarching aim of generating accurate answers. Although recent efforts have explored using reinforcement learning (RL) to optimize specific RAG components, these approaches often focus on simple pipelines with only two components or do not adequately address the complex interdependencies and collaborative interactions among the modules. To overcome these limitations, we propose treating the complex RAG pipeline with multiple components as a multi-agent cooperative task, in which each component can be regarded as an RL agent. Specifically, we present MMOA-RAG 2 , Multi-Module joint Optimization Algorithm for RAG, which employs multi-agent reinforcement learning to harmonize all agents' goals toward a unified reward, such as the F1 score of the final answer. Experiments conducted on various QA benchmarks demonstrate that MMOA-RAG effectively boost the overall performance of the pipeline and outperforms existing baselines. Furthermore, comprehensive ablation studies validate the contributions of individual components and demonstrate MMOA-RAG can be adapted to different RAG pipelines and benchmarks.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2501.15228")
get_code_for_paper("2501.15228")
have("2501.15228")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2501.15228.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2501.15228.svg)](https://syntology.ai/paper/2501.15228)

Connect an agent — have() is free.