FedCSS: Joint Client-and-Sample Selection for Hard Sample-Aware Noise-Robust Federated Learning

Author:

Li Anran1ORCID,Cao Yue1ORCID,Guo Jiabao2ORCID,Peng Hongyi1ORCID,Guo Qing3ORCID,Yu Han1ORCID

Affiliation:

1. Nanyang Technological University, Singapore, Singapore

2. Wuhan University, Wuhan, China

3. A*STAR, Singapore, China

Abstract

Federated Learning (FL) enables a large number of data owners (a.k.a. FL clients) to jointly train a machine learning model without disclosing private local data. The importance of local data samples to the FL model vary widely. This is exacerbated by the presence of noisy data, which exhibit large losses similar to important (hard) samples. Currently, there lacks an FL approach that can effectively distinguish hard samples (which are beneficial) from noisy samples (which are harmful). To bridge this gap, we propose the Federated Client and Sample Selection (FedCSS) approach. It is a bilevel optimization approach for FL client-and-sample selection to achieve hard sample-aware noise-robust learning in a privacy preserving manner. It performs meta-learning based online approximation to iteratively update global FL models, select the most positively influential samples and deal with training data noise. Theoretical analysis shows that it is guaranteed to converge in an efficient manner. Experimental comparison against six state-of-the-art baselines on five real-world datasets in the presence of data noise and heterogeneity shows that it achieves up to 26.4% higher test accuracy, while saving communication and computation costs by at least 41.5% and 1.2%, respectively.

Funder

National Satellite of Excellence in Trustworthy Software Systems, National University of Singapore

Nanyang Technological University, under SUG Grant

NRF Investigatorship

the Cyber Security Agency under its National Cybersecurity R&D Programme

National Research Foundation Singapore and DSO National Laboratories under the AI Singapore Programme

Publisher

Association for Computing Machinery (ACM)

Reference66 articles.

1. Brendan McMahan , Eider Moore , and Ramage. Communication-efficient learning of deep networks from decentralized data . In ICML , 2017 . Brendan McMahan, Eider Moore, and Ramage. Communication-efficient learning of deep networks from decentralized data. In ICML, 2017.

2. Skellam mixture mechanism

3. Anran Li , Hongyi Peng , Lan Zhang , Jiahui Huang , Qing Guo , Han Yu , and Yang Liu . Fedsdg-fs: Efficient and secure feature selection for vertical federated learning. arXiv preprint arXiv:2302.10417 , 2023 . Anran Li, Hongyi Peng, Lan Zhang, Jiahui Huang, Qing Guo, Han Yu, and Yang Liu. Fedsdg-fs: Efficient and secure feature selection for vertical federated learning. arXiv preprint arXiv:2302.10417, 2023.

4. GFL: Federated Learning on Non-IID Data via Privacy-Preserving Synthetic Data

5. Andrew Hard , Kanishka Rao , Rajiv Mathews , and Ramaswamy. Federated learning for mobile keyboard prediction . DeepAI , 2018 . Andrew Hard, Kanishka Rao, Rajiv Mathews, and Ramaswamy. Federated learning for mobile keyboard prediction. DeepAI, 2018.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3