CMAD: Cooperative Multi-Agent Diffusion via Stochastic Optimal Control
Continuous-time generative models have achieved remarkable success in image restoration and synthesis. However, controlling the composition of multiple pre-trained models remains an open challenge. Current approaches largely treat composition as an algebraic composition of probability densities, such as via products or mixtures of experts. This perspective assumes the target distribution is known explicitly, which is almost never the case. In this work, we propose a different paradigm that formulates compositional generation as a cooperative Stochastic Optimal Control problem. Rather than combining probability densities, we treat pre-trained diffusion models as interacting agents whose diffusion trajectories are jointly steered, via optimal control, toward a shared objective defined on their aggregated output. We validate our framework on conditional MNIST generation and compare it against a naïve inference-time DPS-style baseline replacing learned cooperative control with per-step gradient guidance.
Code (0)
등록된 구현이 없습니다.
Tasks
Image RestorationSimilar Papers 제목 키워드 기반
Cluster-Based Multi-Agent Task Scheduling for Space-Air-Ground Integrated Networks
The Space-Air-Ground Integrated Network (SAGIN) framework is a crucial foundation for future networks, where satellites and aerial nodes assist in computational task offloading. The low-altitude economy, leveraging the f…
ClusteringMulti-agent Reinforcement LearningSchedulingDistributed Least Squares Algorithm for Continuous-time Stochastic Systems Under Cooperative Excitation Condition
In this paper, we study the distributed adaptive estimation problem of continuous-time stochastic dynamic systems over sensor networks where each agent can only communicate with its local neighbors. A distributed least s…
Cooperative Multi-Agent Bandits with Heavy Tails
We study the heavy-tailed stochastic bandit problem in the cooperative multi-agent setting, where a group of agents interact with a common bandit problem, while communicating on a network with delays. Existing algorithms…
Weighted Double Deep Multiagent Reinforcement Learning in Stochastic Cooperative Environments
Recently, multiagent deep reinforcement learning (DRL) has received increasingly wide attention. Existing multiagent DRL algorithms are inefficient when facing with the non-stationarity due to agents update their policie…
Deep Reinforcement LearningQ-Learningreinforcement-learningReinforcement Learning+1Diffusion Adaptation over Networks
Adaptive networks are well-suited to perform decentralized information processing and optimization tasks and to model various types of self-organized and complex behavior encountered in nature. Adaptive networks consist …
Distributed Optimization