MAVIPER: Learning Decision Tree Policies For Interpretable Multi-agent Reinforcement Learning

Abstract

Many recent breakthroughs in multi-agent reinforcement learning (MARL) require the use of deep neural networks, which are challenging for human experts to interpret and understand. On the other hand, existing work on interpretable reinforcement learning (RL) has shown promise in extracting more interpretable decision tree-based policies from neural networks, but only in the single-agent setting. To fill this gap, we propose the first set of algorithms that extract interpretable decision-tree policies from neural networks trained with MARL. The first algorithm, IVIPER, extends VIPER, a recent method for single-agent interpretable RL, to the multi-agent setting. We demonstrate that IVIPER learns high-quality decision-tree policies for each agent. To better capture coordination between agents, we propose a novel centralized decision-tree training algorithm, MAVIPER. MAVIPER jointly grows the trees of each agent by predicting the behavior of the other agents using their anticipated trees,

Stats

• citations5
• S2 citations—
• github stars0
• HF likes0
• heat score5.84
• arxiv keymilani2022maviper

Related papers

• Mixrts: Toward Interpretable Multi-agent Reinforcement Learning Via Mixing Recurrent Soft Decision Trees (2022)7.16
• Verifiable Reinforcement Learning Via Policy Extraction (2018)0.00
• Iterative Bounding Mdps: Learning Interpretable Policies Via Non-interpretable Methods (2021)0.00
• "so, Tell Me About Your Policy...": Distillation Of Interpretable Policies From Deep Reinforcement Learning Agents (2025)0.00
• Optimizing Interpretable Decision Tree Policies For Reinforcement Learning (2024)0.00
• Discovering Multiagent Learning Algorithms With Large Language Models (2026)2.05
• V-learning -- A Simple, Efficient, Decentralized Algorithm For Multiagent RL (2021)0.00
• A Review Of Cooperative Multi-agent Deep Reinforcement Learning (2019)19.08