Parallel algorithms for tensor completion in the CP format
Novel parallel algorithms for tensor completion problems, with applications to recommender systems and function learning.Parallelization strategy offers greatly reduced memory requirements compared to previously published matrix equivalents.Convergence results for both alternating least squares and cyclic coordinate descent. Low rank tensor completion addresses the task of filling in missing entries in multi dimensional data. It has proven its versatility in numerous applications, including context aware recommender systems and multivariate function learning. To handle large scale datasets and applications that feature high dimensions, the development of distributed algorithms is central. In this work, we propose novel, highly scalable algorithms based on a combination of the canonical polyadic (CP) tensor format with block coordinate descent methods. Although similar algorithms have been proposed for the matrix case, the case of higher dimensions gives rise to a number of new challenges and requires a different paradigm for data distribution. The convergence of our algorithms is analyzed and numerical experiments illustrate their performance on distributed memory architectures for tensors from a range of different applications.
Parallel Comput.