Automated Tensor-Relational Decomposition for Large-Scale Sparse Tensor Computation
A \emph{tensor-relational} computation is a relational computation where individual tuples carry vectors, matrices, or higher-dimensional arrays. An advantage of tensor-relational computation is that the overall computation can be executed on top of a relational system, inheriting the system's ability to automatically handle very large inputs with high levels of sparsity while high-performance kernels (such as optimized matrix-matrix multiplication codes) can be used to perform most of the underlying mathematical operations. In this paper, we introduce upper-case-lower-case \texttt{EinSum}, which is a tensor-relational version of the classical Einstein Summation Notation. We study how to automatically rewrite a computation in Einstein Notation into upper-case-lower-case \texttt{EinSum} so that computationally intensive components are executed using efficient numerical kernels, while sparsity is managed relationally.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Tensor Decomposition with Relational Constraints for Predicting Multiple Types of MicroRNA-disease Associations
MicroRNAs (miRNAs) play crucial roles in multifarious biological processes associated with human diseases. Identifying potential miRNA-disease associations contributes to understanding the molecular mechanisms of miRNA-r…
Knowledge GraphsLink PredictionTensor DecompositionGeneralizing Tensor Decomposition for N-ary Relational Knowledge Bases
With the rapid development of knowledge bases (KBs), link prediction task, which completes KBs with missing facts, has been broadly studied in especially binary relational KBs (a.k.a knowledge graph) with powerful tensor…
Link PredictionTensor DecompositionSearching to Sparsify Tensor Decomposition for N-ary Relational Data
Tensor, an extension of the vector and matrix to the multi-dimensional case, is a natural way to describe the N-ary relational data. Recently, tensor decomposition methods have been introduced into N-ary relational data …
Neural Architecture SearchTensor DecompositionGeometric All-Way Boolean Tensor Decomposition
Boolean tensor has been broadly utilized in representing high dimensional logical data collected on spatial, temporal and/or other relational domains. Boolean Tensor Decomposition (BTD) factorizes a binary tensor into th…
AllTensor DecompositionTensor Decompositions for Modeling Inverse Dynamics
Modeling inverse dynamics is crucial for accurate feedforward robot control. The model computes the necessary joint torques, to perform a desired movement. The highly non-linear inverse function of the dynamical system c…
Knowledge GraphsMulti-class ClassificationregressionRelational Reasoning+1