Test-time Multi-agent Coordination by Decomposed Value Gradient Flow
On the map: LLM agents and tool use → Reinforcement learning for LLM agents
also in 1 more
Abstract (arXiv)
Offline multi-agent reinforcement learning (MARL) faces a persistent trade-off. Expressive generative policies can represent multi-modal coordination in the data, but cannot distinguish high-value regions, while value-optimized policies exploit the learned Q-function but collapse the multi-modal into a single dominant mode. A single agent's mode collapse can break joint coordination, and simultaneous drift across agents can push the joint policy into unseen regions of the action space. We propose scalable coordination via optimal unified transport (SCOUT), the first offline MARL framework to combine a generative foundation model with a learned value function through test-time action refinement. SCOUT trains two decoupled components: a flow-matching behavioral prior and a decomposed value function. At test-time, it transports behavioral samples toward high-value regions via Stein variational gradient descent. The number of transport steps controls adaptive test-time scaling, replacing a fixed regularization coefficient. Under the individual-global-max (IGM) principle, we prove a single-term KL bound on the joint soft-value gap that vanishes as transport converges, with an irreducible additive residual proportional to the IGM violation. Empirically, SCOUT achieves the best average performance across discrete and continuous offline MARL benchmarks and yields performance improvements in all offline-to-online configurations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Reinforcement learning for LLM agents, one of 16 directions in LLM agents and tool use. First posted on arXiv 1 Oct 2026.
Builds on
No reference list yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Offline Multi-agent Reinforcement Learning via Sequential Score Decomposition
- 2026Value-Guidance MeanFlow for Offline Multi-Agent Reinforcement Learning
- 2026G2MAF: Test-Time Gradient Guidance for Multi-Agent Flow Policies
- 2023A Model-Based Solution to the Offline Multi-Agent Reinforcement Learning Coordination Problem
- 2025OM2P: Offline Multi-Agent Mean-Flow Policy
- 2025Multi-agent Coordination via Flow Matching
- 2026A Recipe for Stable Offline Multi-agent Reinforcement Learning
- 2026CODA: Coordination via On-Policy Diffusion for Multi-Agent Offline Reinforcement Learning