Haikun Zheng

Haikun Zheng

Auto-generated profile, based on publicly available information

Haikun Zheng

School of Computer Science and Technology, East China Normal University, Shanghai, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
5 January 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
WMWei Mao
Wei Mao
XLXingjian Lu
Xingjian Lu
YJYuhui Jiang
Yuhui Jiang
HZHaikun Zheng
Haikun Zheng
Federated Learning (FL) is a promising paradigm for massive data mining service while protecting users' privacy. In wireless federated learning networks (WFLNs), limited communication resources and heterogeneity of user devices have essential impacts on training efficiency of FL, hence it is critical to select clients and allocate network bandwidths among them in each learning round to improve the training efficiency. In this paper, we formulate the joint client selection and bandwidth allocation optimization problem as a MDP process and design a FL framework CSBWA to solve it. CSBWA relies on DRL-based REINFORCE algorithm to automatically perform effective policy based on observed information, e.g. client states, historical bandwidths, and feedback rewards. It is able to achieve lower time cost and energy consumption with long-term FL performance guarantee by jointly optimizing the client selection and bandwidth allocation. Experimental results show the effectiveness of CSBWA in reducing time cost and energy consumption while guaranteeing model performance of wireless federated learning compared with existing state-of-art methods.

12 March 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
XLXingjian Lu
Xingjian Lu
HZHaikun Zheng
Haikun Zheng
WLWenyan Liu
Wenyan Liu
YJYuhui Jiang
Yuhui Jiang
HWHongyue Wu
Hongyue Wu
Federated Learning (FL) is a promising paradigm for mining massive data while respecting users' privacy. However, the deployment of FL on resource-constrained edge devices remains elusive due to its high resource demand. In this paper, unlike existing works that use expensive dense models, we propose to utilize dynamic sparse training in FL and design a novel sparse-to-sparse FL framework, named as POP-FL. The framework can reduce both computation and communication overheads while maintaining the performance of the global model. Specifically, POP-FL partitions massive clients into groups and performs parallel parameter exploration, i.e., Parallel Over-Parameterization , over the collaboration between these groups. This exploration can greatly improve the expressibility and generalizability of sparse training in FL (especially for extreme sparsity levels) through reliably covering sufficient parameters and dynamically updating the global sparse network's structure during the training process. Experimental results show that compared with existing sparse-to-sparse training methods in both iid and non-iid data distribution, POP-FL achieves the best inference accuracy on various representative networks.