FeDABoost: Fairness-Aware Federated Boosting

• FeDABoost is a fairness-aware federated boosting framework that integrates SAMME-inspired adaptive aggregation with client-specific focal loss to improve global performance and reduce disparities among non-IID clients.
• It employs a dual objective that minimizes both average loss and performance variance across clients by weighting contributions based on local error metrics and dynamic boosting signals.
• Empirical evaluations on datasets like MNIST, FEMNIST, and CIFAR-10 demonstrate faster convergence, improved accuracy, and lower fairness variance compared to traditional federated learning methods.

Searching arXiv for FeDABoost and closely related federated boosting / fairness-aware boosting papers. FeDABoost most commonly denotes a fairness-aware federated learning framework that combines SAMME-inspired adaptive aggregation with client-specific dynamic boosting via focal loss in order to improve global performance while reducing disparities across heterogeneous, non-IID clients (Arachchige et al., 3 Oct 2025). In recent arXiv usage, however, the label also appears in broader boosting contexts: as a natural extension of Fair AdaBoost (FAB) that injects fairness signals at each boosting round for group-based classification fairness, and as a federated AdaBoost variant built around asynchronous synchronization and delayed weight compensation (Song et al., 2024). This suggests that FeDABoost is not yet a fully standardized term; rather, it designates a cluster of methods that combine boosting-style reweighting with fairness or federated-learning objectives.

1. Terminological scope and positioning

Recent work uses the name in overlapping but non-identical ways.

Usage	Setting	Defining mechanism
FeDABoost	Federated learning	SAMME-inspired client aggregation plus adaptive focal-loss boosting (Arachchige et al., 3 Oct 2025)
“FeDABoost” as FAB extension	Fair classification	Per-round fairness correction layered onto FAB (Song et al., 2024)
FeDABoost / Federated AdaBoost	Federated learning	Asynchronous boosting with adaptive scheduling and delayed weight compensation (Oghlukyan et al., 10 Jun 2025)

The formulation in "FeDABoost: Fairness Aware Federated Learning with Adaptive Boosting" (Arachchige et al., 3 Oct 2025) is the clearest direct use of the term as the title of a method. There, FeDABoost is explicitly presented as a fairness-aware FL framework for non-IID settings. The system seeks to improve the global model’s average performance while reducing disparities across clients by coupling two mechanisms: adaptive aggregation at the server and dynamic boosting of underperforming clients during local training.

A common misconception is to treat every federated boosting method as FeDABoost. The literature does not support that equivalence. "LoAdaBoost" is a distinct method name and, according to its own description, is not classical AdaBoost and does not use per-sample weight updates, weak learner errors, or boosting coefficients (Huang et al., 2018). Conversely, the FAB paper does not present a method formally named FeDABoost; it presents FAB and then shows how FAB can naturally implement or be extended to implement a method like “FeDABoost” (Song et al., 2024).

2. Optimization targets in the federated formulation

In the federated formulation, there are $k$ total clients, and at communication round $e$ a subset $S_e \subseteq \{1,\dots,k\}$ with $|S_e|=m_e$ participates. Client $i$ owns local dataset $D_i$ drawn from a client-specific, potentially non-IID distribution, and the server maintains a global model $M^e$ (Arachchige et al., 3 Oct 2025).

The method defines fairness through cross-client uniformity of performance rather than through demographic parity or equalized odds. For a performance measure $\phi_i(M)$, such as per-client F1 score or accuracy on a local validation or holdout set, fairness is quantified by the variance

$$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$

Lower variance indicates more uniform performance across clients. The average loss is

$\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$

where $e$0 is a local loss on client $e$1’s validation set.

FeDABoost adopts a dual objective. It seeks a global model $e$2 such that

$e$3

This formalization matters because it makes fairness a property of inter-client dispersion rather than merely a secondary diagnostic. A plausible implication is that the method is especially suited to FL deployments where the principal inequity is client heterogeneity rather than protected-attribute disparity within a single pooled dataset.

The server-side aggregation rule is inspired by multiclass AdaBoost (SAMME). For client $e$4 in round $e$5, with local error rate $e$6 measured on a local validation set, the aggregation weight is

$e$7

where $e$8 is the number of classes in client $e$9’s data. The local error is clipped as

$S_e \subseteq \{1,\dots,k\}$0

with $S_e \subseteq \{1,\dots,k\}$1 a small constant such as $S_e \subseteq \{1,\dots,k\}$2. Only clients with $S_e \subseteq \{1,\dots,k\}$3 are included, which holds when $S_e \subseteq \{1,\dots,k\}$4, i.e., the client is better than random guessing. Aggregation is then performed by weighted parameter averaging:

$S_e \subseteq \{1,\dots,k\}$5

where $S_e \subseteq \{1,\dots,k\}$6 is the client-trained local model.

3. Adaptive boosting via client-specific focal loss

The second component is dynamic boosting of underperforming clients. FeDABoost uses focal loss to emphasize hard-to-classify examples during local training. In binary form,

