Pith. sign in

REVIEW 1 cited by

Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence

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

arxiv 2104.12031 v4 pith:N6UPRU2U submitted 2021-04-24 stat.ML cs.LGcs.NAmath.NAmath.OCstat.ME

classification stat.MLcs.LGcs.NAmath.NAmath.OCstat.ME
keywords tensorestimationconvergenceapplicationsboundconsidererrorgauss-newton
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we consider the estimation of a low Tucker rank tensor from a number of noisy linear measurements. The general problem covers many specific examples arising from applications, including tensor regression, tensor completion, and tensor PCA/SVD. We consider an efficient Riemannian Gauss-Newton (RGN) method for low Tucker rank tensor estimation. Different from the generic (super)linear convergence guarantee of RGN in the literature, we prove the first local quadratic convergence guarantee of RGN for low-rank tensor estimation in the noisy setting under some regularity conditions and provide the corresponding estimation error upper bounds. A deterministic estimation error lower bound, which matches the upper bound, is provided that demonstrates the statistical optimality of RGN. The merit of RGN is illustrated through two machine learning applications: tensor regression and tensor SVD. Finally, we provide the simulation results to corroborate our theoretical findings.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Scalable Factorization Approach for High-Order Structured Tensor Recovery

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Gradient descent on the Stiefel manifold recovers Tucker and tensor-train tensors with linear convergence whose initialization requirement and rate scale polynomially with the tensor order N.

Pith tools