Note: low-rank tensor train completion with side information based on Riemannian optimization

06/23/2020
by   Stanislav Budzinskiy, et al.
0

We consider the low-rank tensor train completion problem when additional side information is available in the form of subspaces that contain the mode-k fiber spans. We propose an algorithm based on Riemannian optimization to solve the problem. Numerical experiments show that the proposed algorithm requires far fewer known entries to recover the tensor compared to standard tensor train completion methods.

READ FULL TEXT

page 5

page 6

research
05/13/2023

Nonnegative Low-Rank Tensor Completion via Dual Formulation with Applications to Image and Video Completion

Recent approaches to the tensor completion problem have often overlooked...
research
06/24/2022

Variational Bayesian inference for CP tensor completion with side information

We propose a message passing algorithm, based on variational Bayesian in...
research
10/08/2021

Tensor train completion: local recovery guarantees via Riemannian optimization

In this work we estimate the number of randomly selected elements of a t...
research
08/02/2021

Tensor completion using geodesics on Segre manifolds

We propose a Riemannian conjugate gradient (CG) optimization method for ...
research
12/11/2019

Tensor Completion via Gaussian Process Based Initialization

In this paper, we consider the tensor completion problem representing th...
research
11/12/2016

Riemannian Tensor Completion with Side Information

By restricting the iterate on a nonlinear manifold, the recently propose...
research
04/17/2018

Fast and Accurate Tensor Completion with Total Variation Regularized Tensor Trains

We propose a new tensor completion method based on tensor trains. The to...

Please sign up or login with your details

Forgot password? Click here to reset