Fully Scalable Methods for Distributed Tensor Factorization.

Given a high-order large-scale tensor, how can we decompose it into latent factors? Can we process it on commodity computers with limited memory? These questions are closely related to recommender systems, which have modeled rating data not as a matrix but as a tensor to utilize contextual information such as time and location. This increase in the order requires tensor factorization methods scalable with both the order and size of a tensor. In this paper, we propose two distributed tensor factorization methods, <sc>CDTF</sc> and <sc>SALS</sc>. Both methods are scalable with all aspects of data and show a trade-off between convergence speed and memory requirements. <sc>CDTF</sc>, based on coordinate descent, updates one parameter at a time, while <sc>SALS</sc> generalizes on the number of parameters updated at a time. In our experiments, only our methods factorized a five-order tensor with 1 billion observable entries, 10 M mode length, and 1 K rank, while all other state-of-the-art methods failed. Moreover, our methods required several orders of magnitude less memory than their competitors. We implemented our methods on <sc>MapReduce </sc> with two widely-applicable optimization techniques: local disk caching and greedy row assignment. They speeded up our methods up to 98.2$\times$<alternatives> <inline-graphic xlink:href="shin-ieq1-2610420.gif"/></alternatives> and also the competitors up to 5.9 $\times$<alternatives> <inline-graphic xlink:href="shin-ieq2-2610420.gif"/></alternatives>. [ABSTRACT FROM AUTHOR]