{'fraction_non_alphanumeric': 0.010221465076660987, 'fraction_numerical': 0.0, 'mean_word_length': 5.25531914893617, '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}}
Agent Learning and Autoregressive Modeling

Relative entropy is used to investigate whether a sequence is memoryless or has memory and to discern the presence of any structure in the sequence. Particular emphasis is placed on obtaining expressions for finite sequence length N and autoregressive sequences with known and unknown autocorrelations. We relate our results to the terms entropy gain, information gain, and redundancy as defined in agent learning studies, and show that these terms can be bounded using the mean squared error due to linear prediction of a stationary sequence.