Wireless Communication Enhanced Value Decomposition for Multi-Agent Reinforcement Learning

• URL: http://arxiv.org/abs/2604.08728v1
• Date: Thu, 09 Apr 2026 19:42:17 GMT
• Title: Wireless Communication Enhanced Value Decomposition for Multi-Agent Reinforcement Learning
• Abstract summary: Cooperation in multi-agent reinforcement learning (MARL) benefits from inter-agent communication.<n>Most approaches assume idealized channels and existing value decomposition methods who successfully shared information with whom.<n>We propose CLOVER, a cooperative MARL framework whose centralized value mixer is conditioned on the communication graph realized under a realistic wireless channel.
• Score: 5.1629948126220055
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cooperation in multi-agent reinforcement learning (MARL) benefits from inter-agent communication, yet most approaches assume idealized channels and existing value decomposition methods ignore who successfully shared information with whom. We propose CLOVER, a cooperative MARL framework whose centralized value mixer is conditioned on the communication graph realized under a realistic wireless channel. This graph introduces a relational inductive bias into value decomposition, constraining how individual utilities are mixed based on the realized communication structure. The mixer is a GNN with node-specific weights generated by a Permutation-Equivariant Hypernetwork: multi-hop propagation along communication edges reshapes credit assignment so that different topologies induce different mixing. We prove this mixer is permutation invariant, monotonic (preserving the IGM condition), and strictly more expressive than QMIX-style mixers. To handle realistic channels, we formulate an augmented MDP isolating stochastic channel effects from the agent computation graph, and employ a stochastic receptive field encoder for variable-size message sets, enabling end-to-end differentiable training. On Predator-Prey and Lumberjacks benchmarks under p-CSMA wireless channels, CLOVER consistently improves convergence speed and final performance over VDN, QMIX, TarMAC+VDN, and TarMAC+QMIX. Behavioral analysis confirms agents learn adaptive signaling and listening strategies, and ablations isolate the communication-graph inductive bias as the key source of improvement.

Related papers

• Decentralized Federated Learning for Heterogeneous Multi-Task Semantic Communication [16.237398580195496]
  This paper introduces a personalized DSC framework that cuts off cross-task interference.<n>Across the network, we deploy a "communicationwhile aggregation" protocol.<n>We evaluate the proposed framework on NYU-v2, where the results reveal a clear trade-off between insufficient aggregation and excessive topological mixing.
  arXiv  Detail & Related papers  (2026-08-15T14:22:58Z)
• JSCGC: Joint Source-Channel-Generation Coding for Wireless Generative Communications [58.67925548779465]
  Joint Source-Channel-Generation Coding (JSCGC) is a generative communication paradigm that replaces the conventional decoder with a generative model at the receiver.<n>JSCGC consistently improves feature-based, semantic-level, and inferenceal quality across diverse channel conditions.
  arXiv  Detail & Related papers  (2026-06-11T03:42:03Z)
• UMEDA: Unified Multi-modal Efficient Data Fusion for Privacy-Preserving Graph Federated Learning via Spectral-Gated Attention and Diffusion-Based Operator Alignment [20.399005485708273]
  Device-free localization trains models from heterogeneous wireless and visual sensors distributed across edge devices.<n>We propose UMEDA, a graph federated learning framework in which clients form nodes of a global graph that share a continuous integral operator.<n> UMEDA outperforms state-of-the-art federated baselines in accuracy, convergence, and communication efficiency.
  arXiv  Detail & Related papers  (2026-05-08T08:15:47Z)
• Joint Source-Channel-Generation Coding: From Distortion-oriented Reconstruction to Semantic-consistent Generation [58.67925548779465]
  We propose Joint Source-Channel-Generation Coding (JSCGC), a novel paradigm that shifts the focus from perceptual reconstruction to probabilistic generation.<n>JSCGC improves substantially semantic quality and semantic fidelity, significantly outperforming conventional distortion-oriented J SCC methods.
  arXiv  Detail & Related papers  (2026-01-19T08:12:47Z)
• A Transformer Inspired AI-based MIMO receiver [0.5039813366558306]
  The AttDet design combines model-based interpretability with data-driven flexibility.<n>We demonstrate through link-level simulations under 5G channel models and high-order, mixed QAM modulation and coding schemes.<n>AttDet can approach near-optimal BER/BLER performance while maintaining predictable, realistic complexity.
  arXiv  Detail & Related papers  (2025-10-23T09:05:10Z)
• Heterogeneous Multi-Agent Reinforcement Learning for Distributed Channel Access in WLANs [47.600901884970845]
  This paper investigates the use of multi-agent reinforcement learning (MARL) to address distributed channel access in wireless local area networks.<n>In particular, we consider the challenging yet more practical case where the agents heterogeneously adopt value-based or policy-based reinforcement learning algorithms to train the model.<n>We propose a heterogeneous MARL training framework, named QPMIX, which adopts a centralized training with distributed execution paradigm to enable heterogeneous agents to collaborate.
  arXiv  Detail & Related papers  (2024-12-18T13:50:31Z)
• Diffusion-Driven Semantic Communication for Generative Models with Bandwidth Constraints [66.63250537475973]
  This paper introduces a diffusion-driven semantic communication framework with advanced VAE-based compression for bandwidth-constrained generative model.<n>Our experimental results demonstrate significant improvements in pixel-level metrics like peak signal to noise ratio (PSNR) and semantic metrics like learned perceptual image patch similarity (LPIPS)
  arXiv  Detail & Related papers  (2024-07-26T02:34:25Z)
• Faster Convergence with Less Communication: Broadcast-Based Subgraph Sampling for Decentralized Learning over Wireless Networks [33.73369874759397]
  $texttBASS$ is a broadcast-based subgraph sampling method designed to accelerate the convergence of D-SGD.<n>We show that $texttBASS$ enables faster convergence with fewer transmission slots compared to existing link-based scheduling methods.
  arXiv  Detail & Related papers  (2024-01-24T20:00:23Z)
• Data-heterogeneity-aware Mixing for Decentralized Learning [63.83913592085953]
  We characterize the dependence of convergence on the relationship between the mixing weights of the graph and the data heterogeneity across nodes. We propose a metric that quantifies the ability of a graph to mix the current gradients. Motivated by our analysis, we propose an approach that periodically and efficiently optimize the metric.
  arXiv  Detail & Related papers  (2022-04-13T15:54:35Z)
• Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning [55.20040781688844]
  QMIX is a novel value-based method that can train decentralised policies in a centralised end-to-end fashion. We propose the StarCraft Multi-Agent Challenge (SMAC) as a new benchmark for deep multi-agent reinforcement learning.
  arXiv  Detail & Related papers  (2020-03-19T16:51:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.