The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
Open accessAbstract
The canonical polyadic and rank-$(L_r,L_r,1)$ block term decomposition (CPD and BTD, respectively) are two closely related tensor decompositions. The CPD and, recently, BTD are important tools in psychometrics, chemometrics, neuroscience, and signal processing. We present a decomposition that generalizes these two and develop algorithms for its computation. Among these algorithms are alternating least squares schemes, several general unconstrained optimization techniques, and matrix-free nonlinear least squares methods. In the latter we exploit the structure of the Jacobian's Gramian to reduce computational and memory cost. Combined with an effective preconditioner, numerical experiments confirm that these methods are among the most efficient and robust currently available for computing the CPD, rank-$(L_r,L_r,1)$ BTD, and their generalized decomposition.
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
(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
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
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
Self-citationSome Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
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
Cichocki, A., Zdunek, R., Phan, A. H., & Amari, S. (2009) · doi:10.1002/9780470747278 · Cited by 1,540
Handbook of Blind Source Separation, Independent Component Analysis and Applications
Comon, P., & Jutten, C. (2010) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 1,501
The Expression of a Tensor or a Polyadic as a Sum of Products
Hitchcock, F. L. (1927) · Journal of Mathematics and Physics · doi:10.1002/sapm192761164 · Cited by 1,345
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
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
Tensor 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
The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Steihaug, T. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720042 · Cited by 824
Paatero, P. (1999) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1999.10474853 · Cited by 756
Blind PARAFAC receivers for DS-CDMA systems
Sidiropoulos, N. D., Giannakis, G. B., & Bro, R. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.824675 · Cited by 560
Line search algorithms with guaranteed sufficient decrease
Moré, J. J., & Thuente, D. J. (1994) · ACM Transactions on Mathematical Software · doi:10.1145/192115.192132 · Cited by 528
On the uniqueness of multilinear decomposition ofN-way arrays
Sidiropoulos, N. D., & Bro, R. (2000) · Journal of Chemometrics · doi:10.1002/1099-128x(200005/06)14:3<229::aid-cem587>3.0.co;2-n · Cited by 525
Decompositions 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
Self-citationTensor 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
A New Algorithm for Unconstrained Optimization
POWELL, M. J. D. (1970) · Nonlinear Programming · doi:10.1016/b978-0-12-597050-1.50006-3 · Cited by 447
De Lathauwer, L. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040608830 · Cited by 419
Self-citationApproximate solution of the trust region problem by minimization over two-dimensional subspaces
Byrd, R. H., Schnabel, R. B., & Shultz, G. A. (1988) · Mathematical Programming · doi:10.1007/bf01580735 · Cited by 411
A comparison of algorithms for fitting the PARAFAC model
Tomasi, G., & Bro, R. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.11.013 · Cited by 372
A weighted non-negative least squares algorithm for three-way ‘PARAFAC’ factor analysis
Paatero, P. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(97)00031-2 · Cited by 340
Multiple Invariants and Generalized Rank of a P‐Way Matrix or Tensor
Hitchcock, F. L. (1928) · Journal of Mathematics and Physics · doi:10.1002/sapm19287139 · Cited by 338
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90064-a · Cited by 280
van den Bos, A. (1994) · IEE Proceedings - Vision Image and Signal Processing · doi:10.1049/ip-vis:19941555 · Cited by 255
Rank, decomposition, and uniqueness for 3-way and n -way arrays
Kruskal, J. B. (1989) · Medical Entomology and Zoology · Cited by 253
Matrix Algebra and Its Applications to Statistics and Econometrics
Rao, C. R., & Rao, M. B. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/3599 · Cited by 218
Unconstrained Optimization of Real Functions in Complex Variables
Sorber, L., Barel, M. V., & Lathauwer, L. D. (2012) · SIAM Journal on Optimization · doi:10.1137/110832124 · Cited by 192
Self-citationJiang, T., & Sidiropoulos, N. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.832022 · Cited by 185
Lathauwer, L. D. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100805510 · Cited by 136
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
Lathauwer, L. D., & de Baynast, A. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.910469 · Cited by 92
The Lifted Newton Method and Its Application in Optimization
Albersmeyer, J., & Diehl, M. (2010) · SIAM Journal on Optimization · doi:10.1137/080724885 · Cited by 78
Stegeman, A. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050644677 · Cited by 53
A short introduction to tensor-based methods for Factor Analysis and Blind Source Separation
Lathauwer, L. D. (2011) · Lirias · Cited by 18
Cited by
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Self-citationCichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
Self-citationBayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
Zhao, Q., Zhang, L., & Cichocki, A. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2392756 · Cited by 587
Tensors : A brief introduction
Comon, P. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2298533 · Cited by 347
Smooth PARAFAC Decomposition for Tensor Completion
Yokota, T., Zhao, Q., & Cichocki, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2586759 · Cited by 279
Metadata
- Authors
- Sorber, L., Van Barel, M., & De Lathauwer, L.
- Venue
- SIAM Journal on Optimization
- Published
- 2013-01
- Volume
- 23
- Issue
- 2
- Pages
- 695-720
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1989811026
- Cited by
- 273
- References
- 38
- FWCI
- 7.09
- Type
- journal article
- Language
- en
- Open access
- green
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.