2 papers
cs.NE2019
A Reinforcement Learning Perspective on the Optimal Control of Mutation Probabilities for the (1+1) Evolutionary Algorithm: First Results on the OneMax Problem
Luca Mossina, Emmanuel Rachelson, Daniel Delahaye
We study how Reinforcement Learning can be employed to optimally control parameters in evolutionary algorithms. We control the mutation probability of a (1+1) evolutionary algorith…
cs.LG2017
Naive Bayes Classification for Subset Selection
Luca Mossina, Emmanuel Rachelson
This article focuses on the question of learning how to automatically select a subset of items among a bigger set. We introduce a methodology for the inference of ensembles of disc…