SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Ngai Edith)
 

Sökning: WFRF:(Ngai Edith) > An Experimental Stu...

An Experimental Study of Byzantine-Robust Aggregation Schemes in Federated Learning

Li, Shenghui, 1994- (författare)
Uppsala universitet,Datorteknik,Avdelningen för datorteknik,Uppsala University, Sweden
Ngai, Edith C.-H. (författare)
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, China
Voigt, Thiemo (författare)
Uppsala universitet,Nätverksbaserade inbyggda system,RISE, the Research Institutes of Sweden, Stockholm, Sweden,Datavetenskap,Uppsala University, Sweden
 (creator_code:org_t)
2023
2023
Engelska.
Ingår i: IEEE Transactions on Big Data. - : Institute of Electrical and Electronics Engineers (IEEE). - 2332-7790 .- 2372-2096.
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Byzantine-robust federated learning aims at mitigating Byzantine failures during the federated training process, where malicious participants (known as Byzantine clients) may upload arbitrary local updates to the central server in order to degrade the performance of the global model. In recent years, several robust aggregation schemes have been proposed to defend against malicious updates from Byzantine clients and improve the robustness of federated learning. These solutions were claimed to be Byzantine-robust, under certain assumptions. Other than that, new attack strategies are emerging, striving to circumvent the defense schemes. However, there is a lack of systematical comparison and empirical study thereof. In this paper, we conduct an experimental study of Byzantine-robust aggregation schemes under different attacks using two popular algorithms in federated learning, FedSGD and FedAvg . We first survey existing Byzantine attack strategies, as well as Byzantine-robust aggregation schemes that aim to defend against Byzantine attacks. We also propose a new scheme, ClippedClustering, to enhance the robustness of a clustering-based scheme by automatically clipping the updates. Then we provide an experimental evaluation of eight aggregation schemes in the scenario of five different Byzantine attacks. Our experimental results show that these aggregation schemes sustain relatively high accuracy in some cases, but they are not effective in all cases. In particular, our proposed ClippedClustering successfully defends against most attacks under independent and identically distributed (IID) local datasets. However, when the local datasets are Non-IID, the performance of all the aggregation schemes significantly decreases. With Non-IID data, some of these aggregation schemes fail even in the complete absence of Byzantine clients. Based on our experimental study, we conclude that the robustness of all the aggregation schemes is limited, highlighting the need for new defense strategies, in particular for Non-IID datasets.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

Nyckelord

Byzantine attacks
distributed learning
federated learning
neural networks
robustness

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Li, Shenghui, 19 ...
Ngai, Edith C.-H ...
Voigt, Thiemo
Om ämnet
NATURVETENSKAP
NATURVETENSKAP
och Data och informa ...
Artiklar i publikationen
IEEE Transaction ...
Av lärosätet
Uppsala universitet
RISE

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy