{'fraction_non_alphanumeric': 0.010452961672473868, 'fraction_numerical': 0.0, 'mean_word_length': 5.927710843373494, '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}}
GPU-accelerated parallel optimization for sparse regularization

We prove the concept that the block successive convex approximation algorithm can be configured in a flexible manner to adjust for implementations on modern parallel hardware architecture. A shuffle order update scheme and an all-close termination criterion are considered for efficient performance and convergence comparisons. Four different implementations are studied and compared. Simulation results on hardware show the condition of using shuffle order and selection of block numbers and implementations.