When does subtracting a rank-one approximation decrease tensor rank?
Computational aspects and applications of commutative rings (13P99) Determinantal varieties (14M12) Computational aspects in algebraic geometry (14Q99) Multilinear algebra, tensor calculus (15A69) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Critical points of functions and mappings on manifolds (58K05)
For a given cone \(X\), a chain of varieties of tensors called data loci is defined inductively as follows:\N\N\(DL_1 = X\),\N\N\(DL_r\) is constructed from \(DL_{r-1}\) by subtracting a critical rank-one approximation.\N\NEach data locus contains the previous one, so the chain is ascending.\N\NAfterwards the geometry of the data loci is studied, namely the decomposition of \(DL_r\) into irreducible components. Also the intersection of the components of \(DL_r\) is proven to contain all weakly orthogonally decomposable tensors of rank at most \(r\).\N\NFinally the paper focuses on the situation when \(X\) is the cone over a Veronese variety. In this case the data locus \(DL_r\) turns out to be exactly the variety of weakly orthogonally decomposable tensors of appropriate rank. Moreover the ascending chain of data loci stabilizes and also the rank at which it becomes stable is given.
- Best rank-k approximations for tensors: generalizing Eckart-Young
- Bounded-rank tensors are defined in bounded degree
- Data loci in algebraic optimization
- Dualities
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- scientific article; zbMATH DE number 7689795 (Why is no real title available?)
- Most tensor problems are NP-hard
- Orthogonal and unitary tensor decomposition from an algebraic perspective
- Progress on the symmetric Strassen conjecture
- Projectively dual varieties
- Singular vectors of orthogonally decomposable tensors
- Singularities of hyperdeterminants
- Subtracting a best rank-1 approximation may increase tensor rank
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor rank is NP-complete
- The bottleneck degree of algebraic varieties
- The data singular and the data isotropic loci for affine cones
- The Euclidean distance degree of an algebraic variety
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
This page was built for publication: When does subtracting a rank-one approximation decrease tensor rank?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020879)
