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.

added 1 citation

References in corpus (4)

• 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
• Tuning Free Rank-Sparse Bayesian Matrix and Tensor Completion with Global-Local Priors