The condition number of join decompositions

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.

References in corpus (10)

• Tensor Decomposition for Signal Processing and Machine Learning
• Identifiability of parameters in latent structure models with many observed variables
• On the Uniqueness of the Canonical Polyadic Decomposition of third-order tensors --- Part II: Uniqueness of the overall decomposition
• An algorithm for generic and low-rank specific identifiability of complex tensors
• Generic uniqueness conditions for the canonical polyadic decomposition and INDSCAL
• On generic identifiability of symmetric tensors of subgeneric rank
• Effective criteria for specific identifiability of tensors and forms
• A condition number for the tensor rank decomposition
• Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
• On partial and generic uniqueness of block term tensor decompositions

Cited by in corpus (17)

• A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
• A condition number for the tensor rank decomposition
• Pencil-based algorithms for tensor rank decomposition are not stable
• Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
• The condition number of Riemannian approximation problems
• Subspace power method for symmetric tensor decomposition
• The average condition number of most tensor rank decomposition problems is infinite
• Tensor completion using geodesics on Segre manifolds
• On the average condition number of tensor rank decompositions
• Geometry of first nonempty Terracini loci
• The condition number of many tensor decompositions is invariant under Tucker compression
• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
• Riemannian Newton optimization methods for the symmetric tensor approximation problem
• Learning Diagonal Gaussian Mixture Models and Incomplete Tensor Decompositions
• Three decompositions of symmetric tensors have similar condition numbers
• Which constraints of a numerical problem cause ill-conditioning?
• Tensor decompositions and algorithms, with applications to tensor learning