arrow
Return

Input-Aware Sparse Tensor Storage Format Selection for Optimizing MTTKRP

delete2021-01-01
delete5
PRE
AI
Q
Qingxiao Sun
Y
Yi Liu
H
Hailong Yang *
M
Ming Dun
Z
Zhongzhi Luan
L
Lin Gan
G
Guangwen Yang
D
Depei Qian
DOI:10.1109/TC.2021.3113028delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Canonical polyadic decomposition (CPD) is one of the most common tensor computations adopted in many scientific applications. The major bottleneck of CPD is matricized tensor times Khatri-Rao product (MTTKRP). To optimize the performance of MTTKRP, various sparse tensor formats have been proposed such as CSF and HiCOO. However, due to the spatial complexity of the tensors, no single format fits all tensors. To address this problem, we propose SpTFS, a framework that automatically predicts the optimal storage format for an input sparse tensor. Specifically, SpTFS leverages a set of sampling methods to lower the sparse tensor to fixed-sized matrices and sparsity features. In addition, SpTFS adopts both supervised learning based and unsupervised learning based methods to predict the optimal sparse tensor storage formats. For supervised learning, we propose TnsNet that combines convolution neural network (CNN) and the feature layer, which effectively captures the sparsity patterns of the input tensors. Once trained, the TnsNet can be used with either density or histogram representation of the input tensor for optimal format prediction. Whereas for unsupervised learning, we propose TnsClustering that consists of a feature encoder using convolutional layers and fully connected layers, and a K-means++ model to cluster sparse tensors for optimal tensor format prediction, without massively profiling on the hardware platform. SpTFS can use the above two models to predict the optimal tensor storage format for accelerating MTTKRP accurately. The experimental results show that both TnsNet and TnsClustering can achieve higher prediction accuracy and performance speedup compared to the state-of-the-art works.
Keywords:
Tensors
Sparse matrices
Hardware
Convolutional neural networks
Matrix decomposition
Unsupervised learning
Task analysis
Tensor computation
MTTKRP
sparse tensor storage format
convolutional neural network
convolutional autoencoder
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Computers cover
IEEE Transactions on Computers
IF:
3.8
Papers:
5.4K
Citations:
9.8K

Organization

B
Beihang University
Scholars:
5.2W
Papers: 4.1W
Citations: 37
T
tsinghua university
Scholars:
11.9W
Papers: 10.0W
Citations: 137
Cited Papers

Cited Papers

Quantitative MRI texture analysis in chronic active multiple sclerosis lesions
err2021-06-01
err0
PREAI
errClaudia E. Weber; Matthias Wittayer; Matthias Kraemer; Andreas Dabringhaus; Michael Platten; Achim Gass; Philipp Eisele
errShare
errSave
Prefrontal cortical-specific differences in behavior and synaptic plasticity between adolescent and adult mice
err2018-03-01
err0
errOAAI
errXanthippi Konstantoudaki; Kleanthi Chalkiadaki; Elisabeth Vasileiou; Katerina Kalemaki; Domna Karagogeos; Kyriaki Sidiropoulou
errShare
errSave
Enacting musical emotions. sense-making, dynamic systems, and the embodied mind
err2016-07-22
err0
PREAI
errAndrea Schiavio; Dylan van der Schyff; Julian Cespedes-Guevara; Mark Reybrouck
errShare
errSave
errShare
errSave
Tensor Decompositions and Applications
err2009-08-05
err7.5K
PREAI
errKolda, Tamara G.; Bader, Brett W.
errShare
errSave
Co‐evolution of cerebral and cerebellar expansion in cetaceans
err2019-09-26
err0
errOAAI
errAmandine Sophie Muller; Stephen Hugh Montgomery
errShare
errSave
researcher View more