Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research addresses the dynamic nature of federated learning by introducing pFedDSH, which enables seamless client onboarding without degrading performance for existing users or requiring data re-exposure. By leveraging hypernetworks and server-side data-free replay, the method effectively balances personalized adaptation with global stability in evolving distributed environments.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Onboarding Without Forgetting: Hypernetwork Personalization with Data-Free Replay for Personalized Federated Learning

arXiv2 min read

arXiv:2508.05157v2 Announce Type: replace Abstract: Federated Learning (FL) enables collaborative training across distributed clients without sharing raw data, offering strong privacy benefits. However, most methods assume all clients remain available throughout training, which is unrealistic as new clients often join over time. We study this setting, where the task and label space stay fixed but clients arrive in batches. Our analysis reveals two key challenges: updating the shared model only with new clients harms existing clients, while freezing it protects them but blocks gains from new knowledge. To capture these trade-offs, we introduce Proactive Adaptation (PA) for onboarding gains and Retroactive Improvement (RI) for changes in earlier clients without retraining. We then propose pFedDSH, which combines a central hypernetwork for personalized initialization, batch-specific binary masks for capacity preservation and allocation, and server-side data-free replay to propagate improvements without exposing client data. Experiments show that pFedDSH preserves stability for existing clients while keeping communication and adaptation costs unchanged for new clients.

Abstract:Federated Learning (FL) enables collaborative training across distributed clients without sharing raw data, offering strong privacy benefits. However, most methods assume all clients remain available throughout training, which is unrealistic as new clients often join over time. We study this setting, where the task and label space stay fixed but clients arrive in batches. Our analysis reveals two key challenges: updating the shared model only with new clients harms existing clients, while freezing it protects them but blocks gains from new knowledge. To capture these trade-offs, we introduce Proactive Adaptation (PA) for onboarding gains and Retroactive Improvement (RI) for changes in earlier clients without retraining. We then propose pFedDSH, which combines a central hypernetwork for personalized initialization, batch-specific binary masks for capacity preservation and allocation, and server-side data-free replay to propagate improvements without exposing client data. Experiments show that pFedDSH preserves stability for existing clients while keeping communication and adaptation costs unchanged for new clients.

Machine Learning (cs.LG)

arXiv:2508.05157 [cs.LG]

(or arXiv:2508.05157v2 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2508.05157 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 247 words

Related coverage