Huiyuan Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Huiyuan Yang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Xiaojun Yuan
University of Electronic Science and Technology of China
5 shared publications - Chenxi Zhong
National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication - Shuo Shao
Department of System Science, University of Shanghai for Science and Technology, Shanghai, China
1 shared publication - Tian Ding
Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong
1 shared publication - Xin Wang
Fudan University
1 shared publication - Yuxuan Shi
Department of Networked Intelligence, Peng Cheng Laboratory, Shenzhen, China
1 shared publication
Latest Publications
- 4 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 11 (6) , 3628-3639
On the Second-Order Achievabilities of Indirect Quadratic Lossy Source Coding
This paper studies the second-order achievabilities of indirect quadratic lossy source coding for a specific class of source models, where the term “quadratic” denotes that the reconstruction fidelity of the hidden source is quantified by a squared error distortion measure. Specifically, it is assumed that the hidden source S can be expressed as S=φ(X)+W, where X is the observable source with alphabet X, φ(∙) is a deterministic function, and W is a random variable independent of X, satisfying E[W]=0, E[W2]>0, E[W3]=0, and E[W6]<∞. Additionally, both the set {φ(x): x εX}and the reconstruction alphabet for S are assumed to be bounded. Under the above settings, a second-order achievability bound is established using techniques based on distortion-tilted information. This result is then generalized to the case of indirect quadratic lossy source coding with observed source reconstruction, where reconstruction is required for both the hidden source S and the observable source X, and the distortion measure for X is not necessarily quadratic. These obtained bounds are consistent in form with their finite-alphabet counterparts, which have been proven to be second-order tight.
- 4 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 11 (6) , 3628-3639
On the Second-Order Achievabilities of Indirect Quadratic Lossy Source Coding
This paper studies the second-order achievabilities of indirect quadratic lossy source coding for a specific class of source models, where the term “quadratic” denotes that the reconstruction fidelity of the hidden source is quantified by a squared error distortion measure. Specifically, it is assumed that the hidden source S can be expressed as S=φ(X)+W, where X is the observable source with alphabet X, φ(∙) is a deterministic function, and W is a random variable independent of X, satisfying E[W]=0, E[W2]>0, E[W3]=0, and E[W6]<∞. Additionally, both the set {φ(x): x εX}and the reconstruction alphabet for S are assumed to be bounded. Under the above settings, a second-order achievability bound is established using techniques based on distortion-tilted information. This result is then generalized to the case of indirect quadratic lossy source coding with observed source reconstruction, where reconstruction is required for both the hidden source S and the observable source X, and the distortion measure for X is not necessarily quadratic. These obtained bounds are consistent in form with their finite-alphabet counterparts, which have been proven to be second-order tight.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (3) , 2358-2372
UAV-Enabled Asynchronous Federated Learning
To exploit unprecedented data generation in mobile edge networks, federated learning (FL) has emerged as a promising alternative to the conventional centralized machine learning (ML). By collectively training a unified learning model on edge devices, FL bypasses the need of direct data transmission, thereby addressing problems such as latency issues and privacy concerns inherent in centralized ML. However, in practical deployment FL suffers from low learning efficiency due to the involved straggler issue and huge uplink overhead. In this paper, we develop a UAV-enabled over-the-air asynchronous FL (UAV-AFL) framework to address this problem. This framework significantly enhance the learning efficiency by supporting the UAV as the parameter server (UAV-PS) in collecting data over-the-air and updating model continuously. We conduct a convergence analysis to quantitatively capture the impact of model asynchrony, device selection and communication errors on the UAV-AFL learning efficiency. Based on this analysis, a unified communication-learning problem is formulated to maximize asymptotical learning accuracy by optimizing the UAV-PS trajectory, device selection and over-the-air transceiver design. Simulation results reveal valuable insights for the system design and demonstrate that the proposed UAV-AFL scheme achieves substantially improvement in learning efficiency compared with the state-of-the-art approaches.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (3) , 2358-2372
UAV-Enabled Asynchronous Federated Learning
To exploit unprecedented data generation in mobile edge networks, federated learning (FL) has emerged as a promising alternative to the conventional centralized machine learning (ML). By collectively training a unified learning model on edge devices, FL bypasses the need of direct data transmission, thereby addressing problems such as latency issues and privacy concerns inherent in centralized ML. However, in practical deployment FL suffers from low learning efficiency due to the involved straggler issue and huge uplink overhead. In this paper, we develop a UAV-enabled over-the-air asynchronous FL (UAV-AFL) framework to address this problem. This framework significantly enhance the learning efficiency by supporting the UAV as the parameter server (UAV-PS) in collecting data over-the-air and updating model continuously. We conduct a convergence analysis to quantitatively capture the impact of model asynchrony, device selection and communication errors on the UAV-AFL learning efficiency. Based on this analysis, a unified communication-learning problem is formulated to maximize asymptotical learning accuracy by optimizing the UAV-PS trajectory, device selection and over-the-air transceiver design. Simulation results reveal valuable insights for the system design and demonstrate that the proposed UAV-AFL scheme achieves substantially improvement in learning efficiency compared with the state-of-the-art approaches.
- 27 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (6) , 4241-4256
Indirect Lossy Source Coding With Observed Source Reconstruction: Nonasymptotic Bounds and Second-Order Asymptotics
This paper considers the joint compression of a pair of correlated sources, where the encoder is allowed to access only one of the sources. The objective is to recover both sources under separate distortion constraints for each source while minimizing the rate. This problem generalizes the indirect lossy source coding problem by also requiring the recovery of the observed source. In this paper, we aim to study the nonasymptotic and second-order asymptotic properties of this problem. Specifically, we begin by deriving nonasymptotic achievability and converse bounds valid for general sources and distortion measures. The source dispersion (Gaussian approximation) is then determined through asymptotic analysis of the nonasymptotic bounds. We further examine the case of erased fair coin flips (EFCF) and provide its specific nonasymptotic achievability and converse bounds. Numerical results under the EFCF case demonstrate that our second-order asymptotic approximation closely approximates the optimum rate at appropriately large blocklengths.
- 27 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (6) , 4241-4256
Indirect Lossy Source Coding With Observed Source Reconstruction: Nonasymptotic Bounds and Second-Order Asymptotics
This paper considers the joint compression of a pair of correlated sources, where the encoder is allowed to access only one of the sources. The objective is to recover both sources under separate distortion constraints for each source while minimizing the rate. This problem generalizes the indirect lossy source coding problem by also requiring the recovery of the observed source. In this paper, we aim to study the nonasymptotic and second-order asymptotic properties of this problem. Specifically, we begin by deriving nonasymptotic achievability and converse bounds valid for general sources and distortion measures. The source dispersion (Gaussian approximation) is then determined through asymptotic analysis of the nonasymptotic bounds. We further examine the case of erased fair coin flips (EFCF) and provide its specific nonasymptotic achievability and converse bounds. Numerical results under the EFCF case demonstrate that our second-order asymptotic approximation closely approximates the optimum rate at appropriately large blocklengths.
- 19 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (8) , 4561-4576
Federated Learning With Lossy Distributed Source Coding: Analysis and Optimization
Recently, federated learning (FL), which replaces data sharing with model sharing, has emerged as an efficient and privacy-friendly machine learning (ML) paradigm. One of the main challenges in FL is the huge communication cost for model aggregation. Many compression/quantization schemes have been proposed to reduce the communication cost for model aggregation. However, the following question remains unanswered: What is the fundamental trade-off between the communication cost and the FL convergence performance? In this paper, we manage to answer this question. Specifically, we first put forth a general framework for model aggregation performance analysis based on the rate-distortion theory. Under the proposed analysis framework, we derive an inner bound of the rate-distortion region of model aggregation. We then conduct an FL convergence analysis to connect the aggregation distortion and the FL convergence performance. We formulate an aggregation distortion minimization problem to improve the FL convergence performance. Two algorithms are developed to solve the above problem. Numerical results on aggregation distortion, convergence performance, and communication cost demonstrate that the baseline model aggregation schemes still have great potential for further improvement.
- 19 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (8) , 4561-4576
Federated Learning With Lossy Distributed Source Coding: Analysis and Optimization
Recently, federated learning (FL), which replaces data sharing with model sharing, has emerged as an efficient and privacy-friendly machine learning (ML) paradigm. One of the main challenges in FL is the huge communication cost for model aggregation. Many compression/quantization schemes have been proposed to reduce the communication cost for model aggregation. However, the following question remains unanswered: What is the fundamental trade-off between the communication cost and the FL convergence performance? In this paper, we manage to answer this question. Specifically, we first put forth a general framework for model aggregation performance analysis based on the rate-distortion theory. Under the proposed analysis framework, we derive an inner bound of the rate-distortion region of model aggregation. We then conduct an FL convergence analysis to connect the aggregation distortion and the FL convergence performance. We formulate an aggregation distortion minimization problem to improve the FL convergence performance. Two algorithms are developed to solve the above problem. Numerical results on aggregation distortion, convergence performance, and communication cost demonstrate that the baseline model aggregation schemes still have great potential for further improvement.
- 18 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (6) , 3853-3868
Over-the-Air Federated Multi-Task Learning Over MIMO Multiple Access Channels
With the explosive growth of data and wireless devices, federated learning (FL) over wireless medium has emerged as a promising technology for large-scale distributed intelligent systems. Yet, the urgent demand for ubiquitous intelligence will generate a large number of concurrent FL tasks, which may seriously aggravate the scarcity of communication resources. By exploiting the analog superposition of electromagnetic waves, over-the-air computation (AirComp) is an appealing solution to alleviate the burden of communication required by FL. However, sharing frequency-time resources in over-the-air computation inevitably brings about the problem of inter-task interference, which poses a new challenge that needs to be appropriately addressed. In this paper, we study over-the-air federated multi-task learning (OA-FMTL) over the multiple-input multiple-output (MIMO) multiple access (MAC) channel. We propose a novel model aggregation method for the alignment of local gradients of different devices, which alleviates the straggler problem in over-the-air computation due to the channel heterogeneity. We establish a communication-learning analysis framework for the proposed OA-FMTL scheme by considering the spatial correlation between devices, and formulate an optimization problem for the design of transceiver beamforming and device selection. To solve this problem, we develop an algorithm by using alternating optimization (AO) and fractional programming (FP), which effectively mitigates the impact of inter-task interference on the FL learning performance. We show that due to the use of the new model aggregation method, device selection is no longer essential, thereby avoiding the heavy computational burden involved in selecting active devices. Numerical results demonstrate the validity of the analysis and the superb performance of the proposed scheme.
- 18 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (6) , 3853-3868
Over-the-Air Federated Multi-Task Learning Over MIMO Multiple Access Channels
With the explosive growth of data and wireless devices, federated learning (FL) over wireless medium has emerged as a promising technology for large-scale distributed intelligent systems. Yet, the urgent demand for ubiquitous intelligence will generate a large number of concurrent FL tasks, which may seriously aggravate the scarcity of communication resources. By exploiting the analog superposition of electromagnetic waves, over-the-air computation (AirComp) is an appealing solution to alleviate the burden of communication required by FL. However, sharing frequency-time resources in over-the-air computation inevitably brings about the problem of inter-task interference, which poses a new challenge that needs to be appropriately addressed. In this paper, we study over-the-air federated multi-task learning (OA-FMTL) over the multiple-input multiple-output (MIMO) multiple access (MAC) channel. We propose a novel model aggregation method for the alignment of local gradients of different devices, which alleviates the straggler problem in over-the-air computation due to the channel heterogeneity. We establish a communication-learning analysis framework for the proposed OA-FMTL scheme by considering the spatial correlation between devices, and formulate an optimization problem for the design of transceiver beamforming and device selection. To solve this problem, we develop an algorithm by using alternating optimization (AO) and fractional programming (FP), which effectively mitigates the impact of inter-task interference on the FL learning performance. We show that due to the use of the new model aggregation method, device selection is no longer essential, thereby avoiding the heavy computational burden involved in selecting active devices. Numerical results demonstrate the validity of the analysis and the superb performance of the proposed scheme.