Generalized Canonical Polyadic Tensor Decomposition

Abstract

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 statistically-motivated loss functions for various scenarios. We provide a generalized framework for computing gradients and handling missing data that enables the use of standard optimization methods for fitting the model. We demonstrate the flexibility of GCP on several real-world examples including interactions in a social network, neural activity in a mouse, and monthly rainfall measurements in India.

References in corpus (1)

• Shared Memory Parallelization of MTTKRP for Dense Tensors

Cited by in corpus (27)

• Spatiotemporal Tensor Completion for Improved Urban Traffic Imputation
• Stochastic Gradients for Large-Scale Tensor Decomposition
• A Flexible Optimization Framework for Regularized Matrix-Tensor Factorizations with Linear Couplings
• Stochastic Mirror Descent for Low-Rank Tensor Decomposition Under Non-Euclidean Losses
• Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints
• Learning from Binary Multiway Data: Probabilistic Tensor Decomposition and its Statistical Optimality
• Learning Inter-Modal Correspondence and Phenotypes from Multi-Modal Electronic Health Records
• A generalizable framework for low-rank tensor completion with numerical priors
• Supervised tensor decomposition with features on multiple modes
• Personalized Coupled Tensor Decomposition for Multimodal Data Fusion: Uniqueness and Algorithms
• On Koopman Mode Decomposition and Tensor Component Analysis
• Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data
• Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition
• MTC: Multiresolution Tensor Completion from Partial and Coarse Observations
• Tensor denoising and completion based on ordinal observations
• Using Wavelets and Spectral Methods to Study Patterns in Image-Classification Datasets
• SWoTTeD: An Extension of Tensor Decomposition to Temporal Phenotyping
• Beyond the Signs: Nonparametric Tensor Completion via Sign Series
• Zero-Truncated Poisson Regression for Sparse Multiway Count Data Corrupted by False Zeros
• A Newton-Type Active Set Method for Nonlinear Optimization with Polyhedral Constraints
• TenIPS: Inverse Propensity Sampling for Tensor Completion
• Baseline Estimation of Commercial Building HVAC Fan Power Using Tensor Completion
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
• Communication Efficient Generalized Tensor Factorization for Decentralized Healthcare Networks
• Data-Driven Model Reduction for Multilinear Control Systems via Tensor Trains
• Sparse Logistic Tensor Decomposition for Binary Data
• Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization