Jiachen Li

Mr. Jiachen Li

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 December 2024 in Electronics
Verified
Journal Article
Open access
PDF file
JLJiachen Li
Jiachen Li
YZYuchao Zhang
Yuchao Zhang
YLYiping Li
Yiping Li
XGXiangyang Gong
Xiangyang Gong
WWWendong Wang
Wendong Wang
Federated learning (FL) strikes a balance between privacy preservation and collaborative model training. However, the periodic transmission of model updates or parameters from each client to the federated server incurs substantial communication overhead, especially for participants with limited network bandwidth. This overhead significantly hampers the practical applicability of FL in real-world scenarios. To address this challenge, we propose FedSparse, an innovative sparse communication framework designed to enhance communication efficiency. The core idea behind FedSparse is to introduce a communication overhead regularization term into the client’s objective function, thereby reducing the number of parameters that need to be transmitted. FedSparse incorporates a Resource Optimization Proximal (ROP) term and an Importance-based Regularization Weighting (IRW) mechanism into the client update objective function. The local update process optimizes both the empirical risk and communication overhead by applying a sparse regularization weighted by update importance. By making minimal modifications to traditional FL approaches, FedSparse effectively reduces the number of parameters transmitted, thereby decreasing the communication overhead. We evaluate the effectiveness of FedSparse through experiments on various datasets under non-independent and identically distributed (non-IID) conditions, demonstrating its flexibility in resource-constrained environments. On the MNIST, Fashion-MNIST, and CIFAR datasets, FedSparse reduces the communication overhead by 24%, 17%, and 5%, respectively, compared to the baseline algorithm, while maintaining similar model performance. Additionally, on simulated non-IID datasets, FedSparse achieves a 6% to 8% reduction in communication resource consumption. By adjusting the sparsity intensity hyperparameter, we demonstrate that FedSparse can be tailored to different FL applications with varying communication resource constraints. Finally, ablation studies highlight the individual contributions of the ROP and IRW modules to the overall improvement in communication efficiency.

6 October 2023
Verified
Conference Paper
Open access
JLJiachen Li
Jiachen Li
YZYuchao Zhang
Yuchao Zhang
YLYiping Li
Yiping Li
XGXiangyang Gong
Xiangyang Gong
WWWendong Wang
Wendong Wang
Federated learning (FL) has yielded impressive results in recent years. However, its effectiveness on non-independently and identically distributed (non-i.i.d) data remains challenging. Existing work aims to address this challenge through client selection strategies or modifications to the client objective function. Despite these efforts, we contend that existing methods are unable to fully leverage client gradients. In this paper, we posit that the challenge of non-i.i.d data stems primarily from conflicting gradients among clients, resulting in deviations in both gradient magnitude and direction. Building on this insight, we propose a simple plug-in, named the Federated Gradient Tailor (FGT), to mitigate the non-i.i.d challenge by identifying and calibrating conflicting gradients before federated aggregation. To evaluate the efficacy of our approach, we conduct a series of experiments on simulated non-i.i.d datasets and demonstrate that the Federated Gradient Tailor significantly improves inference accuracy by 5% and achieves 6 times convergence speedup. Our findings highlight the value of explicitly addressing conflicting gradients in non-i.i.d data, as well as the effectiveness of the proposed Federated Gradient Tailor. This contribution has implications for further enhancing the performance of FL in real-world settings with non-i.i.d data distributions.