$S_e \subseteq \{1,\dots,k\}$7

and in multi-class form,

$S_e \subseteq \{1,\dots,k\}$8

In the reported experiments, $S_e \subseteq \{1,\dots,k\}$9 is fixed and the focusing parameter $|S_e|=m_e$0 is adapted per client (Arachchige et al., 3 Oct 2025).

Underperforming clients are identified by an indicator $|S_e|=m_e$1 based on a threshold $|S_e|=m_e$2: $|S_e|=m_e$3 if client $|S_e|=m_e$4’s performance at round $|S_e|=m_e$5 is below $|S_e|=m_e$6, otherwise $|S_e|=m_e$7. FeDABoost maintains client-specific boosting weights $|S_e|=m_e$8 updated as

$|S_e|=m_e$9

with initialization $i$0. The focusing parameter is then updated as

$i$1

The negative sign in the exponent is important: clients with higher error rates, and thus lower or non-positive $i$2, receive an increased $i$3 when $i$4, which in turn increases $i$5 and focuses training on hard examples.

The algorithmic workflow is server–client alternating. The server samples participating clients, broadcasts $i$6 and current client weights, collects local models and aggregation weights, and forms $i$7 through SAMME-inspired weighted averaging. Each client evaluates local performance, computes $i$8, determines $i$9, updates $D_i$0 and $D_i$1, trains locally with focal loss for $D_i$2 epochs, re-evaluates the trained model, recomputes $D_i$3, and returns $D_i$4 to the server (Arachchige et al., 3 Oct 2025).

The intended division of labor is explicit. Aggregation emphasizes reliable contributors—clients with lower local error—while client-side boosting lifts weaker clients by increasing their focus on hard samples. This balancing is the mechanism through which the method targets both lower average loss and lower performance variance across clients.

4. Fairness metrics, datasets, and empirical behavior

The primary fairness metric is the variance of client performance, $D_i$5. A secondary fairness criterion is worst-client performance, $D_i$6, and the paper also notes Jain’s fairness index,

$D_i$7

for per-client accuracies $D_i$8, with larger values closer to perfectly fair (Arachchige et al., 3 Oct 2025).

The reported experiments cover three benchmark datasets. MNIST is partitioned across 264 clients using a Dirichlet partition with concentration $D_i$9, with 30% participation per round. FEMNIST is inherently non-IID across 3,550 clients, with 20% participation per round. CIFAR-10 is partitioned across 196 clients using Dirichlet $M^e$0, with participation fractions of 20%, 40%, and 60%. Global validation in each round uses 20% unseen data from each client, and the metrics include loss, F1, and accuracy.

The hyperparameters are dataset-specific. Reported settings include SGD learning rate $M^e$1 for MNIST and FEMNIST global models, SGD learning rate $M^e$2 for CIFAR-10 global models, batch size 32 for MNIST and CIFAR-10, batch size 64 for FEMNIST, local epochs 5 for MNIST and FEMNIST and 10 for CIFAR-10, boosting learning rate $M^e$3 for MNIST and FEMNIST and $M^e$4 for CIFAR-10, and thresholds $M^e$5 for MNIST, $M^e$6 for FEMNIST, and $M^e$7 for CIFAR-10. An alternative FeDABoost configuration on FEMNIST uses AdamW with learning rate $M^e$8 and weight decay $M^e$9.

The empirical findings are consistently framed in terms of both performance and fairness. On MNIST, FeDABoost converges to $\phi_i(M)$0 versus FedAvg $\phi_i(M)$1, reaches a given F1 in fewer communication rounds, and reduces the variance of client F1 across the convergence window (rounds 245–255) by 24.4%, from 0.0137 for FedAvg to 0.0103 for FeDABoost. The client F1 distribution is also right-shifted, with median 0.852 versus 0.813 for FedAvg. On FEMNIST, FeDABoost with SGD generally outperforms FedAvg across rounds, while FeDABoost with AdamW significantly outperforms both FedAvg and Ditto, with faster and more stable convergence. The fairness variance over rounds 205–210 is 0.0279 for FeDABoost, compared with 0.0296 for FedAvg and 0.0317 for Ditto, corresponding to reductions of 5.88% and 11.87%, respectively. The client F1 median is 0.652 for FeDABoost, compared with 0.566 for Ditto and 0.558 for FedAvg. On CIFAR-10, FeDABoost obtains F1 scores of 0.716, 0.685, and 0.677 at 20%, 40%, and 60% participation, compared with FedAvg scores of 0.694, 0.679, and 0.675 and Ditto scores of 0.689, 0.672, and 0.642. At 20% participation, validation loss is 0.992 for FeDABoost versus 1.198 for FedAvg and 1.199 for Ditto. Convergence occurs in roughly 60–70 rounds at 20%, 35–45 rounds at 40%, and 25–30 rounds at 60%.

Ablation and sensitivity analyses are also informative. Removing boosting and using only $\phi_i(M)$2-based aggregation weakens performance on MNIST, indicating that client-side focal-loss adaptation is not merely auxiliary. Optimizer choice matters as well: AdamW stabilizes FeDABoost under dynamic $\phi_i(M)$3 and $\phi_i(M)$4 changes, whereas FedAvg is reported as more stable with SGD.

