4 papers
Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
Hussam Al Daas, Grey Ballard, Laura Grigori +4
Sketching is widely used in randomized linear algebra for low-rank matrix approximation, column subset selection, and many other problems, and it has gained significant traction in…
Improved Analysis of Khatri-Rao Random Projections and Applications
Arvind K. Saibaba, Bhisham Dev Verma, Grey Ballard
Randomization has emerged as a powerful set of tools for large-scale matrix and tensor decompositions. Randomized algorithms involve computing sketches with random matrices. A prev…
Efficient Sketching-Based Summation of Tucker Tensors
Rudi Smith, Mirjeta Pasha, Andrés Galindo-Olarte +5
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 e…
Adaptive Randomized Tensor Train Rounding using Khatri-Rao Products
Hussam Al Daas, Grey Ballard, Laura Grigori +3
Approximating a tensor in the tensor train (TT) format has many important applications in scientific computing. Rounding a TT tensor involves further compressing a tensor that is a…