Symmetric tensor decomposition

We present an algorithm for decomposing a symmetric tensor of dimension n and order d as a sum of of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for symmetric tensors of dimension 2. We exploit the known fact that every symmetric tensor is equivalently represented by a homogeneous polynomial in n variables of total degree d. Thus the decomposition corresponds to a sum of powers of linear forms. The impact of this contribution is two-fold. First it permits an efficient computation of the decomposition of any tensor of sub-generic rank, as opposed to widely used iterative algorithms with unproved convergence (e.g. Alternate Least Squares or gradient descents). Second, it gives tools for understanding uniqueness conditions, and for detecting the tensor rank.

[1]  P. Comon,et al.  Symmetric tensor decomposition , 2009, 2009 17th European Signal Processing Conference.

[2]  J. Alexander,et al.  La méthode d'Horace éclatée: application à l'interpolation en degré quatre , 1992 .

[3]  Enrico Carlini Reducing the number of variables of a polynomial , 2006, Algebraic Geometry and Geometric Modeling.

[4]  T. Ens,et al.  Blind signal separation : statistical principles , 1998 .

[5]  Nikos D. Sidiropoulos,et al.  Kruskal's permutation lemma and the identification of CANDECOMP/PARAFAC and bilinear models with constant modulus constraints , 2004, IEEE Transactions on Signal Processing.

[6]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.

[7]  G. Rota,et al.  The invariant theory of binary forms , 1984 .

[8]  Anne Ferréol,et al.  On the behavior of current second and higher order blind source separation methods for cyclostationary sources , 2000, IEEE Trans. Signal Process..

[9]  Victor Y. Pan,et al.  Multivariate Polynomials, Duality, and Structured Matrices , 2000, J. Complex..

[10]  Jerry M. Mendel,et al.  Applications of cumulants to array processing - I. Aperture extension and array calibration , 1995, IEEE Trans. Signal Process..

[11]  P. Paatero The Multilinear Engine—A Table-Driven, Least Squares Program for Solving Multilinear Problems, Including the n-Way Parallel Factor Analysis Model , 1999 .

[12]  Lieven De Lathauwer,et al.  Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures , 2007, IEEE Transactions on Signal Processing.

[13]  R. Harshman,et al.  PARAFAC: parallel factor analysis , 1994 .

[14]  Mohamed Elkadi,et al.  Introduction à la résolution des systèmes polynomiaux , 2007 .

[15]  Bernard Mourrain,et al.  A generalized flat extension theorem for moment matrices , 2009 .

[16]  Monique Laurent,et al.  Revisiting two theorems of Curto and Fialkow on moment matrices , 2005 .

[17]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[18]  Susan A. Murphy,et al.  Monographs on statistics and applied probability , 1990 .

[19]  Ananthram Swami,et al.  Multichannel ARMA processes , 1994, IEEE Trans. Signal Process..

[20]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[21]  Dinh-Tuan Pham,et al.  Blind separation of instantaneous mixtures of nonstationary sources , 2001, IEEE Trans. Signal Process..

[22]  F. Zak Tangents and Secants of Algebraic Varieties , 1993 .

[23]  Andreas Ziehe,et al.  A Fast Algorithm for Joint Diagonalization with Non-orthogonal Transformations and its Application to Blind Source Separation , 2004, J. Mach. Learn. Res..

[24]  Gonzalo Comas,et al.  On the Rank of a Binary Form , 2011, Found. Comput. Math..

[25]  R. Bro PARAFAC. Tutorial and applications , 1997 .

[26]  Pascal Chevalier,et al.  Optimal separation of independent narrow-band sources: Concept and performance , 1999, Signal Process..

[27]  J. Leeuw,et al.  A new computational method to fit the weighted euclidean distance model , 1978 .

[28]  Rufus Oldenburger Composition and rank of n-way matrices and multilinear forms , 1934 .

[29]  M. Laurent Sums of Squares, Moment Matrices and Optimization Over Polynomials , 2009 .

[30]  Bernard Mourrain,et al.  A New Criterion for Normal Form Algorithms , 1999, AAECC.

[31]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

[32]  Jesús A. De Loera,et al.  How to integrate a polynomial over a simplex , 2008, Math. Comput..

[33]  Laurent Albera,et al.  On the virtual array concept for higher order array processing , 2005, IEEE Transactions on Signal Processing.

[34]  P. Comon,et al.  Blind Identification of Overcomplete MixturEs of sources (BIOME) , 2004 .

[35]  Lieven De Lathauwer,et al.  Tensor-based techniques for the blind separation of DS-CDMA signals , 2007, Signal Process..

[36]  B. Flury Common Principal Components in k Groups , 1984 .

[37]  F. S. Macaulay,et al.  The Algebraic Theory of Modular Systems , 1972 .

[38]  J. M. Landsberg,et al.  Geometry and the complexity of matrix multiplication , 2007, ArXiv.

[39]  Marc Moreno Maza,et al.  Computation of canonical forms for ternary cubics , 2002, ISSAC '02.

[40]  Henk A. L. Kiers,et al.  An efficient algorithm for PARAFAC of three-way data with large numbers of observation units , 1991 .

[41]  Grazia Lotti,et al.  O(n2.7799) Complexity for n*n Approximate Matrix Multiplication , 1979, Inf. Process. Lett..

[42]  Pierre Comon,et al.  Decomposition of quantics in sums of powers of linear forms , 1996, Signal Process..

[43]  Gene H. Golub,et al.  Symmetric Tensors and Symmetric Tensor Rank , 2008, SIAM J. Matrix Anal. Appl..

[44]  Bernard Mourrain,et al.  A Sparse Flat Extension Theorem for Moment Matrices , 2008, ArXiv.

[45]  Pierre Comon,et al.  Blind identification of under-determined mixtures based on the characteristic function , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[46]  J. Berge,et al.  Typical rank and indscal dimensionality for symmetric three-way arrays of order I×2×2 or I×3×3 , 2004 .

[47]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[48]  V. Strassen Rank and optimal computation of generic tensors , 1983 .

[49]  P. McCullagh Tensor Methods in Statistics , 1987 .

[50]  Andrzej Cichocki,et al.  Adaptive blind signal and image processing , 2002 .

[51]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .

[52]  J. Kruskal Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics , 1977 .

[53]  A. Iarrobino,et al.  Power Sums, Gorenstein Algebras, and Determinantal Loci , 2000 .

[54]  Arogyaswami Paulraj,et al.  An analytical constant modulus algorithm , 1996, IEEE Trans. Signal Process..

[55]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[56]  Nikos D. Sidiropoulos,et al.  Blind PARAFAC receivers for DS-CDMA systems , 2000, IEEE Trans. Signal Process..