Diversity Through Exclusion (DTE): Niche Identification for Reinforcement Learning through Value-Decomposition

TL;DR

This paper introduces a reinforcement learning algorithm that uses multiple sub-policies and a novel value-decomposition method to help agents discover and converge to higher-value niches in complex environments.

Contribution

It proposes a new RL algorithm with a multi-policy architecture and a fitness-sharing inspired learning rule, improving niche exploration and avoidance of local optima.

Findings

Agents can escape local optima to find higher-value strategies.

The method outperforms baseline deep Q-learning in multi-niche environments.

Artificial chemistry platform demonstrates the approach's effectiveness.

Abstract

Many environments contain numerous available niches of variable value, each associated with a different local optimum in the space of behaviors (policy space). In such situations it is often difficult to design a learning process capable of evading distraction by poor local optima long enough to stumble upon the best available niche. In this work we propose a generic reinforcement learning (RL) algorithm that performs better than baseline deep Q-learning algorithms in such environments with multiple variably-valued niches. The algorithm we propose consists of two parts: an agent architecture and a learning rule. The agent architecture contains multiple sub-policies. The learning rule is inspired by fitness sharing in evolutionary computation and applied in reinforcement learning using Value-Decomposition-Networks in a novel manner for a single-agent's internal population. It can concretely be understood as adding an extra loss term where one policy's experience is also used to update all the other policies in a manner that decreases their value estimates for the visited states. In particular, when one sub-policy visits a particular state frequently this decreases the value predicted for other sub-policies for going to that state. Further, we introduce an artificial chemistry inspired platform where it is easy to create tasks with multiple rewarding strategies utilizing different resources (i.e. multiple niches). We show that agents trained this way can escape poor-but-attractive local optima to instead converge to harder-to-discover higher value strategies in both the artificial chemistry environments and in simpler illustrative environments.