Xingyu Li

Mr. Xingyu Li


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
14 December 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
XLXingyu Li
Xingyu Li
ZQZhe Qu
Zhe Qu
SZShangqing Zhao
Shangqing Zhao
Bo TangBo Tang
Bo Tang
ZLZhuo Lu
Zhuo Lu
YLYao Liu
Yao Liu
Federated learning (FL) provides a high efficient decentralized machine learning framework, where the training data remains distributed at remote clients in a network. Though FL enables a privacy-preserving mobile edge computing framework using IoT devices, recent studies have shown that this approach is susceptible to poisoning attacks from the side of remote clients. To address the poisoning attacks on FL, we provide a two-phase defense algorithm called Local Malicious Factor (LoMar). In phase I, LoMar scores model updates from each remote client by measuring the relative distribution over their neighbors using a kernel density estimation method. In phase II, an optimal threshold is approximated to distinguish malicious and clean updates from a statistical perspective. Comprehensive experiments on four real-world datasets have been conducted, and the experimental results show that our defense strategy can effectively protect the FL system. Specifically, the defense performance on Amazon dataset under a label-flipping attack indicates that, comparing with FG+Krum, LoMar increases the target label testing accuracy from $96.0\%$ to $98.8\%$ , and the overall averaged testing accuracy from 90.1% to $97.0%.

28 December 2023 in Neurocomputing
Verified
Journal Article
Closed access
XLXingyu Li
Xingyu Li
Bo TangBo Tang
Bo Tang
HLHaifeng Li
Haifeng Li

8 March 2023 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
XLXingyu Li
Xingyu Li
ZQZhe Qu
Zhe Qu
Bo TangBo Tang
Bo Tang
ZLZhuo Lu
Zhuo Lu
Federated learning (FL) is a decentralized machine learning architecture, which leverages a large number of remote devices to learn a joint model with distributed training data. However, the system-heterogeneity is one major challenge in an FL network to achieve robust distributed learning performance, which comes from two aspects: 1) device-heterogeneity due to the diverse computational capacity among devices and 2) data-heterogeneity due to the nonidentically distributed data across the network. Prior studies addressing the heterogeneous FL issue, for example, FedProx, lack formalization and it remains an open problem. This work first formalizes the system-heterogeneous FL problem and proposes a new algorithm, called federated local gradient approximation (FedLGA), to address this problem by bridging the divergence of local model updates via gradient approximation. To achieve this, FedLGA provides an alternated Hessian estimation method, which only requires extra linear complexity on the aggregator. Theoretically, we show that with a device-heterogeneous ratio $\rho $ , FedLGA achieves convergence rates on non-i.i.d. distributed FL training data for the nonconvex optimization problems with $\mathcal{O} ({}[{(1+\rho)}/{\sqrt {ENT}}] + {}{1}/{T})$ and $\mathcal{O} ({}[{(1+\rho)\sqrt {E}}/{\sqrt {TK}}] + {}{1}/{T})$ for full and partial device participation, respectively, where $E$ is the number of local learning epoch, $T$ is the number of total communication round, $N$ is the total device number, and $K$ is the number of the selected device in one communication round under partially participation scheme. The results of comprehensive experiments on multiple datasets indicate that FedLGA can effectively address the system-heterogeneous problem and outperform current FL methods. Specifically, the performance against the CIFAR-10 dataset shows that, compared with FedAvg, FedLGA improves the model’s best testing accuracy from 60.91% to 64.44%.

18 August 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
ZQZhe Qu
Zhe Qu
XLXingyu Li
Xingyu Li
JXJie Xu
Jie Xu
Bo TangBo Tang
Bo Tang
ZLZhuo Lu
Zhuo Lu
YLYao Liu
Yao Liu
Multi-server Federated learning (FL) has been considered as a promising solution to address the limited communication resource problem of single-server FL. We consider a typical multi-server FL architecture, where the coverage areas of regional servers may overlap. The key point of this architecture is that the clients located in the overlapping areas update their local models based on the average model of all accessible regional models, which enables indirect model sharing among different regional servers. Due to the complicated network topology, the convergence analysis is much more challenging than in single-server FL. In this paper, we firstly propose a novel MS-FedAvg algorithm for this multi-server FL architecture and analyze its convergence on non-iid datasets for general non-convex settings. Since the number of clients located in each regional server is much less than single-server FL, the bandwidth of each client should be large enough to successfully communicate training models with the server, which indicates that full client participation can work in multi-server FL. Also, we provide the convergence analysis of the partial client participation scheme and develop a new biased partial participation strategy to further accelerate convergence. Our results indicate that the convergence results highly depend on the ratio of the number of clients in each area type to the total number of clients in all three strategies. The extensive experiments show remarkable performance and support our theoretical results.

31 May 2019 in Electronics
Verified
Journal Article
Open access
PDF file
XLXingyu Li
Xingyu Li
Bo TangBo Tang
Bo Tang
John BallJohn Ball
John Ball
MDMatthew Doude
Matthew Doude
Daniel CarruthDaniel Carruth
Daniel Carruth
Perception, planning, and control are three enabling technologies to achieve autonomy in autonomous driving. In particular, planning provides vehicles with a safe and collision-free path towards their destinations, accounting for vehicle dynamics, maneuvering capabilities in the presence of obstacles, traffic rules, and road boundaries. Existing path planning algorithms can be divided into two stages: global planning and local planning. In the global planning stage, global routes and the vehicle states are determined from a digital map and the localization system. In the local planning stage, a local path can be achieved based on a global route and surrounding information obtained from sensors such as cameras and LiDARs. In this paper, we present a new local path planning method, which incorporates a vehicle’s time-to-rollover model for off-road autonomous driving on different road profiles for a given predefined global route. The proposed local path planning algorithm uses a 3D occupancy grid and generates a series of 3D path candidates in the s-p coordinate system. The optimal path is then selected considering the total cost of safety, including obstacle avoidance, vehicle rollover prevention, and comfortability in terms of path smoothness and continuity with road unevenness. The simulation results demonstrate the effectiveness of the proposed path planning method for various types of roads, indicating its wide practical applications to off-road autonomous driving.

27 May 2020 in Nanomedicine
Verified
Journal Article
Closed access
BXBohui Xu
Bohui Xu
YZYan Zhang
Yan Zhang
HYHan Yang
Han Yang
TLTingting Liu
Tingting Liu
YLYoujia Lu
Youjia Lu
TWThomas Webster
Thomas Webster
Aim: This study examined nanoparticle entry into tumor-associated vascular endothelial cells during transport to hepatocellular carcinoma cells and tumors. Materials & methods: siVEGF was loaded in...