Demo Data from VLDB 2026 / reviewers in the wild / expert
Mengzhen Yang
dblp:344/9782
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Artificial intelligence and machine learning · 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
1 paper |
Efficient and distributed learning · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › federated learning
communication-efficient federated learning |
1.0 | 1 | 2026 | LSHFed: Robust and Communication-Efficient Federated Learning with Locally-Sensitive Hashing Gradient Mapping · AAAI 2026 |
Machine learning › Efficient and distributed learning
federated learning |
1.0 | 1 | 2026 | LSHFed: Robust and Communication-Efficient Federated Learning with Locally-Sensitive Hashing Gradient Mapping · AAAI 2026 |
Machine learning › Efficient and distributed learning › federated learning
robust federated learning |
1.0 | 1 | 2026 | LSHFed: Robust and Communication-Efficient Federated Learning with Locally-Sensitive Hashing Gradient Mapping · AAAI 2026 |
Privacy and data protection › privacy-preserving machine learning › federated learning privacy
gradient inversion attack |
0.3 | 1 | 2026 | LSHFed: Robust and Communication-Efficient Federated Learning with Locally-Sensitive Hashing Gradient Mapping · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
locality-sensitive hashing · 2.0gradient verification · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | LSHFed: Robust and Communication-Efficient Federated Learning with Locally-Sensitive Hashing Gradient MappingabstractFederated learning (FL) enables collaborative model training across distributed nodes without exposing raw data, but its decentralized nature makes it vulnerable in trust-deficient environments. Inference attacks may recover sensitive information from gradient updates, while poisoning attacks can degrade model performance or induce malicious behaviors. Existing defenses often suffer from high communication and computation costs, or limited detection precision. To address these issues, we propose LSHFed, a robust and communication-efficient FL framework that simultaneously enhances aggregation robustness and privacy preservation. At its core, LSHFed incorporates LSHGM, a novel gradient verification mechanism that projects high-dimensional gradients into compact binary representations via multi-hyperplane locality-sensitive hashing. This enables accurate detection and filtering of malicious gradients using only their irreversible hash forms, thus mitigating privacy leakage risks and substantially reducing transmission overhead. Extensive experiments demonstrate that LSHFed maintains high model performance even when up to 50% of participants are collusive adversaries, while achieving up to a 1000× reduction in gradient verification communication compared to full-gradient methods. Guanjie Cheng, Mengzhen Yang, Xinkui Zhao, Shuyi Yu, Tianyu Du, Mengying Zhu, Shuiguang Deng |
AAAI | 2 |
| 2023 | Federated learning: a deep learning model based on resnet18 dual path for lung nodule detection
Kefeng Fan, Mengzhen Yang |
Multim. Tools Appl. | 3 |
| 2023 | Correction to: Federated learning: a deep learning model based on resnet18 dual path for lung nodule detection
Kefeng Fan, Mengzhen Yang |
Multim. Tools Appl. | 3 |