{'fraction_non_alphanumeric': 0.013757523645743766, 'fraction_numerical': 0.0, 'mean_word_length': 5.847058823529411, '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}}
A fast algorithm for general matrix factorization

Matrix factorization algorithms are emerging as popular tools in many applications, especially dictionary learning method for recovering biomedical image data from noisy and ill-conditioned measurements. We introduce a novel dictionary learning algorithm based on augmented Lagrangian (AL) approach to learn dictionaries from exemplar data and it can be extended to general matrix factorization problems due to different constraints. Specifically, we use the alternating minimization strategy to decouple the dictionary learning scheme into three main subproblems, which can be solved efficiently. The proposed algorithm can accommodate arbitrary priors on the dictionary, which enables us to inject prior information into the learning process. We validate the algorithm using simulated data and demonstrate its utility in the context of denoising. Comparisons with existing methods show a considerable speedup over other methods. More importantly, we observe that the proposed algorithm is able to recover the dictionaries correctly, even at high sparsity levels and is relatively insensitive to initialization.