EVA-Gen: When Perception Learns from Value via Generative Models in Decentralized Multi-Agent Systems
Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 472-480.
https://doi.org/10.24963/ijcai.2026/54
Keywords
- Agent-based and Multi-agent Systems: Multi-agent learning
- Agent-based and Multi-agent Systems: Coordination and cooperation
- Agent-based and Multi-agent Systems: Agent theories and models
Abstract
Decentralized Multi Agent Reinforcement Learning (MARL) faces a fundamental dilemma in real world deployments: agents must operate under epistemic fragmentation, where local observations are severely occluded, while navigating heterogeneous value landscapes, where sparse, critical events carry disproportionately high stakes. Existing paradigms typically decouple state estimation from policy optimization, guiding perception modules merely to minimize uniform reconstruction error. This leads to a Perception Value Misalignment, where agents squander computational resources reconstructing task irrelevant background noise while failing to resolve uncertainties in high value regions. To bridge this gap, we propose EVA-Gen (Epistemic Value Alignment via Generative Models) that establishes a cybernetic loop between generative perception and value based decision making. We formulate the Value Conditioned Reconstruction Paradigm, establishing that optimal perception under resource constraints is functionally weighted by the gradient of the value function. EVA-Gen couples Backward Flow to steer diffusion toward high stakes manifolds, Collaborative Information Bottleneck to filter communication for value relevant consensus, and Risk Sensitive Rectification to prevent sparse signal dilution, synergistically closing the perception control loop. Empirically, we demonstrate that EVA-Gen achieves superior performance in three value-heterogeneous multi agent environments.
- PassRoomGUD 43.1± 4.5 27.5± 3.8 26.8%± 5.2 35.0± 5.7 20.6± 4.6 22.5%± 5.9 30.9± 7.4 17.9± 6.2 20.7%± 8.7 34.6± 5.9 21.9± 5.0 22.9%± 7.4 SecretRoomGUD 36.1± 3.7 23.1± 3.2 19.5%± 4.8 26.4± 5.1 17.2± 3.8 14.6%± 6.3 20.8± 7.1 12.0± 6.0 10.7%± 7.4 26.7± 5.3 16.6± 5.4 12.6%± 7.7 MultiRoomGUD 39.6± 4.1 25.3± 3.5 21.2%± 5.5 29.4± 5.9 19.0± 4.7 15.8%± 7.7 23.4± 8.1 11.7± 7.0 12.3%± 9.3 29.4± 7.6 17.6± 6.0 13.4%± 8.8 2m vs 1zDPD 70.2± 4.8 658.1± 48.5 58.5%± 6.2 64.4± 6.2 595.5± 57 50.7%± 7.5 59.4± 7.8 578.2± 71.3 46.6%± 9.5 64.1± 5.8 594.6± 58.1 51.3%± 8.6 3mDPD 54.2± 6.8 925.9± 72.3 38.5%± 8.5 44.6± 9.0 795± 91 29.1%± 10.7 38.0± 10.7 707.6± 104.6 26.0%± 12.0 43.6± 10.1 745.3± 100 30.3%± 11.4 8mDPD 9.5± 15.5 248± 102 6.2%± 12.8 5.3± 17.4 145.9± 110.8 2.8%± 15.5 2.8± 18.7 111± 129.4 2.4%± 16.5 5.3± 18.5 142.6± 125.3 3.3%± 15.8 Urbannoise 86.1± 2.4 13.9± 2.4 75.8%± 3.2 79.4± 3.5 20.6± 3.5 65.5%± 4.3 75.0± 4.5 24.9± 4.4 57.1%± 6.0 73.8± 4.0 26.2± 3.4 56.3%± 4.7 Emergencynoise 78.4± 1.5 21.6± 1.5 68.5%± 2.8 69.2± 2.8 30.8± 2.9 58.2%± 4.1 67.0± 4.3 33.0± 3.8 55.2%± 6.2 61.6± 4.4 38.4± 4.7 49.8%± 5.8 Densenoise 85.3± 5.1 14.7± 5.1 74.5%± 6.2 76.6± 7.1 23.4± 6.6 54.8%± 7.8 73.7± 7.3 26.3± 7.8 53.0%± 8.8 74.5± 6.9 25.5± 7.4 51.7%± 8.6
- [Alemi et al., 2017] Alexander A Alemi, Ian Fischer, Joshua V Dillon, and Kevin Murphy. Deep variational information bottleneck. In International Conference on Learning Representations (ICLR), 2017.
- [Bellemare et al., 2017] Marc G Bellemare, Will Dabney, and Rémi Munos. A distributional perspective on rein- forcement learning. In International conference on ma- chine learning, pages 449-458. PMLR, 2017.
- [Bus ¸oniu et al., 2008] Lucian Bus ¸oniu, Robert Babuška, and Bart De Schutter. A comprehensive survey of multiagent reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 38(2):156-172, 2008.
- [De Witt et al., 2020] Christian Schroeder De Witt, Tarun Gupta, Denys Makoviichuk, Viktor Makoviychuk, Philip HS Torr, Mingfei Sun, and Shimon Whiteson. Is independent learning all you need in the starcraft multi-agent challenge? arXiv preprint arXiv:2011.09533, 2020.
- [Dibangoye and Buffet, 2018] Jilles S Dibangoye and Olivier Buffet. Learning to act in decentralized partially observable mdps. In International Conference on Machine Learning (ICML), pages 1233-1242. PMLR, 2018.
- [Grimm et al., 2020] Christopher Grimm, André Barreto, Satinder Singh, and David Silver. The value equiva- lence principle for model-based reinforcement learning. In Advances in Neural Information Processing Systems (NeurIPS), volume 33, pages 5541-5552, 2020.
- [Hafner et al., 2025] Danijar Hafner, Jurgis Pasukonis, Jimmy Ba, and Timothy Lillicrap. Mastering diverse control tasks through world models. Nature, pages 1-7, 2025.
- [Ho et al., 2020] Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. In Advances in Neural Information Processing Systems (NeurIPS), vol- ume 33, pages 6840-6851, 2020.
- [Igl et al., 2018] Maximilian Igl, Luisa Zintgraf, Tuan Anh Le, Frank Wood, and Shimon Whiteson. Deep variational reinforcement learning for pomdps. In International Con- ference on Machine Learning (ICML), pages 2117-2126.
- PMLR, 2018.
- [Janner et al., 2022] Michael Janner, Yilun Du, Joshua B Tenenbaum, and Sergey Levine. Planning with diffu- sion for flexible behavior synthesis. In International Con- ference on Machine Learning (ICML), pages 9902-9915.
- PMLR, 2022.
- [Jiang et al., 2024] Haobin Jiang, Ziluo Ding, and Zongqing Lu. Settling decentralized multi-agent coordinated explo- ration by novelty sharing. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 38, pages 17444-17452, 2024.
- [Li et al., 2024] Jiawei Li, Yiran Wang, Chen Chen, Peng Liu, and Yi Wu. Cmimc: Cascaded mutual information maximization for cooperative multi-agent reinforcement learning. In AAAI Conference on Artificial Intelligence, volume 38, pages 13562-13570, 2024.
- [Oliehoek and Amato, 2016] Frans A Oliehoek and Christo- pher Amato. A concise introduction to decentralized POMDPs. Springer, 2016.
- [Rashid et al., 2020] Tabish Rashid, Mikayel Samvelyan, Christian Schroeder De Witt, Gregory Farquhar, Jakob Fo- erster, and Shimon Whiteson. Monotonic value function factorisation for deep multi-agent reinforcement learning. Journal of Machine Learning Research, 21(178):1-51, 2020.
- [Ren et al., 2025] Tao Ren, Zheyuan Hu, Jianwei Niu, and Yiming Yao. Explaboff: Towards explorative and collab- orative task offloading via mutual information-enhanced marl. In IEEE INFOCOM 2025-IEEE Conference on Computer Communications, pages 1-10. IEEE, 2025.
- [Samvelyan et al., 2019] Mikayel Samvelyan, Tabish Rashid, Christian Schroeder de Witt, Gregory Farquhar, Nantas Nardelli, Tim G. J. Rudner, Chia-Man Hung, Philip H. S. Torr, Jakob Foerster, and Shimon Whiteson. The StarCraft multi-agent challenge. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 2019.
- [Schrittwieser et al., 2020] Julian Schrittwieser, Ioannis Antonoglou, Thomas Hubert, Karen Simonyan, Laurent Sifre, Simon Schmitt, Arthur Guez, Edward Lockhart, Demis Hassabis, Thore Graepel, et al. Mastering atari, go, chess and shogi by planning with a learned model. Nature, 588(7839):604-609, 2020.
- [Song et al., 2021a] Jiaming Song, Chenlin Meng, and Ste- fano Ermon. Denoising diffusion implicit models. In Inter- national Conference on Learning Representations, 2021.
- [Song et al., 2021b] Yang Song, Jascha Sohl-Dickstein, Diederik P Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole. Score-based generative modeling through stochastic differential equations. In International Confer- ence on Learning Representations, 2021.
- [Su et al., 2024] Ronshee Chawla Su, Qing Zhou, Yaqi Yang, and Baohe Wang. Collaborative multi-agent het- erogeneous multi-armed bandits. In International Confer- ence on Machine Learning (ICML), pages 32819-32848.
- PMLR, 2024.
- [Sukhbaatar et al., 2016] Sainbayar Sukhbaatar, Rob Fergus, et al. Learning multiagent communication with backprop- agation. In Advances in Neural Information Processing Systems (NeurIPS), volume 29, pages 2244-2252, 2016.
- [Wang et al., 2020] Rundong Wang, Xu He, Runsheng Yu, Wei Qiu, Bo An, and Zinovi Rabinovich. Learning effi- cient multi-agent communication: An information bottle- neck approach. In Proceedings of the 37th International Conference on Machine Learning (ICML), pages 9908- 9918. PMLR, 2020.
- [Wang et al., 2023] Andrew Wang, Andrew C Li, Toryn Q Klassen, Rodrigo Toro Icarte, and Sheila A McIlraith. Learning belief representations for partially observable deep RL. In Proceedings of the 40th International Confer- ence on Machine Learning (ICML), pages 35970-35988.
- PMLR, 2023.
- [Yu et al., 2022] Chao Yu, Akash Velu, Eugene Vinitsky, Ji- axuan Gao, Yu Wang, Alexandre Bayen, and Yi Wu. The surprising effectiveness of ppo in cooperative multi-agent games. Advances in Neural Information Processing Sys- tems (NeurIPS), 35:24611-24624, 2022.
- [Zhang et al., 2021] Kaiqing Zhang, Zhuoran Yang, and Tamer Bas ¸ar. Multi-agent reinforcement learning: A se- lective overview of theories and algorithms. Handbook of reinforcement learning and control, pages 321-384, 2021.
References were extracted automatically from the PDF and may contain errors.
Full text extracted automatically from the PDF; figures, tables and equations may differ. The PDF is the version of record.
1 Introduction
The field of Multi-Agent Reinforcement Learning (MARL) [Zhang et al., 2021; Bus¸oniu et al., 2008] has rapidly become a cornerstone for distributed control in complex systems where centralized sensing and decision-making are impractical. These domains heavily rely on agents that must make decisions based on limited local observations and con-
* Corresponding author.

