Fast Sampling-Based Sketches for Tensors
William J. Swartworth, David P. Woodruff
Abstract
We introduce a new approach for applying sampling-based sketches to two and three mode tensors. We illustrate our technique to construct sketches for the classical problems of sampling and producing embeddings. In both settings we achieve sketches that can be applied to a rank one tensor in (for ) in time scaling with rather than or . Our main idea is a particular sampling construction based on fast convolution which allows us to quickly compute sums over sufficiently random subsets of tensor entries.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 229363da-8162-4639-a2d5-2f8e0b1f4c11Builds on2
Related papers
- More Efficient Sampling for Tensor Decomposition With Worst-Case GuaranteesOsman Asif MalikICML 2022 · 17 citations
- Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor DecompositionVivek Bharadwaj, Osman Asif Malik, Riley Murray, Laura Grigori et al.NeurIPS 2023 · 14 citations
- Fast and accurate randomized algorithms for low-rank tensor decompositionsLinjian Ma, Edgar SolomonikNeurIPS 2021 · 35 citations
- Cost-efficient Gaussian tensor network embeddings for tensor-structured inputsLinjian Ma, Edgar SolomonikNeurIPS 2022 · 18 citations
- Leverage Score Sampling for Tensor Product Matrices in Input Sparsity TimeDavid P. Woodruff, Amir ZandiehICML 2022 · 10 citations
