Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 43 min ago
PreprintarXiv licencearXiv

A Joint Power-Privacy Control Framework for Decentralized Learning over Heterogeneous Wireless Multicasting Networks

Abstract

In this paper, we propose a decentralized learning framework that incorporates both power control and privacy guarantees. Specifically, we enable a set of clients in a wireless multicast network to jointly train a common model while maintaining a prescribed per-iteration maximum privacy leakage level. The communication network is represented by a rowstochastic adjacency matrix, allowing us to capture asymmetric channel gains as well as heterogeneous maximum transmit power levels. Differential privacy is enforced through an explicit powersplitting strategy that allocates each node's limited maximum transmit power between model coefficients and injected Gaussian noise, thereby jointly controlling learning performance and privacy leakage. We further prove that the proposed algorithm achieves a cumulative regret bound of O(logT), whereTdenotes the time horizon. To evaluate the practical performance of our approach, we perform comprehensive experiments on the CIFAR-10 dataset under both IID and non-IID data distributions, considering different privacy levels, diverse numbers of clients, and various graph topologies. The results demonstrate strong performance across the considered settings and improved performance over existing methods, highlighting the effectiveness of the proposed algorithm under realistic wireless communication constraints.

Related

  1. Decentralized Decision-Making among Heterogeneous Autonomous Vehicles: An α-Potential Game Framework
    Anran Hu, Zhexin Wang, Yufei Zhang +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Over-the-Air Federated Learning in Heterogeneous Mobile Wireless Networks
    Ming Xiang, Nicolò Michelusi, Yonina C. Eldar +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. DeepTelecom: A Differentiable Multimodal Framework for Channel Twinning in Dynamic Heterogeneous Wireless Environments
    Bohao Wang, Tianen Yuan, William Yen +12
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Decentralized Bandit Learning of Markov Perfect Equilibria
    Felix Höfer, H. Mete Soner
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv
  5. Learning to Refer: Inference-Time Collaboration in Decentralized Federated Learning
    Yuheng Ma, Chendi Wang, Qiong Zhang
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{ziaeddini2026joint,
  title = {{A Joint Power-Privacy Control Framework for Decentralized Learning over Heterogeneous Wireless Multicasting Networks}},
  author = {Amir Ziaeddini and Yauhen Yakimenka and Joerg Kliewer},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.03245},
  eprint = {2609.03245},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.03245},
}
RIS
TY  - UNPB
TI  - A Joint Power-Privacy Control Framework for Decentralized Learning over Heterogeneous Wireless Multicasting Networks
AU  - Amir Ziaeddini
AU  - Yauhen Yakimenka
AU  - Joerg Kliewer
PY  - 2026
DA  - 2026/09/03
PB  - arXiv
DO  - 10.48550/arxiv.2609.03245
UR  - https://arxiv.org/abs/2609.03245
AB  - In this paper, we propose a decentralized learning framework that incorporates both power control and privacy guarantees. Specifically, we enable a set of clients in a wireless multicast network to jointly train a common model while maintaining a prescribed per-iteration maximum privacy leakage level. The communication network is represented by a rowstochastic adjacency matrix, allowing us to capture asymmetric channel gains as well as heterogeneous maximum transmit power levels. Differential privacy is enforced through an explicit powersplitting strategy that allocates each node's limited maximum transmit power between model coefficients and injected Gaussian noise, thereby jointly controlling learning performance and privacy leakage. We further prove that the proposed algorithm achieves a cumulative regret bound of O(logT), whereTdenotes the time horizon. To evaluate the practical performance of our approach, we perform comprehensive experiments on the CIFAR-10 dataset under both IID and non-IID data distributions, considering different privacy levels, diverse numbers of clients, and various graph topologies. The results demonstrate strong performance across the considered settings and improved performance over existing methods, highlighting the effectiveness of the proposed algorithm under realistic wireless communication constraints.
ER  -