A generalizable framework for low-rank tensor completion with numerical priors
arXiv:2302.05881 · doi:10.1016/j.patcog.2024.110678
Abstract
Low-Rank Tensor Completion, a method which exploits the inherent structure of tensors, has been studied extensively as an effective approach to tensor completion. Whilst such methods attained great success, none have systematically considered exploiting the numerical priors of tensor elements. Ignoring numerical priors causes loss of important information regarding the data, and therefore prevents the algorithms from reaching optimal accuracy. Despite the existence of some individual works which consider ad hoc numerical priors for specific tasks, no generalizable frameworks for incorporating numerical priors have appeared. We present the Generalized CP Decomposition Tensor Completion (GCDTC) framework, the first generalizable framework for low-rank tensor completion that takes numerical priors of the data into account. We test GCDTC by further proposing the Smooth Poisson Tensor Completion (SPTC) algorithm, an instantiation of the GCDTC framework, whose performance exceeds current state-of-the-arts by considerable margins in the task of non-negative tensor completion, exemplifying GCDTC's effectiveness. Our code is open-source.
arXiv commentAccepted to Pattern Recognition
References in corpus (11)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Scalable Tensor Factorizations for Incomplete Data
- Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
- Smooth PARAFAC Decomposition for Tensor Completion
- On Tensors, Sparsity, and Nonnegative Factorizations
- A Nonconvex Low-Rank Tensor Completion Model for Spatiotemporal Traffic Data Imputation
- Generalized Canonical Polyadic Tensor Decomposition
- Newton-Based Optimization for Kullback-Leibler Nonnegative Tensor Factorizations
- Logistic Tensor Factorization for Multi-Relational Data
- Tensor Completion with Provable Consistency and Fairness Guarantees for Recommender Systems
- Noisy Tensor Completion via Low-rank Tensor Ring