Pith. sign in

REVIEW 1 cited by

Multi-Agent Reinforcement Learning for Power Control in Wireless Networks via Adaptive Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.15858 v1 pith:ZZU2PNYU submitted 2023-11-27 cs.NI cs.LGcs.MA

classification cs.NIcs.LGcs.MA
keywords networkslearningoptimizationwirelessagentschallengescommunicationcontrol
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The ever-increasing demand for high-quality and heterogeneous wireless communication services has driven extensive research on dynamic optimization strategies in wireless networks. Among several possible approaches, multi-agent deep reinforcement learning (MADRL) has emerged as a promising method to address a wide range of complex optimization problems like power control. However, the seamless application of MADRL to a variety of network optimization problems faces several challenges related to convergence. In this paper, we present the use of graphs as communication-inducing structures among distributed agents as an effective means to mitigate these challenges. Specifically, we harness graph neural networks (GNNs) as neural architectures for policy parameterization to introduce a relational inductive bias in the collective decision-making process. Most importantly, we focus on modeling the dynamic interactions among sets of neighboring agents through the introduction of innovative methods for defining a graph-induced framework for integrated communication and learning. Finally, the superior generalization capabilities of the proposed methodology to larger networks and to networks with different user categories is verified through simulations.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Improving monotonic optimization in heterogeneous multi-agent reinforcement learning with optimal marginal deterministic policy gradient

    cs.AI 2025-07 reject novelty 5.0 of 10

    OMDPG combines optimal marginal Q-values with pessimistic Q-critics to reconcile monotonic improvement with partial parameter sharing in heterogeneous multi-agent RL.

Pith tools