Momentum-Based Federated Reinforcement Learning with Interaction and Communication Efficiency
Sheng Yue, Xingyuan Hua, Lili Chen, Ju Ren
Abstract
Federated Reinforcement Learning (FRL) has garnered increasing attention recently. However, due to the intrinsic spatio-temporal non-stationarity of data distributions, the current approaches typically suffer from high interaction and communication costs. In this paper, we introduce a new FRL algorithm, named MFPO, that utilizes momentum, importance sampling, and additional server-side adjustment to control the shift of stochastic policy gradients and enhance the efficiency of data utilization. We prove that by proper selection of momentum parameters and interaction frequency, MFPO can achieve and interaction and communication complexities (N represents the number of agents), where the interaction complexity achieves linear speedup with the number of agents, and the communication complexity aligns the best achievable of existing first-order FL algorithms. Extensive experiments corroborate the substantial performance gains of MFPO over existing methods on a suite of complex and high-dimensional benchmarks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- Context Learning for Multi-Agent DiscussionXingyuan Hua, Sheng Yue, Xinyi Li, Yizhe Zhao et al.ICLR 2026 · 4 citations
- Learning to Explore: Scaling Agentic Reasoning via Exploration-Aware Policy OptimizationXingyuan Hua, Sheng Yue, Ju RenICML 2026 · 1 citation
Builds on6
- SCAFFOLD: Stochastic Controlled Averaging for Federated LearningSai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi et al.ICML 2020 · 3,875 citations
- Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated LearningHaibo Yang, Minghong Fang, Jia LiuICLR 2021 · 310 citations
- Fault-Tolerant Federated Reinforcement Learning with Theoretical GuaranteeFlint Xiaofeng Fan, Yining Ma, Zhongxiang Dai, Wei Jing et al.NeurIPS 2021 · 102 citations
- STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated LearningPrashant Khanduri, Pranay Sharma, Haibo Yang, Mingyi Hong et al.NeurIPS 2021 · 78 citations
- The Complexity of Finding Stationary Points with Stochastic Gradient DescentYoel Drori, Ohad ShamirICML 2020 · 73 citations
Related papers
- Momentum for the Win: Collaborative Federated Reinforcement Learning across Heterogeneous EnvironmentsHan Wang, Sihong He, Zhili Zhang, Fei Miao et al.ICML 2024 · 9 citations
- Finite-Time Analysis of On-Policy Heterogeneous Federated Reinforcement LearningChenyu Zhang, Han Wang, Aritra Mitra, James AndersonICLR 2024 · 32 citations
- Policy Optimization with Stochastic Mirror DescentLong Yang, Yu Zhang, Gang Zheng, Qian Zheng et al.AAAI 2022 · 38 citations
- On the Convergence of Local Stochastic Compositional Gradient Descent with MomentumHongchang Gao, Junyi Li, Heng HuangICML 2022 · 18 citations
- Momentum Benefits Non-iid Federated Learning Simply and ProvablyZiheng Cheng, Xinmeng Huang, Pengfei Wu, Kun YuanICLR 2024 · 40 citations
