Alternating minimization algorithms for graph regularized tensor completion

by   Yu Guan, et al.

We consider a low-rank tensor completion (LRTC) problem which aims to recover a tensor from incomplete observations. LRTC plays an important role in many applications such as signal processing, computer vision, machine learning, and neuroscience. A widely used approach is to combine the tensor completion data fitting term with a regularizer based on a convex relaxation of the multilinear ranks of the tensor. For the data fitting function, we model the tensor variable by using the Canonical Polyadic (CP) decomposition and for the low-rank promoting regularization function, we consider a graph Laplacian-based function which exploits correlations between the rows of the matrix unfoldings. For solving our LRTC model, we propose an efficient alternating minimization algorithm. Furthermore, based on the Kurdyka-Łojasiewicz property, we show that the sequence generated by the proposed algorithm globally converges to a critical point of the objective function. Besides, an alternating direction method of multipliers algorithm is also developed for the LRTC model. Extensive numerical experiments on synthetic and real data indicate that the proposed algorithms are effective and efficient.


page 1

page 2

page 3

page 4


Low rank tensor completion with sparse regularization in a transformed domain

Tensor completion is a challenging problem with various applications. Ma...

A New Convex Relaxation for Tensor Completion

We study the problem of learning a tensor from a set of linear measureme...

Directional Regularized Tensor Modeling for Video Rain Streaks Removal

Outdoor videos sometimes contain unexpected rain streaks due to the rain...

Adaptive Tensor Learning with Tensor Networks

Tensor decomposition techniques have shown great successes in machine le...

Convex Factorization Machine for Regression

We propose the convex factorization machine (CFM), which is a convex var...

Tensor Recovery Based on A Novel Non-convex Function Minimax Logarithmic Concave Penalty Function

Non-convex relaxation methods have been widely used in tensor recovery p...

A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization

We propose a general algorithmic framework for constrained matrix and te...

Please sign up or login with your details

Forgot password? Click here to reset