Clustered federated learning (CFL) can suffer from cluster collapse. In particular, under unfavorable initialization, early client assignments concentrate heterogeneous groups on one cluster model, wh...
arXiv:2604.05088v2 Announce Type: replace-cross Abstract: We propose ScalarFedLQR, a communication-efficient federated algorithm for model-free learning of a common policy in linear quadratic regulat...
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.
arXiv:2601. 22601v2 Announce Type: replace Abstract: Federated unlearning (FU) aims to erase designated client-level, class-level, or sample-level knowledge from a global model.
arXiv:2606. 30499v1 Announce Type: new Abstract: Federated Learning often suffers under non-independently and identically distributed data, where a single global model may fail to represent the diversity of client distributions.
The paper introduces the Viability‑constrained Behavioral Steering Attack (V‑BSA), a new attack strategy for federated reinforcement learning that targets the timing of interventions rather than just the construction of malicious updates. By selecting sparse intervention states based on local policy uncertainty and applying envelope‑constrained steering, V‑BSA can significantly degrade performance on discrete‑action benchmarks while using far fewer interventions than traditional dense poisoning attacks. The study demonstrates that the specific states at which interventions occur constitute a distinct and critical dimension of robustness in sequential decision‑making settings.
arXiv:2610.25113v3 Announce Type: replace-cross Abstract: The explore-exploit trade-off is the core problem of reinforcement learning (RL). In its multi-agent, resource-sharing form the optimum is no...
arXiv:2606. 10124v1 Announce Type: cross Abstract: Federated learning (FL) is often subject to aggregation variance if clients do not consistently participate in training rounds.
arXiv:2610.07859v1 Announce Type: new Abstract: Conventional decentralized federated learning (DFL) often focuses on clients, with each client maintaining a model copy, performing updates individuall...
StoCFL is a clustered federated learning framework designed to address Non-IID data and dynamic client participation. It introduces a flexible clustering mechanism that allows arbitrary client participation and accommodates newly joined clients, improving data efficiency and model performance. Experiments on four Non-IID settings and a real-world dataset demonstrate that StoCFL achieves promising cluster results even when the number of clusters is unknown, outperforming baseline approaches across various scenarios.
The paper demonstrates that a minimal foraging swarm can approach the explore/exploit optimum of reinforcement learning without any learner or reward signal. Agents use heavy‑tailed Levy flights to explore, recruit neighbors via a threshold cascade on their proximity network, and disperse as patch crowds, creating a cycle that balances exploration and exploitation. The swarm attains the shape of the ideal‑free distribution (committed foragers track richness with slope 0.94) and reaches this allocation dynamically in about 150 steps, though it remains slightly exploitable and does not achieve the exact equilibrium.
arXiv:2609.07312v1 Announce Type: new Abstract: This paper proposes a robust decentralized personalized federated learning method R-DPFL, that enables clients to reduce the impact of Byzantine attack...