Tensor train completion: local recovery guarantees via Riemannian optimization
Numerical Analysis
2025-04-09 v3 Machine Learning
Numerical Analysis
Abstract
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 auxiliary subspace information and obtain the corresponding local convergence guarantees.
Cite
@article{arxiv.2110.03975,
title = {Tensor train completion: local recovery guarantees via Riemannian optimization},
author = {Stanislav Budzinskiy and Nikolai Zamarashkin},
journal= {arXiv preprint arXiv:2110.03975},
year = {2025}
}
Comments
1 figure added; Accepted version