{'fraction_non_alphanumeric': 0.032101167315175094, 'fraction_numerical': 0.0038910505836575876, 'mean_word_length': 5.198795180722891, '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}}
JADE: Self-adaptive differential evolution with fast and reliable convergence performance

A new differential evolution algorithm, JADE, is proposed to improve the rate and the reliability of convergence performance by implementing a new mutation strategy 'DE/current-to-p-best' and controlling the parameters in a self-adaptive manner. The 'DE/current-to-p-best' is a generalization of 'DE/current-to-best'. It diversifies the population but still inherits the fast convergence property. Self-adaptation is beneficial for performance improvement. Also, it avoids the requirement of prior knowledge about parameter settings and thus works well without user interaction. Compared to other self-adaptive DE algorithms, JADE converges faster and reliably in at least 10 out of a set of 13 benchmark problems and shows competitive results in other cases as well. Simulations results also clearly show that there is no single parameter value suitable for various problems or even at different optimization stages of a single problem.