On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-(1,L_r,L_r) Terms
From MaRDI portal
Publication:5113366
Abstract: Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine learning, etc. On the other hand, in several applications the rank-1 constraint on the terms is too restrictive. A multilinear rank- constraint (where a rank-1 term is the special case for which ) could be more realistic, while it still yields a decomposition with attractive uniqueness properties. In this paper we focus on the decomposition of a tensor into a sum of multilinear rank- terms, . This particular decomposition type has already found applications in wireless communication, chemometrics and the blind signal separation of signals that can be modelled as exponential polynomials and rational functions. We find conditions on the terms which guarantee that the decomposition is unique and can be computed by means of the eigenvalue decomposition of a matrix even in the cases where none of the factor matrices has full column rank. We consider both the case where the decomposition is exact and the case where the decomposition holds only approximately. We show that in both cases the number of the terms and their "sizes" do not have to be known a priori and can be estimated as well. The conditions for uniqueness are easy to verify, especially for terms that can be considered "generic". In particular, we obtain the following two generalizations of a well known result on generic uniqueness of the CPD (i.e., the case ): we show that the multilinear rank- decomposition of an tensor is generically unique if i) and or if ii) and .
Recommendations
- On Uniqueness of the nth Order Tensor Decomposition into Rank-1 Terms with Linear Independence in One Mode
- Tensor decompositions in rank \(+1\)
- A constructive algorithm for decomposing a tensor into a finite sum of orthonormal rank-1 terms
- On partial and generic uniqueness of block term tensor decompositions
- Rank-\(r\) decomposition of symmetric tensors
- Tensor decompositions and rank increment conjecture
- On Uniqueness of the Canonical Tensor Decomposition with Some Form of Symmetry
- On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor
- Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
- Rank properties and computational methods for orthogonal tensor decompositions
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 3443893 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Algebraic geometry. An introduction. Transl. from the French by Catriona Maclean
- An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
- An algorithm for generic and low-rank specific identifiability of complex tensors
- Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_{r,n},L_{r,n},1)\) terms. II: Algorithms
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Effective criteria for specific identifiability of tensors and forms
- Finding a low-rank basis in a matrix subspace
- Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
- Löwner-Based Blind Signal Separation of Rational Functions With Applications
- On partial and generic uniqueness of block term tensor decompositions
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. I: Basic results and uniqueness of one factor matrix
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Pencil-based algorithms for tensor rank decomposition are not stable
- Preconditioned optimization algorithms solving the problem of the non unitary joint block diagonalization: application to blind separation of convolutive mixtures
- Rank and optimal computation of generic tensors
- Real identifiability vs. complex identifiability
- Refined methods for the identifiability of tensors
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
Cited in
(11)- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_r,n,L_r,n,1)\) terms. I: Uniqueness
- \((L_r,L_r,1)\)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- Nonlinear algebra and applications
- Bilinear factorizations subject to monomial equality constraints via tensor decompositions
- Decomposition of a tensor into multilinear rank-\((M_r,N_r,\cdot)\) terms
- Lower bounds on the rank and symmetric rank of real tensors
- SOTT: greedy approximation of a tensor as a sum of tensor trains
- From computation to comparison of tensor decompositions
- Improved Uniqueness Conditions for Canonical Tensor Decompositions with Linearly Dependent Loadings
- Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
This page was built for publication: On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113366)
