Recompression Of Hadamard Products Of Tensors In Tucker Format

The Hadamard product features prominently in tensor-based algorithms in scientific computing and data analysis. Due to its tendency to significantly increase ranks, the Hadamard product can represent a major computational obstacle in algorithms based on low-rank tensor representations. It is therefore of interest to develop recompression techniques that mitigate the effects of this rank increase. In this work, we investigate such techniques for the case of the Tucker format, which is well suited for tensors of low order and small to moderate multilinear ranks. Fast algorithms are attained by combining iterative methods, such as the Lanczos method and randomized algorithms, with fast matrix-vector products that exploit the structure of Hadamard products. The resulting complexity reduction is particularly relevant for tensors featuring large mode sizes I and small to moderate multilinear ranks R. To implement our algorithms, we have created a new Julia library for tensors in Tucker format.


Published in:
Siam Journal On Scientific Computing, 39, 5, A1879-A1902
Year:
2017
Publisher:
Philadelphia, Siam Publications
ISSN:
1064-8275
Keywords:
Laboratories:




 Record created 2018-01-15, last modified 2019-12-05


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)