block term decompositioncondition numberCP decompositionjoin decomposition problemjoin settensor rank decompositionWaring decomposition
Semialgebraic sets and related spaces (14P10) Multilinear algebra, tensor calculus (15A69) Sensitivity analysis for optimization problems on manifolds (49Q12) Local Riemannian geometry (53B20) Methods of local Riemannian geometry (53B21) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)
Abstract: The join set of a finite collection of smooth embedded submanifolds of a mutual vector space is defined as their Minkowski sum. Join decompositions generalize some ubiquitous decompositions in multilinear algebra, namely tensor rank, Waring, partially symmetric rank and block term decompositions. This paper examines the numerical sensitivity of join decompositions to perturbations; specifically, we consider the condition number for general join decompositions. It is characterized as a distance to a set of ill-posed points in a supplementary product of Grassmannians. We prove that this condition number can be computed efficiently as the smallest singular value of an auxiliary matrix. For some special join sets, we characterized the behavior of sequences in the join set converging to the latter's boundary points. Finally, we specialize our discussion to the tensor rank and Waring decompositions and provide several numerical experiments confirming the key results.
Recommendations
- Condition numbers for the tensor rank decomposition
- Three decompositions of symmetric tensors have similar condition numbers
- Tensor decomposition and homotopy continuation
- On the average condition number of tensor rank decompositions
- The average condition number of most tensor rank decomposition problems is infinite
Cites work
- A coordinate-free condition number for convex programming
- An algorithm for generic and low-rank specific identifiability of complex tensors
- Applied Multiway Data Analysis
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Condition numbers for the tensor rank decomposition
- Condition. The geometry of numerical algorithms
- Congruences and concurrent lines in multi-view geometry
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Effective criteria for specific identifiability of tensors and forms
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 5065241 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Identifiability of parameters in latent structure models with many observed variables
- Induction for secant varieties of Segre varieties
- Introduction to Smooth Manifolds
- Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
- On Generic Identifiability of 3-Tensors of Small Rank
- On generic identifiability of symmetric tensors of subgeneric rank
- On maximum, typical and generic ranks
- On the ideals and singularities of secant varieties of Segre varieties
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Orthogonal tensor decompositions
- Projection-like retractions on matrix manifolds
- Rank-one approximation to high order tensors
- Real rank two geometry
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor decompositions for learning latent variable models
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- The geometry of ill-conditioning
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Cited in
(24)- On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- Riemannian Newton optimization methods for the symmetric tensor approximation problem
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Perturbation analysis for matrix joint block diagonalization
- An approximation method of CP rank for third-order tensor completion
- Three decompositions of symmetric tensors have similar condition numbers
- The average condition number of most tensor rank decomposition problems is infinite
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Pencil-based algorithms for tensor rank decomposition are not stable
- The dynamics of swamps in the canonical tensor approximation problem
- A Riemannian trust region method for the canonical tensor rank approximation problem
- The Condition Number of Riemannian Approximation Problems
- A recursive eigenspace computation for the canonical polyadic decomposition
- The condition number of many tensor decompositions is invariant under Tucker compression
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
- Which constraints of a numerical problem cause ill-conditioning?
- A direct method for computing the complex-valued triple decomposition of third-order tensors
- Geometry of first nonempty Terracini loci
- Reducing swamp behavior for the canonical polyadic decomposition problem by rank-1 freezing
- Tensor decompositions for count data that leverage stochastic and deterministic optimization
- A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors
- Hadamard-Hitchcock decompositions: identifiability and computation
This page was built for publication: The condition number of join decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604567)
