The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Symmetric Tensors and Symmetric Tensor Rank
Abstract
A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a symmetric sum of outer product of vectors. A rank-1 order-k tensor is the outer product of k nonzero vectors. Any symmetric tensor can be decomposed into a linear combination of rank-1 tensors, each of which is symmetric or not. The rank of a symmetric tensor is the minimal number of rank-1 tensors that is necessary to reconstruct it. The symmetric rank is obtained when the constituting rank-1 tensors are imposed to be themselves symmetric. It is shown that rank and symmetric rank are equal in a number of cases and that they always exist in an algebraically closed field. We will discuss the notion of the generic symmetric rank, which, due to the work of Alexander and Hirschowitz [J. Algebraic Geom., 4 (1995), pp. 201–222], is now known for any values of dimension and order. We will also show that the set of symmetric tensors of symmetric rank at most r is not closed unless $r=1$.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
A Multilinear Singular Value Decomposition
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896305696 · Cited by 4,106
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Time Series: Data Analysis and Theory.
Koopmans, L. H., & Brillinger, D. R. (1976) · Journal of the American Statistical Association · doi:10.2307/2285347 · Cited by 2,637
Harshman, R. A. (1970) · Cited by 2,255
Kronecker products and matrix calculus in system theory
Brewer, J. (1978) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1978.1084534 · Cited by 1,907
Shafarevich, I. R. (1994) · Springer eBooks · doi:10.1007/978-3-642-57956-1 · Cited by 1,651
(2005) · Graduate Texts in Mathematics · doi:10.1007/b138611 · Cited by 1,621
Kruskal, J. B. (1977) · Linear Algebra and its Applications · doi:10.1016/0024-3795(77)90069-6 · Cited by 1,619
Eigenvalues of a real supersymmetric tensor
Qi, L. (2005) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2005.05.007 · Cited by 1,440
Cited by
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
(2020) · Radical Treatment · doi:10.2307/j.ctvw1d7dg.9 · Cited by 3,373
ALEXANDER, P. (1963) · Philosophical Books · doi:10.1111/j.1468-0149.1963.tb00798.x · Cited by 2,854
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
Self-citationTensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
Self-citationTensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
“For instance, it is not clear a priori that the symmetric rank of a tensor should even be finite (Comon et al., 2008).”
BackgroundDecompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
De Lathauwer, L. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/070690729 · Cited by 479
Tensor decompositions, alternating least squares and other tales
Comon, P., Luciani, X., & de Almeida, A. L. F. (2009) · Journal of Chemometrics · doi:10.1002/cem.1236 · Cited by 457
Self-citationCichocki, A., Lee, N., Oseledets, I., Phan, A.-H., Zhao, Q., & Mandic, D. P. (2016) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000059 · Cited by 456
Tensors : A brief introduction
Comon, P. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2298533 · Cited by 347
Self-citationA New Truncation Strategy for the Higher-Order Singular Value Decomposition
Vannieuwenhoven, N., Vandebril, R., & Meerbergen, K. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/110836067 · Cited by 277
Shifted Power Method for Computing Tensor Eigenpairs
Kolda, T. G., & Mayo, J. R. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100801482 · Cited by 273
Metadata
- Authors
- Comon, P., Golub, G., Lim, L.-H., & Mourrain, B.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2008-01
- Volume
- 30
- Issue
- 3
- Pages
- 1254-1279
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2039748980
- Cited by
- 544
- References
- 34
- FWCI
- 7.47
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.