arXiv:2611.12964v1 Announce Type: new Abstract: While federated reinforcement learning (RL) has traditionally guaranteed high efficiency in homogeneous environments, collaboration is often hindered when agents possess distinct goals. In this paper, we flip this paradigm, framing reward heterogeneity not as a hurdle to consensus, but as a structural asset that catalyzes exploration. We first propose Personalized Federated Upper Confidence Bound Value Iteration (PF-UCBVI), which achieves optimal linear speedup by decoupling shared dynamics from personalized objectives. To eliminate the risks of explicit exploration, we then introduce Personalized Federated Exploration-Free Value Iteration (PF-EFVI), a purely greedy algorithm that leverages reward diversity to ensure state-action coverage. We prove that PF-EFVI attains logarithmic regret without explicit exploration bonuses under sufficient reward diversity. Our results reveal that agent disagreement shifts the exploration burden from temporal complexity to spatial diversity, enabling efficient collective learning without explicit exploration.
Exploration via Exploitation: The Blessing of Reward Diversity in Personalized Federated RL
A new arXiv paper (2611.12964v1) introduces PF-EFVI, a purely greedy personalized federated reinforcement learning algorithm that the authors prove attains logarithmic regret without explicit exploration bonuses when agents' rewards are sufficiently diverse. The paper's companion method, PF-UCBVI, achieves optimal linear speedup by decoupling shared dynamics from personalized objectives, and the authors argue reward heterogeneity shifts the exploration burden from temporal complexity to spatial diversity, enabling efficient collective learning without explicit exploration.
Run your AI side-project on zahid.host
EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.