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

Yangshuo He

dblp:298/0914 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0002-5722-887XORCID · corroborated

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

Computer networks · 3 · 2 first-author · 3 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.

Computer networks
2 papers
Physical-layer communications · 67% Edge and fog computing · 33%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Edge and fog computing
distributed learning
0.912025
Robustness in Wireless Distributed Learning: An Information-Theoretic Analysis · IEEE Trans. Commun. 2025
Edge and fog computing › edge machine learning
wireless edge learning
0.912025
Robustness in Wireless Distributed Learning: An Information-Theoretic Analysis · IEEE Trans. Commun. 2025
Coding theory › source coding
rate-distortion theory
0.912025
Robustness in Wireless Distributed Learning: An Information-Theoretic Analysis · IEEE Trans. Commun. 2025
Physical-layer communications
channel coding
0.812024
Rate-Adaptive Coding Mechanism for Semantic Communications With Multi-Modal Data · IEEE Trans. Commun. 2024
Physical-layer communications › semantic communication
multi-modal semantic communication
0.812024
Rate-Adaptive Coding Mechanism for Semantic Communications With Multi-Modal Data · IEEE Trans. Commun. 2024
Physical-layer communications › channel coding › adaptive coding
rate-adaptive coding
0.812024
Rate-Adaptive Coding Mechanism for Semantic Communications With Multi-Modal Data · IEEE Trans. Commun. 2024
Physical-layer communications
semantic communication
0.812024
Rate-Adaptive Coding Mechanism for Semantic Communications With Multi-Modal Data · IEEE Trans. Commun. 2024
Physical-layer communications › channel modeling
channel impairment
0.312025
Robustness in Wireless Distributed Learning: An Information-Theoretic Analysis · IEEE Trans. Commun. 2025
Physical-layer communications › channel coding › error control coding
unequal error protection
0.212024
Rate-Adaptive Coding Mechanism for Semantic Communications With Multi-Modal Data · IEEE Trans. Commun. 2024

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

robust training · 1.7information-theoretic analysis · 1.7optimization · 0.8neural network · 0.8
YearPublicationVenuePosition
2025 Robustness in Wireless Distributed Learning: An Information-Theoretic Analysis
abstract
In recent years, the application of artificial intelligence (AI) in wireless communications has demonstrated inherent robustness against wireless channel distortions. Most existing works empirically leverage this robustness to yield considerable performance gains through AI architectural designs. However, there is a lack of direct theoretical analysis of this robustness and its potential to enhance communication efficiency, which restricts the full exploitation of these advantages. In this paper, we adopt an information-theoretic approach to evaluate the robustness in wireless distributed learning by deriving an upper bound on the task performance loss due to imperfect wireless channels. Utilizing this insight, we define task outage probability and characterize the maximum transmission rate under task accuracy guarantees, referred to as the task-aware ϵ-capacity resulting from the robustness. To achieve the utility of the theoretical results in practical settings, we present an efficient algorithm for the approximation of the upper bound. Subsequently, we devise a robust training framework that optimizes the trade-off between robustness and task accuracy, enhancing the robustness against channel distortions. Extensive experiments validate the effectiveness of the proposed upper bound and task-aware ϵ-capacity and demonstrate that the proposed robust training framework achieves high robustness, thus ensuring a high transmission rate while maintaining inference performance.
Yangshuo He, Guanding Yu, Huaiyu Dai
IEEE Trans. Commun.1
2024 Rate-Adaptive Coding Mechanism for Semantic Communications With Multi-Modal Data
abstract
Recently, the ever-increasing demand for bandwidth in multi-modal communication systems requires a paradigm shift. Powered by deep learning, semantic communications are applied to multi-modal scenarios to boost communication efficiency and save communication resources. However, the existing end-to-end neural network (NN) based framework without the channel encoder/decoder is incompatible with modern digital communication systems. Moreover, most end-to-end designs are task-specific and require re- design and re- training for new tasks, which limits their applications. In this paper, we propose a distributed multi-modal semantic communication framework incorporating the conventional channel encoder/decoder. We adopt NN-based semantic encoder and decoder to extract correlated semantic information contained in different modalities, including speech, text, and image. Based on the proposed framework, we further establish a general rate-adaptive coding mechanism for various types of multi-modal semantic tasks. In particular, we utilize unequal error protection based on semantic importance, which is derived by evaluating the distortion bound of each modality. We further formulate and solve an optimization problem that aims at minimizing inference delay while maintaining inference accuracy for semantic tasks. Numerical results show that the proposed mechanism fares better than both conventional communication and existing semantic communication systems in terms of task performance, inference delay, and deployment complexity.
Yangshuo He, Guanding Yu, Yunlong Cai
IEEE Trans. Commun.1
2024 Semantic Feature Scheduling and Rate Control in Multi-Modal Distributed Network
abstract
Traditional scheduling algorithms make decisions based solely on the channel conditions, without considering the transmitted semantic content. However, in multi-modal semantic communication systems, there is redundancy and variance in the importance of semantic features across modalities for task performance. To address this issue, we propose a novel feature scheduling and error probability control scheme that balances channel diversity and semantic diversity in semantic communication systems. Specifically, we first introduce a semantic feature importance metric to measure each feature’s contribution to the inference performance of semantic task. Using this metric, we formulate and solve an optimization problem to reduce overall latency while guaranteeing semantic task performance. Our detailed analysis examines feature selection strategies and transmission rate optimization to illustrate scheduling decisions based on both channel fading and semantic content. Consequently, we develop both optimal and low-complexity feature transmission scheduling schemes based on the optimization solution. Extensive experiments over multi-modal semantic communication systems validate that the semantic feature importance metric can reveal the importance of features from different modalities and accordingly affect their transmission rate. Additionally, the proposed schemes significantly reduce the system latency compared to the traditional methods.
Huiguo Gao, Guanding Yu, Yangshuo He, Yuanwei Liu
IEEE Trans. Wirel. Commun.3