An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
From MaRDI portal
Publication:5246480
DOI10.1137/140961389zbMath1322.14022arXiv1403.4157OpenAlexW3104226882WikidataQ60307017 ScholiaQ60307017MaRDI QIDQ5246480
Nick Vannieuwenhoven, Luca Chiantini, Giorgio Ottaviani
Publication date: 21 April 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.4157
Computational aspects of higher-dimensional varieties (14Q15) Multilinear algebra, tensor calculus (15A69) Canonical forms, reductions, classification (15A21) Varieties and morphisms (14A10) Elementary questions in algebraic geometry (14A25)
Related Items
Catalecticant intersections and confinement of decompositions of forms ⋮ Identifiability for the k-secant variety of the Segre-Veronese varieties ⋮ Estimating multivariate latent-structure models ⋮ Set evincing the ranks with respect to an embedded variety (symmetric tensor rank and tensor rank) ⋮ A very brief introduction to nonnegative tensors from the geometric viewpoint ⋮ On singularities of third secant varieties of Veronese embeddings ⋮ Smoothed analysis for tensor methods in unsupervised learning ⋮ Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL ⋮ Segre Functions in Multiprojective Spaces and Tensor Analysis ⋮ Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method ⋮ Topology of tensor ranks ⋮ Linearly dependent subsets of Segre varieties ⋮ Condition numbers for the tensor rank decomposition ⋮ Most secant varieties of tangential varieties to Veronese varieties are nondefective ⋮ Effective Criteria for Specific Identifiability of Tensors and Forms ⋮ On the description of identifiable quartics ⋮ Identifiability of an X-Rank Decomposition of Polynomial Maps ⋮ Identifiability for mixtures of centered Gaussians and sums of powers of quadratics ⋮ Learning algebraic models of quantum entanglement ⋮ Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number ⋮ On the multigraded Hilbert function of lines and rational curves in multiprojective spaces ⋮ From non-defectivity to identifiability ⋮ Estimation under group actions: recovering orbits from invariants ⋮ An algorithm for the non-identifiability of rank-3 tensors ⋮ On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms ⋮ The Condition Number of Join Decompositions ⋮ On generic identifiability of symmetric tensors of subgeneric rank ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ A uniqueness result on the decompositions of a bi-homogeneous polynomial ⋮ Typical and admissible ranks over fields ⋮ Real identifiability vs. complex identifiability ⋮ On a geometric method for the identifiability of forms ⋮ A new class of non-identifiable skew-symmetric tensors ⋮ Identifiability of homogeneous polynomials and Cremona transformations ⋮ Unnamed Item ⋮ Equations for the Fifth Secant Variety of Segre Products of Projective Spaces ⋮ Partially symmetric tensor rank: the description of the non-uniqueness case for low rank ⋮ Large families of homogeneous polynomials with non-unique additive decompositions ⋮ Identifiability of rank-3 tensors ⋮ Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable ⋮ Homotopy techniques for tensor decomposition and perfect identifiability ⋮ From Computation to Comparison of Tensor Decompositions ⋮ Semialgebraic Geometry of Nonnegative Tensor Rank ⋮ All secant varieties of the Chow variety are nondefective for cubics and quaternary forms ⋮ Almost all subgeneric third-order Chow decompositions are identifiable ⋮ The Hitchhiker guide to: secant varieties and tensor decomposition ⋮ Reconstruction of a homogeneous polynomial from its additive decompositions when identifiability fails ⋮ Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking
