Certified Policy Smoothing For Cooperative Multi-agent Reinforcement Learning

Abstract

Cooperative multi-agent reinforcement learning (c-MARL) is widely applied in safety-critical scenarios, thus the analysis of robustness for c-MARL models is profoundly important. However, robustness certification for c-MARLs has not yet been explored in the community. In this paper, we propose a novel certification method, which is the first work to leverage a scalable approach for c-MARLs to determine actions with guaranteed certified bounds. c-MARL certification poses two key challenges compared with single-agent systems: (i) the accumulated uncertainty as the number of agents increases; (ii) the potential lack of impact when changing the action of a single agent into a global team reward. These challenges prevent us from directly using existing algorithms. Hence, we employ the false discovery rate (FDR) controlling procedure considering the importance of each agent to certify per-state robustness and propose a tree-search-based algorithm to find a lower bound of the global reward un

Stats

• citations4
• S2 citations—
• github stars0
• HF likes0
• heat score5.24
• arxiv keymu2022certified

Related papers

• Robust Multi-agent Reinforcement Learning With State Uncertainty (2023)0.00
• Safe Multi-agent Reinforcement Learning With Convergence To Generalized Nash Equilibrium (2024)0.00
• Breaking The Curse Of Multiagency In Robust Multi-agent Reinforcement Learning (2024)0.00
• Byzantine Robust Cooperative Multi-agent Reinforcement Learning As A Bayesian Game (2023)0.00
• CAMMARL: Conformal Action Modeling In Multi Agent Reinforcement Learning (2023)0.00
• Empirical Study On Robustness And Resilience In Cooperative Multi-agent Reinforcement Learning (2025)0.00
• Attacking C-marl More Effectively: A Data Driven Approach (2022)0.00
• Multi-agent Reinforcement Learning In Stochastic Networked Systems (2020)0.00