Multi-relational Learning Using Weighted Tensor Decomposition with Modular Loss
We propose a modular framework for multi-relational learning via tensor decomposition. In our learning setting, the training data contains multiple types of relationships among a set of objects, which we represent by a sparse three-mode tensor. The goal is to predict the values of the missing entries. To do so, we model each relationship as a function of a linear combination of latent factors. We learn this latent representation by computing a low-rank tensor decomposition, using quasi-Newton optimization of a weighted objective function. Sparsity in the observed data is captured by the weighted objective, leading to improved accuracy when training data is limited. Exploiting sparsity also improves efficiency, potentially up to an order of magnitude over unweighted approaches. In addition, our framework accommodates arbitrary combinations of smooth, task-specific loss functions, making it better suited for learning different types of relations. For the typical cases of real-valued functions and binary relations, we propose several loss functions and derive the associated parameter gradients. We evaluate our method on synthetic and real data, showing significant improvements in both accuracy and scalability over related factorization techniques.
Code (0)
등록된 구현이 없습니다.
Tasks
Relational ReasoningTensor DecompositionSimilar Papers 제목 키워드 기반
Generalizing 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 DecompositionTensor 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 DecompositionAutomated 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 computat…
Reweighted Low-Rank Tensor Decomposition based on t-SVD and its Applications in Video Denoising
The t-SVD based Tensor Robust Principal Component Analysis (TRPCA) decomposes low rank multi-linear signal corrupted by gross errors into low multi-rank and sparse component by simultaneously minimizing tensor nuclear no…
DenoisingTensor DecompositionVideo Denoising