The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A scalable optimization approach for fitting canonical tensor decompositions
Abstract
Tensor decompositions are higher‐order analogues of matrix decompositions and have proven to be powerful tools for data analysis. In particular, we are interested in the canonical tensor decomposition, otherwise known as CANDECOMP/PARAFAC (CP), which expresses a tensor as the sum of component rank‐one tensors and is used in a multitude of applications such as chemometrics, signal processing, neuroscience and web analysis. The task of computing CP, however, can be difficult. The typical approach is based on alternating least‐squares (ALS) optimization, but it is not accurate in the case of overfactoring. High accuracy can be obtained by using nonlinear least‐squares (NLS) methods; the disadvantage is that NLS methods are much slower than ALS. In this paper, we propose the use of gradient‐based optimization methods. We discuss the mathematical calculation of the derivatives and show that they can be computed efficiently, at the same cost as one iteration of ALS. Computational experiments demonstrate that the gradient‐based optimization methods are more accurate than ALS and faster than NLS in terms of total computation time. Copyright © 2011 John Wiley & Sons, Ltd.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Self-citation(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
PARAFAC. Tutorial and applications
Bro, R. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(97)00032-4 · Cited by 2,814
Harshman, R. A. (1970) · Cited by 2,255
Kruskal, J. B. (1977) · Linear Algebra and its Applications · doi:10.1016/0024-3795(77)90069-6 · Cited by 1,619
A new efficient method for determining the number of components in PARAFAC models
Bro, R., & Kiers, H. A. L. (2003) · Journal of Chemometrics · doi:10.1002/cem.801 · Cited by 1,257
Multi‐Way Analysis with Applications in the Chemical Sciences
Smilde, A., Bro, R., & Geladi, P. (2004) · Wiley eBooks · doi:10.1002/0470012110 · Cited by 1,176
Cited by
Scalable tensor factorizations for incomplete data
Acar, E., Dunlavy, D. M., Kolda, T. G., & Mørup, M. (2011) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2010.08.004 · Cited by 602
Self-citationA literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Cichocki, 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 for Data Mining and Data Fusion: Models, Applications, and Scalable Algorithms
Papalexakis, E. E., Faloutsos, C., & Sidiropoulos, N. D. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2915921 · Cited by 354
Coupled matrix factorization with sparse factors to identify potential biomarkers in metabolomics
Acar, E., Gurdeniz, G., Rasmussen, M. A., Rago, D., Dragsted, L. O., & Bro, R. (2012) · International Journal of Knowledge Discovery in Bioinformatics · doi:10.4018/jkdb.2012070102 · Cited by 35
Self-citation
Metadata
- Authors
- Acar, E., Dunlavy, D. M., & Kolda, T. G.
- Venue
- Journal of Chemometrics
- Publisher
- Wiley
- Published
- 2011-01-27
- Volume
- 25
- Issue
- 2
- Pages
- 67-86
- ISSN
- 0886-9383 (ISSN-L)
- 1099-128X
- OpenAlex
- W2071729267
- Cited by
- 290
- References
- 31
- FWCI
- 6.22
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A scalable optimization approach for fitting canonical tensor decompositions. https://app.cochat.ai/papers/10.1002/cem.1335
- The paper
- Acar, E., Dunlavy, D. M., & Kolda, T. G. (2011). A scalable optimization approach for fitting canonical tensor decompositions. Journal of Chemometrics. https://doi.org/10.1002/cem.1335
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.