{'fraction_non_alphanumeric': 0.0163727959697733, 'fraction_numerical': 0.0025188916876574307, 'mean_word_length': 5.411290322580645, '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}}
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding

This paper presents an algorithm which combines estimation distribution algorithm with a chromosome compression scheme to solve large scale noisy OneMax problem. The search space reduction resulted from chromosome compression enables the algorithm to solve a one-billion-bit problem. Arithmetic coding represents a compressed binary string with two real numbers. Using this representation, a model of highly fit individuals can be constructed. This model can be used to evolve the solution in the manner of estimation distribution algorithm. The experimental result shows that the algorithm can solve billion-bit Noisy OneMax problem in about 34 hours using a normal PC-class computer.