Parallel algorithms for large scale constrained tensor decomposition
(EN)
Σιδηροπουλος Νικολαος
(EL)
Λιαβας Αθανασιος
(EL)
Sidiropoulos Nikos
(EN)
Liavas Athanasios
(EN)
Πολυτεχνείο Κρήτης
(EL)
Technical University of Crete
(EN)
Most tensor decomposition algorithms were developed for in-memory computation on a single machine. There are a few recent exceptions that were designed for parallel and distributed computation, but these cannot easily incorporate practically important constraints, such as nonnegativity. A new constrained tensor factorization framework is proposed in this paper, building upon the Alternating Direction method of Multipliers (ADMoM). It is shown that this simplifies computations, bypassing the need to solve constrained optimization problems in each iteration, yielding algorithms that are naturally amenable to parallel implementation. The methodology is exemplified using nonnegativity as a baseline constraint, but the proposed framework can incorporate many other types of constraints. Numerical experiments are encouraging, indicating that ADMoM-based nonnegative tensor factorization (NTF) has high potential as an alternative to state-of-the-art approaches.
(EN)
