.png){kind=icon}
Return
Fully Scalable Methods for Distributed Tensor Factorization
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2016.2610420.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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, CDTF and SALS. Both methods are scalable with all aspects of data and show a trade-off between convergence speed and memory requirements. CDTF, based on coordinate descent, updates one parameter at a time, while SALS 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, 10M 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 MAPREDUCE with two widely-applicable optimization techniques: local disk caching and greedy row assignment. They speeded up our methods up to 98.2 x and also the competitors up to 5.9 x.
Keywords:
Tensor factorization
tensor completion
distributed computing
MapReduce
hadoop
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
Cited Papers
ShareSaveDC Offset Error Compensation Algorithm for PR Current Control of a Single-Phase Grid-Tied Inverter.png)
Energies
OAAI
EnergiesIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more