Evolutionary Hyperparameter Optimization

Traditionally, hyperparameter optimization (HPO) for reinforcement learning (RL) is particularly difficult when compared to other types of machine learning. This is for several reasons, including the relative sample inefficiency of RL and its sensitivity to hyperparameters.

AgileRL is focused on improving HPO for RL in order to allow faster development with robust training. Evolutionary algorithms have been shown to allow faster, automatic convergence to optimal hyperparameters than other HPO methods by taking advantage of shared memory between a population of agents acting in identical environments.

../_images/agilerl_evohpo_vs_bayesian.png

Our evolutionary approach allows for HPO in a single training run compared to Bayesian methods that require multiple sequential training runs to achieve similar, and often inferior, results.

At regular intervals, after learning from shared experiences, a population of agents can be evaluated in an environment. Each evolution step then has two parts. First, a selection strategy reshapes the population, preserving the strongest agents and nominating which agents to perturb. Then a shared mutation step perturbs those nominated agents to further explore the hyperparameter and architecture space. AgileRL provides two interchangeable selection strategies: tournament selection (the default) and multi-frequency selection. Both hand their nominated agents to the same mutation operators. In short, a selection strategy decides which agents are perturbed, while mutation decides how.

../_images/agilerl_hpo_loop.png

The AgileRL evolutionary hyperparameter optimization loop.