Practical alternating least squares for tensor ring decomposition.

DOI10.1002/NLA.2542MaRDI QIDQ6584473zbMATH OpenFDO

Authors Hanyu Li

Publication date 7 August 2024

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NLA.2542

zbMATH Keywords

alternating least squaresnormal equationQR factorizationtensor producttensor ring decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Decomposition methods (49M27) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Approximation algorithms (68W25)

Cited in

(5)

• Randomized tensor wheel decomposition
• Tracking tensor ring decompositions of streaming tensors
• Accelerated alternating least squares for tensor wheel decomposition with applications
• Low-rank fully-connected tensor network learning for tensor-on-tensor regression
• Randomized algorithms for computing tensor ring rounding

This page was built for publication: Practical alternating least squares for tensor ring decomposition.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584473)