MARS2: Scaling Multi-Agent Tree Search via Reinforcement Learning for Code Generation
Not on the map. Why?
Abstract (arXiv)
Reinforcement learning (RL) paradigms have demonstrated strong performance on reasoning-intensive tasks such as code generation. However, limited trajectory diversity often leads to diminishing returns, which constrains the achievable performance ceiling. Search-enhanced RL alleviates this issue by introducing structured exploration, which remains constrained by the single-agent policy priors. Meanwhile, leveraging multiple interacting policies can acquire more diverse exploratory signals, but existing approaches are typically decoupled from structured search. We propose MARS2 (Multi-Agent Reinforced Tree-Search Scaling), a unified RL framework in which multiple independently-optimized agents collaborate within a shared tree-structured search environment. MARS2 models the search tree as a learnable multi-agent interaction environment, enabling heterogeneous agents to collaboratively generate and refine candidate solutions within a shared search topology. To support effective learning, we introduce a path-level group advantage formulation based on tree-consistent reward shaping, which facilitates effective credit assignment across complex search trajectories. Experiments on code generation benchmarks show that MARS2 consistently improves performance across diverse model combinations and training settings, demonstrating the effectiveness of coupling multi-agent collaboration with tree search for enhancing reinforcement learning. Our code is publicly available at https://github.com/TsinghuaC3I/MARTI.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 26 references that are in the map. First posted on arXiv 16 Apr 2026.
Builds on
18 of 26 references.
References · 18
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
- 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,519
- 2023PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallelcited by 641
- 2025Absolute Zero: Reinforced Self-play Reasoning with Zero Datacited by 323
- 2025A Survey on Test-Time Scaling in Large Language Models: What, How, Where, and How Well?cited by 215
- 2017A Survey of Learning in Multiagent Environments: Dealing with Non-Stationaritycited by 93
- 2025MAPoRL: Multi-Agent Post-Co-Training for Collaborative Large Language Models with Reinforcement Learningcited by 80
- 2025Outcome-based Exploration for LLM Reasoningcited by 79
- 2025TreeRL: LLM Reinforcement Learning with On-Policy Tree Searchcited by 75
- 2025TreePO: Bridging the Gap of Policy Optimization and Efficacy and Inference Efficiency with Heuristic Tree-based Modelingcited by 60
- 2025Evaluating the Diversity and Quality of LLM Generated Contentcited by 51
6 more
- 2025Wider or Deeper? Scaling LLM Inference-Time Compute with Adaptive Branching Tree Searchcited by 48
- 2025Prismatic Synthesis: Gradient-based Data Diversification Boosts Generalization in LLM Reasoningcited by 38
- 2025Efficient Code Embeddings from Code Generation Modelscited by 12
- 2025How Diversely Can Language Models Solve Problems? Exploring the Algorithmic Diversity of Model-Generated Codecited by 9
- 2025ReST-RL: Reinforcing LLM Reasoning through Unified Self-Training and Value-Guided Searchcited by 9
- 2025MarsRL: Advancing Multi-Agent Reasoning System via Reinforcement Learning with Agentic Pipeline Parallelismcited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.