The geometry of rank-one tensor completion

DOI10.1137/16M1074102zbMATH Open1375.14193arXiv1605.01678OpenAlexW3105634262MaRDI QIDQ5347300FDOQ5347300

Authors: Thomas Kahle, Kaie Kubjas, Mario Kummer, Zvi Rosen 

Publication date: 23 May 2017

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Abstract: The geometry of the set of restrictions of rank-one tensors to some of their coordinates is studied. This gives insight into the problem of rank-one completion of partial tensors. Particular emphasis is put on the semialgebraic nature of the problem, which arises for real tensors with constraints on the parameters. The algebraic boundary of the completable region is described for tensors parametrized by probability distributions and where the number of observed entries equals the number of parameters. If the observations are on the diagonal of a tensor of format $dimesdotsimesd$, the complete semialgebraic description of the completable region is found.

Full work available at URL: https://arxiv.org/abs/1605.01678

Recommendations

• Matrix completion and tensor rank
• Spectral algorithms for tensor completion
• Fundamental conditions for low-CP-rank tensor completion
• Typical and generic ranks in matrix completion
• On the geometry of geometric rank

zbMATH Keywords

probability distributiontensor completionrank-one tensor

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Real algebraic sets (14P05) Semialgebraic sets and related spaces (14P10)

Cites Work

• Tensor Decompositions and Applications
• Exact matrix completion via convex optimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Title not available (Why is that?)
• Toric ideals generalized by quadratic binomials
• Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Most tensor problems are NP-hard
• The algebraic combinatorial approach for low-rank matrix completion
• Title not available (Why is that?)
• Binomial ideals
• The convex geometry of linear inverse problems
• Determinantal representations of hyperbolic plane curves: an elementary approach
• Uniqueness of low-rank matrix completion by rigidity theory
• Blind Multilinear Identification
• Rees algebras of edge ideals
• Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
• On tensor completion via nuclear norm minimization
• Algebraic boundaries of \(\mathrm{SO}(2)\)-orbitopes
• Toric algebra of hypergraphs
• Title not available (Why is that?)
• Matrix completion for the independence model

Cited In (5)

• Recovery from Power Sums
• Typical and generic ranks in matrix completion
• Typical ranks in symmetric matrix completion
• The relation between a tensor and its associated semi-symmetric form
• Matrix completion and tensor rank

This page was built for publication: The geometry of rank-one tensor completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347300)