Name
Abstract | ||
|---|---|---|
For applications that deal with large amounts of high dimensional multi-aspect data, it is natural to represent such data as tensors or multi-way arrays. Tensor computations, such as tensor decompositions, are increasingly being used to extract and explain properties of such data. An important class of tensors is the symmetric tensor, which shows up in real-world applications such as signal processing, biomedical engineering, and data analysis. In this work, we describe novel optimizations that exploit the symmetry in tensors in order to reduce redundancy in computations and storage and effectively parallelize operations involving symmetric tensors. Specifically, we apply our optimizations on the matricized tensor times Khatri Rao product (mttkrp) operation, a key operation in tensor decomposition algorithms such as INDSCAL (individual differences in scaling) for symmetric tensors. We demonstrate improved performance for both sequential and parallel execution using our techniques on various synthetic and real data sets. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/HPEC.2015.7322458 | 2015 IEEE High Performance Extreme Computing Conference (HPEC) |
Keywords | Field | DocType |
optimization,symmetric tensor computation,data analysis,data representation,matricized tensor times Khatri Rao product,MTTKRP operation,tensor decomposition algorithm | Tensor product network,Tensor product,Discrete mathematics,Invariants of tensors,Tensor,Tensor (intrinsic definition),Algorithm,Cartesian tensor,Symmetric tensor,Tensor contraction,Mathematics | Conference |
ISSN | Citations | PageRank |
2377-6943 | 3 | 0.45 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathon Cai | 1 | 3 | 0.45 |
| Muthu Manikandan Baskaran | 2 | 493 | 33.10 |
| Benoît Meister | 3 | 138 | 12.84 |
| Richard Lethin | 4 | 118 | 17.17 |