https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Selective Trimmed Average: A Resilient Federated Learning Algorithm With Deterministic Guarantees on the Optimality Approximation
Mälardalen University, School of Innovation, Design and Engineering. Mälardalen Univ, Akad Innovat, Design Och Tekn IDT, S-72220 Västerås, Sweden..
Roma Tre Univ, Dept Civil Comp Sci & Aeronaut Technol Engn, I-00154 Rome, Italy..
Roma Tre Univ, Dept Civil Comp Sci & Aeronaut Technol Engn, I-00154 Rome, Italy..
Univ Cagliari, Dept Elect & Elect Engn, I-09122 Cagliari, Italy..
2024 (English)In: IEEE Transactions on Cybernetics, ISSN 2168-2267, E-ISSN 2168-2275Article in journal (Refereed) Published
Abstract [en]

The federated learning (FL) paradigm aims to distribute the computational burden of the training process among several computation units, usually called agents or workers, while preserving private local training datasets. This is generally achieved by resorting to a server-worker architecture where agents iteratively update local models and communicate local parameters to a server that aggregates and returns them to the agents. However, the presence of adversarial agents, which may intentionally exchange malicious parameters or may have corrupted local datasets, can jeopardize the FL process. Therefore, we propose selective trimmed average (SETA), which is a resilient algorithm to cope with the undesirable effects of a number of misbehaving agents in the global model. SETA is based on properly filtering and combining the exchanged parameters. We mathematically prove that the proposed algorithm is resilient against data and local model poisoning attacks. Most resilient methods presented so far in the literature assume that a trusted server is in hand. In contrast, our algorithm works both in server-worker and shared memory architectures, where the latter excludes the necessity of a trusted server. The theoretical findings are corroborated through numerical results on MNIST dataset and on multiclass weather dataset (MWD).

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2024.
Keywords [en]
Adversarial attacks, distributed optimization, multiagent systems, resilient federated learning (FL)
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:mdh:diva-65951DOI: 10.1109/TCYB.2024.3350387ISI: 001152001200001PubMedID: 38261507Scopus ID: 2-s2.0-85183672190OAI: oai:DiVA.org:mdh-65951DiVA, id: diva2:1835896
Available from: 2024-02-07 Created: 2024-02-07 Last updated: 2024-02-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textPubMedScopus

Search in DiVA

By author/editor
Kaheni, Mojtaba
By organisation
School of Innovation, Design and Engineering
In the same journal
IEEE Transactions on Cybernetics
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
pubmed
urn-nbn

Altmetric score

doi
pubmed
urn-nbn
Total: 10 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf