{'fraction_non_alphanumeric': 0.011419249592169658, 'fraction_numerical': 0.0, 'mean_word_length': 5.898876404494382, '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}}
Optimization via adaptive sampling and regenerative simulation

We investigate a new approach for simulation-based optimization that draws on two recent stochastic optimization methods: an adaptive sampling approach called the nested partitions method and ordinal optimization. An ordinal comparison perspective is used to show that the nested partitions method converges globally under weak conditions. Furthermore, we use those results to determine a lower bound for the required sampling effort in each iteration, and show that global convergence requires relatively little simulation effort in each iteration.