Nonconvex Robust Low-Rank Tensor Reconstruction via an Empirical Bayes Method

Low-rank tensor reconstruction has attracted a great deal of research interest in signal processing, image processing and machine learning. To deal with outliers that are now ubiquitous in many modern applications, a representative approach is to decompose and reconstruct the data into a low-rank component and a sparse outlier component. As surrogate functions of the matrix rank and the sparsity that are non-convex and discontinuous, the nuclear norm and the $\ell _1$ norm are often exploited for recovering higher order tensors and removing outliers, respectively. However, the nuclear norm and the $\ell _1$ norm are loose approximations of the matrix rank and the sparsity, respectively. Furthermore, the tensor nuclear norm is not guaranteed to be the tightest convex envelope of a multilinear rank. In this paper, we develop a new method for robust tensor reconstruction. By capitalizing on the empirical Bayes method, whose performance has been shown to act as state-of-the-art to the performance of standard sparse and low-rank matrix recovery, we formulate the objective function of the empirical Bayes method for robust tensor reconstruction, and then adjust the objective function to facilitate algorithm derivation, while keeping desirable attributes including concavity and symmetry of the objective function of the empirical Bayes method. We demonstrate the superior performance of the proposed algorithm in comparison with state-of-the-art alternatives by conducting experiments on both synthetic data and real data.

[1]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[2]  Liqing Zhang,et al.  Bayesian Robust Tensor Factorization for Incomplete Multiway Data , 2014, IEEE Transactions on Neural Networks and Learning Systems.

[3]  Ming Yuan,et al.  On Tensor Completion via Nuclear Norm Minimization , 2014, Foundations of Computational Mathematics.

[4]  Xi Chen,et al.  Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization , 2010, SDM.

[5]  Donald Goldfarb,et al.  Robust Low-Rank Tensor Recovery: Models and Algorithms , 2013, SIAM J. Matrix Anal. Appl..

[6]  Wei Liu,et al.  Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[7]  Qi Xie,et al.  Kronecker-Basis-Representation Based Tensor Sparsity and Its Applications to Tensor Recovery , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Reinhold Schneider,et al.  Low rank tensor recovery via iterative hard thresholding , 2016, ArXiv.

[9]  Peter D. Hoff,et al.  Equivariant minimax dominators of the MLE in the array normal model , 2015, J. Multivar. Anal..

[10]  Wen Gao,et al.  Exploring Algorithmic Limits of Matrix Rank Minimization Under Affine Constraints , 2014, IEEE Transactions on Signal Processing.

[11]  Peter D. Hoff,et al.  Separable covariance arrays via the Tucker product, with applications to multivariate relational data , 2010, 1008.2169.

[12]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[13]  Shuicheng Yan,et al.  Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm , 2015, IEEE Transactions on Image Processing.

[14]  Dietrich von Rosen,et al.  The multilinear normal distribution: Introduction and some basic properties , 2013, J. Multivar. Anal..

[15]  Wei Chen,et al.  Low-Rank Tensor Completion: A Pseudo-Bayesian Learning Approach , 2017, 2017 IEEE International Conference on Computer Vision (ICCV).

[16]  Liqing Zhang,et al.  Bayesian Sparse Tucker Models for Dimension Reduction and Tensor Completion , 2015, ArXiv.

[17]  Wei Liu,et al.  Tensor Robust Principal Component Analysis with a New Tensor Nuclear Norm , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Emmanuel J. Candès,et al.  Matrix Completion With Noise , 2009, Proceedings of the IEEE.

[19]  Zenglin Xu,et al.  Bayesian Nonparametric Models for Multiway Data Analysis , 2015, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Liqing Zhang,et al.  Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Shmuel Friedland,et al.  Nuclear norm of higher-order tensors , 2014, Math. Comput..

[22]  Hiroyuki Kasai,et al.  Low-rank tensor completion: a Riemannian manifold preconditioning approach , 2016, ICML.

[23]  Andrzej Cichocki,et al.  Stable, Robust, and Super Fast Reconstruction of Tensors Using Multi-Way Projections , 2014, IEEE Transactions on Signal Processing.

[24]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[25]  Shuicheng Yan,et al.  Generalized Singular Value Thresholding , 2014, AAAI.

[26]  Andrzej Cichocki,et al.  Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements , 2015, IEEE Transactions on Image Processing.

[27]  Tae-Hyun Oh,et al.  A Pseudo-Bayesian Algorithm for Robust PCA , 2016, NIPS.

[28]  Qi Tian,et al.  Statistical modeling of complex backgrounds for foreground object detection , 2004, IEEE Transactions on Image Processing.

[29]  Mei Han An,et al.  accuracy and stability of numerical algorithms , 1991 .

[30]  Christopher J. Hillar,et al.  Most Tensor Problems Are NP-Hard , 2009, JACM.

[31]  Maryam Fazel,et al.  Iterative reweighted algorithms for matrix rank minimization , 2012, J. Mach. Learn. Res..

[32]  Shuicheng Yan,et al.  Exact Low Tubal Rank Tensor Recovery from Gaussian Measurements , 2018, IJCAI.

[33]  Nikos D. Sidiropoulos,et al.  A Factor Analysis Framework for Power Spectra Separation and Multiple Emitter Localization , 2015, IEEE Transactions on Signal Processing.

[34]  Prateek Jain,et al.  Provable Tensor Factorization with Missing Data , 2014, NIPS.

[35]  Joos Vandewalle,et al.  A Multilinear Singular Value Decomposition , 2000, SIAM J. Matrix Anal. Appl..

[36]  M. Kilmer,et al.  Factorization strategies for third-order tensors , 2011 .

[37]  Ryota Tomioka,et al.  Estimation of low-rank tensors via convex optimization , 2010, 1010.0789.

[38]  Shuicheng Yan,et al.  Generalized Nonconvex Nonsmooth Low-Rank Minimization , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[39]  H. Rauhut,et al.  Recovery of third order tensors via convex optimization , 2015, 2015 International Conference on Sampling Theory and Applications (SampTA).

[40]  Jieping Ye,et al.  Tensor Completion for Estimating Missing Values in Visual Data , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[41]  Shuicheng Yan,et al.  Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization , 2014, IEEE Transactions on Image Processing.

[42]  Wotao Yin,et al.  Parallel matrix factorization for low-rank tensor completion , 2013, ArXiv.

[43]  Terence Sim,et al.  The CMU Pose, Illumination, and Expression Database , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[44]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..