{'fraction_non_alphanumeric': 0.014326647564469915, 'fraction_numerical': 0.0019102196752626551, 'mean_word_length': 5.591194968553459, '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}}
Correlation-aware techniques for sparse support recovery

Sparse support recovery techniques guarantee successful recovery of sparse solutions to linear underdetermined systems provided the measurement matrix satisfies certain conditions. The maximum level of sparsity that can be recovered with existing algorithms is O(M) where M denotes the size of the measurement vector. This paper shows how this can be improved to O(M2) by assuming certain prior knowledge about the correlation structure of the measurements. The theory for correlation aware framework for support recovery is developed, which involves the Khatri-Rao (KR) product of the measurement matrix. Necessary and sufficient conditions for unique recovery of the sparse support are provided for this new framework which outperforms the more traditional CS techniques in terms of required size of the measurement vector. It also gives rise to interesting questions of constructing classes of measurement matrices which can exploit the prior correlation knowledge in an effective way.1