CREW (Collaborative Reinforcement Learning for Related Work Generation) is proposed, a novel framework where LLM agents bypass heuristic pipelines to dynamically coordinate by autonomously selecting actions, driven by a policy optimized via Independent Proximal Policy Optimization (IPPO).
Abstract
Automatic Related Work Generation (RWG) significantly reduces the human time and effort required to author the Related Work Section (RWS) of a research paper. However, prior methods leveraging multi-agent Large Language Models (LLMs) typically rely on a predefined workflow, where each agent is responsible for a specific step in the entire process. This rigid, static inter-agent coordination limits the adaptive collaboration required to synthesize complex scientific literature. To address this limitation, we propose CREW (Collaborative Reinforcement Learning for Related Work Generation), a novel framework where LLM agents bypass heuristic pipelines to dynamically coordinate by autonomously selecting actions, such as Retrieve, Disseminate, Compose, and Critique, driven by a policy optimized via Independent Proximal Policy Optimization (IPPO). Extensive experiments on a standard RWG benchmark demonstrate that our approach yields substantial quality improvements over strong existing baselines, while significantly reducing token costs. Code is available at https://github.com/YenPBao/CREW-Collaborative-MARL.git
G2MAF applies one globally normalized, projected critic gradient to guide and coordinate all agents'corrections while keeping the action both feasible and close to the frozen policy proposal.
Guo-Wei Zou, Hai-Tao Wang, Guo-Xin Wang et al.· 0 citations
UnifiedPlayers, a cooperative framework comprising a Planning Player that generates tasks, an Execution Player that produces multi-turn trajectories with Python tool calls, and an Evaluation Player that constructs executable verifiers, highlights cooperation among specialized players as a promising path toward self-enh...
This work introduces a unified RL formulation that jointly optimizes agent and environment policies, where the environment policy learns graph edge costs to provide global movement guidance via backward Dijkstra search and achieves significant improvements over the strong search-based planner, Causal-PIBT, across multi...
He Jiang, Jingtian Yan, Yulun Zhang et al.· 0 citations
This work instantiates MAPL using MARL from human feedback with a learned reward model and multi-agent direct preference optimization (MADPO), and shows that MAPL can improve collaboration quality and efficiency while approaching the performance of MARL with fixed, well-defined rewards.
Shuo Liu, Xinzichen Li, Tian-Le Chen et al.· 0 citations
This work introduces Compositional Environment Scaling (\textbf{CompoWorld}), which expands the task space by composing a finite library of reusable services, and guides reinforcement learning toward full task completion by emphasizing criteria with lower pass rates within each rollout group.
Xiao-Wen Yang, Wei-Yi Xu, Wen Da et al.· 0 citations
Focusing on multi-agent path finding as an exemplary problem, this paper proposes to simplify two popular approaches to MAPF, namely multi-agent reinforcement learning and adaptive search, to enable seamless combination and transferability of methods without substantial engineering effort.
Thomy Phan· Proceedings of the Thirty-Fi...· 0 citations
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.