stat.MLOct 1, 2025

Guaranteed Noisy CP Tensor Recovery via Riemannian Optimization on the Segre Manifold

Authors: Ke Xu, Yuefeng Han

Organizations: Department of Applied and Computational Mathematics and Statistics, University of Notre Dame

Abstract

Recovering a low-CP-rank tensor from noisy linear measurements is a central challenge in high-dimensional data analysis, with applications spanning tensor PCA, scalar-on-tensor regression, tensor-on-tensor regression, and beyond. We exploit the intrinsic geometry of rank-one tensors by casting the recovery task as an optimization problem over the Segre manifold, the smooth Riemannian manifold of rank-one tensors. This geometric viewpoint yields two powerful algorithms: Riemannian Gradient Descent (RGD) and Riemannian Gauss-Newton (RGN), each of which preserves feasibility at every iteration. Under mild noise assumptions, we prove that RGD converges at a local linear rate, while RGN exhibits an initial local quadratic phase followed by linear refinement to the statistical error. Extensive synthetic experiments validate these convergence guarantees and demonstrate the practical effectiveness of our methods.

Figures & tables

Appendix figures & tables17 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Guaranteed Low-Rank Tensor Recovery from Modewise Measurements via Normalized Block-Weighted Riemannian Gradient Descent

    Sep 21, 2026Yushi Zhou, Feng ZhangRiemannian OptimizationTensor Decomposition

  2. The power of small initialization in noisy low-tubal-rank tensor recovery

    Mar 3, 2026ZHiyu Liu, Haobo Geng, Xudong Wang +3OverparameterizationGradient Descent

  3. Strict-Saddle Landscapes and Multi-Rank Geometry in Low-Tubal-Rank Tensor Sensing

    Sep 29, 2026Eugene Agyei-Kodie, Longxiu Huang, Shuang Li +1Nonconvex OptimizationOptimization Convergence Analysis