Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Yuzhu Mao

dblp:290/1809 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0001-6916-7990ORCID · corroborated

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

Computer networks · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Efficient and distributed learning · 79% Robot navigation and mapping · 21%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
1.522024
AQUILA: Communication Efficient Federated Learning With Adaptive Quantization in Device Selection Strategy · IEEE Trans. Mob. Comput. 2024
SAFARI: Sparsity-Enabled Federated Learning With Limited and Unreliable Communications · IEEE Trans. Mob. Comput. 2024
Machine learning › Efficient and distributed learning › model compression › quantization
adaptive quantization
0.812024
AQUILA: Communication Efficient Federated Learning With Adaptive Quantization in Device Selection Strategy · IEEE Trans. Mob. Comput. 2024
Machine learning › Efficient and distributed learning › federated learning
client selection
0.812024
AQUILA: Communication Efficient Federated Learning With Adaptive Quantization in Device Selection Strategy · IEEE Trans. Mob. Comput. 2024
Machine learning › Efficient and distributed learning › federated learning
communication-efficient federated learning
0.812024
AQUILA: Communication Efficient Federated Learning With Adaptive Quantization in Device Selection Strategy · IEEE Trans. Mob. Comput. 2024
Robotics › Robot navigation and mapping › localization
inertial navigation
0.812024
FormerReckoning: Physics Inspired Transformer for Accurate Inertial Navigation · MobiCom 2024
Robotics › Robot navigation and mapping
localization
0.212024
FormerReckoning: Physics Inspired Transformer for Accurate Inertial Navigation · MobiCom 2024
Distributed systems
distributed machine learning
0.212024
AQUILA: Communication Efficient Federated Learning With Adaptive Quantization in Device Selection Strategy · IEEE Trans. Mob. Comput. 2024

Methods — techniques the papers use, named apart from their topics

