New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition

by   Shuyu Dong, et al.

We propose new Riemannian preconditioned algorithms for low-rank tensor completion via the polyadic decomposition of a tensor. These algorithms exploit a non-Euclidean metric on the product space of the factor matrices of the low-rank tensor in the polyadic decomposition form. This new metric is designed using an approximation of the diagonal blocks of the Hessian of the tensor completion cost function, thus has a preconditioning effect on these algorithms. We prove that the proposed Riemannian gradient descent algorithm globally converges to a stationary point of the tensor completion problem, with convergence rate estimates using the Łojasiewicz property. Numerical results on synthetic and real-world data suggest that the proposed algorithms are more efficient in memory and time compared to state-of-the-art algorithms. Moreover, the proposed algorithms display a greater tolerance for overestimated rank parameters in terms of the tensor recovery performance, thus enable a flexible choice of the rank parameter.


page 1

page 2

page 3

page 4


Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition

We propose Riemannian preconditioned algorithms for the tensor completio...

Low-rank tensor completion: a Riemannian manifold preconditioning approach

We propose a novel Riemannian manifold preconditioning approach for the ...

A Dual Framework for Low-rank Tensor Completion

We propose a novel formulation of the low-rank tensor completion problem...

Riemannian Tensor Completion with Side Information

By restricting the iterate on a nonlinear manifold, the recently propose...

Tensor train completion: local recovery guarantees via Riemannian optimization

In this work we estimate the number of randomly selected elements of a t...

A Ternary Non-Commutative Latent Factor Model for Scalable Three-Way Real Tensor Completion

Motivated by large-scale Collaborative-Filtering applications, we presen...

Optimization on product manifolds under a preconditioned metric

Since optimization on Riemannian manifolds relies on the chosen metric, ...

Please sign up or login with your details

Forgot password? Click here to reset