Direct Mutation and Crossover in Genetic Algorithms Applied to Reinforcement Learning Tasks
Neuroevolution has recently been shown to be quite competitive in reinforcement learning (RL) settings, and is able to alleviate some of the drawbacks of gradient-based approaches. This paper will focus on applying neuroevolution using a simple genetic algorithm (GA) to find the weights of a neural network that produce optimally behaving agents. In addition, we present two novel modifications that improve the data efficiency and speed of convergence when compared to the initial implementation. The modifications are evaluated on the FrozenLake environment provided by OpenAI gym and prove to be significantly better than the baseline approach.
Code (0)
등록된 구현이 없습니다.
Tasks
OpenAI Gymreinforcement-learningReinforcement Learning (RL)Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Perfect Edge-Transmitting Recombination of Permutations
Crossover is the process of recombining the genetic features of two parents. For many applications where crossover is applied to permutations, relevant genetic features are pairs of adjacent elements, also called edges i…
How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms
We re-investigate a fundamental question: how effective is crossover in Genetic Algorithms in combining building blocks of good solutions? Although this has been discussed controversially for decades, we are still lackin…
Evolutionary AlgorithmsGenetic optimization algorithms applied toward mission computability models
Genetic algorithms are modeled after the biological evolutionary processes that use natural selection to select the best species to survive. They are heuristics based and low cost to compute. Genetic algorithms use selec…
Benchmarking a $(μ+λ)$ Genetic Algorithm with Configurable Crossover Probability
We investigate a family of $(\mu+\lambda)$ Genetic Algorithms (GAs) which creates offspring either from mutation or by recombining two randomly chosen parents. By scaling the crossover probability, we can thus interpolat…
BenchmarkingStandard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms
Explaining to what extent the real power of genetic algorithms lies in the ability of crossover to recombine individuals into higher quality solutions is an important problem in evolutionary computation. In this paper we…
Evolutionary Algorithms