REVIEW 1 cited by
A Single-Mode Quasi Riemannian Gradient Descent Algorithm for Low-Rank Tensor Recovery
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper focuses on recovering a low-rank tensor from its incomplete measurements. We propose a novel algorithm termed the Single Mode Quasi Riemannian Gradient Descent (SM-QRGD). By exploiting the benefits of both fixed-rank matrix tangent space projection in Riemannian gradient descent and sequentially truncated high-order singular value decomposition (ST-HOSVD), SM-QRGD achieves a much faster convergence speed than existing state-of-the-art algorithms. Theoretically, we establish the convergence of SM-QRGD through the Tensor Restricted Isometry Property (TRIP) and the geometry of the fixed-rank matrix manifold. Numerically, extensive experiments are conducted, affirming the accuracy and efficacy of the proposed algorithm.
Forward citations
Cited by 1 Pith paper
-
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 ...
Discussion (0). Continue with ORCID to comment.