Efficient CP Rounding Using Alternating Least Squares with QR Decomposition
SIAM Journal on Matrix Analysis and Applications · 30.06.2026 · 47 (2) · 544-563
DOI: 10.1137/25m1742333 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Matrix Analysis and Applications, online erschienen am 16.04.2026. Verfasst von Alex Zhang und 3 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Gefördert von: National Science Foundation, US Department of Energy.
Abstract (Originalsprache)
The CANDECOMP/PARAFAC (CP) decomposition is widely used for analyzing multidimensional data, and the alternating least squares (CP-ALS) algorithm is a common method for its computation. CP rounding is the problem of computing a lower-rank CP decomposition of an input already in a higher-rank CP format. While the normal equations (NE) approach in CP-ALS is efficient for the CP rounding problem and frequently used, it becomes unstable in the presence of ill-conditioned subproblems. This paper presents a new QR-based CP-ALS method for CP rounding that preserves both numerical stability and computational efficiency. Our experiments show that the proposed method offers significant speedup over a previous QR-based approach and the Tensor Toolbox’s NE-based implementation, particularly for higher-order tensors. Furthermore, our approach demonstrates a marked reduction in error for ill-conditioned problems, with error reductions several orders of magnitude smaller compared to the NE-based method, while achieving faster convergence and more accurate solutions. By using a more numerically stable approach, we can solve more problems in reduced working precision, which enables further reduction in time to solution. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/alexz949/CP-Rounding.git . [Formula: see text]
Förderung
- National Science Foundation
- US Department of Energy
Zitieren
APA
Zhang, A., Verma, B. D., Lent, J. V., & Ballard, G. (2026). Efficient CP Rounding Using Alternating Least Squares with QR Decomposition. SIAM Journal on Matrix Analysis and Applications, 47(2), 544-563. https://doi.org/10.1137/25m1742333
Vancouver
Zhang A, Verma BD, Lent JV, Ballard G. Efficient CP Rounding Using Alternating Least Squares with QR Decomposition. SIAM Journal on Matrix Analysis and Applications. 2026;47(2):544-563. doi:10.1137/25m1742333
BibTeX
@article{Zhang2026,
author = {Zhang, Alex and Verma, Bhisham Dev and Lent, Jan Van and Ballard, Grey},
title = {Efficient CP Rounding Using Alternating Least Squares with QR Decomposition},
journal = {SIAM Journal on Matrix Analysis and Applications},
year = {2026},
volume = {47},
number = {2},
pages = {544--563},
doi = {10.1137/25m1742333}
}
EUVIMED