{'fraction_non_alphanumeric': 0.017615176151761516, 'fraction_numerical': 0.0, 'mean_word_length': 5.107438016528926, '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}}
Rate of convergence in evolutionary computation

The broad field of evolutionary computation (EC)-including genetic algorithms as a special case-has attracted much attention in the last several decades. Many bold claims have been made about the effectiveness of various EC algorithms. These claims have centered on the efficiency, robustness, and ease of implementation of EC approaches. Unfortunately, there seems to be little theory to support such claims. One key step to formally evaluating or substantiating such claims is to establish rigorous results on the rate of convergence of EC algorithms. This paper presents a computable rate of convergence for a class of ECs that includes the standard genetic algorithm as a special case.