FedEMA (Federated Divergence-Aware Exponential Moving Average Update for Self-Supervised Learning)
Algorithms AIMech:FedEmaDivergenceAwareExponentialMovingAverageFederatedSelfSupervisedLearning DRAFT
Aliases: FedEMA, Federated Divergence-aware Exponential Moving Average, FedSSL and FedEMA Divergence-Aware Federated Self-Supervised Learning
A federated self-supervised representation learning algorithm (Zhuang, Wen, & Zhang 2022, Sections 3.2 & 4, Equations 1-3, Algorithm 1) built on a generalized Siamese-network Federated Self-Supervised Learning (FedSSL) framework in which each client k in {1, ..., K} trains an online network W_k^o = (W_k, W_k^p) (online encoder W_k and MLP predictor W_k^p) and a momentum target encoder W_k^t updated per mini-batch via W_k^t <- m W_k^t + (1 - m) W_k on unlabeled private data D_k, while the server aggregates online encoders and predictors via W_g^{r+1} = sum_{k in S_t} (n_k/n) W_k^r and W_g^{p,r+1} = sum_{k in S_t} (n_k/n) W_k^{p,r}. Instead of overwriting client k's online network with the global network (FedBYOL), FedEMA retains local non-IID representation knowledge by updating client k's online encoder and predictor at round r via a divergence-aware exponential moving average W_k^r = mu W_k^{r-1} + (1 - mu) W_g^r (Equation 1) and W_k^{p,r} = mu W_k^{p,r-1} + (1 - mu) W_g^{p,r} (Equation 2), where the dynamic decay rate mu = min(lambda_k ||W_g^r - W_k^{r-1}||_2, 1) (Equation 3) scales with the L2 divergence between the global encoder W_g^r and client k's previous online encoder W_k^{r-1}, and the client-specific scaler lambda_k = tau / ||W_g^{r+1} - W_k^r||_2 with expected initial decay tau in [0.5, 1) is automatically calibrated once by an autoscaler at the earliest round r client k is sampled (Algorithm 1, line 10).
Identity Notes & Concept Scope
Distinct from MOON (AIMech:MoonModelContrastiveFederatedLearning, Li et al. 2021), which adds a supervised model-contrastive representation loss between local and global encoders on labeled client data rather than performing unlabeled Siamese self-supervised learning with L2-divergence-scaled exponential moving average parameter interpolation; and distinct from APFL (AIMech:ApflAdaptivePersonalizedFederatedLearningViaConvexGlobalLocalModelInterpolation, Deng et al. 2020), which learns a gradient-updated mixing scalar alpha_i between separate global and local supervised models rather than dynamically setting the online-network EMA decay rate mu = min(lambda_k ||W_g^r - W_k^{r-1}||_2, 1) from encoder L2 divergence in Siamese self-supervised learning.
Claims & Grounded Evidence
4 Claims
Mechanism
#r490-claim-1
FedEMA updates each client k's online encoder W_k^r and predictor W_k^{p,r} at the start of round r via W_k^r = mu W_k^{r-1} + (1 - mu) W_g^r and W_k^{p,r} = mu W_k^{p,r-1} + (1 - mu) W_g^{p,r} with dynamic decay rate mu = min(lambda_k ||W_g^r - W_k^{r-1}||_2, 1) (Equations 1-3) and one-shot autoscaler lambda_k = tau / ||W_g^{r+1} - W_k^r||_2 calibrated at client k's first sampled round, reducing exactly to FedBYOL when lambda_k = 0 (Algorithm 1).
Mechanism
#r490-claim-2
Within the generalized Siamese FedSSL framework, empirical ablation shows that (1) the online MLP predictor W_k^p is essential to prevent local representation collapse, (2) stop-gradient is not strictly required in FedBYOL because periodic server aggregation already separates the online encoder W_k from the momentum target encoder W_k^t, and (3) retaining local non-IID knowledge in both the target encoder and the EMA-updated online network significantly improves non-IID linear-probe accuracy.
Limitation
#r490-claim-3
FedEMA requires stateful clients (or server-side client state caching) to retain previous round parameters W_k^{r-1} and W_k^{p,r-1} across rounds; in massive stateless cross-device federated settings where each client participates only once, FedEMA degrades to standard FedBYOL (full global overwrite).
Application
#r490-claim-4
Applied to decentralized unlabeled visual representation learning with ResNet-18 and ResNet-50 Siamese networks on IID and non-IID CIFAR-10 and CIFAR-100 benchmarks under linear evaluation and 1%/10%-label semi-supervised fine-tuning, outperforming FedSimCLR, FedMoCoV1/V2, FedSimSiam, FedBYOL, and FedCA.
⚠️ Curated Limitations & Negative Results
- Requires stateful clients (or server-side state caching) to store previous online parameters W_k^{r-1} and W_k^{p,r-1}; degrades to FedBYOL when clients participate only once.
- Setting manual scaler lambda > 1 saturates mu = 1 at early rounds so no global knowledge is incorporated, requiring autoscaler calibration with tau in [0.5, 1).
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:FederatedLearning
Federated Learning
|
broad_match | FedEMA is a federated self-supervised representation learning algorithm within the broader FederatedLearning category. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r490-primary-pdf
|
Weiming Zhuang, Yonggang Wen, Shuai Zhang
|
primary paper
full_text
|
ID: https://arxiv.org/abs/2204.04385
sha256:46131d93cfd5…
|
r490-arxiv-abs
|
Weiming Zhuang, Yonggang Wen, Shuai Zhang
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2204.04385
sha256:81f386e9bac4…
|
r490-metadata-cr
|
Weiming Zhuang, Yonggang Wen, Shuai Zhang
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2204.04385
sha256:3fded22e663d…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T09:33:00Z
Updated: 2026-10-19T09:33:00Z
Explore across X-Mech
Related computational & biological Mechs:
Embedding Map
Network Graph
ProteinTraitsMech (ESM-2 pLM)
DUFMech (Domain pLM)
TraitMech
CultureMech
All 14 X-Mech Repositories