.png){kind=icon}
.png){kind=icon}
Return
Generalized Canonical Polyadic Tensor Decomposition
.png){kind=icon}
OA
AI
DOI：10.1137/18M1203626.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Tensor decomposition is a fundamental unsupervised machine learning method in data science, with applications including network analysis and sensor data processing. This work develops a generalized canonical polyadic (GCP) low-rank tensor decomposition that allows other loss functions besides squared error. For instance, we can use logistic loss or Kullback-Leibler divergence, enabling tensor decomposition for binary or count data. We present a variety of statistically motivated loss functions for various scenarios. We provide a generalized framework for computing gradients and handling missing data that enable the use of standard optimization methods for fitting the model. We demonstrate the flexibility of the GCP decomposition on several real-world examples including interactions in a social network, neural activity in a mouse, and monthly rainfall measurements in India.
Keywords:
canonical polyadic (CP) tensor decomposition
CANDECOMP
PARAFAC
Poisson tensor factorization
Bernoulli tensor factorization
missing data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.1
Papers:
888
Citations:
1.2W