SOURCE-LINKED INTELLIGENCE

Robust Federated Q-Learning with Almost No Communication

arXiv · AI, language, vision and robotics · article · Aug 24, 2026 · UTC

We consider a federated reinforcement learning setting involving $M$ agents, all of whom interact with a common Markov Decision Process (MDP). The agents exchange information via a central server to learn the optimal value function. Our goal is to understand to what extent one can hope for collaborative sample-complexity speedups in such a setting, when a small fraction of the agents are adversarial and can act arbitrarily. To that end, we propose Robust Fed-Q}, a federated Q-learning algorithm that blends ideas from both model-based and model-free RL, along with the median-of-means device fro

Read original source ↗ Open in workspace

recordType

paper

region

Global