paper-with-me

홈 › Papers

Breaking the Curse of Dimensionality in Multiagent State Space: A Unified Agent Permutation Framework

2022-03-10 · Xiaotian Hao, Hangyu Mao, Weixun Wang, Yaodong Yang, Dong Li, Yan Zheng, Zhen Wang, Jianye Hao

The state space in Multiagent Reinforcement Learning (MARL) grows exponentially with the agent number. Such a curse of dimensionality results in poor scalability and low sample efficiency, inhibiting MARL for decades. To break this curse, we propose a unified agent permutation framework that exploits the permutation invariance (PI) and permutation equivariance (PE) inductive biases to reduce the multiagent state space. Our insight is that permuting the order of entities in the factored multiagent state space does not change the information. Specifically, we propose two novel implementations: a Dynamic Permutation Network (DPN) and a Hyper Policy Network (HPN). The core idea is to build separate entity-wise PI input and PE output network modules to connect the entity-factored state space and action space in an end-to-end way. DPN achieves such connections by two separate module selection networks, which consistently assign the same input module to the same input entity (guarantee PI) and assign the same output module to the same entity-related output (guarantee PE). To enhance the representation capability, HPN replaces the module selection networks of DPN with hypernetworks to directly generate the corresponding module weights. Extensive experiments in SMAC, Google Research Football and MPE validate that the proposed methods significantly boost the performance and the learning efficiency of existing MARL algorithms. Remarkably, in SMAC, we achieve 100% win rates in almost all hard and super-hard scenarios (never achieved before).

📄 PDF Abstract BibTeX arXiv:2203.05285

Code (0)

등록된 구현이 없습니다.

Tasks

Data AugmentationMulti-agent Reinforcement LearningReinforcement Learning (RL)SMACSMAC+

Methods 이 논문이 사용한 방법론

Grouped Convolution A Grouped Convolution uses a group of convolutions - multiple kernels per layer - resulting in multiple channel outputs per layer. This leads to wider networks helping a…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Concatenated Skip Connection A Concatenated Skip Connection is a type of skip connection that seeks to reuse features by concatenating them to new layers, allowing more information to be retained from…
Residual Connection 설명 없음
DPN Block 설명 없음
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Average Pooling 설명 없음

Similar Papers 제목 키워드 기반

Policy Distillation and Value Matching in Multiagent Reinforcement Learning

2019-03-15 · Samir Wadhwania, Dong-Ki Kim, Shayegan Omidshafiei, Jonathan P. How

Multiagent reinforcement learning algorithms (MARL) have been demonstrated on complex tasks that require the coordination of a team of multiple agents to complete. Existing works have focused on sharing information betwe…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Breaking the curse of dimensionality with Isolation Kernel

2021-09-29 · Kai Ming Ting, Takashi Washio, Ye Zhu, Yang Xu

The curse of dimensionality has been studied in different aspects. However, breaking the curse has been elusive. We show for the first time that it is possible to break the curse using the recently introduced Isolation K…

Clustering

Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximation

2023-02-07 · Qiwen Cui, Kaiqing Zhang, Simon S. Du

We propose a new model, independent linear Markov game, for multi-agent reinforcement learning with a large state space and a large number of agents. This is a class of Markov games with independent linear function appro…

Multi-agent Reinforcement Learning

The Representation Power of Neural Networks: Breaking the Curse of Dimensionality

2020-12-10 · Moise Blanchard, M. Amine Bennouna

In this paper, we analyze the number of neurons and training parameters that a neural networks needs to approximate multivariate functions of bounded second mixed derivatives -- Korobov functions. We prove upper bounds o…

Error Analysis of Kernel/GP Methods for Nonlinear and Parametric PDEs

2023-05-08 · Pau Batlle, Yifan Chen, Bamdad Hosseini, Houman Owhadi 외

We introduce a priori Sobolev-space error estimates for the solution of nonlinear, and possibly parametric, PDEs using Gaussian process and kernel based methods. The primary assumptions are: (1) a continuous embedding of…