Rank Regularization and Bayesian Inference for Tensor Completion and Extrapolation
From MaRDI portal
Abstract: A novel regularizer of the PARAFAC decomposition factors capturing the tensor's rank is proposed in this paper, as the key enabler for completion of three-way data arrays with missing entries. Set in a Bayesian framework, the tensor completion method incorporates prior information to enhance its smoothing and prediction capabilities. This probabilistic approach can naturally accommodate general models for the data distribution, lending itself to various fitting criteria that yield optimum estimates in the maximum-a-posteriori sense. In particular, two algorithms are devised for Gaussian- and Poisson-distributed data, that minimize the rank-regularized least-squares error and Kullback-Leibler divergence, respectively. The proposed technique is able to recover the "ground-truth tensor rank when tested on synthetic data, and to complete brain imaging and yeast gene expression datasets with 50% and 15% of missing entries respectively, resulting in recovery errors at -10dB and -15dB.
Cited in
(5)- Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography
- Alternating Linear Scheme in a Bayesian Framework for Low-Rank Tensor Approximation
- N-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry
- scientific article; zbMATH DE number 5269047 (Why is no real title available?)
- Variational Bayesian inference for CP tensor completion with subspace information
This page was built for publication: Rank Regularization and Bayesian Inference for Tensor Completion and Extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578816)
