Metraipolis › archive › dc_70a70360b8fc
FedCritic-MIMO: Communication-Efficient Serverless Federated Critic Learning for Massive-MIMO Resource Control in Open and Disaggregated 6G RANs — arXiv:2608.03852
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03852
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:14:40.689Z
- SHA-256 of the archived text
4f8f4b19f3d67148f4d6c80dd5d3ccc5ba7cf5af3eaca1db60499b9b2c354121- Stable URL of this page
https://metraipolis.com/documento/dc_70a70360b8fc
How to cite
FedCritic-MIMO: Communication-Efficient Serverless Federated Critic Learning for Massive-MIMO Resource Control in Open and Disaggregated 6G RANs — arXiv:2608.03852 — arXiv (en), https://arxiv.org/abs/2608.03852 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_70a70360b8fc (Metraipolis archive dc_70a70360b8fc, sha256 4f8f4b19f3d67148f4d6c80dd5d3ccc5ba7cf5af3eaca1db60499b9b2c354121)
BibTeX
@misc{dc70a70360b8fc,
title = {FedCritic-MIMO: Communication-Efficient Serverless Federated Critic Learning for Massive-MIMO Resource Control in Open and Disaggregated 6G RANs — arXiv:2608.03852},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03852},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_70a70360b8fc; sha256 4f8f4b19f3d67148f4d6c80dd5d3ccc5ba7cf5af3eaca1db60499b9b2c354121},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03852. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper proposes FedCritic-MIMO, a communication-efficient serverless federated multi-agent reinforcement learning framework for AI-native resource control across independently deployable cell-level controllers in open and disaggregated 6G RANs. Controllers share no trainer, retain local actors and personalized critic components, and exchange only compatible shared critic parameters. FedCritic-MIMO targets reuse-$1$ multi-cell massive-MIMO OFDMA deployments, where RAN controllers jointly manage user scheduling, per-stream power allocation, beamforming, interference, and long-term QoS with limited inter-controller signaling. Each base station locally executes its actor without centralized training or actor federation, while critic knowledge is exchanged peer-to-peer over an interference-aware graph. It enables this collaboration through wireless-aware event triggering, adaptive layer-wise top-$k$ sparse critic exchange with error feedback, and balanced interference-aware fusion. We establish conditional finite-time stationarity and consensus guarantees for the balanced, compressed peer-to-peer critic recursion under a fixed-policy, frozen-target critic-regression model. In strongly interference-coupled reuse-$1$ simulations, FedCritic-MIMO achieves the best performance-communication tradeoff among heuristic, independent-learning, centralized-training, and communication-ablation baselines. It achieves the highest held-out throughput, improves user-rate distribution and mean SINR, increases QoS satisfaction, and attains the lowest interference cost per delivered bit among learning baselines. It reduces critic-communication overhead by $76\%$ relative to uncompressed distributed critic exchange. These results demonstrate that serverless exchange of compatible shared critic parameters can coordinate RAN controllers without centralized trajectory collection or parameter-server aggregation. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-05 in cs.MA). Categorie arXiv: Machine Learning (cs.LG) ; Multiagent Systems (cs.MA); Networking and Internet Architecture (cs.NI). Pagina del lavoro: https://arxiv.org/abs/2608.03852 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T12:05:27.226Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).