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
FedABoost: Fairness Aware Federated Learning with Adaptive Boosting
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science.ORCID iD: 0009-0000-7923-160X
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science.ORCID iD: 0000-0003-3128-191x
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science.ORCID iD: 0000-0002-3010-8798
2026 (English)In: Machine Learning and Principles and Practice of Knowledge Discovery in Databases: International Workshops of ECML PKDD 2025, Porto, Portugal, September 15–19, 2025, Revised Selected Papers, Part III / [ed] Koprinska I., Mendes-Moreira J., Branco P., Springer Nature, 2026, 1, p. 492-507Conference paper, Published paper (Refereed)
Abstract [en]

This work focuses on improving the performance and fairness of Federated Learning (FL) in non-IID settings by enhancing model aggregation and boosting the training of under-performing clients. We propose FedABoost, a novel FL framework that integrates a dynamic boosting mechanism and an adaptive gradient aggregation strategy. Inspired by the weighting mechanism of the Multiclass AdaBoost (SAMME) algorithm, our aggregation method assigns higher weights to clients with lower local error rates, thereby promoting more reliable contributions to the global model. In parallel, FedABoost dynamically boosts under-performing clients by adjusting the focal loss focusing parameter, emphasizing hard-to-classify examples during local training. These mechanisms work together to enhance the global model’s fairness by reducing disparities in client performance and encouraging fair participation. We have evaluated FedABoost on three benchmark datasets: MNIST, FEMNIST, and CIFAR10, and compared its performance with those of FedAvg and Ditto. The results show that FedABoost achieves improved fairness and competitive performance. The FedABoost code and the experimental results are available at \href{https://github.com/tharukackasthuri/fedaboost.git}{GitHub}

Place, publisher, year, edition, pages
Springer Nature, 2026, 1. p. 492-507
Series
Communications in Computer and Information Science (CCIS), ISSN 1865-0929, E-ISSN 1865-0937 ; 2841
Keywords [en]
Federated Learning, Fairness in FL, Client Personalization, Model W eighting Mechanism, Boosting Algorithms
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:bth-29315DOI: 10.1007/978-3-032-19102-1_30Scopus ID: 2-s2.0-105040253838ISBN: 9783032191014 (print)OAI: oai:DiVA.org:bth-29315DiVA, id: diva2:2052087
Conference
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2025, Porto, Sept 15-19, 2025
Part of project
HINTS - Human-Centered Intelligent RealitiesAvailable from: 2026-04-10 Created: 2026-04-10 Last updated: 2026-06-12Bibliographically approved
In thesis
1. Heterogeneous Federated Learning: Fairness and Client Behaviour Exploration
Open this publication in new window or tab >>Heterogeneous Federated Learning: Fairness and Client Behaviour Exploration
2026 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Federated Learning (FL) is a promising distributed learning method that enables multiple clients to collaboratively train a shared model without sharing their raw data thus preserving privacy. However, in practical implementations, client data are typically non-independent and identically distributed (non-IID). This resulting in heterogeneous learning dynamics and unequal benefits across participants. Improvements in average global performance can mask performance degradation for disadvantaged clients, highlighting a structural fairness challenge in FL. This thesis argues that achieving fairness under non-IID FL requires explicit understanding and modeling of client behavioral heterogeneity rather than uniform aggregation of client updates. 

In addressing the issue of fairness in FL under data heterogeneity, the thesis first studies and analyzes clients' deviating behavior during the federated training process. An eccentricity-based approach is introduced to quantify deviations in local models and data representations within the global model, enabling systematic identification of atypical contribution and benefit patterns. The insights gained lay the foundation for our further research into developing novel, fairness-aware FL solutions for heterogeneous, distributed learning setups.

Then it proposes a fairness-aware aggregation framework called FeDABoost that adapts client influence based on local performance signals. By dynamically weighting client updates and adjusting local optimization to emphasize hard examples, the method reduces disparities across heterogeneous clients while maintaining competitive global performance. Later, the thesis introduces DEFFT, a clients distribution-aware framework that models latent similarities among clients through persistent grouping based on label distributions. Cluster-level models and hierarchical knowledge distillation integrate inter-client structure into the learning process, enhancing fairness metrics along with overall accuracy.

Across multiple benchmark datasets, the proposed approaches demonstrate that a principled way to modeling heterogeneity can lead to measurable improvements in fairness without compromising global performance. The three discussed studies together establish a structured framework for mitigating unequal benefits in FL under non-IID data distributions.

Place, publisher, year, edition, pages
Karlskrona: Blekinge Tekniska Högskola, 2026. p. 114
Series
Blekinge Institute of Technology Licentiate Dissertation Series, ISSN 1650-2140 ; 2026:03
Keywords
Federated Learning, Non-IID Data, Fairness in FL, Client Behavior
National Category
Other Engineering and Technologies
Research subject
Computer Science
Identifiers
urn:nbn:se:bth-29327 (URN)978-91-7295-525-7 (ISBN)
Presentation
2026-06-08, J1630, Karlskrona, 13:15
Opponent
Supervisors
Available from: 2026-04-17 Created: 2026-04-10 Last updated: 2026-05-13Bibliographically approved

Open Access in DiVA

The full text will be freely available from 2027-06-01 08:21
Available from 2027-06-01 08:21

Other links

Publisher's full textScopus

Authority records

Kasthuri Arachchige, TharukaBoeva, VeselkaAbghari, Shahrooz

Search in DiVA

By author/editor
Kasthuri Arachchige, TharukaBoeva, VeselkaAbghari, Shahrooz
By organisation
Department of Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 80 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