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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuexin Shi

dblp:139/6966 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1 · 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
2 papers
Efficient and distributed learning · 100%
Computer networks
1 paper
Edge and fog computing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
1.922026
FedMHO: Heterogeneous One-Shot Federated Learning Towards Resource-Constrained Clients · WWW 2026
FedHM: Efficient federated learning for heterogeneous models via low-rank factorization · Artif. Intell. 2025
Machine learning › Efficient and distributed learning › federated learning › heterogeneous federated learning
model-heterogeneous federated learning
1.012026
FedMHO: Heterogeneous One-Shot Federated Learning Towards Resource-Constrained Clients · WWW 2026
Machine learning › Efficient and distributed learning › federated learning › communication-efficient federated learning
one-shot federated learning
1.012026
FedMHO: Heterogeneous One-Shot Federated Learning Towards Resource-Constrained Clients · WWW 2026
Machine learning › Efficient and distributed learning › federated learning
heterogeneous federated learning
0.912025
FedHM: Efficient federated learning for heterogeneous models via low-rank factorization · Artif. Intell. 2025
Machine learning › Efficient and distributed learning › model compression
low-rank approximation
0.912025
FedHM: Efficient federated learning for heterogeneous models via low-rank factorization · Artif. Intell. 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
FedHM: Efficient federated learning for heterogeneous models via low-rank factorization · Artif. Intell. 2025
Machine learning › Efficient and distributed learning
distributed training
0.312025
FedHM: Efficient federated learning for heterogeneous models via low-rank factorization · Artif. Intell. 2025

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

knowledge fusion · 2.0knowledge distillation · 2.0generative model · 2.0low-rank factorization · 0.9federated averaging · 0.9
YearPublicationVenuePosition
2026 FedMHO: Heterogeneous One-Shot Federated Learning Towards Resource-Constrained Clients
abstract
Federated Learning (FL) is increasingly adopted in edge computing scenarios, where a large number of heterogeneous clients operate under constrained or sufficient resources. The iterative training process of FL incurs considerable computation and communication overhead, which is unfriendly for resource-constrained devices. One-shot FL is a promising approach to addressing communication issues inherent in conventional FL, and model-heterogeneous FL solves the problem of diverse computing resources across clients. However, existing methods face challenges in effectively managing model-heterogeneous one-shot FL, often leading to unsatisfactory global model performance or reliance on auxiliary datasets. To address these challenges, we propose a novel FL framework named FedMHO, which leverages deep classification models on resource-sufficient clients and lightweight generative models on resource-constrained devices. On the server side, FedMHO involves a two-stage process that includes data generation and knowledge fusion. Furthermore, we introduce FedMHO-MD and FedMHO-SD to mitigate the knowledge-forgetting problem during the knowledge fusion stage, and an unsupervised data optimization solution to improve the quality of synthetic samples. Comprehensive experiments demonstrate the effectiveness of our methods, as they outperform state-of-the-art baselines in various experimental setups.
Dezhong Yao 0002, Tongtong Liu 0006, Yuexin Shi, Zhiqiang Xu 0003
WWW3
2025 FedHM: Efficient federated learning for heterogeneous models via low-rank factorization
abstract
One underlying assumption of recent Federated Learning (FL) paradigms is that all local models share an identical network architecture. However, this assumption is inefficient for heterogeneous systems where devices possess varying computation and communication capabilities. The presence of such heterogeneity among devices negatively impacts the scalability of FL and slows down the training process due to the existence of stragglers. To this end, this paper proposes a novel federated compression framework for heterogeneous models , named FedHM, distributing the heterogeneous low-rank models to clients and then aggregating them into a full-rank global model. Furthermore, FedHM significantly reduces communication costs by utilizing low-rank models. Compared with state-of-the-art heterogeneous FL methods under various FL settings, FedHM is superior in the performance and robustness of models with different sizes. Additionally, the convergence guarantee of FL for heterogeneous devices is first theoretically analyzed.
Dezhong Yao 0002, Wanning Pan, Yuexin Shi, Michael O'Neill 0002, Yutong Dai 0002, Yao Wan 0001, Peilin Zhao, Hai Jin 0001, Limin Sun 0001
Artif. Intell.3
2013 Dense depth acquisition via one-shot stripe structured light
abstract
Depth acquisition for moving objects becomes increasingly critical for some applications such as human facial expression recognition. This paper presents a method for capturing the depth maps of moving objects that uses a one-shot black-and-white stripe pattern with the features of simplicity and easily generation. Considering the accuracy of a matching is crucial for a precise depth map but the matching of variant-width stripes is sparse and rough, the phase differences extracted by Gabor filter to achieve a pixel-wise matching with sub-pixel accuracy are used. The details of the derivation are presented to prove that this method based on the phase difference calculated by Gabor filter is valid. In addition, the periodic ambiguity of the encoded stripe is eliminated by the epipolar segment covering a given depth range at a camera-projector calibrating stage to decrease the calculation complexity. Experimental results show that our method can get a dense and accurate depth map of a moving object.
Fu Li 0002, Guangming Shi, Fei Qi 0001, Yuexin Shi
VCIP5