Joint Optimization of Communication and Device Clustering for Secure Clustered Federated Learning

In this paper, a secure and communication-efficient clustered federated learning (CFL) design is investigated. In our model, several base stations (BSs) with heterogeneous task-handling capabilities and multiple users with non-independent and identically distributed (non-IID) data jointly perform CFL training using differential privacy (DP) techniques. Since each BS can process only a subset of learning tasks and has limited wireless resource blocks to allocate to users for federated learning (FL) model parameter transmission, it is necessary to jointly optimize resource block (RB) allocation and user scheduling for CFL performance optimization. Meanwhile, our considered CFL requires devices to use their limited data and FL model information to determine their task identities, which may introduce additional communication overhead. This problem is formulated as an optimization problem whose goal is to minimize the training loss of all learning tasks while considering device clustering, RB allocation, noise, and FL model transmission delay. To solve this, we propose a novel value decomposed multi-agent reinforcement learning (VD-MARL) algorithm that enables distributed BSs to independently determine their connected users, the RBs, and DP noise of the connected users but jointly minimize the training loss of all learning tasks across all BSs. Different from the existing MARL methods that assign a large penalty for invalid actions, we propose a novel penalty assignment scheme that assigns penalty depending on the number of devices that cannot meet communication constraints (e.g., delay), which can guide the MARL scheme to quickly find valid actions thus improving the convergence speed. Simulation results show that the VD-MARL can improve the convergence rate by up to 35% and the ultimate accumulated rewards by 27% compared to independent Q-learning.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11160725
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint Optimization of Communication and Device Clustering for Secure Clustered Federated Learning

Mingzhe Chen, Dongyu Wei, Shiwen Mao, Yuchen Liu et al.
Privacy-Preserving Technologies in Data
article

Joint Optimization of Communication and Device Clustering for Secure Clustered Federated Learning

Mingzhe Chen, Dongyu Wei, Shiwen Mao, Yuchen Liu, Hanzhi Yu
article en

Abstract

In this paper, a secure and communication-efficient clustered federated learning (CFL) design is investigated. In our model, several base stations (BSs) with heterogeneous task-handling capabilities and multiple users with non-independent and identically distributed (non-IID) data jointly perform CFL training using differential privacy (DP) techniques. Since each BS can process only a subset of learning tasks and has limited wireless resource blocks to allocate to users for federated learning (FL) model parameter transmission, it is necessary to jointly optimize resource block (RB) allocation and user scheduling for CFL performance optimization. Meanwhile, our considered CFL requires devices to use their limited data and FL model information to determine their task identities, which may introduce additional communication overhead. This problem is formulated as an optimization problem whose goal is to minimize the training loss of all learning tasks while considering device clustering, RB allocation, noise, and FL model transmission delay. To solve this, we propose a novel value decomposed multi-agent reinforcement learning (VD-MARL) algorithm that enables distributed BSs to independently determine their connected users, the RBs, and DP noise of the connected users but jointly minimize the training loss of all learning tasks across all BSs. Different from the existing MARL methods that assign a large penalty for invalid actions, we propose a novel penalty assignment scheme that assigns penalty depending on the number of devices that cannot meet communication constraints (e.g., delay), which can guide the MARL scheme to quickly find valid actions thus improving the convergence speed. Simulation results show that the VD-MARL can improve the convergence rate by up to 35% and the ultimate accumulated rewards by 27% compared to independent Q-learning.

North Carolina State University (US), University of Miami (US), North Central State College (US), Auburn University (US)
Openalex Percentile: Top 86%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.