Log In Sign Up

Robust Low-tubal-rank Tensor Completion based on Tensor Factorization and Maximum Correntopy Criterion

by   Yicong He, et al.

The goal of tensor completion is to recover a tensor from a subset of its entries, often by exploiting its low-rank property. Among several useful definitions of tensor rank, the low-tubal-rank was shown to give a valuable characterization of the inherent low-rank structure of a tensor. While some low-tubal-rank tensor completion algorithms with favorable performance have been recently proposed, these algorithms utilize second-order statistics to measure the error residual, which may not work well when the observed entries contain large outliers. In this paper, we propose a new objective function for low-tubal-rank tensor completion, which uses correntropy as the error measure to mitigate the effect of the outliers. To efficiently optimize the proposed objective, we leverage a half-quadratic minimization technique whereby the optimization is transformed to a weighted low-tubal-rank tensor factorization problem. Subsequently, we propose two simple and efficient algorithms to obtain the solution and provide their convergence and complexity analysis. Numerical results using both synthetic and real data demonstrate the robust and superior performance of the proposed algorithms.


page 10

page 12


Robust M-estimation-based Tensor Ring Completion: a Half-quadratic Minimization Approach

Tensor completion is the problem of estimating the missing values of hig...

Robust Manifold Nonnegative Tucker Factorization for Tensor Data Representation

Nonnegative Tucker Factorization (NTF) minimizes the euclidean distance ...

Variational Bayesian Inference for Robust Streaming Tensor Factorization and Completion

Streaming tensor factorization is a powerful tool for processing high-vo...

New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition

We propose new Riemannian preconditioned algorithms for low-rank tensor ...

Robust Matrix Completion via Maximum Correntropy Criterion and Half Quadratic Optimization

Robust matrix completion aims to recover a low-rank matrix from a subset...

Rank-one Boolean tensor factorization and the multilinear polytope

We consider the NP-hard problem of approximating a tensor with binary en...

Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms

Polynomial networks and factorization machines are two recently-proposed...

Code Repositories