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

Yufang Wu

dblp:343/8726 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0001-6419-1155ORCID · corroborated

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

Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
1 paper
Efficient and distributed learning · 100%
Network and information security
2 papers
Blockchain and cryptocurrency security · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › distributed storage
decentralized storage
1.012026
The Promise vs. Reality of NFT Decentralization: An Empirical Study of Storage Strategies and Defects · WWW 2026
Machine learning › Efficient and distributed learning
federated learning
0.912025
RobustPFL: Robust Personalized Federated Learning · IEEE Trans. Dependable Secur. Comput. 2025
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
0.912025
RobustPFL: Robust Personalized Federated Learning · IEEE Trans. Dependable Secur. Comput. 2025
Machine learning › Efficient and distributed learning › federated learning
robust federated learning
0.912025
RobustPFL: Robust Personalized Federated Learning · IEEE Trans. Dependable Secur. Comput. 2025
Software maintenance and evolution
software defects
0.312026
The Promise vs. Reality of NFT Decentralization: An Empirical Study of Storage Strategies and Defects · WWW 2026

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

empirical study · 3.0local collaborative training · 1.7layer-position normalized similarity · 1.7blockchain committee mechanism · 1.7
YearPublicationVenuePosition
2026 The Promise vs. Reality of NFT Decentralization: An Empirical Study of Storage Strategies and Defects
Yufang Wu, Siwen Chen, Chao Li 0023, Yuan Weng, Wei Wang 0012
WWW1
2025 RobustPFL: Robust Personalized Federated Learning
abstract
Conventional federated learning (FL) coordinated by a central server focuses on training a global model and protecting the privacy of clients' training data by storing it locally. However, the statistical heterogeneity hinders the global model from adapting to the non-IID distributions among clients. Moreover, untrusted and unreliable central servers and malicious clients may compromise model integrity and availability, thus degrading the robustness of FL. To address these challenges, we present RobustPFL, a decentralized personalized federated learning (PFL) approach that combines$\alpha$-based Layer-position Normalized Similarity ($\alpha$-LNS) and local collaborative training to improve personalized performance while utilizing a blockchain-based committee mechanism to coordinate the aggregation process, thereby achieving high personalized accuracy and robustness. Extensive experiments show that our RobustPFL approach outperforms multiple algorithms, including Local training, FedAvg, FedReptile, Per-FedAvg, FedBN, and SPFL, on MNIST, CIFAR10, EMNIST, and N-BaIoT datasets in four non-IID settings. We also evaluate RobustPFL's effectiveness against attacks—poisoning attacks and free-riding attacks. Particularly, for three prevalent poisoning attacks (backdoor, label flipping, and model poisoning attacks), we compare non-defensive (FedAvg) and defensive (Krum, trimmed mean, Bulyan, FedBN, FLAME, and FangTrmean) methods with our proposed RobustPFL. The results show that our approach achieves significant defensive effects.
Wei Wang 0012, Yufang Wu, Chao Li 0023, Guangquan Xu, Shouling Ji, Tao Li 0022, Meng Shen 0001, Yufei Han 0001
IEEE Trans. Dependable Secur. Comput.3