arXiv Machine Learning By Jebacyril Arockiaraj, Dhruv Parikh, Jayashree Adivarahan, Rajgopal Kannan, Viktor Prasanna

Accurate and Resource-Efficient Federated Continual Learning

Read the original on arXiv Machine Learning →

arXiv:2606. 11480v1 Announce Type: new Abstract: Federated continual learning (FCL) must learn from distributed task streams under limited resources, such as communication, computation, memory, and label availability.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 10

FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection

arXiv:2604. 24012v3 Announce Type: replace Abstract: Federated learning enables a population of clients to collaboratively train machine learning models without exchanging their raw data, but standard algorithms such as FedAvg suffer from slow convergence and high communication and memory costs in heterogeneous, resource-constrained environments.

By Yutong He, Zhengyang Huang, Jiahe Geng, Kun Yuan
arXiv Machine Learning
Aug 31

Ampere: Communication-Efficient and High-Accuracy Split Federated Learning

Ampere is a new split federated learning system that reduces both on‑device computation and device‑server communication while improving accuracy. It trains device and server blocks sequentially with local losses, eliminating gradient transfers, and uses a lightweight auxiliary network to consolidate activations into a single transfer. Experiments on CNNs and Transformers show up to 11.70 pp accuracy gains, 18.6× faster training, 911× less communication, and 14.5× less computation compared to state‑of‑the‑art SFL baselines.

By Zihan Zhang, Leon Wong, Blesson Varghese
arXiv Machine Learning
Aug 24

SPARCL: Spectral Partitioned Analytic Continual Learning

SPARCL introduces a spectral partitioned analytic continual learning method that addresses forgetting in analytic class‑incremental learning. By decomposing the running autocorrelation into a high‑energy core and a residual complement, SPARCL freezes core components for old classes and updates only the residual block, ensuring closed‑form updates with an invariance guarantee. Experiments on CIFAR‑100, CUB‑200, ImageNet‑R, and ImageNet‑A with a frozen ViT‑B/16 protocol show that SPARCL narrows the performance gap between classical analytic learners and strong representation matchers while complementing sparse feature‑decorrelation approaches.

By James Hartley, Zeropy Surio, Daniel Whitmore, Hannah Clarke, Thomas Reed