5. Relation to fairness-aware boosting and other federated AdaBoost variants

FeDABoost is closely related, but not identical, to FAB, the fair AdaBoost method developed for binary classification fairness in pooled data settings (Song et al., 2024). FAB focuses on group-wise accuracy parity, false positive rate parity, and false negative rate parity. It defines unfairness measures such as $\phi_i(M)$5, $\phi_i(M)$6, and $\phi_i(M)$7, and incorporates a fairness penalty into AdaBoost via a fairness-aware initial distribution $\phi_i(M)$8. For example, the canonical initial weights include

$\phi_i(M)$9

with analogous forms for FPR and FNR. After initialization, FAB performs standard AdaBoost updates and does not recompute group fairness metrics per round. The same source then describes how a method like “FeDABoost” can be realized by extending FAB with per-round fairness signals such as $$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$0, $$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$1, and $$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$2, together with an additional multiplicative correction

$$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$3

That construction is fairness-aware in the demographic-group sense, whereas the federated FeDABoost of (Arachchige et al., 3 Oct 2025) is fairness-aware in the cross-client performance-variance sense.

Another nearby line of work uses the term FeDABoost in a more infrastructural FL sense. "Integrating Asynchronous AdaBoost into Federated Learning: Five Real World Applications" presents an enhanced asynchronous AdaBoost for FL with adaptive communication scheduling and delayed weight compensation (Oghlukyan et al., 10 Jun 2025). Its scheduling rule is

$$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$4

and delayed weak learners are down-weighted as

$$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$5

Across five domains—edge vision, blockchain-based transparency, mobile personalization, IoT anomaly detection, and federated healthcare—the paper reports training time reductions of approximately 20–35% and communication-overhead reductions of 30–40% relative to baseline federated AdaBoost, with fewer boosting rounds and maintained or slightly improved accuracy. This is a federated AdaBoost interpretation of FeDABoost, but it does not use the client-fairness variance objective of (Arachchige et al., 3 Oct 2025).

LoAdaBoost is related only in a looser sense. It is a federated, loss-based adaptive training-budget allocation layered on FedAvg rather than a classical AdaBoost system (Huang et al., 2018). It boosts weaker clients by giving them more local epochs based on loss, uses simple averaging for aggregation, and explicitly states that it does not use per-sample weight updates or boosting coefficients. Its inclusion is mainly useful for disambiguation: not every federated method with “boost” in the name implements AdaBoost-style weighting.

6. Limitations, open problems, and broader significance

The federated FeDABoost formulation has several limitations that are explicit in the current literature (Arachchige et al., 3 Oct 2025). Performance depends on $$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$6, $$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$7, and optimizer choice, and the method can be fragile in certain non-IID regimes. Overweighting low-error clients through $$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$8 may marginalize some clients, although the adaptive focal-loss mechanism is intended to mitigate that effect. Formal convergence guarantees are not provided; the reported convergence and stability arguments are empirical and rely on bounded local errors, clipping, and conservative learning-rate choices. With very large client populations or sparse participation, per-round error estimates $$\mathrm{Var}(\phi(M))=\frac{1}{k}\sum_{i=1}^k\big(\phi_i(M)-\bar{\phi}(M)\big)^2, \qquad \bar{\phi}(M)=\frac{1}{k}\sum_{j=1}^k \phi_j(M).$$9 may be noisy. The method is compatible with secure aggregation and encryption, but integrating differential privacy would require careful retuning because DP noise can bias $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$0 and $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$1.

The fairness-aware boosting interpretation inherited from FAB has a different set of limits (Song et al., 2024). It is formulated primarily for binary classification, requires access to protected attributes during training, and becomes statistically fragile when $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$2, $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$3, or $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$4 are small. Simultaneously optimizing $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$5, $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$6, and $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$7 requires balancing multiple $\bar{\ell}(M)=\frac{1}{k}\sum_{i=1}^k \ell_i(M),$8 values, and fairness may conflict with calibration. The asynchronous federated AdaBoost variant likewise leaves open the problem of formal convergence under bounded delays and non-IID data, as well as automated tuning of thresholds and decay parameters (Oghlukyan et al., 10 Jun 2025).

Taken together, these works place FeDABoost at the intersection of three concerns: boosting as an adaptive reweighting principle, federated learning under heterogeneity, and fairness either across clients or across protected groups. The principal significance of the term lies in that intersection. In one strand, FeDABoost is a client-fairness-oriented FL method built from SAMME-style aggregation and client-adaptive focal loss. In another, it is a natural fairness-aware extension of FAB that re-injects group-disparity signals at each boosting round. In a third, it denotes asynchronous federated AdaBoost with communication-aware synchronization. The unifying theme is the use of boosting-style adaptivity to redistribute learning pressure toward entities that are currently underperforming—whether those entities are clients, groups, or stale weak learners.