(a)Standard Decoupled
Perception-Decision Pipeline
(b)Value-Conditioned
Cybernetic Loop(EVA-Gen)
Figure 1: Overview: (a) The standard decoupled pipeline, where perception minimizes uniform reconstruction loss independent of decision relevance. (b) EVA-Gen, which closes the perceptioncontrol loop by steering generative belief inference toward valuesen·sitive regions via Backward Flow.
strained communication channels. In these decentralized execution environments, each agent operates with a locally consistent yet globally incomplete view of the system, a challenge often referred to as epistemic fragmentation [Oliehoek and Amato, 2016; Dibangoye and Buffet, 2018]. Further compounding this issue is the presence of heterogeneous value landscapes, where agents must navigate through regions that carry disproportionately high stakes due to sparse, critical events. These challenges make real-world MARL deployment notoriously brittle.
Traditional model-based architectures often decouple state representation from policy optimization. In these frameworks, perception modules are trained to minimize a uniform reconstruction error across the observation space, treating background noise and critical signals equally. While notable works such as DreamerV3 [Hafner et al., 2025] and MuZero [Schrittwieser et al., 2020] have made strides toward value-aware learning, they generally target settings with either single-agent or fully observable environments where a unified world model suffices. In decentralized systems, this separation creates a fundamental pathology: a PerceptionValue Misalignment, where agents waste scarce computational resources processing irrelevant background textures while failing to resolve uncertainties in regions where the value function gradient is most sensitive. This misalignment is especially detrimental when operating under tight communication or compute budgets.
To resolve this misalignment, we propose a paradigm shift that places the value function at the center of perception learning (Fig. 1). Our insight is rooted in the observation that under resource constraints, perceptual errors do not equally impact decision-making. Specifically, if an agent's objective is to maximize the expected return V π (s), the impact of a perceptual error ε = ˆ s - s can be approximated by a first-order Taylor expansion: V π (ˆ s) ≈ V π (s) +∇sV π (s)⊤ε. This relationship reveals that the error's impact on utility is proportional to the gradient magnitude ∥∇sV π (s)∥. This observation motivates the concept of Value-Conditioned Reconstruction: optimal perception under fixed resource constraints is not uniform, but functionally weighted by the value gradient, prioritizing fidelity in high-stakes regions.
In response, we introduce EVA-Gen (Epistemic-Value Alignment via Generative Models), a unified framework that bridges the gap between generative perception and valuebased decision-making. EVA-Gen incorporates this principle through three synergistic mechanisms: (1) Backward Flow via Value-Guided Diffusion: We utilize diffusion models [Ho et al., 2020; Janner et al., 2022] to model the multimodal uncertainty in fragmented observations. By introducing a value-gradient-weighted sampling process, we bias the reverse diffusion steps to prioritize the generation of highvalue latent manifolds, effectively guiding perception toward task-relevant areas. (2) Collaborative Information Bottleneck: To mitigate decentralized bandwidth limitations, we introduce a collaborative information bottleneck [Wang et al., 2020] that filters communication. By maximizing mutual information specifically over value-relevant features, this mechanism fosters consensus on critical perceptual elements while discarding shared noise. (3) Risk-Sensitive Gradient Rectification: In environments with sparse high-value events, we counter signal dilution by adjusting policy gradients using uncertainty estimates derived from the generative model. This ensures the policy remains sensitive to sparse but critical signals despite the prevalence of low-value data.
In summary, the contributions of this work are as follows:
- We formulate the Value-Conditioned Reconstruction Paradigm, establishing that optimal perception under resource constraints should be weighted by the value function gradient.
- We introduce EVA-Gen, a novel architecture that integrates value-guided diffusion, collaborative bottlenecks, and risk-sensitive rectification to achieve tight epistemic-value alignment.
- We provide extensive empirical validation on SMAC variants with sparse rewards, Value-oriented collaborative exploration tasks, and an edge computing testbed.
2 RelatedWork
Our work positions EVA-Gen at the intersection of generative belief inference, value-aware modeling, and communicationefficient coordination under resource constraints.
2.1 Generative beliefs under epistemic uncertainty
Decentralized control relies on inferring global states from partial observations. While recurrent encoders paired with CTDE methods (e.g., QMIX [Rashid et al., 2020]) provide scalable coordination, they typically yield deterministic pseudo-beliefs that do not explicitly represent the multimodal posteriors induced by severe occlusion [Wang et al., 2023]. This motivates generative belief modeling in POMDP RL [Igl et al., 2018], where diffusion models improve mode coverage [Ho et al., 2020; Janner et al., 2022]. However, existing generative perception approaches optimize uniform denoising or reconstruction objectives, inducing a frequency bias: modeling capacity is allocated by visitation density rather than decision sensitivity. EVA-Gen bridges this gap by conditioning diffusion emphasis on value gradients, ensuring limited compute is spent on resolving high-stakes uncertainty.
2.2 Value equivalence vs. value conditioned reconstruction
Model-based RL (e.g., Dreamer, MuZero) learns latent dynamics for planning and control [Schrittwieser et al., 2020]. A key principle is Value Equivalence [Grimm et al., 2020]: representations need only preserve information relevant to Bellman updates. While conceptually aligned with task relevance, these methods are typically realized in centralized settings with objectives that remain effectively frequencyweighted; in heterogeneous value landscapes, this systematically underserves rare, high-impact regions. EVA-Gen complements value-equivalent modeling by shifting the focus from state abstraction to resource allocation, prioritizing perceptual fidelity according to value sensitivity under explicit compute/bandwidth budgets.
2.3 Communication-efficient coordination and risk-sensitive learning
To handle bandwidth constraints, explicit communication methods learn what to share [Sukhbaatar et al., 2016], while Information Bottleneck objectives motivate compression [Alemi et al., 2017]. Yet multi-agent bottlenecks define relevance via generic predictability [Su et al., 2024], which may preserve shared but low-utility features. EVA-Gen introduces a Collaborative Information Bottleneck shaped by value-relevant supervision, so transmitted bits reduce uncertainty along decision-critical dimensions. While prioritization (e.g., PER [Bellemare et al., 2017]) can amplify rare signals, EVA-Gen couples such emphasis with closed-form importance correction and uncertainty-aware rectification to preserve gradient fidelity under value-biased perception.
3 Preliminary
We begin by defining the resource-constrained decentralized control problem under epistemic fragmentation, then show why uniform perception is theoretically misaligned with control via a first-order value-degradation analysis.

