Fast Sampling-Based Sketches for Tensors
William J. Swartworth, David P. Woodruff
2024年份
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- More Efficient Sampling for Tensor Decomposition With Worst-Case GuaranteesOsman Asif MalikICML 2022 · 被引用 17 次
- Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor DecompositionVivek Bharadwaj, Osman Asif Malik, Riley Murray, Laura Grigori 等NeurIPS 2023 · 被引用 14 次
- Fast and accurate randomized algorithms for low-rank tensor decompositionsLinjian Ma, Edgar SolomonikNeurIPS 2021 · 被引用 35 次
- Cost-efficient Gaussian tensor network embeddings for tensor-structured inputsLinjian Ma, Edgar SolomonikNeurIPS 2022 · 被引用 18 次
- Leverage Score Sampling for Tensor Product Matrices in Input Sparsity TimeDavid P. Woodruff, Amir ZandiehICML 2022 · 被引用 10 次
