FedRolex (Model-Heterogeneous Federated Learning with Rolling Sub-Model Extraction)
Algorithms AIMech:FedRolexModelHeterogeneousFederatedLearningWithRollingSubModelExtraction DRAFT
Aliases: FedRolex, Rolling Sub-Model Extraction Federated Learning, Model-Heterogeneous Federated Learning with Rolling Sub-Model Extraction
A partial-training (PT) model-heterogeneous federated learning algorithm (Alam, Liu, Yan, & Zhang 2022, Section 3, Equations 3-6, Algorithm 1, Appendix A.1 Lemmas 1-2, Appendix A.2 Equation 10) that trains a global server model theta (which can be larger than the largest client model) across resource-heterogeneous clients n in {1, ..., N} with model capacity proportions beta_n in (0, 1] without requiring public data and while preserving compatibility with secure aggregation. In communication round j, for each layer i of the global model with K_i total nodes/kernels and rolling offset j_hat = j mod K_i, the server extracts client n's sub-model node index set via a deterministic circularly advancing rolling window S_{n,i}^{(j)} = {j_hat, j_hat + 1, ..., j_hat + floor(beta_n K_i) - 1} if j_hat + floor(beta_n K_i) <= K_i, and {j_hat, ..., K_i - 1} U {0, ..., j_hat + floor(beta_n K_i) - 1 - K_i} otherwise (Equation 4), broadcasts the sub-model theta_{n, S_{n,i}^{(j)}}^{(j)} for local SGD training on D_n (Equation 3), and updates each global parameter [i, k] by selective averaging theta_{[i,k]}^{(j+1)} = (1 / sum_{m in M_k} p_m) sum_{m in M_k} p_m theta_{m,[i,k]}^{(j)} over the active clients M_k subset of M that updated parameter [i, k] in round j (Equation 10).
Identity Notes & Concept Scope
Distinct from HeteroFL (AIMech:HeteroFlWidthScaledSubnetworkAggregationForHeterogeneousFederatedLearning, Diao et al. 2021) and FjORD (AIMech:FjordOrderedDropoutAndSelfDistillationForHeterogeneousFederatedLearning, Horvath et al. 2021), which use static prefix sub-model extraction S_{n,i}^{(j)} = {0, 1, ..., floor(beta_n K_i) - 1} independent of round j (Equation 6) so that the global server model cannot exceed the largest client model and higher-index parameters are never trained on low-capacity clients' data; and distinct from Federated Dropout (Caldas et al. 2018), which extracts random node subsets each round (Equation 5) and requires O(I log I + I(m-1) log log I) expected rounds rather than m I rounds to update all I sub-models at least m times.
Claims & Grounded Evidence
4 Claims
Mechanism
#r489-claim-1
FedRolex extracts layer i of client n's sub-model in round j using a rolling window S_{n,i}^{(j)} of size floor(beta_n K_i) starting at j_hat = j mod K_i with circular wraparound modulo K_i (Equation 4) and aggregates returned sub-model parameters at the server via selective averaging theta_{[i,k]}^{(j+1)} = (1 / sum_{m in M_k} p_m) sum_{m in M_k} p_m theta_{m,[i,k]}^{(j)} over the subset M_k of participating clients whose rolling window covered parameter [i, k] (Algorithm 1, Equation 10).
Mechanism
#r489-claim-2
By Lemmas 1 and 2 (Appendix A.1, Equations 7-9), random sub-model selection (Federated Dropout, Equation 5) requires E[N] = I sum_{i=1}^I (1/i) = I int_0^infty (1 - (1 - e^{-t})^I) dt ~ I log I rounds to select all I indices once and I int_0^infty (1 - (1 - S_m(t) e^{-t})^I) dt ~ I log I + I(m-1) log log I rounds to select all indices at least m times, whereas FedRolex's deterministic rolling window trains every index m times in exactly m I rounds and can train a global server model gamma > 1 times larger than the largest client model.
Limitation
#r489-claim-3
A full nonconvex optimization convergence proof for rolling sub-model extraction is left open beyond the statistical coverage analysis, and when the server model scaling ratio gamma = {2, 4, 8, 16} grows large relative to small client models on small datasets, global model accuracy still drops as gamma increases.
Application
#r489-claim-4
Applied to model-heterogeneous cross-device federated training of PreResNet18 on CIFAR-10 and CIFAR-100 and a 3-layer Transformer language model on Stack Overflow across five client capacity tiers beta in {1, 1/2, 1/4, 1/8, 1/16}, outperforming HeteroFL and Federated Dropout under both low and high data heterogeneity.
⚠️ Curated Limitations & Negative Results
- Provides a statistical node-coverage analysis rather than a full nonconvex optimization convergence proof, and global accuracy still degrades when the server-to-client capacity ratio gamma is very large on small datasets.
- Addresses training a large global server model across heterogeneous clients, leaving post-training sub-model deployment selection for individual resource-constrained clients as a separate step.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:FederatedLearning
Federated Learning
|
broad_match | FedRolex is a partial-training model-heterogeneous federated learning algorithm within the broader FederatedLearning category. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r489-primary-pdf
|
Samiul Alam, Luyang Liu, Ming Yan, Mi Zhang
|
primary paper
full_text
|
ID: https://arxiv.org/abs/2212.01548
sha256:3b1602263d82…
|
r489-arxiv-abs
|
Samiul Alam, Luyang Liu, Ming Yan, Mi Zhang
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2212.01548
sha256:279f03e215ca…
|
r489-metadata-cr
|
Samiul Alam, Luyang Liu, Ming Yan, Mi Zhang
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2212.01548
sha256:d844ccd88e81…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T09:32:00Z
Updated: 2026-10-19T09:32: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