Yuqing Tian

dblp:175/8978 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
8since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 2 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2025 Self-distillation with Mutual Assistance Mechanism: Enhancing Model Performance Through Collaborative Learning
Zhe Li 0020, Yuqing Tian
PRCV (8)3
2024 Realizing Over-the-Air Neural Networks in RIS-Assisted MIMO Communication Systems
abstract
Recently , over-the-air computation (OAC) has shown potential in realizing computation tasks over wireless transmission. Through proper transmit and receive beamforming design, multiple-input multiple-output (MIMO)-based OAC systems can even realize partial functions of neural networks (NNs). In this paper, we propose an OAC-NN with reconfigurable intelligent surface (RIS)-aided MIMO, in which the NN computation task can be realized through updating the RIS reflection matrix. In the proposed structure, the communication system can complete the overall simple NN-based tasks only through multiple rounds of transmissions without introducing any additional computing resources. Numerical results reflect the effectiveness of the proposed scheme and the tradeoff between communication costs and computing performance.
Yuzhi Yang, Zhaoyang Zhang 0001, Yuqing Tian, Zhaohui Yang 0001, Richeng Jin, Lei Liu 0005, Chongwen Huang
WCNC3
2024 Unsourced Multiple Access for Mission-Critical Control Systems in Industrial Internet of Things
abstract
In mission-critical Industrial Internet of Things (IIoT), multiple sensors make independent observations at different locations and then transmit them to the base station (BS) to obtain a global system state vector. Uploading observation information to the BS by active sensors is a multiple access process. As the task is to complete state estimation instead of maximizing the physical-layer capacity, conventional multiple access schemes cannot be applied directly to mission-critical IIoT applications. Therefore, next generation multiple access (NGMA) techniques are urgently needed to realize the key performance indicators for the design of IIoT networks. Note that, in mission-critical IIoT systems, each sensor can only obtain the observation of a subset of state variables, and the BS only cares about the state information embedded in that observation not the identities of the sensors. This indicates that the whole process of data transmission and state estimation can be totally unsourced, thus resulting in a highly efficient IIoT system implementation. Based on this crucial finding, in this article, we propose an unsourced multiple access (UMA)-based mission-critical IIoT system. Moreover, a decoupled UMA (D-UMA) scheme is proposed to improve transmission efficiency and state estimation performance. We analyse the fundamental aspects of how our design affects and guarantees the controllability, observability, and stability of an IIoT control system. Simulation results verify the remarkable performance of the proposed scheme compared with the conventional orthogonal multiple access (OMA) and nonorthogonal multiple access (NOMA) schemes.
Jingze Che, Zhaoyang Zhang 0001, Yuqing Tian, Zhaohui Yang 0001, Zhiji Deng, Xiaoming Chen 0001
IEEE Internet Things J.3
2024 Hierarchical Federated Edge Learning With Adaptive Clustering in Internet of Things
abstract
The expansion of the Internet of Things (IoT) has led to a significant surge in data flow over edge networks, posing substantial challenges to data mining and management. While federated edge learning (FEEL) effectively accomplishes global integration and local training based on the decentralized data sets, its deployment across expansive IoT networks introduces additional challenges. The primary issues stem from managing the interaction between the communication load and learning effectiveness. The communication loads driven by recurrent data exchanges between the user equipment (UE) and central servers exacerbate network congestion and latency issues. Moreover, the learning efficacy is undermined due to the typically nonindependent and identically distributed (non-IID) characteristics of real-world IoT data. In this article, a novel communication-efficient hierarchical FEEL framework is proposed to tackle these challenges. Specifically, UEs are adaptively clustered according to their link conditions, geographic locations, and data distributions. Small base stations (SBSs) collect local model updates from the UEs in their clusters and communicate with a macro base station (MBS) for the global model aggregation. To jointly maximize the communication gain (in terms of reducing latency) and the learning gain (in terms of improving accuracy), a clustering and resource allocation optimization problem is formulated, and a cross entropy-based method with low computational complexity is proposed. Numerical experiments validate that the proposed hierarchical FEEL system achieves fast convergence and significantly improves the system efficiency for various learning tasks and the system settings.
Yuqing Tian, Zhaoyang Zhang 0001, Richeng Jin, Hangguan Shan, Wei Wang 0021, Tony Q. S. Quek
IEEE Internet Things J.1
2023 Federated Learning with Unsourced Random Access
abstract
A large number of new applications are emerging in the future sixth-generation (6G) communication systems. Federated learning (FL) enables massive user equipments (UEs), such as mobile phones and Internet of Things (IoT) devices, to cooperatively learn a shared model for prediction in various applications, while keeping the training data local. However, in practical scenarios, there are still some problems in deploying FL systems, including serving a large number of active UEs, longtime delay, and the risk of UEs’ privacy leakage. To tackle these issues, we introduce unsourced random access (URA) into the FL systems. URA can support massive connectivity and its unsourced property can protect the UEs’ identity privacy. Moreover, considering the trade-off between communication and computation performance and the various importance of different UEs’ local models in training epochs, two importance metrics are designed. The UEs can decide their own active probability according to the metrics among the communication rounds, which avoids the additional cost of being scheduled by the base station (BS) and maximums the use of the limited communication resources to ensure UEs with higher priority can upload trained models, thus improving the training efficiency. Simulation results verify the remarkable communication and computation performance of the proposed schemes.
Yuqing Tian, Jingze Che, Zhaoyang Zhang 0001, Zhaohui Yang 0001
VTC2023-Spring1
2023 Over-the-Air Split Machine Learning in Wireless MIMO Networks
abstract
In split machine learning (ML), different partitions of a neural network (NN) are executed by different computing nodes, requiring a large amount of communication cost. As over-the-air computation (OAC) can efficiently implement all or part of the computation at the same time of communication, thus by substituting the wireless transmission in the traditional split ML framework with OAC, the communication load can be eased. In this paper, we propose to deploy split ML in a wireless multiple-input multiple-output (MIMO) communication network utilizing the intricate interplay between MIMO-based OAC and NN. The basic procedure of the OAC split ML system is first provided, and we show that the inter-layer connection in a NN of any size can be mathematically decomposed into a set of linear precoding and combining transformations over a MIMO channel carrying out multi-stream analog communication. The precoding and combining matrices which are regarded as trainable parameters, and the MIMO channel matrix, which are regarded as unknown (implicit) parameters, jointly serve as a fully connected layer of the NN. Most interestingly, the channel estimation procedure can be eliminated by exploiting the MIMO channel reciprocity of the forward and backward propagation, thus greatly saving the system costs and/or further improving its overall efficiency. The generalization of the proposed scheme to the conventional NNs is also introduced, i.e., the widely used convolutional NNs. We demonstrate its effectiveness under both the static and quasi-static memory channel conditions with comprehensive simulations.
Yuzhi Yang, Zhaoyang Zhang 0001, Yuqing Tian, Zhaohui Yang 0001, Chongwen Huang, Caijun Zhong, Kai-Kit Wong
IEEE J. Sel. Areas Commun.3
2022 Hierarchical Federated Learning with Adaptive Clustering on Non-IID Data
abstract
Federated learning (FL) in a mobile edge network faces challenges from both communication and learning per-spectives. The typically non-i.i.d. data can lead to slow convergence and low accuracy. To ease these challenges, frequent communications between user equipments (UEs) and the cen-tral macro base station (MBS) are necessary, aggravating the communication burden. In this paper, a novel hierarchical FL framework is proposed to alleviate the biased convergence of the global model, achieving better communication and computation efficiency. Specifically, the UEs are adaptively clustered and allocated to specific small base stations (SBSs) according to channel conditions, geographic locations, and data distributions. The SBSs are further aggregated to the MBS, forming a hier-archical FL framework. The joint user clustering and wireless resource allocation optimization problem is formulated. To solve this problem, a cross entropy (CE) based method with low computational complexity is proposed. Simulation results validate that the proposed hierarchical FL system can save more than 87 percent training time under the EMNIST Letters dataset, achieving fast convergence and significantly improving the system efficiency.
Yuqing Tian, Zhaoyang Zhang 0001, Zhaohui Yang 0001, Richeng Jin
GLOBECOM1
2022 Asynchronous Federated Learning Over Wireless Communication Networks
abstract
The conventional federated learning (FL) framework usually assumes synchronous reception and fusion of all the local models at the central aggregator and synchronous updating and training of the global model at all the agents as well. However, in a wireless network, due to limited radio resource, inevitable transmission failures and heterogeneous computing capacity, it is very hard to realize strict synchronization among all the involved user equipments (UEs). In this paper, we propose a novel asynchronous FL framework, which well adapts to the heterogeneity of users, communication environments and learning tasks, by considering both the possible delays in training and uploading the local models and the resultant staleness among the received models that has heavy impact on the global model fusion. A novel centralized fusion algorithm is designed to determine the fusion weight during the global update, which aims to make full use of the fresh information contained in the uploaded local models while avoiding the biased convergence by enforcing the impact of each UE’s local dataset to be proportional to its sample share. Numerical experiments validate that the proposed asynchronous FL framework can achieve fast and smooth convergence and enhance the training efficiency significantly.
Zhaoyang Zhang 0001, Yuqing Tian, Qianqian Yang 0002, Hangguan Shan, Wei Wang 0021, Tony Q. S. Quek
IEEE Trans. Wirel. Commun.3
2015 A Schedule Optimization for Weihai Bus System
abstract
An optimization model was developed for a realistic multi-route scenario to guide the vehicle schedule of bus systems at Weihai. The interactions of prospective passengers and bus companies were taken into consideration to achieve the maximum financial benefit as well as social satisfaction. The results shows that the difference between current operating pattern and newly suggested one was not so large that adjustment on bus schedule would be relatively easy to implement.
Yuqing Tian
ICSS2