A preconditioned Riemannian gradient descent method that weights gradient entries by row norms of the TT-unfolded gradient achieves linear convergence for low tensor-train rank completion and is reported to be orders of magnitude faster than standard RGD.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
A preconditioned Riemannian gradient descent method that weights gradient entries by row norms of the TT-unfolded gradient achieves linear convergence for low tensor-train rank completion and is reported to be orders of magnitude faster than standard RGD.