{'fraction_non_alphanumeric': 0.011984021304926764, 'fraction_numerical': 0.0, 'mean_word_length': 5.654867256637168, '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}}
Demixing sparse signals via convex optimization

We consider demixing a pair of sparse signals in orthonormal basis via convex optimization. Theoretically, we characterize the condition under which the solution of the convex optimization problem correctly demixes the true signal components. In specific, we introduce the local subspace coherence to characterize how a basis vector is coherent with a signal subspace, and show that the convex optimization approach succeeds if the subspaces of the true signal components avoid high local subspace coherence. Furthermore, we illustrate via examples that our condition for exact demixing is more fundamental than existing conditions. We then verify our theoretical finding through numerical experiments.