Yuezhi Zhou

Dr. Yuezhi Zhou

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
13 December 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
YDYongheng Deng
Yongheng Deng
FLFeng Lyu
Feng Lyu
JRJu Ren
Ju Ren
HWHuaqing Wu
Huaqing Wu
YZYuezhi Zhou
Yuezhi Zhou
XSXuemin Shen
Xuemin Shen
The emergency of federated learning (FL) enables distributed data owners to collaboratively build a global model without sharing their raw data, which creates a new business chance for building data market. However, in practical FL scenarios, the hardware conditions and data resources of the participant clients can vary significantly, leading to different positive/negative effects on the FL performance, where the client selection problem becomes crucial. To this end, we propose AUCTION , an A utomated and q U ality-aware C lient selec TION framework for efficient FL, which can evaluate the learning quality of clients and select them automatically with quality-awareness for a given FL task within a limited budget. To design AUCTION , multiple factors such as data size, data quality, and learning budget that can affect the learning performance should be properly balanced. It is nontrivial since their impacts on the FL model are intricate and unquantifiable. Therefore, AUCTION is designed to encode the client selection policy into a neural network and employ reinforcement learning to automatically learn client selection policies based on the observed client status and feedback rewards quantified by the federated learning performance. In particular, the policy network is built upon an encoder-decoder deep neural network with an attention mechanism, which can adapt to dynamic changes of the number of candidate clients and make sequential client selection actions to reduce the learning space significantly. Extensive experiments are carried out based on real-world datasets and well-known learning models to demonstrate the efficiency, robustness, and scalability of AUCTION .

1 August 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
YDYongheng Deng
Yongheng Deng
FLFeng Lyu
Feng Lyu
JRJu Ren
Ju Ren
YCYi-Chao Chen
Yi-Chao Chen
PYPeng Yang
Peng Yang
YZYaoxue Zhang
Yaoxue Zhang
Federated learning enables distributed model training over various computing nodes, e.g., mobile devices, where instead of sharing raw user data, computing nodes can solely commit model updates without compromising data privacy. The quality of federated learning relies on the model updates contributed by computing nodes training with their local data. However, with various factors (e.g., training data size, mislabeled data samples, skewed data distributions), the model update qualities of computing nodes can vary dramatically, while inclusively aggregating low-quality model updates can deteriorate the global model quality. To achieve efficient federated learning, in this paper, we propose a novel framework named FAIR , i.e., F ederated le A rning with qual I ty awa R eness. Particularly, FAIR integrates three major components: 1) learning quality estimation: we adopt the model aggregation weight (learned in the third component) to reversely quantify the individual learning quality of nodes in a privacy-preserving manner, and leverage the historical learning records to infer the next-round learning quality; 2) quality-aware incentive mechanism: within the recruiting budget, we model a reverse auction problem to stimulate the participation of high-quality and low-cost computing nodes, and the method is proved to be truthful, individually rational, and computationally efficient; and 3) auto-weighted model aggregation: based on the gradient descent method, we devise an auto-weighted model aggregation algorithm to automatically learn the optimal aggregation weights to further enhance the global model quality. Based on real-world datasets and learning tasks, extensive experiments are conducted to demonstrate the efficacy of FAIR .

13 February 2024 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
YDYongheng Deng
Yongheng Deng
FLFeng Lyu
Feng Lyu
TXTengxi Xia
Tengxi Xia
YZYuezhi Zhou
Yuezhi Zhou
YZYaoxue Zhang
Yaoxue Zhang
YYYuanyuan Yang
Yuanyuan Yang
Federated learning (FL) enables collaborative model training over distributed computing nodes without sharing their privacy-sensitive raw data. However, in FL, iterative exchanges of model updates between distributed nodes and the cloud server can result in significant communication cost, especially when the data distributions at distributed nodes are imbalanced with requiring more rounds of iterations. In this paper, with our in-depth empirical studies, we disclose that extensive cloud aggregations can be avoided without compromising the learning accuracy if frequent aggregations can be enabled at edge network. To this end, we shed light on the hierarchical federated learning (HFL) framework, where a subset of distributed nodes can play as edge aggregators to support edge aggregations. Under the HFL framework, we formulate a communication cost minimization (CCM) problem to minimize the total communication cost required for model learning with a target accuracy by making decisions on edge aggragator selection and node-edge associations. Inspired by our data-driven insights that the potential of HFL lies in the data distribution at edge aggregators, we propose ShapeFL, i.e., SHaping dAta distRibution at Edge, to transform and solve the CCM problem. In ShapeFL, we divide the original problem into two sub-problems to minimize the per-round communication cost and maximize the data distribution diversity of edge aggregator data, respectively, and devise two light-weight algorithms to solve them accordingly. Extensive experiments are carried out based on several opened datasets and real-world network topologies, and the results demonstrate the efficacy of ShapeFL in terms of both learning accuracy and communication efficiency.

16 December 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
JHJunyi He
Junyi He
DZDi Zhang
Di Zhang
YZYuezhi Zhou
Yuezhi Zhou
YZYaoxue Zhang
Yaoxue Zhang
Collaborative computation offloading in Mobile Edge Computing (MEC) where edge users offload tasks opportunistically to resourceful neighboring mobile devices (MDs), offers a promising solution to satisfy low-latency requirements. However, most existing works assume that those MDs volunteer to help edge users without an incentive mechanism. In this paper, we propose an auction-based incentive mechanism, where users and MDs participate in the system dynamically. Our auction mechanism runs in the online fashion and optimizes the long-term system welfare without knowledge of future information, e.g, task start time, task length, resource demand, and valuation, etc. We prove that the proposed online mechanism achieves the desired properties, including individual rationality, truthfulness, and computational tractability. Moreover, the theoretical competitive ratio shows that our online mechanism achieves near-optimal long-term social welfare close to the offline optimum. Extensive experiments based on real-world traces demonstrate the efficiency of the proposed online mechanism.

1 December 2021 in Tsinghua Science and Technology
Verified
Journal Article
Closed access
QHQuanwei Huang
Quanwei Huang
YZYuezhi Zhou
Yuezhi Zhou
LTLinmi Tao
Linmi Tao
WYWeikang Yu
Weikang Yu
YZYaoxue Zhang
Yaoxue Zhang
ZHZuoxiang He
Zuoxiang He
The accurate segmentation of medical images is crucial to medical care and research; however, many efficient supervised image segmentation methods require sufficient pixel level labels. Such requirement is difficult to meet in practice and even impossible in some cases, e.g., rare Pathoma images. Inspired by traditional unsupervised methods, we propose a novel Chan-Vese model based on the Markov chain for unsupervised medical image segmentation. It combines local information brought by superpixels with the global difference between the target tissue and the background. Based on the Chan-Vese model, we utilize weight maps generated by the Markov chain to model and solve the segmentation problem iteratively using the min-cut algorithm at the superpixel level. Our method exploits abundant boundary and local region information in segmentation and thus can handle images with intensity inhomogeneity and object sparsity. In our method, users gain the power of fine-tuning parameters to achieve satisfactory results for each segmentation. By contrast, the result from deep learning based methods is rigid. The performance of our method is assessed by using four Computerized Tomography (CT) datasets. Experimental results show that the proposed method outperforms traditional unsupervised segmentation techniques.

23 February 2025 in Future Internet
Verified
Journal Article
Open access
PDF file
YZYuezhi Zhou
Yuezhi Zhou
XCXu Chen
Xu Chen
In recent years, the field of artificial intelligence has made a revolutionary breakthrough