Pith. sign in

REVIEW 1 cited by

Tensor train completion: local recovery guarantees via Riemannian optimization

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 2110.03975 v3 pith:D3DD3LDK submitted 2021-10-08 math.NA cs.LGcs.NA

classification math.NAcs.LGcs.NA
keywords tensorcompletionguaranteeslocaltrainconvergenceriemannianauxiliary
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we estimate the number of randomly selected elements of a tensor that with high probability guarantees local convergence of Riemannian gradient descent for tensor train completion. We derive a new bound for the orthogonal projections onto the tangent spaces based on the harmonic mean of the unfoldings' singular values and introduce a notion of core coherence for tensor trains. We also extend the results to tensor train completion with auxiliary subspace information and obtain the corresponding local convergence guarantees.

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