OCLGMAMLOct 23, 2022

Symmetric (Optimistic) Natural Policy Gradient for Multi-agent Learning with Parameter Convergence

arXiv:2210.12812v215 citationsh-index: 68
Originality Incremental advance
AI Analysis

This addresses stability issues in multi-agent learning, particularly in function approximation settings, by ensuring parameter convergence, which is incremental as it builds on existing NPG methods with new theoretical guarantees.

The paper tackled the problem of parameter non-convergence in natural policy gradient (NPG) algorithms for multi-agent reinforcement learning, showing that vanilla NPG may not converge parameters even with regularization, and proposed symmetric NPG variants with global last-iterate parameter convergence guarantees for scenarios like two-player zero-sum games and multi-player monotone games.

Multi-agent interactions are increasingly important in the context of reinforcement learning, and the theoretical foundations of policy gradient methods have attracted surging research interest. We investigate the global convergence of natural policy gradient (NPG) algorithms in multi-agent learning. We first show that vanilla NPG may not have parameter convergence, i.e., the convergence of the vector that parameterizes the policy, even when the costs are regularized (which enabled strong convergence guarantees in the policy space in the literature). This non-convergence of parameters leads to stability issues in learning, which becomes especially relevant in the function approximation setting, where we can only operate on low-dimensional parameters, instead of the high-dimensional policy. We then propose variants of the NPG algorithm, for several standard multi-agent learning scenarios: two-player zero-sum matrix and Markov games, and multi-player monotone games, with global last-iterate parameter convergence guarantees. We also generalize the results to certain function approximation settings. Note that in our algorithms, the agents take symmetric roles. Our results might also be of independent interest for solving nonconvex-nonconcave minimax optimization problems with certain structures. Simulations are also provided to corroborate our theoretical findings.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes