{'fraction_non_alphanumeric': 0.027114967462039046, 'fraction_numerical': 0.0, 'mean_word_length': 5.36551724137931, '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}}
Weighted Krylov-Levenberg-Marquardt Method for Canonical Polyadic Tensor Decomposition

Weighted canonical polyadic (CP) tensor decomposition appears in a wide range of applications. A typical situation where the weighted decomposition is needed is when some tensor elements are unknown, and the task is to fill in the missing elements under the assumption that the tensor admits a low-rank model. The traditional methods for large-scale decomposition tasks are based on alternating least-squares methods or gradient methods. Second-order methods might have significantly better convergence, but so far they were used only on small tensors. The proposed Krylov-Levenberg-Marquardt method enables to do second-order-based iterations even in large-scale decomposition problems, with or without weights. We show in simulations that the proposed technique can outperform existing state-of-the-art algorithms in some scenarios.