Tensor train completion: local recovery guarantees via Riemannian optimization

10/08/2021
by   Stanislav Budzinskiy, et al.
0

In this work we estimate the number of randomly selected elements of a tensor that with high probability guarantees local convergence of Riemannian gradient descent for tensor train completion. We derive a new bound for the orthogonal projections onto the tangent spaces based on the harmonic mean of the unfoldings' singular values and introduce a notion of core coherence for tensor trains. We also extend the results to tensor train completion with side information and obtain the corresponding local convergence guarantees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2020

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

We consider the low-rank tensor train completion problem when additional...
research
03/08/2022

TTML: tensor trains for general supervised machine learning

This work proposes a novel general-purpose estimator for supervised mach...
research
01/26/2021

New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition

We propose new Riemannian preconditioned algorithms for low-rank tensor ...
research
08/27/2021

Provable Tensor-Train Format Tensor Completion by Riemannian Optimization

The tensor train (TT) format enjoys appealing advantages in handling str...
research
11/12/2016

Riemannian Tensor Completion with Side Information

By restricting the iterate on a nonlinear manifold, the recently propose...
research
06/19/2023

To Fold or Not to Fold: Graph Regularized Tensor Train for Visual Data Completion

Tensor train (TT) representation has achieved tremendous success in visu...
research
04/17/2018

Fast and Accurate Tensor Completion with Tensor Trains: A System Identification Approach

We propose a novel tensor completion approach by equating it to a system...

Please sign up or login with your details

Forgot password? Click here to reset