Learning to Deliberate: Meta-policy Collaboration for Agentic LLMs with Multi-agent Reinforcement Learning

Wei Yang, Jesse Thomason

TL;DR

This paper introduces the Meta-Policy Deliberation Framework (MPDF), which moves multi-agent LLM systems away from rigid, "hard-coded" debate protocols toward learned, adaptive strategies. By using a novel reinforcement learning algorithm called SoftRankPO, agents learn to choose between persisting, refining, or conceding based on their internal confidence, resulting in higher accuracy and a 30% reduction in token costs.

What Problem Does This Paper Address?

Current multi-agent systems (MAS) for LLMs usually rely on "macro-level" orchestration—fixed rules like "Agent A debates Agent B for three rounds." The authors argue this creates a Meta-Cognitive Blindspot. In these static setups, agents act as passive executors; they don't account for their own internal states, such as uncertainty or confidence.

If an agent is 99% sure it has the right answer, a static protocol might still force it to "refine" its answer or listen to a less-confident peer, leading to "noise accumulation" and wasted computation. The challenge is teaching agents a "meta-policy": the ability to strategically decide how to interact based on the evolving context of a problem.

Methods

The researchers formulated multi-agent collaboration as a Decentralized Partially Observable Markov Decision Process (Dec-POMDP).

1. The Meta-Policy Deliberation Framework (MPDF)

Instead of just generating text, each agent is equipped with a lightweight policy network that chooses from three discrete high-level actions:

  • Persist: Keep the current solution (used when confident).
  • Refine: Trigger an internal self-correction process.
  • Concede: Adopt a peer’s solution (used when a peer's answer seems higher quality).

2. SoftRankPO

Training these policies is difficult because rewards in reasoning tasks are often sparse and noisy. Standard RL algorithms like PPO or GRPO can be sensitive to reward scaling. The authors developed SoftRankPO, which stabilizes learning by:

  • Converting raw rewards into rank-based advantages.
  • Mapping these ranks through smooth normal quantiles (Gaussian percentiles).
  • This makes the learning process "scale-resilient," meaning it doesn't break down if rewards vary wildly between different math problems.

3. Consensus-Driven Reward Shaping

Agents are rewarded based on two factors: local self-improvement (did my answer get better?) and global influence (did my contribution help the group reach the correct consensus?).

Datasets

The framework was evaluated across six diverse benchmarks using backbones like Llama-3 and Qwen-2.5:

  • Mathematical Reasoning: GSM8K, MATH, AIME, and AMC.
  • General Knowledge: MMLU.
  • Code Generation: HumanEval.

Key Insights and Ideas

  • From Collaboration to Coordination: As agents trained, their behavior shifted dramatically. In early stages (SFT), agents were "exploratory," often choosing to refine or concede. After RL, the "Persist" rate jumped from 19.1% to 78.8%. The agents learned to recognize high-quality outputs early and stop unnecessary debating.
  • The Principle of Minimal Intervention: The model naturally learned that "less is more." By intervening only when they perceived a meaningful chance for improvement, the agents became more accurate while being much more efficient.
  • Robustness to "Reward Noise": SoftRankPO proved significantly more stable than GRPO. While GRPO's performance could fluctuate based on how rewards were scaled, SoftRankPO maintained a steady improvement curve regardless of the reward magnitude.

Key Results

  • Superior Accuracy: MPDF with SoftRankPO achieved a 55.74% average accuracy across all benchmarks, outperforming state-of-the-art dynamic methods like AgentPrune and DyLAN.
  • Efficiency Gains: The system achieved a 29.96% reduction in total token usage compared to the standard LLM-Debate baseline. It reached better answers using roughly 47k tokens vs. the baseline's 67k.
  • Scalability: The framework scales well with the number of agents (tested up to 6) and communication rounds, though it shows diminishing returns after 4 rounds, suggesting a "sweet spot" for deliberation depth.

Limitations and Future Work

  • Diminishing Returns: The authors noted that performance slightly dropped at 5 rounds of deliberation, likely due to noise accumulation or "over-thinking."
  • Critic Dependency: The "Introspective Confidence" measure relies on the LLM acting as its own critic. If the backbone model has poor self-evaluation capabilities, the meta-policy may struggle.
  • Future Directions: The authors suggest exploring more complex action spaces beyond the three core actions and testing the framework on even more subjective tasks where "correctness" isn't as binary as a math problem.

Loading related content...