Efficient Sketching-Based Summation of Tucker Tensors
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910052700389376 |
|---|---|
| author | Smith, Rudi Pasha, Mirjeta Galindo-Olarte, Andrés Daas, Hussam Al Ballard, Grey Nakao, Joseph Qiu, Jing-Mei Taitano, William |
| author_facet | Smith, Rudi Pasha, Mirjeta Galindo-Olarte, Andrés Daas, Hussam Al Ballard, Grey Nakao, Joseph Qiu, Jing-Mei Taitano, William |
| contents | We present efficient, sketching-based methods for the summation of tensors in Tucker format. Leveraging the algebraic structure of Khatri-Rao and Kronecker products, our approach enables compressed arithmetic on Tucker tensors while controlling rank growth and computational cost. The proposed sketching framework avoids the explicit formation of large intermediate tensors, instead operating directly on the factor matrices and core tensors to produce accurate low-rank approximations of tensor sums. Furthermore, we analyze the computational complexity and the theoretical approximation properties of the proposed methodology. Numerical experiments demonstrate the effectiveness of our approach on four problems: two synthetic test cases, a parameter-dependent elliptic equation (commonly referred to as the cookie problem) solved via GMRES, and a one-dimensional linear transport problem discretized via high-order discontinuous Galerkin methods, where repeated tensor summation arises as a core computational bottleneck. Across these examples, the sketching-based summation achieves substantial computational savings while preserving high accuracy relative to direct summation and re-compression. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_13532 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient Sketching-Based Summation of Tucker Tensors Smith, Rudi Pasha, Mirjeta Galindo-Olarte, Andrés Daas, Hussam Al Ballard, Grey Nakao, Joseph Qiu, Jing-Mei Taitano, William Numerical Analysis 15A69, 65F10, 65F55, 65M60, 68W20, 35L65 We present efficient, sketching-based methods for the summation of tensors in Tucker format. Leveraging the algebraic structure of Khatri-Rao and Kronecker products, our approach enables compressed arithmetic on Tucker tensors while controlling rank growth and computational cost. The proposed sketching framework avoids the explicit formation of large intermediate tensors, instead operating directly on the factor matrices and core tensors to produce accurate low-rank approximations of tensor sums. Furthermore, we analyze the computational complexity and the theoretical approximation properties of the proposed methodology. Numerical experiments demonstrate the effectiveness of our approach on four problems: two synthetic test cases, a parameter-dependent elliptic equation (commonly referred to as the cookie problem) solved via GMRES, and a one-dimensional linear transport problem discretized via high-order discontinuous Galerkin methods, where repeated tensor summation arises as a core computational bottleneck. Across these examples, the sketching-based summation achieves substantial computational savings while preserving high accuracy relative to direct summation and re-compression. |
| title | Efficient Sketching-Based Summation of Tucker Tensors |
| topic | Numerical Analysis 15A69, 65F10, 65F55, 65M60, 68W20, 35L65 |
| url | https://arxiv.org/abs/2603.13532 |