Variational Bayesian inference for CP tensor completion with side information

Abstract

We propose a message passing algorithm, based on variational Bayesian inference, for low-rank tensor completion with automatic rank determination in the canonical polyadic format when additional side information (SI) is given. The SI comes in the form of low-dimensional subspaces the contain the fiber spans of the tensor (columns, rows, tubes, etc.). We validate the regularization properties induced by SI with extensive numerical experiments on synthetic and real-world data and present the results about tensor recovery and rank determination. The results show that the number of samples required for successful completion is significantly reduced in the presence of SI. We also discuss the origin of a bump in the phase transition curves that exists when the dimensionality of SI is comparable with that of the tensor.

arXiv commentadded 1 citation

References in corpus (18)

• Tensor Decomposition for Signal Processing and Machine Learning
• Tensor Decompositions for Signal Processing Applications From Two-way to Multiway Component Analysis
• Scalable Tensor Factorizations for Incomplete Data
• Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
• Efficient tensor completion for color image and video recovery: Low-rank tensor train
• Smooth PARAFAC Decomposition for Tensor Completion
• Bayesian Robust Tensor Factorization for Incomplete Multiway Data
• All-at-once Optimization for Coupled Matrix and Tensor Factorizations
• Provable Inductive Matrix Completion
• Rank regularization and Bayesian inference for tensor completion and extrapolation
• Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models
• Bayesian Sparse Tucker Models for Dimension Reduction and Tensor Completion
• Coupled Graphs and Tensor Factorization for Recommender Systems and Community Detection
• Bayesian matrix completion: prior specification
• Tensor train completion: local recovery guarantees via Riemannian optimization
• Note: low-rank tensor train completion with side information based on Riemannian optimization
• Alternating minimization algorithms for graph regularized tensor completion
• Tuning Free Rank-Sparse Bayesian Matrix and Tensor Completion with Global-Local Priors