{'fraction_non_alphanumeric': 0.01406799531066823, 'fraction_numerical': 0.0, 'mean_word_length': 6.0578512396694215, '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}}
Noisy GA Resampling on Evolved Parameterized Policies for Stochastic Constraint Programming

Stochastic Constraint Programming is an extension of Constraint Programming for modeling and solving combinatorial problems which involve uncertainty in real world. Evolved Parameterized Policies (EPP) is the first incomplete approach to stochastic constraint problems which has higher performance rather than other methods, but still seems non-practical for large multi-stage problems due to scenarios exponentially growing. We proposed new resampling method called IDGAS based on Noisy GAs and other Evolutionary Computation algorithms, which aim to ensure the reliability while keeping in high search performance. In experiments on credit portfolio management with multi-stage, it performed more effective than conventional EPP and other resampling methods.