knowledge distillation · 1.5device selection · 1.5adaptive quantization · 1.5transformer · 0.8sparse learning · 0.8similarity-based compensation · 0.8physics-informed learning · 0.8convergence analysis · 0.8
YearPublicationVenuePosition
2025 TRRS-DM: Two-stage Resampling and Residual Shifting for high-fidelity texture inpainting of Terracotta Warriors utilizing Diffusion Models
Peiyuan Quan, Yuzhu Mao, Rui Cao 0003, Linzhi Su
Pattern Recognit.3
2024 FormerReckoning: Physics Inspired Transformer for Accurate Inertial Navigation
abstract
Although modern localization methods have achieved remarkable accuracy with various sensors, there are still some circumstances where only proprioceptive sensing works (Inertial Navigation). However, localization and navigation using only IMU sensors (costing less than $1000) still face significant challenges such as low accuracy and large cumulative errors when using traditional filter methods. Furthermore, AI-based approaches, while promising, often yield unpredictable and unreliable outputs. This paper proposes FormerReckoning, an inertial localization estimation framework for wheeled robotics that incorporates physical prompts into a Transformer framework to enhance translation estimation accuracy. Our tests show that FormerReckoning not only reduces mean translation errors to 0.72% but also surpasses all baseline models in performance, demonstrating its potential to provide reliable and precise localization in a cost-effective manner.
Jiaqi Li 0028, Chenyu Zhao 0002, Yuzhu Mao, Xinlei Chen, Wenbo Ding 0001, Xiaoyang Qu, Jianzong Wang
MobiCom3
2024 SAFARI: Sparsity-Enabled Federated Learning With Limited and Unreliable Communications
abstract
Federated learning (FL) enables edge devices to collaboratively learn a model in a distributed fashion. Many existing researches have focused on improving communication efficiency of high-dimensional models and addressing bias caused by local updates. However, most FL algorithms are either based on reliable communications or assuming fixed and known unreliability characteristics. In practice, networks could suffer from dynamic channel conditions and non-deterministic disruptions, with time-varying and unknown characteristics. To this end, in this paper we propose a sparsity-enabled FL framework with both improved communication efficiency and bias reduction, termed as SAFARI. It makes use of similarity among client models to rectify and compensate for bias that results from unreliable communications. More precisely, sparse learning is implemented on local clients to mitigate communication overhead, while to cope with unreliable communications, a similarity-based compensation method is proposed to provide surrogates for missing model updates. With respect to sparse models, we analyze SAFARI under bounded dissimilarity. It is demonstrated that SAFARI under unreliable communications is guaranteed to converge at the same rate as the standard FedAvg with perfect communications. Implementations and evaluations on the CIFAR-10 dataset validate the effectiveness of SAFARI by showing that it can achieve the same convergence speed and accuracy as FedAvg with perfect communications, with up to 60% of the model weights being pruned and a high percentage of client updates missing in each round of model updates.
Yuzhu Mao, Zihao Zhao 0001, Meilin Yang, Le Liang, Yang Liu 0165, Wenbo Ding 0001, Tian Lan 0001, Xiao-Ping Zhang 0002
IEEE Trans. Mob. Comput.1
2024 AQUILA: Communication Efficient Federated Learning With Adaptive Quantization in Device Selection Strategy
abstract
The widespread adoption of Federated Learning (FL), a privacy-preserving distributed learning methodology, has been impeded by the challenge of high communication overheads, typically arising from the transmission of large-scale models. Existing adaptive quantization methods, designed to mitigate these overheads, operate under the impractical assumption of uniform device participation. Additionally, these methods are limited in their adaptability due to the necessity of manual quantization level selection and often overlook biases inherent in local devices' data, thereby affecting the robustness of the global model. In response, this paper introduces AQUILA (adaptivequantization in device selection strategy), a novel adaptive framework devised to effectively handle these issues, enhancing the efficiency and robustness of FL. AQUILA integrates a sophisticated device selection method that prioritizes the quality and usefulness of device updates. Utilizing the exact global model stored by devices enables a more precise device selection criterion, reduces model deviation, and limits the need for hyperparameter adjustments. Furthermore, AQUILA presents an innovative quantization criterion, optimized to improve communication efficiency while assuring model convergence. Our experiments demonstrate that AQUILA significantly decreases communication costs compared to existing methods, while maintaining comparable model performance across diverse non-homogeneous FL settings, such as Non-IID data and heterogeneous model architectures.
Zihao Zhao 0001, Yuzhu Mao, Zhenpeng Shi, Yang Liu 0165, Tian Lan 0001, Wenbo Ding 0001, Xiao-Ping Zhang 0002
IEEE Trans. Mob. Comput.2
2022 Communication-Efficient Federated Learning with Adaptive Quantization
abstract
Federated learning (FL) has attracted tremendous attentions in recent years due to its privacy-preserving measures and great potential in some distributed but privacy-sensitive applications, such as finance and health. However, high communication overloads for transmitting high-dimensional networks and extra security masks remain a bottleneck of FL. This article proposes a communication-efficient FL framework with an Adaptive Quantized Gradient (AQG), which adaptively adjusts the quantization level based on a local gradient’s update to fully utilize the heterogeneity of local data distribution for reducing unnecessary transmissions. In addition, client dropout issues are taken into account and an Augmented AQG is developed, which could limit the dropout noise with an appropriate amplification mechanism for transmitted gradients. Theoretical analysis and experiment results show that the proposed AQG leads to 18% to 50% of additional transmission reduction as compared with existing popular methods, including Quantized Gradient Descent (QGD) and Lazily Aggregated Quantized (LAQ) gradient-based methods without deteriorating convergence properties. Experiments with heterogenous data distributions corroborate a more significant transmission reduction compared with independent identical data distributions. The proposed AQG is robust to a client dropping rate up to 90% empirically, and the Augmented AQG manages to further improve the FL system’s communication efficiency with the presence of moderate-scale client dropouts commonly seen in practical FL scenarios.
Yuzhu Mao, Zihao Zhao 0001, Guangfeng Yan, Yang Liu 0165, Tian Lan 0001, Linqi Song, Wenbo Ding 0001
ACM Trans. Intell. Syst. Technol.1