{'fraction_non_alphanumeric': 0.010889292196007259, 'fraction_numerical': 0.0, 'mean_word_length': 5.4941176470588236, '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}}
A competitive Neyman-Pearson approach to universal hypothesis testing with applications

A new generalization of the Neyman-Pearson approach to the problem of composite hypothesis testing is proposed. The resulting universal test is shown to be efficient in the sense of achieving exponential decay of both types of error for all values of unknown parameters, whenever such an efficient universal test exists. The best universally achievable error exponents are identified and conditions for the existence of efficient universal tests are established.