3.1 ProblemFormulation
We consider a Resource-Constrained Decentralized Partially Observable Markov Decision Process (RC-Dec-POMDP),
where N = {1, . . . ,N} is the agent set. At time t, the environment is in global state st ∈ S. Each agent i receives a local observation
which is severely occluded/noisy, inducing epistemic fragmentation. Agents take actions ai,t ∈ Ai, forming a joint action at = (a1,t, . . . , aN,t). The system transitions as st+1 ∼ P(· | st, at) and yields a shared reward rt = R(st, at).
Because st is unavailable at execution, EVA-Gen operates on a control-sufficient latent state zt ∈ Rd , defined by an encoder φ (learned under CTDE supervision):
During execution, agent i infers a belief ˆ zi,t from its local observation and received messages (defined below), and executes a decentralized policy
We use CTDE to train a centralized critic on zt, while enforcing decentralized execution through Eq. (4).
Agents can exchange compressed messages. Let ui,t be agent i's transmitted message and ˜ui,t the received (possibly corrupted/dropped) message. We impose the constraint set
where Bandwidth constraint: ∑Ni=1 bits(ui,t) ≤ B for each timestep t. Compute constraint: the perception module qϕ has a bounded inference budget, e.g., a maximum number of denoising steps or FLOPs Ccomp.
Let ci,t denote the aggregated communication context available to agent i (defined in Sec. 4.2). The generative perception module produces a posterior over latent belief:
The goal is to maximize the expected discounted return:
Under these constraints, perception cannot be uniformly accurate everywhere; the core question becomes how to allocate limited perceptual capacity to maximize control utility.
3.2 Theoretical Motivation
Standard model-based MARL pipelines decouple perception from control, training perception to minimize a uniform reconstruction loss (e.g., E∥z - ˆ z∥2 ).
Let V π (z) be the value function of policy π in the latent space, and define the perception error ε ≜ ˆ z - z. We denote the (discounted) visitation distribution under π by ρπ (z).
Theorem 1 (Value-Conditioned Reconstruction Principle). Assume V π is differentiable and L-smooth on the support of ρπ , i.e., ∥∇V π (z) -∇V π (z′ )∥ ≤ L∥z - z ′ ∥. Then for any estimator ˆ z,
| Method | Setup | Parameters | MAPPO | MACE | IPPO | EVA-Gen (Ours) | ||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| σ | D | C | SR (%) | ER | SR (%) | ER | SR (%) | ER | SR (%) | ER | ||
| PassRoomCRB | ✓ | 0.0 | - | - | 100.0±0.0 | 48.9±2.0 | 100.0±0.0 | 49.9±2.2 | 96.5±3.5 | 50.8±2.8 | 99.5±1.5 | 52.4±2.8 |
| PassRoomPFS | ✓ | 0.3 | - | - | 90.6±2.8 | 44.3±2.8 | 90.0±2.5 | 46.5±2.1 | 85.0±8.5 | 45.2±4.8 | 96.2±1.2 | 49.9±2.2 |
| PassRoomCAT | ◦ | 0.0 | 0.5 | - | 38.5±4.5 | 16.2±3.5 | 52.3±3.5 | 21.5±2.9 | 42.0±15.5 | 22.8±8.5 | 88.9±3.2 | 46.5±3.1 |
| PassRoomVMD | ✓ | 0.0 | - | 50 | 12.8±3.2 | 19.5±3.8 | 25.4±4.4 | 30.1±4.5 | 78.5±12.8 | 72.5±8.2 | 75.3±3.5 | 40.5±3.4 |
| PassRoomGUD | × | 0.3 | - | 50 | 3.5±1.8 | 11.2±2.4 | 12.6±2.8 | 19.5±3.2 | 8.2±6.5 | 18.5±5.8 | 43.1±4.5 | 27.5±3.8 |
| PassRoomTCB | × | 0.3 | 0.5 | 50 | 1.5±1.0 | 5.8±1.6 | 6.4±2.1 | 15.2±2.6 | 2.5±3.2 | 15.2±4.5 | 21.3±4.2 | 18.5±3.2 |
| PassRoomAvg. | 41.2±2.2 | 31.0±2.7 | 47.8±2.5 | 30.4±2.9 | 52.1±8.3 | 37.5±5.8 | 70.7±2.5 | 39.2±3.1 | ||||
| SecretRoomCRB | ✓ | 0.0 | - | - | 100.0±0.0 | 47.5±2.2 | 100.0±0.0 | 48.3±1.6 | 88.5±7.2 | 48.2±3.8 | 98.9±1.0 | 50.1±2.2 |
| SecretRoomPFS | ✓ | 0.3 | - | - | 80.2±3.4 | 41.9±2.2 | 86.5±2.3 | 44.5±2.3 | 68.0±12.5 | 36.5±6.8 | 92.8±2.4 | 47.1±2.0 |
| SecretRoomCAT | ◦ | 0.0 | 0.5 | - | 33.5±3.9 | 14.0±2.9 | 45.1±4.1 | 19.1±3.3 | 22.5±18.5 | 12.8±10.2 | 81.9±2.6 | 41.9±2.5 |
| SecretRoomVMD | ✓ | 0.0 | - | 50 | 10.2±2.4 | 16.9±3.2 | 20.8±3.8 | 26.5±3.9 | 72.0±15.5 | 78.5±9.8 | 67.5±2.9 | 35.9±2.8 |
| SecretRoomGUD | × | 0.3 | - | 50 | 2.5±1.2 | 9.0±1.8 | 10.2±2.2 | 16.9±2.4 | 3.8±4.8 | 22.5±7.2 | 36.1±3.7 | 23.1±3.2 |
| SecretRoomTCB | × | 0.3 | 0.5 | 50 | 0.9±0.6 | 4.6±1.2 | 5.2±1.7 | 11.8±2.2 | 0.8±1.5 | 18.8±5.5 | 15.9±3.4 | 14.5±2.6 |
| SecretRoomAvg. | 37.9±1.9 | 22.3±2.2 | 44.6±2.3 | 27.9±2.6 | 42.6±10.0 | 36.2±7.2 | 65.5±2.3 | 35.4±2.6 | ||||
| MultiRoomCRB | ✓ | 0.0 | - | - | 100.0±0.0 | 48.2±2.1 | 100.0±0.0 | 49.1±1.8 | 52.5±15.5 | 28.5±8.5 | 99.2±1.1 | 51.1±2.5 |
| MultiRoomPFS | ✓ | 0.3 | - | - | 85.4±3.1 | 43.1±2.5 | 88.1±2.4 | 45.5±2.2 | 32.0±18.2 | 17.5±9.8 | 94.5±1.8 | 48.5±2.1 |
| MultiRoomCAT | ◦ | 0.0 | 0.5 | - | 36.0±4.2 | 15.1±3.2 | 48.7±3.8 | 20.3±3.1 | 8.5±9.5 | 4.8±5.2 | 85.4±2.9 | 44.2±2.8 |
| MultiRoomVMD | ✓ | 0.0 | - | 50 | 11.5±2.8 | 18.2±3.5 | 23.1±4.1 | 28.3±4.2 | 45.0±20.5 | 52.5±12.5 | 71.4±3.2 | 38.2±3.1 |
| MultiRoomGUD | × | 0.3 | - | 50 | 3.0±1.5 | 10.1±2.1 | 11.4±2.5 | 18.2±2.8 | 1.2±2.5 | 8.5±4.8 | 39.6±4.1 | 25.3±3.5 |
| MultiRoomTCB | × | 0.3 | 0.5 | 50 | 1.2±0.8 | 5.2±1.4 | 5.8±1.9 | 13.5±2.4 | 0.0±0.0 | 5.2±3.2 | 18.6±3.8 | 16.5±2.9 |
| MultiRoomAvg. | 39.5±2.1 | 23.3±2.5 | 46.2±2.4 | 29.1±2.8 | 23.2±11.0 | 19.5±7.3 | 68.1±2.5 | 37.3±2.8 | ||||
Note: Setup indicates accessibility (✓: door open, ◦: partially open, ×: closed). CRB (Clean); PFS/CAT/VMD (Single stressor); GUD (Gated+σ+C); TCB (All factors coupled).
Moreover, for any δ0 > 0,
which implies that, under a fixed distortion budget E∥ε∥2 ≤ δ, minimizing the value-conditioned quadratic objective
minimizes a tight upper bound on the expected value degradation in Eq. (8) up to constants.
Proof. By L-smoothness, Taylor's theorem gives V π (ˆ z) = V π (z) + ∇V π (z)⊤ε + R with |R| ≤ L2 ∥ε∥2 , which yields Eq. (8) by Cauchy-Schwarz. Eq. (9) follows from the inequality ∥x∥ ≤ 1 2δ0 ∥x∥2 + δ0 2 applied to x = ε and scaling by ∥∇V π (z)∥. Substituting into Eq. (8) shows that LVCR controls the leading term governing value deviation under a quadratic distortion budget.
Remark 1 Theorem 1 establishes a precise surrogate necessity: under finite resources, perception should prioritize regions where the value function is sensitive (large ∥∇zV π (z)∥). Uniform reconstruction is recovered only in the degenerate case where ∥∇zV π (z)∥ is constant (i.e., no value heterogeneity).
4 Methodology
Guided by Theorem 1, EVA-Gen Framework closes the perception-value loop via three mechanisms (Fig. 2). We utilize a CTDE-trained centralized critic Vω(z) to compute value sensitivities in the latent space.
4.1 Backward Flow via Value-Guided Diffusion
To minimize Eq. (10) under compute constraints, we allocate capacity to value-sensitive latents and implement Backward Flow via value-weighted diffusion.
Value-weighted replay distribution: define the value sensitivity and sampling weight
where α ≥ 0 controls aggressiveness and stabilizes training.
Value-weighted replay distribution: given a replay buffer distribution pD(z, o, c), construct a value-biased distribution
Sampling from pval implements the value-conditioning in Eq. (10) while retaining the same model class.
Diffusion training in latent space: we train a conditional diffusion model ϵϕ to model qϕ(z | o, c) by predicting injected noise in the standard denoising objective [Ho et al., 2020; Song et al., 2021b]. Let zk denote the noised latent at diffusion step k. The Backward Flow objective is
| Scenario | Setup | Parameters | IPPO | MAPPO | MACE | EVA-Gen (Ours) | ||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| σ | D | C | WR (%) | ER | WR (%) | ER | WR (%) | ER | WR (%) | ER | ||
| 2m vs 1zCBC | ✓ | - | - | - | 52.5±8.5 | 542.2±68.1 | 68.5±4.2 | 658.1±42.2 | 72.8±3.8 | 681.3±38.1 | 76.2±3.5 | 702.3±35.4 |
| 2m vs 1zOCC-L | ✓ | 0.1 | - | - | 48.5±9.2 | 512.1±72.2 | 61.5±5.8 | 612.1±52.6 | 68.2±4.5 | 645.7±45.1 | 72.8±4.2 | 675.2±42.8 |
| 2m vs 1zNOI-L | ✓ | - | 0.1 | - | 50.2±8.8 | 528.5±70.1 | 63.2±5.5 | 625.7±48.5 | 69.5±4.2 | 655.4±42.1 | 74.5±3.8 | 690.9±38.1 |
| 2m vs 1zDEC-L | ✓ | - | - | 10 | 22.8±12.5 | 425.2±85.1 | 32.5±8.5 | 485.1±68.7 | 51.6±7.2 | 540.1±58.3 | 68.5±5.8 | 634.4±52.5 |
| 2m vs 1zDPD | ◦ | 0.1 | 0.1 | - | 42.5±10.5 | 485.6±78.7 | 55.8±6.8 | 578.0±58.1 | 62.5±5.5 | 615.5±52.4 | 70.2±4.8 | 658.1±48.2 |
| 2m vs 1zFULL | × | 0.3 | 0.1 | 10 | 38.5±11.2 | 468.4±82.2 | 51.6±7.5 | 558.1±62.6 | 58.8±6.2 | 595.0±55.0 | 68.5±5.2 | 634.1±52.2 |
| 2m vs 1zAvg. | 42.5±10.1 | 493.3±75.8 | 55.5±6.4 | 586.1±55.0 | 63.9±5.2 | 621.8±48.3 | 71.8±4.5 | 665.5±44.5 | ||||
| 3mCBC | ✓ | - | - | - | 18.5±12.5 | 684.0±95.1 | 36.7±8.5 | 950.0±72.2 | 72.5±4.5 | 1188.9±58.6 | 74.5±4.2 | 1220.2±52.1 |
| 3mOCC-L | ✓ | 0.1 | - | - | 12.5±14.5 | 551.5±102.7 | 28.5±9.5 | 807.2±78.4 | 64.8±5.2 | 1093.1±62.1 | 70.2±4.8 | 1155.9±58.1 |
| 3mNOI-L | ✓ | - | 0.1 | - | 14.2±13.8 | 589.7±98.9 | 30.5±9.2 | 836.0±75.0 | 66.5±4.8 | 1121.2±60.1 | 72.8±4.5 | 1185.5±55.6 |
| 3mDEC-L | ✓ | - | - | 10 | 5.8±16.5 | 399.7±112.8 | 18.5±11.5 | 684.0±88.9 | 48.5±6.8 | 874.0±68.5 | 62.5±5.8 | 1028.0±65.0 |
| 3mDPD | ◦ | 0.1 | 0.1 | - | 4.5±17.2 | 332.0±118.3 | 15.8±12.5 | 589.0±95.6 | 42.5±7.5 | 808.1±72.8 | 54.2±6.8 | 925.8±72.1 |
| 3mFULL | × | 0.3 | 0.1 | 10 | 2.5±18.5 | 237.0±125.7 | 8.5±14.5 | 427.0±105.1 | 34.3±8.8 | 741.1±78.5 | 48.5±7.8 | 865.0±82.8 |
| 3mAvg. | 9.7±15.5 | 465.3±108.3 | 23.1±11.0 | 715.5±85.5 | 54.8±6.3 | 970.8±66.3 | 63.8±5.6 | 1063.0±64.0 | ||||
| 8mCBC | ✓ | - | - | - | 2.5±14.2 | 185.0±95.0 | 10.5±11.5 | 268.0±85.0 | 15.2±10.8 | 298.0±78.3 | 17.2±11.2 | 318.0±82.7 |
| 8mOCC-L | ✓ | 0.1 | - | - | 1.5±15.5 | 162.3±98.4 | 8.5±12.8 | 245.4±88.7 | 12.8±12.2 | 275.0±85.0 | 14.5±13.2 | 295.0±92.2 |
| 8mNOI-L | ✓ | - | 0.1 | - | 1.8±15.2 | 168.1±95.3 | 9.2±12.5 | 255.4±88.7 | 13.5±11.8 | 282.1±82.2 | 15.8±12.8 | 305.0±88.4 |
| 8mDEC-L | ✓ | - | - | 10 | 0.5±16.5 | 135.8±102.6 | 6.5±13.8 | 218.3±92.3 | 9.8±13.2 | 248.0±88.0 | 12.5±14.5 | 275.5±95.5 |
| 8mDPD | ◦ | 0.1 | 0.1 | - | 0.2±17.2 | 118.1±105.0 | 4.5±14.8 | 195.0±98.1 | 7.2±14.2 | 225.9±95.6 | 9.5±15.5 | 248.4±102.2 |
| 8mFULL | × | 0.3 | 0.1 | 10 | 0.0±0.0 | 95.5±35.6 | 2.8±15.8 | 168.5±105.1 | 5.5±15.2 | 205.1±102.3 | 7.8±16.2 | 228.5±108.2 |
| 8mAvg. | 1.1±13.1 | 143.8±88.3 | 7.0±13.5 | 224.8±92.7 | 10.7±12.9 | 255.5±88.3 | 12.9±13.9 | 278.2±94.5 | ||||
Note: Setup indicates degradation tier (✓: single mild factor, ◦: two-factor coupling, ×: full stress). CBC (Clean); OCC/NOI/DEC (Single stressor); DPD (Dual perception degradation); FULL (Max stress).
To satisfy Ccomp, we use accelerated samplers (e.g., DDIM [Song et al., 2021a]) with K′ ≪ K denoising steps at execution. Backward Flow ensures these limited steps focus on resolving uncertainty in high-stakes manifolds.
4.2 Collaborative Information Bottleneck (CIB)
Under bandwidth budget B, agents cannot share raw observations. CIB learns compressed messages that retain valuerelevant information and align agents on critical factors.
CIB encoder and aggregation (interface to diffusion): each agent encodes a message
aggregates received neighbor messages into a context vector
which is provided to diffusion as the conditioning input in Eq. (6), Eq. (15). This couples communication to perception.
Information bottleneck objective: let yt be a value-relevant training signal, e.g., yt = Vω(zt), an advantage estimate ˆ At , or a binary criticality label I{g(zt) ≥ τ}. We seek messages that preserve information about yt while compressing oi,t:
where β trades off informativeness and rate. In practice, we optimize a standard variational information bottleneck surrogate [Alemi et al., 2017]:
where p(u) is a simple prior (e.g., N(0, I)) and the KL term acts as a differentiable proxy for expected bitrate.
4.3 Risk-Sensitive Gradient Rectification
Value-Guided Diffusion biases samples toward highsensitivity states, which is necessary for perception but can distort policy learning if uncorrected. Meanwhile, sparse critical events risk being overwhelmed by routine transitions.
Proposition 1 (Gradient dilution under value sparsity). Let Zcrit and Zrtn be critical and routine sets with pcrit = P(z ∈ Zcrit) and prtn = 1 - pcrit. Decompose the expected policy gradient as G = pcritGcrit+prtnGrtn. If prtn/pcrit = κ ≫ 1 and Gcrit,Grtn are comparable in magnitude, then under uniform sampling the critical-state contribution is O(1/κ).
Because pval(z, o, c) ∝ pD(z, o, c) w(z) (Eq. (13)), density ratio required to correct bias is available in closed form:
Thus, we do not perform density-ratio estimation; we directly use 1/w(z) (with clipping/normalization) as the biascorrection factor.
Diffusion defines a posterior distribution over ˆ zi,t. Quantify epistemic uncertainty by Monte Carlo posterior spread:
In practice, M is small (e.g., M ∈ {2, 4}) and can be computed only during training or amortized at execution.
| Method | Setup | Parameters | MAPPO | CMiMC | ExplabOff | EVA-Gen (Ours) | |||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| p | σ | λ | ρ | SR (%) | VRLS (%) | SR (%) | VRLS (%) | SR (%) | VRLS (%) | SR (%) | VRLS (%) | ||
| Urbanbase | ✓ | 5 | 0.2 | 1.5 | 20 | 60.6±1.5 | 39.3±1.5 | 79.8±3.0 | 20.1±3.0 | 70.4±1.6 | 29.5±1.6 | 90.8±1.9 | 9.2±1.9 |
| Urbannoise | × | 5 | 0.3 | 1.5 | 20 | 45.8±1.9 | 54.1±1.9 | 67.8±1.7 | 32.1±1.7 | 59.0±2.2 | 40.9±2.2 | 86.0±2.4 | 13.9±2.4 |
| Urbanloss | ✓ | 10 | 0.2 | 1.5 | 20 | 46.1±1.3 | 53.8±1.3 | 68.7±2.2 | 31.2±2.2 | 60.5±2.2 | 39.5±2.2 | 86.6±1.9 | 13.3±1.9 |
| Urbanload | × | 5 | 0.2 | 2.5 | 20 | 40.3±0.9 | 59.6±0.9 | 62.2±3.4 | 37.7±3.4 | 55.5±1.5 | 44.4±1.5 | 82.1±2.5 | 17.9±2.5 |
| Urbanqos | ✓ | 5 | 0.2 | 1.5 | 35 | 43.7±1.8 | 56.2±1.8 | 65.7±2.4 | 34.2±2.4 | 58.8±2.4 | 41.1±2.4 | 84.8±3.0 | 15.1±3.0 |
| UrbanAvg. | 47.3±1.5 | 52.6±1.5 | 68.9±2.5 | 31.0±2.5 | 60.8±2.0 | 39.1±2.0 | 86.0±2.4 | 13.9±2.4 | |||||
| Emergencybase | ✓ | 10 | 0.2 | 2.5 | 25 | 38.4±0.9 | 61.5±0.9 | 60.5±2.6 | 39.4±2.6 | 53.0±0.7 | 46.9±0.7 | 81.7±2.6 | 18.2±2.6 |
| Emergencynoise | × | 10 | 0.3 | 2.5 | 25 | 36.5±0.9 | 63.4±0.9 | 59.4±1.4 | 40.6±1.4 | 49.5±1.3 | 50.4±1.3 | 78.3±1.5 | 21.6±1.5 |
| Emergencyloss | × | 15 | 0.2 | 2.5 | 25 | 38.5±0.8 | 61.5±0.8 | 57.3±1.4 | 42.6±1.4 | 52.5±2.3 | 47.4±2.3 | 81.6±2.6 | 18.3±2.6 |
| Emergencyburst | × | 10 | 0.2 | 3.5 | 25 | 31.8±1.5 | 68.1±1.5 | 52.8±2.2 | 47.1±2.2 | 45.6±1.1 | 54.3±1.1 | 76.6±2.5 | 23.3±2.5 |
| Emergencycritical | × | 20 | 0.3 | 4.0 | 40 | 24.1±0.8 | 75.8±0.8 | 43.0±1.6 | 56.9±1.6 | 36.7±1.7 | 63.2±1.7 | 69.1±1.9 | 30.9±1.9 |
| EmergencyAvg. | 33.8±1.0 | 66.1±1.0 | 54.6±1.8 | 45.3±1.8 | 47.5±1.4 | 52.4±1.4 | 77.5±2.2 | 22.4±2.2 | |||||
| Densebase | ✓ | 10 | 0.3 | 1.5 | 30 | 42.1±0.6 | 57.8±0.6 | 63.5±1.3 | 36.4±1.3 | 57.9±2.0 | 42.4±2.0 | 86.8±3.5 | 13.1±3.5 |
| Densenoise | × | 10 | 0.4 | 1.5 | 30 | 39.5±1.1 | 60.4±1.1 | 62.8±2.2 | 37.1±2.2 | 53.9±1.3 | 46.0±1.3 | 85.2±5.1 | 14.7±5.1 |
| Denseloss | × | 15 | 0.3 | 1.5 | 30 | 41.9±0.8 | 58.0±0.8 | 63.7±2.6 | 36.2±2.6 | 55.8±1.8 | 44.1±1.8 | 82.9±3.4 | 17.0±3.4 |
| Denseload | × | 10 | 0.3 | 2.0 | 30 | 38.5±1.2 | 61.4±1.2 | 58.3±2.7 | 41.6±2.7 | 53.8±1.6 | 46.1±1.6 | 80.7±3.5 | 19.2±3.5 |
| Denseextreme | × | 15 | 0.5 | 2.0 | 40 | 32.0±1.4 | 67.9±1.4 | 54.0±1.1 | 45.9±1.1 | 46.0±1.6 | 53.9±1.6 | 78.7±1.8 | 21.2±1.8 |
| DenseAvg. | 38.8±1.0 | 61.1±1.0 | 60.5±2.0 | 39.4±2.0 | 53.4±1.7 | 46.5±1.7 | 82.8±3.5 | 17.1±3.5 | |||||
We define the rectification weight
where ¯σdiff,t aggregates per-agent uncertainties (e.g., mean over i) and λ > 0 controls risk sensitivity. The rectified actor update is then
with an analogous ρt-weighted critic regression. The biascorrection restores gradient fidelity under 4.1's value-biased sampling, while the uncertainty gate suppresses unstable updates under highly ambiguous beliefs.
5 Experiments
We conduct comprehensive experiments using the EVAGen framework across three scenarios characterized by epistemic fragmentation and heterogeneous value landscapes: (i) MACE-GridWorld [Jiang et al., 2024] for fundamental mechanism verification, (ii) SMAC for complex combat coordination [Samvelyan et al., 2019], and (iii) a custom UAVMEC testbed for system-level validation.
5.1 Baselines
We compare EVA-Gen with five baselines: IPPO [De Witt et al., 2020], an independent on-policy learner without explicit coordination; MAPPO [Yu et al., 2022], a strong CTDE PPO baseline with centralized value estimation and decentralized execution; MACE [Jiang et al., 2024], using decentralized novelty sharing for coordinated exploration; CMiMC [Li et al., 2024], maximizing mutual information between local and collaborative views for communication-efficient MARL; and ExplabOff [Ren et al., 2025], an MI-enhanced collaborative offloading baseline. All methods follow the same training protocol and network scale for fair comparison.
5.2 Experimental Environments
GridWorld: We adopt GridWorld benchmarks, Pass, SecretRoom, and MultiRoom, for sequential critical state reasoning. We introduce an Epistemic-Value Trap via perturbations: (1) Positional Drift (σ) for epistemic fragmentation via stochastic coordinate shifts; (2) Ambiguity (D) for perceptual aliasing using dummy triggers; and (3) Distractors (C) for value heterogeneity via dense low-value rewards.
SMAC: Experiments are conducted on SMAC (2m-1z, 3m, 8m) under sparse rewards [Jiang et al., 2024]. We augment the standard environment with three stressors to test robustness: (i) Dynamic Occlusion (stochastic feature masking); (ii) Observation Noise (attribute perturbation); and (iii) Value Decoys (dense, low-value targets), which create value traps to distract agents from global coordination.
UAV-MECSystemVerification: In our customUAV-MEC simulation, tasks exhibit heterogeneous QoS requirements: a small fraction of high-priority, latency-sensitive tasks (LS, high value) and a majority of best-effort tasks (LT, low value). Agents operate under partial observability due to channel occlusion and incomplete communications.
5.3 Experimental Analysis
GridWorld Results
Table 1 shows Success Rate (SR) and Episodic Return (ER) in scenarios under six configurations of epistemic fragmentation and value heterogeneity. The near-perfect performance
| Scenario | EVA-Gen (Full) | w/o BF | w/o CIB | w/o RSR | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| SR/WR (%) | VRLS/ER | AUC (%) | SR/WR (%) | VRLS/ER | AUC (%) | SR/WR (%) | VRLS/ER | AUC (%) | SR/WR (%) | VRLS/ER (%) | AUC (%) | |
| PassRoomGUD | 43.1± 4.5 | 27.5±3.8 | 26.8%±5.2 | 35.0± 5.7 | 20.6± 4.6 | 22.5%± 5.9 | 30.9± 7.4 | 17.9± 6.2 | 20.7%± 8.7 | 34.6± 5.9 | 21.9± 5.0 | 22.9%± 7.4 |
| SecretRoomGUD | 36.1± 3.7 | 23.1±3.2 | 19.5%±4.8 | 26.4± 5.1 | 17.2± 3.8 | 14.6%± 6.3 | 20.8± 7.1 | 12.0± 6.0 | 10.7%± 7.4 | 26.7± 5.3 | 16.6± 5.4 | 12.6%± 7.7 |
| MultiRoomGUD | 39.6± 4.1 | 25.3±3.5 | 21.2%±5.5 | 29.4± 5.9 | 19.0± 4.7 | 15.8%± 7.7 | 23.4± 8.1 | 11.7± 7.0 | 12.3%± 9.3 | 29.4± 7.6 | 17.6± 6.0 | 13.4%± 8.8 |
| 2m vs 1zDPD | 70.2± 4.8 | 658.1±48.5 | 58.5%±6.2 | 64.4± 6.2 | 595.5± 57 | 50.7%± 7.5 | 59.4± 7.8 | 578.2±71.3 | 46.6%±9.5 | 64.1± 5.8 | 594.6± 58.1 | 51.3%± 8.6 |
| 3mDPD | 54.2± 6.8 | 925.9±72.3 | 38.5%±8.5 | 44.6± 9.0 | 795± 91 | 29.1%±10.7 | 38.0±10.7 | 707.6±104.6 | 26.0%±12.0 | 43.6±10.1 | 745.3± 100 | 30.3%± 11.4 |
| 8mDPD | 9.5± 15.5 | 248± 102 | 6.2%± 12.8 | 5.3± 17.4 | 145.9±110.8 | 2.8%±15.5 | 2.8± 18.7 | 111± 129.4 | 2.4%± 16.5 | 5.3± 18.5 | 142.6± 125.3 | 3.3%± 15.8 |
| Urbannoise | 86.1± 2.4 | 13.9±2.4 | 75.8%±3.2 | 79.4± 3.5 | 20.6± 3.5 | 65.5%± 4.3 | 75.0± 4.5 | 24.9± 4.4 | 57.1%± 6.0 | 73.8± 4.0 | 26.2± 3.4 | 56.3%± 4.7 |
| Emergencynoise | 78.4± 1.5 | 21.6±1.5 | 68.5%±2.8 | 69.2± 2.8 | 30.8± 2.9 | 58.2%± 4.1 | 67.0± 4.3 | 33.0± 3.8 | 55.2%± 6.2 | 61.6± 4.4 | 38.4± 4.7 | 49.8%± 5.8 |
| Densenoise | 85.3± 5.1 | 14.7±5.1 | 74.5%±6.2 | 76.6± 7.1 | 23.4± 6.6 | 54.8%± 7.8 | 73.7± 7.3 | 26.3± 7.8 | 53.0%± 8.8 | 74.5± 6.9 | 25.5± 7.4 | 51.7%± 8.6 |
Note: GridWorld: Door=closed, σ = 0, Dummy=low, Coins=50; SMAC: σ = D = 0.1; UAV-MEC: obs.-noise.
of the clean baseline (CRB) confirms task reachability. EVAGen excels: in PassRoom, it lifts SR from 52.1% (IPPO) to 70.7%; in MULTIROOM, it improves from46.2% (MACE) to 68.1%. While value-agnostic baselines show high variance in difficult regimes-indicating policy divergence-EVA-Gen maintains tight error margins (±2 ∼ 3%). Higher ER indicates that EVA-Gen succeeds efficiently without time penalties. This validates that conditioning perception on downstream value gradients suppresses task-irrelevant noise, resolving perception-value misalignment.
SMAC Results
Table 2 reports WR and ER on three SMAC maps under six stress settings with increasing perceptual degradation and value heterogeneity. EVA-Gen achieves the strongest robustness across maps, improving the average WR on 2m vs 1z from 63.9% (MACE) to 71.8% and maintaining 68.5% WR under the FULL setting. On the harder 8m map, EVA-Gen obtains the highest average WR (12.9%) and ER (278.2), outperforming MACE (10.7%WR, 255.5 ER). As stress increases, baselines degrade more sharply, whereas EVA-Gen preserves higher WR/ER, indicating more reliable coordination under severe partial observability and value decoys. These results support that value-guided perception mitigates perception-value misalignment in sparse-reward MARL.
UAV-MEC Results
Table 3 presents UAV-MEC performance across Urban, Emergency, and Dense scenarios under varying stress (noise, packet loss, QoS criticality). The results demonstrate a critical joint improvement: EVA-Gen simultaneously increases SR while reducing the LS Task Violation Rate (VR). Specifically, in Urban scenarios, it attains 86.09% SR with only 13.91% VR, substantially outperforming MAPPO and strong offloading baselines like CMiMC. Unlike aggressive strategies that trade safety for marginal success gains, EVA-Gen pushes the Pareto frontier outward, indicating superior risksensitive trade-offs under uncertainty. This supports our argument: by aligning reconstruction resources with value and risk, the system prevents sparse high-stakes signals from being diluted by abundant low-value channel fluctuations, ensuring reliability where it matters most.
Ablation Study Results
Table 4 confirms the synergy of EVA-Gen, which consistently outperforms its ablated variants in performance (SR/WR), reliability (VRLS/ER), and efficiency (AUC). w/o BF: Removing Backward Flow reduces AUC and success rates, especially under severe uncertainty such as UAV-MEC, showing that value-guided belief reconstruction is crucial for stable convergence. w/o CIB: Without CIB, agents transmit value-irrelevant signals, leading to higher constraint violations and weaker coordination under limited communication. w/o RSR: Removing RSR sharply increases V RLS in UAVMEC despite moderate success rates, revealing a value trap: agents overfit frequent low-value rewards while neglecting sparse high-priority constraints. This validates RSR's role in preserving reliability under long-tailed value distributions.
6 Conclusion
In this work, we proposed EVA-Gen, a unified decentralized MARL framework for mitigating Perception-Value Misalignment under epistemic fragmentation and heterogeneous value landscapes. We established the Value-Conditioned Reconstruction Principle, showing that value degradation induces a perception objective weighted by value sensitivity, and instantiated it through a closed loop of Backward Flow, Collaborative Information Bottleneck, and Risk-Sensitive Gradient Rectification. Our results suggest that resource-constrained agents should prioritize decision-critical uncertainty over uniform world reconstruction.
Acknowledgements
This work was supported in part by the Artificial Intelligence Scientific and Technological Innovation Program of Liaoning Province (No.2023JH26/10100008)
Contribution Statement
YuDuo Zheng and XueFeng Du contributed equally to the formulation, method design, experiments, analysis, and writing of this work. Yanqi Cheng supported the implementation and experimental analysis. Li Yin contributed to validation and revision. Fengqi Li supervised the project, revised the manuscript, and serves as the corresponding author. All authors have read and approved the final manuscript.
@inproceedings{ijcai2026p54,
title = {EVA-Gen: When Perception Learns from Value via Generative Models in Decentralized Multi-Agent Systems},
author = {Zheng, Yuduo and Du, XueFeng and Cheng, Yanqi and Yin, Li and Li, Fengqi},
booktitle = {Proceedings of the Thirty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-26}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Diego Calvanese},
pages = {472--480},
year = {2026},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2026/54},
url = {https://doi.org/10.24963/ijcai.2026/54},
}
TY - CPAPER TI - EVA-Gen: When Perception Learns from Value via Generative Models in Decentralized Multi-Agent Systems AU - Zheng, Yuduo AU - Du, XueFeng AU - Cheng, Yanqi AU - Yin, Li AU - Li, Fengqi T2 - Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26 PB - International Joint Conferences on Artificial Intelligence Organization PY - 2026 SP - 472 EP - 480 DO - 10.24963/ijcai.2026/54 UR - https://doi.org/10.24963/ijcai.2026/54 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: