Lin Chen 0033

dblp:13/3479-33 · DBLP profile ↗
← Back
4ranked-venue papers in the field
2as first author
4since 2021 · last 2024
0000-0003-0961-0545ORCID · conflict

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 3 (1 first)Database Systems & Data Management · 1 (1 first)
YearPublicationVenuePosition
2024 Differentially Private Federated Learning on Non-iid Data: Convergence Analysis and Adaptive Optimization
abstract
Federated learning (FL) has attracted increasing attention in recent years due to its data privacy preservation and great applicability to large-scale user scenarios. However, when FL faces numerous clients, it is inevitable to emerge the non-independent and identically distributed (non-iid) data between clients, which brings an enormous challenge for model training and performance analysis like convergence. Besides, due to the non-iid data, the participating clients of FL tend to be extremely heterogeneous so the number of samplings among clients causes a sampling variance problem, which induces a huge variation in convergence. More importantly, although FL can foster privacy security via locally retaining the training data, if local data is secret and sensitive, FL should have more powerful privacy protection to resist the cloud server or third party to infer private information from shared models or intermediate gradients. Facing the non-iid and privacy challenges, we propose a differential privacy (DP) based non-iid FL algorithm called DPNFL to jointly tackle these two issues. Specifically, motivated by the DP and its variants, we are the first to adopt the truncated concentrated differential privacy technique under the FL scenario to more tightly track end-to-end privacy loss, while requiring less noise injection for the same level of DP. To avoid the sampling variance problem, we enable the server to sample the partial clients uniformly without replacement, which also guarantees unbiased sampling. To further improve the algorithm performance, we also propose an adaptive version of DPNFL named AdDPNFL, which adopts the adaptive optimization on the server-side to simultaneously alleviate the impact of non-iid data and DP noise on model utility. Finally, we perform extensive experiments to validate the effectiveness and superiority of our algorithms.
Lin Chen 0033, Xiaofeng Ding 0001, Zhifeng Bao, Pan Zhou 0001, Hai Jin 0001
IEEE Trans. Knowl. Data Eng.1
2023 Distributed dynamic online learning with differential privacy via path-length measurement
Lin Chen 0033, Xiaofeng Ding 0001, Pan Zhou 0001, Hai Jin 0001
Inf. Sci.1
2023 A review of federated learning: taxonomy, privacy and future directions
Hashan Ratnayake, Lin Chen 0033, Xiaofeng Ding 0001
J. Intell. Inf. Syst.2
2021 Dynamic online convex optimization with long-term constraints via virtual queue
Xiaofeng Ding 0001, Lin Chen 0033, Pan Zhou 0001, Zichuan Xu, Shiping Wen 0001, John C. S. Lui, Hai Jin 0001
Inf. Sci.2