The paper introduces Robust Fed-Q, a federated Q‑learning algorithm designed for settings where multiple agents interact with a shared Markov Decision Process and communicate through a central server. It combines model‑based and model‑free reinforcement learning techniques with a median‑of‑means strategy from robust statistics to handle a small fraction of adversarial agents. The authors prove that Robust Fed-Q achieves exact convergence to the optimal value function with high probability, attains near‑optimal finite‑time rates that benefit from collaboration, and requires only “~O(1)” communication rounds per guarantee.
By Sreejeet Maity, Aritra Mitra
arXiv:2606. 02107v1 Announce Type: cross Abstract: This paper proposes a Network Distributed Multi-Agent Reinforcement Learning (ND-MARL) framework for quadcopter consensus control.
By Youssef Mahran, Zeyad Gamal, Aamir Ahmad, Ayman El-Badawy
arXiv:2603. 19617v2 Announce Type: replace Abstract: Federated learning (FL) is a communication-efficient framework for solving distributed optimization problems.
By Mohammadjavad Ebrahimi, Daniel Burbano, Farzad Yousefian
arXiv:2605. 18077v2 Announce Type: replace Abstract: Communication is a key component in multi-agent reinforcement learning (MARL) for mitigating partial observability, yet prior approaches often rely on inefficient information exchange or fail to transmit sufficient state information.
By Sangjun Bae, Yisak Park, Sanghyeon Lee, Seungyul Han
The paper introduces Fed‑LSVI, a federated online reinforcement learning algorithm that uses linear function approximation in episodic Markov decision processes. It achieves a regret bound of ≥O(√{Md^3H^4T}) while only exchanging compressed sufficient statistics, thereby meeting privacy constraints. The method reduces communication cost to logarithmic in the number of episodes, a marked improvement over previous approaches that required linear communication.
By Zihang Liang, Haochen Zhang, Lingzhou Xue
The paper proposes a new federated learning approach called FedALS that reduces communication costs by varying aggregation frequencies across model layers. It derives tighter generalization bounds for one‑round and multi‑round federated learning, linking these bounds to local updates and data heterogeneity. Based on representation‑learning insights, the authors argue that infrequent aggregation of early layers and more frequent aggregation of final layers yields more generalizable models, especially in non‑iid settings, and demonstrate the method’s effectiveness experimentally.
By Peyman Gholami, Hulya Seferoglu
The paper introduces Robust Async-Fed-Q, an epoch‑based federated Q‑learning algorithm that combines variance‑reduced Bellman operator estimation with robust server aggregation. It provides high‑probability finite‑time guarantees showing that honest agents retain sample‑efficiency benefits even when some agents act adversarially, with the adversarial impact diminishing as honest data grows. The authors also present matching lower bounds, extend the framework to single‑trajectory sampling and heterogeneous coverage, and improve communication complexity for asynchronous federated Q‑learning.
By Sreejeet Maity, Aritra Mitra
arXiv:2610.28565v1 Announce Type: new
Abstract: Clustered federated learning (CFL) can suffer from cluster collapse. In particular, under unfavorable initialization, early client assignments concentr...
By Priyanka Sinha, Snigdhansu Chatterjee
arXiv:2609.25701v1 Announce Type: new
Abstract: We study distributed Byzantine-resilient actor-critic multi-agent reinforcement learning (AC-MARL), where agents collectively learn policies through lo...
By Haejoon Lee, Dimitra Panagou
arXiv:2504. 12742v2 Announce Type: replace Abstract: Decentralized Federated Learning (DFL) enables collaborative model training without relying on a central server.
By Yuan Zhou, Xinli Shi, Xuelong Li, Jiachen Zhong, Guanghui Wen, Jinde Cao
The paper proposes Byrd-NAFL, a Byzantine‑robust federated learning algorithm that incorporates Nesterov’s momentum and resilient aggregation rules. It achieves fast and safe convergence under non‑convex, smooth loss functions with relaxed gradient assumptions, and provides a finite‑time convergence guarantee. Experiments show that Byrd-NAFL outperforms existing methods in convergence speed, accuracy, and resilience to various malicious attacks.
By Lihan Xu, Xiaoyi Fan, Gang Wang, Runhao Zeng, Xiping Hu, Yanjie Dong
arXiv:2608. 09565v1 Announce Type: cross Abstract: Optimization theory is a widely used tool for intelligent decision-making.
By Muhammad Faraz Ul Abrar, Nicol\`o Michelusi, Erik G. Larsson