{'fraction_non_alphanumeric': 0.019318181818181818, 'fraction_numerical': 0.0, 'mean_word_length': 5.62406015037594, '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}}
Distributed Tensor Completion Over Networks

The aim of this paper is to propose a novel distributed strategy for tensor completion, where (partial) data are collected over a network of agents with sparse, but connected, topology. The method hinges on the canonical polyadic decomposition, also known as PARAFAC, to complete the low-rank tensor in a distributed fashion. To deal with the nonconvex and distributed nature of the learning problem, we exploit a convexification/decomposition technique based on successive convex approximations, while using dynamic consensus to diffuse information over the network and force asymptotic agreement among the agents. Asymptotic convergence to stationary solutions of the centralized problem is established under mild conditions. Finally, numerical results assess the performance of the proposed method over both synthetic and real data.