{'fraction_non_alphanumeric': 0.019834710743801654, 'fraction_numerical': 0.0, 'mean_word_length': 5.9655172413793105, '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}}
An optimization algorithm for imprecise multi-objective problem functions

Real world objective functions often produce two types of uncertain output: noise and imprecision. While there is a distinct difference between both types, most optimization algorithms treat them the same. This paper introduces an alternative way to handle imprecise, interval-valued objective functions, namely imprecision-propagating MOEAs. Hypervolume metrics and imprecision measures are extended to imprecise Pareto sets. The performance of the new approach is experimentally compared to a standard distribution-assuming MOEA