Table of Contents
Fetching ...

Leveraging Partial Symmetry for Multi-Agent Reinforcement Learning

Xin Yu, Rongye Shi, Pu Feng, Yongkai Tian, Simin Li, Shuhao Liao, Wenjun Wu

TL;DR

This work tackles the challenge of leveraging symmetry in multi-agent reinforcement learning when symmetry is partial rather than perfect. It formalizes the partially symmetric Markov game, proves a bounded performance error for symmetry-based training, and introduces the Partial Symmetry Exploitation (PSE) framework to adaptively exploit symmetry via quantification, annealing, augmentation, and a symmetry-consistency loss. Empirical results across classic MARL benchmarks and real-world robot experiments show that PSE consistently improves sample efficiency and outcomes under symmetry-breaking conditions, outperforming strong baselines. The approach offers a practical pathway to incorporate inductive biases in realistic MARL deployments, with implications for robust coordination in heterogeneous, partially symmetric systems.

Abstract

Incorporating symmetry as an inductive bias into multi-agent reinforcement learning (MARL) has led to improvements in generalization, data efficiency, and physical consistency. While prior research has succeeded in using perfect symmetry prior, the realm of partial symmetry in the multi-agent domain remains unexplored. To fill in this gap, we introduce the partially symmetric Markov game, a new subclass of the Markov game. We then theoretically show that the performance error introduced by utilizing symmetry in MARL is bounded, implying that the symmetry prior can still be useful in MARL even in partial symmetry situations. Motivated by this insight, we propose the Partial Symmetry Exploitation (PSE) framework that is able to adaptively incorporate symmetry prior in MARL under different symmetry-breaking conditions. Specifically, by adaptively adjusting the exploitation of symmetry, our framework is able to achieve superior sample efficiency and overall performance of MARL algorithms. Extensive experiments are conducted to demonstrate the superior performance of the proposed framework over baselines. Finally, we implement the proposed framework in real-world multi-robot testbed to show its superiority.

Leveraging Partial Symmetry for Multi-Agent Reinforcement Learning

TL;DR

This work tackles the challenge of leveraging symmetry in multi-agent reinforcement learning when symmetry is partial rather than perfect. It formalizes the partially symmetric Markov game, proves a bounded performance error for symmetry-based training, and introduces the Partial Symmetry Exploitation (PSE) framework to adaptively exploit symmetry via quantification, annealing, augmentation, and a symmetry-consistency loss. Empirical results across classic MARL benchmarks and real-world robot experiments show that PSE consistently improves sample efficiency and outcomes under symmetry-breaking conditions, outperforming strong baselines. The approach offers a practical pathway to incorporate inductive biases in realistic MARL deployments, with implications for robust coordination in heterogeneous, partially symmetric systems.

Abstract

Incorporating symmetry as an inductive bias into multi-agent reinforcement learning (MARL) has led to improvements in generalization, data efficiency, and physical consistency. While prior research has succeeded in using perfect symmetry prior, the realm of partial symmetry in the multi-agent domain remains unexplored. To fill in this gap, we introduce the partially symmetric Markov game, a new subclass of the Markov game. We then theoretically show that the performance error introduced by utilizing symmetry in MARL is bounded, implying that the symmetry prior can still be useful in MARL even in partial symmetry situations. Motivated by this insight, we propose the Partial Symmetry Exploitation (PSE) framework that is able to adaptively incorporate symmetry prior in MARL under different symmetry-breaking conditions. Specifically, by adaptively adjusting the exploitation of symmetry, our framework is able to achieve superior sample efficiency and overall performance of MARL algorithms. Extensive experiments are conducted to demonstrate the superior performance of the proposed framework over baselines. Finally, we implement the proposed framework in real-world multi-robot testbed to show its superiority.
Paper Structure (23 sections, 1 theorem, 13 equations, 8 figures)

This paper contains 23 sections, 1 theorem, 13 equations, 8 figures.

Key Result

Proposition 1

If a partially symmetric Markov game $\mathcal{M}_g$ satisfies the conditions in equations rewardequ and transequ for all $(s, a) \in \Psi$, then the performance error $\textit{Error}_{\mathcal{M}_g}=|Q^{\star}(s, a) - Q^{\star}(gs, ga)|$ is bounded by $\frac{\epsilon}{1-\gamma} + \frac{\gamma \delt

Figures (8)

  • Figure 1: Illustration of symmetry disruption in a non-uniform field: despite the spatial symmetry of the multi-agent system, the introduction of a non-uniform field, such as uneven terrain or a wind field, disrupts this symmetry and the symmetry assumption does not strictly hold everywhere. Colors denote varying intensities of the field.
  • Figure 2: Performance of the EQ-MPN and MPN under varying noise levels. As the noise intensity (the degree of symmetry-breaking) increases, the perfect symmetry network, EQ-MPN, exhibits a declining trend.
  • Figure 3: The overall framework of the proposed PSE. The framework is composed of four key modules: 1) Symmetry Quantification, which measures the level of symmetry in the environment, 2) Adaptive Tuning, which serves as the annealing coefficient modulating the continuous degree of symmetry utilization. 3) Symmetry Augmentation, which manipulates the data based on the quantified symmetry, and 4) Symmetry Loss, a specially crafted function that optimizes the policy network with respect to the symmetry.
  • Figure 4: The simulated tasks considered in the experiments.
  • Figure 5: Learning curves of the baseline and their versions with the PSE framework on the three multi-agent tasks.
  • ...and 3 more figures

Theorems & Definitions (4)

  • Definition 1: Partial Equivariance and Invariance
  • Definition 2: Partially Symmetric Markov game
  • Definition 3: Performance Error for $\mathcal{M}_g$ when using symmetry-augmented data
  • Proposition 1: Performance Error Bound