Name
Abstract | ||
|---|---|---|
Given an input tensor, its CANDECOMP/PARAFAC decomposition (or CPD) is a low-rank representation. CPDs are of particular interest in data analysis and mining, especially when the data tensor is sparse and of higher order (dimension). This paper focuses on the central bottleneck of a CPD algorithm, which is evaluating a sequence of matricized tensor times Khatri-Rao products (MTTKRPs). To speed up the MTTKRP sequence, we propose a novel, adaptive tensor memoization algorithm, ADATM. Besides removing redundant computations within the MTTKRP sequence, which potentially reduces its overall asymptotic complexity, our technique also allows a user to make a space-time tradeoff by automatically tuning algorithmic and machine parameters using a model-driven framework. Our method improves as the tensor order grows, making its performance more scalable for higher-order data problems. We show speedups of up to 8x and 820x on real sparse data tensors with orders as high as 85 over the SPLATT package and Tensor Toolbox library respectively; and on a full CPD algorithm (CP-ALS), ADATM can be up to 8x faster than state-of-the-art method implemented in SPLATT. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/IPDPS.2017.80 | 2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS) |
Field | DocType | ISSN |
Tensor,Computer science,Parallel computing,Matrix decomposition,Algorithm,Theoretical computer science,Stress (mechanics),Memoization,Sparse matrix,Speedup,Scalability,Computation | Conference | 1530-2075 |
Citations | PageRank | References |
10 | 0.46 | 21 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiajia Li | 1 | 317 | 34.53 |
| Jee Choi | 2 | 10 | 0.46 |
| Ioakeim Perros | 3 | 62 | 5.13 |
| Jimeng Sun | 4 | 4729 | 240.91 |
| Richard Vuduc | 5 | 1343 | 100.74 |