LGAIOct 19, 2020

Learning by Competition of Self-Interested Reinforcement Learning Agents

arXiv:2010.09770v35 citations
AI Analysis

This addresses the inefficiency of structural credit assignment in biologically plausible alternatives to backpropagation for training neural networks, though it is incremental in improving upon existing methods.

The paper tackles the high variance problem in training deep neural networks with REINFORCE by proposing Weight Maximization, where hidden units maximize their outgoing weight norms instead of a global reward, leading to significantly faster learning than REINFORCE and slightly slower than backpropagation.

An artificial neural network can be trained by uniformly broadcasting a reward signal to units that implement a REINFORCE learning rule. Though this presents a biologically plausible alternative to backpropagation in training a network, the high variance associated with it renders it impractical to train deep networks. The high variance arises from the inefficient structural credit assignment since a single reward signal is used to evaluate the collective action of all units. To facilitate structural credit assignment, we propose replacing the reward signal to hidden units with the change in the $L^2$ norm of the unit's outgoing weight. As such, each hidden unit in the network is trying to maximize the norm of its outgoing weight instead of the global reward, and thus we call this learning method Weight Maximization. We prove that Weight Maximization is approximately following the gradient of rewards in expectation. In contrast to backpropagation, Weight Maximization can be used to train both continuous-valued and discrete-valued units. Moreover, Weight Maximization solves several major issues of backpropagation relating to biological plausibility. Our experiments show that a network trained with Weight Maximization can learn significantly faster than REINFORCE and slightly slower than backpropagation. Weight Maximization illustrates an example of cooperative behavior automatically arising from a population of self-interested agents in a competitive game without any central coordination.

Code Implementations1 repo
Foundations

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

Your Notes