Guaranteed Low-Rank Tensor Recovery from Modewise Measurements via Normalized Block-Weighted Riemannian Gradient Descent
Not on the map. Why?
Abstract (arXiv)
We consider the recovery of low-multilinear-rank tensors from linear measurements and propose an adaptive block-weighted modewise Riemannian gradient descent method. The method combines memory-efficient modewise measurements with a normalized adaptive weighting strategy for the core and factor components of the Riemannian gradient. The weighting improves convergence without increasing the multilinear-rank bound of the search direction or the size of the reduced core used for retraction. Under the tensor restricted isometry property and a suitable initialization, we establish local linear convergence and derive sampling guarantees for sub-Gaussian and subsampled orthogonal with random sign (SORS) measurements. Numerical experiments on synthetic low-Tucker-rank tensors show that the proposed method reduces iteration counts and computational time while maintaining reliable recovery performance, especially near the recovery threshold and for structured SORS measurements.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 41 references that are in the map. First posted on arXiv 21 Sep 2026.
Builds on
13 of 41 references.
References · 13
- 2015Exact tensor completion using t-SVDcited by 70
- 2013Square Deal: Lower Bounds and Improved Relaxations for Tensor Recoverycited by 37
- 2014On Tensor Completion via Nuclear Norm Minimizationcited by 32
- 2014Provable Tensor Factorization with Missing Datacited by 31
- 2017On Polynomial Time Methods for Exact Low Rank Tensor Completioncited by 27
- 2017Statistically Optimal and Computationally Efficient Low Rank Tensor Completion from Noisy Entriescited by 23
- 2014Riemannian preconditioningcited by 19
- 2019Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squarescited by 10
- 2021Implicit Regularization and Entrywise Convergence of Riemannian Optimization for Low Tucker-Rank Tensor Completioncited by 9
- 2023A Preconditioned Riemannian Gradient Descent Algorithm for Low-Rank Matrix Recoverycited by 7
- 2020Grassmannian Optimization for Online Tensor Completion and Tracking with the t-SVDcited by 6
- 2021Johnson-Lindenstrauss Embeddings with Kronecker Structurecited by 5
Built on by
Not cited yet.