{'fraction_non_alphanumeric': 0.01256281407035176, 'fraction_numerical': 0.0, 'mean_word_length': 5.532786885245901, '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}}
Applying evolutionary algorithms to problems with noisy, time-consuming fitness functions

For many "real world" applications of evolutionary computation, the fitness function is obscured by random noise. This interferes with the evaluation and selection process and adversely affects the performance of the algorithm. We present a study of noise compensation techniques designed to better counteract the negative effects of noise. We introduce algorithms that vary the number of samples used per candidate based on the amount of noise present at that point in the search space. Results show that these algorithms are significantly better than the traditional technique used by the optimisation community and that noise compensation is indeed a difficult task that warrants further investigation.