Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2510.16930 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917026875834368 |
|---|---|
| author | Sun, Yuchen Bhat, Amit Wang, Chunmei Huang, Kejun |
| author_facet | Sun, Yuchen Bhat, Amit Wang, Chunmei Huang, Kejun |
| contents | We propose a new algorithm called higher-order QR iteration (HOQRI) for computing low multilinear rank approximation (LMLRA), also known as the Tucker decomposition, of large and sparse tensors. Compared to the celebrated higher-order orthogonal iterations (HOOI), HOQRI relies on a simple orthogonalization step in each iteration rather than a more sophisticated singular value decomposition step as in HOOI. More importantly, when dealing with extremely large and sparse data tensors, HOQRI completely eliminates the intermediate memory explosion by defining a new sparse tensor operation called TTMcTC (short for tensor times matrix chains times core). Furthermore, recognizing that the orthonormal constraints form a Cartesian product of Stiefel manifolds, we introduce the framework of manifold optimization and show that HOQRI guarantees convergence to the set of stationary points. Numerical experiments on synthetic and real data showcase the effectiveness of HOQRI. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_16930 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | HOQRI: Higher-order QR Iteration for Low Multilinear Rank Approximation of Large and Sparse Tensors Sun, Yuchen Bhat, Amit Wang, Chunmei Huang, Kejun Numerical Analysis We propose a new algorithm called higher-order QR iteration (HOQRI) for computing low multilinear rank approximation (LMLRA), also known as the Tucker decomposition, of large and sparse tensors. Compared to the celebrated higher-order orthogonal iterations (HOOI), HOQRI relies on a simple orthogonalization step in each iteration rather than a more sophisticated singular value decomposition step as in HOOI. More importantly, when dealing with extremely large and sparse data tensors, HOQRI completely eliminates the intermediate memory explosion by defining a new sparse tensor operation called TTMcTC (short for tensor times matrix chains times core). Furthermore, recognizing that the orthonormal constraints form a Cartesian product of Stiefel manifolds, we introduce the framework of manifold optimization and show that HOQRI guarantees convergence to the set of stationary points. Numerical experiments on synthetic and real data showcase the effectiveness of HOQRI. |
| title | HOQRI: Higher-order QR Iteration for Low Multilinear Rank Approximation of Large and Sparse Tensors |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2510.16930 |