We study streaming federated learning with limited client memory, where newly generated training data incur time-varying sampling costs and must be selectively admitted and retained over time. We consider a joint server-side admission and client-side memory-management framework with the objective of minimizing the cumulative excess population risk under a sampling-cost budget and buffer constraints.
arXiv:2608. 07157v1 Announce Type: new Abstract: Sub-model federated learning lets resource-constrained clients train width-reduced versions of a global model, but existing methods allocate capacity by device resources alone.
By Alireza Moayedikia, Alicia Troncoso Lora
arXiv:2606. 08452v1 Announce Type: new Abstract: In many real-world settings, data streams are nonstationary and arrive sequentially, requiring learning systems to adapt continuously without retraining from scratch.
By Nazreen Shah, Govinda Arya, Bharath B. N., Ranjitha Prasad
arXiv:2601. 19788v2 Announce Type: replace Abstract: Federated Continual Learning (FCL) leverages inter-client collaboration to better balance new knowledge acquisition and old knowledge retention on non-stationary data.
By Sixing Tan, Xianmin Liu
The paper introduces FedSWE, a federated learning algorithm designed to handle non‑stationary and heterogeneous client availability without requiring prior real‑time knowledge of which devices are online. FedSWE compensates for missed computations, stabilizes global updates, and mixes local updates through implicit gossiping, all while adding only modest memory and computational overhead. The authors prove that FedSWE converges to a stationary point for non‑convex objectives and achieves linear speedup in certain scenarios, and they validate these claims with experiments on real‑world datasets featuring diverse client unavailability patterns.
By Ming Xiang, Stratis Ioannidis, Edmund Yeh, Carlee Joe-Wong, Lili Su
arXiv:2609.38833v1 Announce Type: new
Abstract: Federated continual learning must integrate new tasks over time without losing earlier-task knowledge. Most existing methods attach an anti-forgetting...
By Sungmin Kang, Zhengzhong Tu, Sunwoo Lee
arXiv:2609.23843v1 Announce Type: new
Abstract: Scheduling clients for model training is critical in federated learning due to both data and system heterogeneity. Most previous works focus on the qua...
By Wen Xu, Ben Liang, Gary Boudreau, Hamza Sokun
arXiv:2606. 08854v1 Announce Type: cross Abstract: Standard Reinforcement Learning with Verifiable Rewards (RLVR) training allocates a fixed rollout budget to every query, without regard for what each query's difficulty means for the current policy.
By Shivchander Sudalairaj, Kai Xu, Akash Srivastava, Giorgio Giannone
arXiv:2606. 17805v1 Announce Type: new Abstract: Data acquisition is a major bottleneck for learning in real-time streams: analysts must decide on the fly which labels to purchase while respecting a rolling budget.
By Xiwen Huang, Pierre Pinson
arXiv:2608. 19488v1 Announce Type: new Abstract: Production machine learning systems degrade under concept drift, yet practitioners have little principled guidance on when to retrain.
By Sawan Dasari
arXiv:2408. 05886v5 Announce Type: replace Abstract: Heterogeneous system configurations of distributed clients connected to the central server (CS) via a time-varying wireless network pose significant challenges for popular distributed machine learning (ML) algorithms such as federated learning (FL).
By Ferdous Pervej, Minseok Choi, Andreas F. Molisch
arXiv:2501. 12942v2 Announce Type: replace Abstract: Effective multi-user delay-constrained scheduling is crucial in various real-world applications, including embodied AI, instant messaging, live streaming, and data center management, where efficient resource allocation is required among users with diverse delay sensitivities.
By Zhuoran Li, Ruishuo Chen, Hai Zhong, Longbo Huang