Test-time Multi-agent Coordination by Decomposed Value Gradient Flow
cs.LG, cs.RO
Submitted: 2026-10-01
Updated: 2026-10-01
Comments: NeurIPS 2026
Code: https://github.com/DongsuLeeTech/scout
License: http://creativecommons.org/licenses/by/4.0/
The gist: Offline multi-agent reinforcement learning (MARL) faces a persistent trade-off.
Terminology
Abstract
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.
Sources
- Safe, Multi-Agent, Reinforcement Learning for Autonomous Driving
- Policy Agnostic RL: Offline RL and Online RL Fine-Tuning of Any Class and Backbone
- IDQL: Implicit Q-Learning as an Actor-Critic Method with Diffusion Policies
- Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problems
- A Recipe for Stable Offline Multi-agent Reinforcement Learning
- Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learning
- The Invisible Leash: Why RLVR May or May Not Escape Its Origin
- Flow Matching Guide and Code
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks