KT-pFL (Parameterized Knowledge Transfer for Personalized Federated Learning)
Algorithms AIMech:KtPflParameterizedKnowledgeTransferForPersonalizedFederatedLearning DRAFT
Aliases: KT-pFL, Parameterized Knowledge Transfer for Personalized Federated Learning, Sim-pFL and TopK-pFL Personalized Knowledge Coefficient Distillation
A personalized group knowledge transfer federated learning algorithm (Zhang, Guo, Ma, Wang, Xu, & Wu 2021, Sections 3-4, Definitions 3.1-3.2, Equations 2-7, Algorithm 1, Theorem 4.1, Remark 4.1) that enables clients n in {1, ..., N} with heterogeneous or homogeneous model architectures w^n and non-IID private datasets D_n to collaboratively learn personalized models via a shared public reference dataset D_r and a trainable N x N knowledge coefficient matrix c in R^{N x N} (Equation 3). Each client n minimizes the personalized loss L_{per,n}(w^n) = L_n(w^n) + lambda sum_{x_hat in D_r} L_{KL}(sum_{m=1}^N c_{mn} s(w^m, x_hat), s(w^n, x_hat)) where s(w^m, x_hat) = softmax(z^m(x_hat)/T) (Definition 3.1, Equation 2), while the system jointly minimizes min_{w,c} L(w, c) = sum_{n=1}^N (D_n/D) L_{per,n}(w^n) + rho ||c - 1/N||_2^2 with Frobenius shrinkage toward the uniform collaboration matrix 1/N (Equation 4) via alternating optimization: (1) client-side local SGD on D_n (Equation 5) followed by public-data KL distillation toward client n's personalized server soft prediction sum_{m=1}^N c_{mn} s(w^m, xi_r) (Equation 6), and (2) server-side gradient descent on c via c <- c - eta_3 lambda sum_{n=1}^N (D_n/D) nabla_c L_{KL}(sum_{m=1}^N c_m s(w^{m,*}, xi_r), s(w^{n,*}, xi_r)) - 2 eta_3 rho (c - 1/N) (Equation 7).
Identity Notes & Concept Scope
Distinct from FedMD (AIMech:FedMdHeterogeneousFederatedLearningViaPublicDatasetModelDistillation, Li & Wang 2019) and FedDF (AIMech:FedDfEnsembleDistillationForRobustModelFusionInFederatedLearning, Lin et al. 2020), which form a single unweighted global ensemble teacher (1/N) sum_{m=1}^N s(w^m, x_hat) rather than maintaining a client-specific server soft prediction parameterized by a gradient-trained N x N knowledge coefficient matrix c; and distinct from FedFomo (AIMech:FedFomoFirstOrderModelOptimizationForPersonalizedFederatedLearning, Zhang et al. 2021) and FedAMP (AIMech:FedAmpFederatedAttentiveMessagePassingForPersonalizedCrossSiloFederatedLearning, Huang et al. 2021), which require identical model architectures to aggregate raw model parameters in weight space rather than distilling personalized linear combinations of public-data soft predictions across heterogeneous neural architectures.
Claims & Grounded Evidence
4 Claims
Mechanism
#r488-claim-1
KT-pFL formulates personalized heterogeneous federated learning as the alternating minimization of L(w, c) = sum_{n=1}^N (D_n/D) [L_n(w^n) + lambda sum_{x_hat in D_r} L_{KL}(sum_{m=1}^N c_{mn} s(w^m, x_hat), s(w^n, x_hat))] + rho ||c - 1/N||_2^2 (Equations 2-4), alternating between two-stage client updates (private SGD in Equation 5 and public KL distillation in Equation 6) and server gradient updates on the N x N knowledge coefficient matrix c with L2 shrinkage toward 1/N (Equation 7).
Mechanism
#r488-claim-2
Theorem 4.1 and Remark 4.1 prove that for any client n with local distribution D_n and empirical hypotheses {h_{D_hat_m}}_{m=1}^N, there always exist optimal knowledge coefficients c^*_{m,n} such that the expected loss of the personalized ensemble model satisfies L_{D_n}(sum_{m=1}^N c^*_{m,n} h_{D_hat_m}) <= L_{D_n}(h_{D_hat_n}) and L_{D_n}(sum_{m=1}^N c^*_{m,n} h_{D_hat_m}) <= L_{D_n}((1/N) sum_{m=1}^N h_{D_hat_m}), with strict inequality on non-IID problems.
Limitation
#r488-claim-3
KT-pFL requires a shared public dataset D_r accessible to all clients for computing and distilling soft predictions, and choosing an overly large public dataset size |D_r| or an excessively large generalization regularization parameter rho slows client distillation or forces c toward uniform 1/N weights, degrading personalized accuracy.
Application
#r488-claim-4
Applied to heterogeneous client architectures (LeNet, AlexNet, ResNet-18, ShuffleNetV2) and homogeneous CNNs on non-IID EMNIST, Fashion_MNIST, and CIFAR-10 benchmarks, where KT-pFL outperforms FedMD, FedDF, Sim-pFL, TopK-pFL, pFedMe, FedAMP, FedFomo, and pFedHN while reducing communication volume by transmitting compact soft predictions instead of full model weights.
⚠️ Curated Limitations & Negative Results
- Requires an auxiliary public dataset D_r accessible to all participating clients for computing and distilling soft predictions.
- Overly large public dataset sizes |D_r| increase client-side distillation latency, while overly large regularization rho forces c toward uniform 1/N weights.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:FederatedLearning
Federated Learning
|
broad_match | KT-pFL is a personalized group knowledge transfer algorithm within the broader FederatedLearning category. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r488-primary-pdf
|
Jie Zhang, Song Guo, Xiaosong Ma, Haozhao Wang, Wencao Xu, Feijie Wu
|
primary paper
full_text
|
ID: https://arxiv.org/abs/2111.02862
sha256:18c5c1bb95b7…
|
r488-arxiv-abs
|
Jie Zhang, Song Guo, Xiaosong Ma, Haozhao Wang, Wencao Xu, Feijie Wu
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2111.02862
sha256:84c99527b191…
|
r488-metadata-cr
|
Jie Zhang, Song Guo, Xiaosong Ma, Haozhao Wang, Wencao Xu, Feijie Wu
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2111.02862
sha256:7f6af276ff75…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T09:31:00Z
Updated: 2026-10-19T09:31: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