atlas

Research map / Multi-agent systems and games / LLM agents

Scaling Autonomous Agents via Automatic Reward Modeling And Planning

ICLR 2025 · Multi-agent systems and games › LLM agents · approach: LLM multi-agent decision making · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes ARMAP, which automatically learns a VLM-based reward model from LLM-agent exploration and synthetic positive/negative trajectories, then uses it with best-of-N, Reflexion, or MCTS to improve LLM agents on web, science, and math tasks.

Problem

LLM agents struggle with multi-step decision-making in interactive environments, and collecting agent trajectory data or relying on commercial LLM APIs for fine-tuning or evaluation is costly and restricted.

Approach

Learn a lightweight reward model without human labels by having an LLM agent explore environments, relabel trajectories with refined task intents, and synthesize negative trajectories; then plug this reward model into multiple planning algorithms at inference time without fine-tuning the policy LLMs.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the learned reward model with MCTS instead of greedy decodingPhi3.8B agent · ScienceWorld seenscore: 9.5 -> 28.3Helped
Use the learned reward model with Best-of-N instead of greedy decodingLlama8B agent · ScienceWorld seenscore: 29.9 -> 35.7Helped
Use the learned reward model with MCTS instead of samplingLlama70B agent · Game of 24success rate: 9.6 -> 24.0Helped
Add a length penalty to the reward target (ablation)ARMAP-M with Llama70B · Webshopaverage action length: 4.5 -> 4.0Helped
Add a length penalty to the reward target (ablation)ARMAP-M with Llama70B · Webshopaverage product price: 97.9 -> 102.1Helped
Remove learned reward-model guidance (ablation)ARMAP-M · ScienceWorld seenscore: 28.3 -> 26.5Hurt
Train a policy model with supervised fine-tuning rather than use ARMAP planning (ablation)VILA3B policy and Phi3.8B agent · ScienceWorld seenscore: 18.6 vs 28.3Hurt
Train the reward model with pairwise comparison rather than binary classification (ablation)ARMAP on ScienceWorld · ScienceWorld seen and unseenscore: 57.0 -> 59.0; 55.4 -> 56.7Helped
Include visual input in the reward model (ablation)ARMAP-R with Llama70B · Webshopmatching reward: 56.1 -> 56.5Helped
Include visual input in the reward model (ablation)ARMAP-B with Mistral7B · Webshopmatching reward: 51.3 -> 54.4Helped
Use VILA-13B instead of VILA-3B as the reward-model backbone (ablation)ARMAP-B · ScienceWorld seenscore: 57.3 -> 61.2; 35.7 -> 34.3; 24.5 -> 26.0; 20.0 -> 19.5Mixed
Use 1/5 of the original reward-model training data (ablation)ARMAP-B with VILA-3B reward model · ScienceWorld seenscore: 57.3 -> 52.1; 35.7 -> 31.4; 24.5 -> 22.6; 20.0 -> 17.9Hurt

Surprising findings

Limitations

Experimental setup

Datasets: WebShop ScienceWorld Game of 24 ALFWorld AgentClinic

Benchmarks: WebShop ScienceWorld Game of 24 ALFWorld AgentClinic

Metrics: success rate matching reward average action length average price

Baselines: Sampling Greedy Reflexion SFT-Policy

Builds on: Reflexion ReAct Monte Carlo Tree Search VILA Bradley-Terry pairwise reward modeling

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy