Decompositions of a Higher-Order Tensor in Block Terms - Part II: Definitions and Uniqueness
نویسنده
چکیده
In this paper we introduce a new class of tensor decompositions. Intuitively, we decompose a given tensor block into blocks of smaller size, where the size is characterized by a set of mode-n ranks. We study different types of such decompositions. For each type we derive conditions under which essential uniqueness is guaranteed. The parallel factor decomposition and Tucker’s decomposition can be considered as special cases in the new framework. The paper sheds new light on fundamental aspects of tensor algebra.
منابع مشابه
Decompositions of a Higher-Order Tensor in Block Terms - Part III: Alternating Least Squares Algorithms
In this paper we derive alternating least squares algorithms for the computation of the block term decompositions introduced in Part II. We show that degeneracy can also occur for block term decompositions.
متن کاملTensor modeling and signal processing for wireless communication systems. (Modélisation et traitement tensoriel du signal pour les systèmes de communication sans-fil)
In several signal processing applications for wireless communications, the received signal is multidimensional in nature and may exhibit a multilinear algebraic structure. In this context, the PARAFAC tensor decomposition has been the subject of several works in the past six years. However, generalized tensor decompositions are necessary for covering a wider class of wireless communication syst...
متن کاملTensor Decompositions via Two-Mode Higher-Order SVD (HOSVD)
Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal’s uniqueness theorem to decompose symmetric, nearly orthogonally decomposable tensors. Unlike the classical higher-order singular value decomposition which unfolds a ten...
متن کاملFrom Tensor to Coupled Matrix/Tensor Decomposition
Decompositions of higher-order tensors are becoming more and more important in signal processing, data analysis, machine learning, scientific computing, optimization and many other fields. A new trend is the study of coupled matrix/tensor decompositions (i.e., decompositions of multiple matrices and/or tensors that are linked in one or several ways). Applications can be found in various fields ...
متن کاملDecompositions of a Higher-Order Tensor in Block Terms - Part I: Lemmas for Partitioned Matrices
In this paper we study a generalization of Kruskal’s permutation lemma to partitioned matrices. We define the k’-rank of partitioned matrices as a generalization of the k-rank of matrices. We derive a lower-bound on the k’-rank of Khatri–Rao products of partitioned matrices. We prove that Khatri–Rao products of partitioned matrices are generically full column rank.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 30 شماره
صفحات -
تاریخ انتشار 2008