Multi-task Federated Reinforcement Learning With Adversaries

Abstract

Reinforcement learning algorithms, just like any other Machine learning algorithm pose a serious threat from adversaries. The adversaries can manipulate the learning algorithm resulting in non-optimal policies. In this paper, we analyze the Multi-task Federated Reinforcement Learning algorithms, where multiple collaborative agents in various environments are trying to maximize the sum of discounted return, in the presence of adversarial agents. We argue that the common attack methods are not guaranteed to carry out a successful attack on Multi-task Federated Reinforcement Learning and propose an adaptive attack method with better attack performance. Furthermore, we modify the conventional federated reinforcement learning algorithm to address the issue of adversaries that works equally well with and without the adversaries. Experimentation on different small to mid-size reinforcement learning problems show that the proposed attack method outperforms other general attack methods and the

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyanwar2021multi

Related papers

• Adversarial Attacks In Consensus-based Multi-agent Reinforcement Learning (2021)0.00
• Constrained Black-box Attacks Against Cooperative Multi-agent Reinforcement Learning (2025)0.00
• Efficient Adversarial Attacks On Online Multi-agent Reinforcement Learning (2023)0.00
• SUB-PLAY: Adversarial Policies Against Partially Observed Multi-agent Reinforcement Learning Systems (2024)0.00
• Adversarial Attacks In Cooperative AI (2021)0.00
• Neutral Agent-based Adversarial Policy Learning Against Deep Reinforcement Learning In Multi-party Open Systems (2025)0.00
• Provably Robust Federated Reinforcement Learning (2025)0.00
• Camouflage Adversarial Attacks On Multiple Agent Systems (2024)0.00