Name
Title | ||
|---|---|---|
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree |
Abstract | ||
|---|---|---|
The widely used alternating least squares (ALS) algorithm for the canonical polyadic (CP) tensor decomposition is dominated in cost by the matricized-tensor times Khatri-Rao product (MTTKRP) kernel. This kernel is necessary to set up the quadratic optimization subproblems. State-of-the-art parallel ALS implementations use dimension trees to avoid redundant computations across MTTKRPs within each A... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/IPDPS49936.2021.00049 | 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS) |
Keywords | DocType | ISSN |
Tensors,Program processors,Perturbation methods,Approximation algorithms,Supercomputers,Computational efficiency,Parallel algorithms | Conference | 1530-2075 |
ISBN | Citations | PageRank |
978-1-6654-4066-0 | 1 | 0.35 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Linjian Ma | 1 | 2 | 1.71 |
| Edgar Solomonik | 2 | 270 | 17.94 |