{'fraction_non_alphanumeric': 0.015904572564612324, 'fraction_numerical': 0.0, 'mean_word_length': 5.904109589041096, '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}}
Approximation analysis of empirical feature-based learning with truncated sparsity

A sparse algorithm, based on empirical feature selection, is investigated from the viewpoint of learning theory. It is a novel way to realize sparse empirical feature-based learning different from the regularized kernel projection machines. Représenter theorem and error analysis of this algorithm are established without sparsity assumption of regression function. An empirical study verifies our theoretical analysis.