An efficient differential privacy federated learning scheme with optimal adaptive client number K

Jian Wang; Mengwei Zhang

doi:10.1117/12.2667280

22 February 2023 An efficient differential privacy federated learning scheme with optimal adaptive client number K

Jian Wang, Mengwei Zhang

Proceedings Volume 12587, Third International Seminar on Artificial Intelligence, Networking, and Information Technology (AINIT 2022); 1258708 (2023) https://doi.org/10.1117/12.2667280
Event: Third International Seminar on Artificial Intelligence, Networking, and Information Technology (AINIT 2022), 2022, Shanghai, China

Abstract

Federated Learning (FL) protects users’ privacy by only uploading the training result instead of gathering all the private data. However, achieving the desired model performance often requires a large number of iterations of parameter transfer between client and central server. Currently, selecting a fixed number of clients to participate in training can slightly reduce the communication overhead during model training, but ignore the impact on model training accuracy. In this paper, we propose an adaptive chosen client number K scheme, which can give a better tradeoff between accuracy and cost. Firstly, through experiments, we find that increasing extracted clients’ number K can reduce iterations’ number T, but after K increases to a certain extent (𝐾₁), T will no longer reduce significantly. Similarly, increasing K can further improve the accuracy of model training, but K is large enough (𝐾₂ ≥ 𝐾₁), the accuracy will also no more be improved remarkably. Thus, [𝐾₁,𝐾₂] is the optimal range. Secondly, we conduct experiments on different datasets with different number of clients, and find that the optimal client’s number growth rate q’ for different conditions is 0.02. According to the experimental results, we set the initial K to be 𝐾₁ for the optimal T, when the model update magnitude in two adjacent iterations is less than a threshold, the number of clients participating in training will increase by q’ to speed up the convergence until K reaches K₂, otherwise it will remain unchanged. Finally, we use our algorithm to improve present FL algorithms. Through experiments, we demonstrate that our algorithm is suitable for existing differential private FL algorithms.

Citation Download Citation

Jian Wang and Mengwei Zhang "An efficient differential privacy federated learning scheme with optimal adaptive client number K", Proc. SPIE 12587, Third International Seminar on Artificial Intelligence, Networking, and Information Technology (AINIT 2022), 1258708 (22 February 2023); https://doi.org/10.1117/12.2667280

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
7 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Education and training

Machine learning

Sampling rates

Data privacy

Performance modeling

Computer simulations

Data modeling

Show All Keywords

Keywords/Phrases

Search In:

Publication Years