This paper reinterprets FCIL as a unified multi-task learning problem, where both client and task updates are represented as adaptation vectors in a shared parameter space and proposes Unified Geometric Surgery on Spatio-Temporal Adaptation Vectors (SUM), a purely server-side framework that performs geometric surgery on adaptation vectors during aggregation.
Abstract
Real-world intelligent systems often require both distributed collaboration across data-isolated clients and continual adaptation to evolving tasks. This setting naturally gives rise to Federated Class Incremental Learning (FCIL), which combines Federated Learning (FL) and Continual Learning (CL). However, their combination introduces two coupled sources of interference: spatial interference from heterogeneous clients and temporal interference from sequential tasks, jointly leading to Spatial-Temporal Catastrophic Forgetting (ST-CF). Existing approaches typically address spatial and temporal interference with separate mechanisms, often incurring additional client-side computation or communication, while leaving directional interactions among updates during aggregation unregulated. In this paper, we reinterpret FCIL as a unified multi-task learning problem, where both client and task updates are represented as adaptation vectors in a shared parameter space. Based on this view, we propose Unified Geometric Surgery on Spatio-Temporal Adaptation Vectors (SUM), a purely server-side framework that performs geometric surgery on adaptation vectors during aggregation. Spatial SUM mitigates client-level interference within each round, while causal online temporal SUM removes cross-task interference over time without additional client-side computation, communication, or memory beyond standard federated training. Empirically, SUM achieves up to 22% improvement over prior FCIL methods across diverse vision and language benchmarks while remaining robust to unreliable clients and maintaining computational efficiency.
FedALA-WR, a novel framework that integrates adaptive attention-based aggregation with a weighted memory replay mechanism, allowing clients to reinforce valuable past knowledge during local training, consistently outperforms baseline FL and state-of-the-art pFL methods in accuracy and convergence speed.
Tinku Singh, N. Khoa, B. Kumar et al.· Cluster Computing· 0 citations
Dynamic Subspace Boosting (Dysco), a plug-in method that allocates client-specific LoRA subspaces in a federated and dynamic manner, and proves that Dysco's server-fixed merged subspaces yield a tighter upper bound on this error.
Haobo Zhang, Jiankun Wang, Suraj Rajendran et al.· 0 citations
FedRAM is proposed, a three-step framework that progressively updates two scalar hyperparameters: the task importance weight and the client aggregation coefficient, where the proxy model serves as an intermediate between the local reference model and the global agent model.
Fan Wu, Xinyu Yan, Jiabei Liu et al.· Neural Information Processin...· 0 citations
Experimental results show that FedOPAL not only significantly outperforms the original analytical methods on several benchmarks, but also achieves accuracy comparable to state-of-the-art iterative methods while maintaining zero server-side training costs, providing a new engineering paradigm for efficient collaboration of large models on the edge.
Lingyu Qiu, Daniela Annunziata, Stefano Izzo et al.· 2026 2nd International Confe...· 0 citations
A novel class-incremental continual learning model for a one-shot FL paradigm, in which each task introduces new classes, clients observe heterogeneous and evolving class distributions, and communication with the server occurs only once, substantially mitigates catastrophic forgetting while consistently enhancing recognition of newly introduced classes.
Pedro H. Barros, Omid Orang, Giulia Zanon de Castro et al.· 0 citations
FedADB, a Class Anchor-Driven Dual-Branch FL framework, a dual-branch collaborative training mechanism designed for clients that achieves significant improvements in both accuracy and convergence speed.
Zhenyan Liu, Hua Zhang, Haoran Gao et al.· 0 citations