Federated learning (FL) leverages the private data and computing power of multiple clients to collaboratively train a global model. Many existing FL algorithms over wireless networks adopting synchronous model aggregation suffer from the straggler issue, due to the heterogeneity of local computing power and channel conditions. To address this issue, we in this paper advocate an asynchronous FL framework with adaptive client selection for training latency minimization, taking into account the client availability and long-term fairness. We consider a practical scenario, where the channel conditions and the locally available computing power are not known in prior. This makes the client selection problem challenging, as the training latency consists of the uplink/downlink transmission time and the local training time. To this end, we tackle the asynchronous client selection problem in an online manner by converting the latency minimization problem into a multi-armed bandit problem, and leverage the upper confidence bound policy and virtual queue technique in Lyapunov optimization to solve the problem. We theoretically show that the proposed algorithm achieves sub-linear regret performance, ensures long-term fairness, and guarantees training convergence. Results show that the proposed algorithm can reduce the training time by up to 50% when compared to the baseline algorithms.
1 December 2021 in IEEE Transactions on Vehicular Technology
Federated learning (FL) unleashes the full potential of training a global statistical model collaboratively from edge clients. In wireless FL, for the scarcity of spectrum, only a fraction of clients are capable to participate in the FL training in each round. On the other hand, the performance of FL suffers from the label noise, which naturally exists in the dataset of each client. To alleviate the label noise issue, prior works proposed several client selection algorithms, where the privacy of raw data might be compromised when extra information exchange was introduced. To avoid extra information exchange in FL, we propose to leverage an algorithm that measures the noise ratio of each client based on a clean validation dataset. We then propose an online client selection framework, supported by Copeland score and multi-arm bandits, which can select the client set with low noise ratios efficiently. The proposed algorithm is performed in the server side, thereby it can be implemented in the basic FL framework seamlessly. Simulation results demonstrate that our proposed algorithm spends less training time while guaranteeing the required accuracy compared to other baseline algorithms.
18 February 2022 in IEEE Transactions on Industrial Informatics
With the expected explosive use of the Internet of Everything in sixth generation (6G), the cybertwin network is able to convert user information to digital assets and provide extensive services. However, protecting and enhancing privacy of the processed and transmitted data in cybertwin-driven 6G is still in its infancy. Federated learning (FL) is a nascent distributed machine learning paradigm that is able to facilitate privacy protection in cybertwin networks. In a cybertwin network, imbalanced data distribution of the clients can increase the bias of the global model and sacrifice the performance of the FL model. Prior research work dealing with imbalanced data requires extra data information exchanged between clients and the server, which increases the risk of privacy leakage. To avoid privacy leakage, we design an estimation algorithm to determine the distribution of local data collected at the clients without the awareness of specific raw data. We consider two scenarios in FL: 1) the server could receive the individual trained model for each selected device and 2) the server could receive the aggregated model from the selected clients. We formulate two device selection problems to improve the training performance of the aforementioned scenarios. We develop two online learning algorithms to tackle the selection problems for both individual model uploading and aggregated model uploading. The proposed algorithms are conducted on the server, thereby avoiding privacy leakage and extra computation at the clients. We validate the effectiveness of the proposed client selection algorithms with sufficient experiments in cybertwin-driven 6G networks.
9 November 2022 in IEEE Transactions on Vehicular Technology
As a nascent privacy-preserving machine learning (ML) paradigm, federated learning (FL) leverages distributed clients at the network edge to collaboratively train an ML model. Asynchronous FL overcomes the straggler issue in synchronous FL. However, asynchronous FL incurs the staleness problem, which degrades the training performance of FL over wireless networks. To tackle the staleness problem, we develop a staleness compensation algorithm to improve the training performance of FL in terms of convergence and test accuracy. By including the first-order term in Taylor expansion of the gradient function, the proposed algorithm compensates the staleness in asynchronous FL. To further minimize training latency, we model the client selection for asynchronous FL as a multi-armed bandit problem. We develop an online client selection algorithm to minimize training latency without prior knowledge of the channel condition or local computing status. Simulation results show that the proposed algorithm outperforms the baseline algorithms in both test accuracy and training latency.
4 November 2024 in IEEE Internet of Things Journal
The integration of sensing, communication, and computation (ISCC) is a critical technology that will support various emerging wireless services in future 6G networks. The unmanned aerial vehicles (UAVs) equipped with edge servers can be used as an aerial service platform in intelligent transportation systems (ITS) to offer ISCC services to vehicles. This paper studies an aerial UAV network comprising a central UAV and secondary UAVs to realize sensing of the global ITS environment and data fusion computation through collaborative UAVs. To enhance the service performance of ISCC, we maximize the success rate of ISCC services and the energy efficiency of UAVs by jointly optimizing bandwidth allocation, power allocation, and computing capacity control while ensuring the sensing and data processing latency requirements. Leveraging the network architecture and collaboration requirements of UAVs, we propose the multi-UAV collaborative Air-ISCC (MCAI) algorithm based on the asynchronous advantage actor-critic algorithm, which obtains the optimal ISCC service policy by co-training a deep reinforcement learning model with multiple UAVs. Sufficient experimental results show that MCAI enhances energy efficiency by 10.51% to 80.12% compared with the baselines. Moreover, MCAI exhibits good scalability, strengthening its feasibility in real scenarios.
3 September 2021 in IEEE Transactions on Vehicular Technology
When the wireless communication system evolves to massive multiple-input multiple-output (MIMO) system, the system becomes more and more complex. Hybrid beamforming architecture provides excellent trade-off between the system performance and the complexity for the massive MIMO system. Hybrid beamforming architecture can be classified as fully-connected (FC) and sub-connected (SC) architecture. Existing studies on the system performance comparison of the two architectures are limited. In this paper, we investigate the performance of the FC and SC architecture in the multi-user multiple-input single-output (MU-MISO) system. We derive the closed-form sum rate of two architectures under the same total transmission power constraint. From the results, we conclude that the system performance of FC architecture is always better than that of SC architecture. When the number of users is small or the signal noise ratio (SNR) is low, the performance difference between the FC and SC architecture is small. Our analysis can serve as a guideline of choosing hybrid beamforming architectures.