Why Go Full? Elevating Federated Learning Through Partial Network Updates
This work addresses a specific bottleneck in federated learning for privacy-preserving distributed ML, offering an incremental improvement over traditional methods.
The paper tackles the layer mismatch problem in federated learning, where full network updates hinder model convergence and performance. The proposed FedPart method, which updates only partial layers per round, significantly improves convergence speed and accuracy while reducing communication and computational costs.
Federated learning is a distributed machine learning paradigm designed to protect user data privacy, which has been successfully implemented across various scenarios. In traditional federated learning, the entire parameter set of local models is updated and averaged in each training round. Although this full network update method maximizes knowledge acquisition and sharing for each model layer, it prevents the layers of the global model from cooperating effectively to complete the tasks of each client, a challenge we refer to as layer mismatch. This mismatch problem recurs after every parameter averaging, consequently slowing down model convergence and degrading overall performance. To address the layer mismatch issue, we introduce the FedPart method, which restricts model updates to either a single layer or a few layers during each communication round. Furthermore, to maintain the efficiency of knowledge acquisition and sharing, we develop several strategies to select trainable layers in each round, including sequential updating and multi-round cycle training. Through both theoretical analysis and experiments, our findings demonstrate that the FedPart method significantly surpasses conventional full network update strategies in terms of convergence speed and accuracy, while also reducing communication and computational overheads.