{'fraction_non_alphanumeric': 0.014380530973451327, 'fraction_numerical': 0.0, 'mean_word_length': 6.182539682539683, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Exploiting gradient information in continuous iterated density estimation evolutionary algorithms

For continuous optimization problems, evolutionary algorithms (EAs) that build and use probabilistic models have obtained promising results. However, the local gradient information of the fitness function is not used in these EAs. In the case of optimization of continuous differentiable functions, it may be less efficient to disregard this information. In this paper, we therefore hybridize pure continuous iterated density estimation evolutionary algorithms (IDEAs) by using the conjugate gradient algorithm on a selection of the solutions. We test the resulting algorithm on a few well known difficult continuous differentiable function optimization problems. The results indicate that exploiting gradient information in probabilistic model building EAs leads to more efficient continuous optimization