Fetching the paper…
Reading the bibliography…
We present a data structure to randomly sample rows from the Khatri-Rao product of several matrices according to the exact distribution of its leverage scores.
Khatri-Rao space-time codes
N.D. Sidiropoulos and R.S. Budampati · 2002
Earlier work this paper cites.
Efficient matlab computations with sparse and factored tensors
Brett W. Bader and Tamara G. Kolda · 2008
Earlier work this paper cites.
Hadamard, Khatri-Rao, Kronecker and other matrix products
Shuangzhe Liu and Götz Trenkler · 2008
Earlier work this paper cites.
The fast Johnson–Lindenstrauss transform and approximate nearest neighbors
Nir Ailon and Bernard Chazelle · 2009
Earlier work this paper cites.
Tensor decompositions and applications
Tamara G. Kolda and Brett W. Bader · 2009
Earlier work this paper cites.
MIMO radar using compressive sampling
Yao Yu, Athina P. Petropulu, and H. Vincent Poor · 2009
Earlier work this paper cites.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P. G. Martinsson, and J. A. Tropp · 2011
Earlier work this paper cites.
Fast approximation of matrix coherence and statistical leverage
Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, and David P. Woodruff · 2012
Earlier work this paper cites.
Sketching as a tool for numerical linear algebra
David P Woodruff et al · 2014
Earlier work this paper cites.
Framework for batched and GPU-resident factorization algorithms to block Householder transformations
Azzam Haidar, Tingxing Dong, Stanimire Tomov, Piotr Luszczek, and Jack Dongarra · 2015
Earlier work this paper cites.
Fast and guaranteed tensor decomposition via sketching
Yining Wang, Hsiao-Yu Tung, Alexander J Smola, and Anima Anandkumar · 2015
Earlier work this paper cites.
SPALS: Fast alternating least squares via implicit leverage scores sampling
Dehua Cheng, Richard Peng, Yan Liu, and Ioakeim Perros · 2016
Cited alongside, same era.
SPLATT: The Surprisingly ParalleL spArse Tensor Toolkit
Shaden Smith and George Karypis · 2016
Cited alongside, same era.
FROSTT: The formidable repository of open sparse tensors and tools, 2017
Shaden Smith, Jee W. Choi, Jiajia Li, Richard Vuduc, Jongsoo Park, Xing Liu, and George Karypis · 2017
Cited alongside, same era.
A practical randomized CP tensor decomposition
Casey Battaglino, Grey Ballard, and Tamara G. Kolda · 2018
Cited alongside, same era.
Optimal sketching for Kronecker product regression and low rank approximation
Huaian Diao, Rajesh Jayaram, Zhao Song, Wen Sun, and David Woodruff · 2019
Cited alongside, same era.
Tensorly: Tensor learning in python
Jean Kossaifi, Yannis Panagakis, Anima Anandkumar, and Maja Pantic · 2019
Practical leverage-based sampling for low-rank tensor decomposition
Brett W. Larsen and Tamara G. Kolda · 2022
Later among the works it cites.
Cost-efficient gaussian tensor network embeddings for tensor-structured inputs
Linjian Ma and Edgar Solomonik · 2022
Later among the works it cites.
More efficient sampling for tensor decomposition with worst-case guarantees
Osman Asif Malik · 2022
Later among the works it cites.
Sampling-based decomposition algorithms for arbitrary tensor networks, October 2022
Osman Asif Malik, Vivek Bharadwaj, and Riley Murray · 2022
Later among the works it cites.
Dynamic tensor product regression
Aravind Reddy, Zhao Song, and Lichen Zhang · 2022
Later among the works it cites.
Sextans: A streaming accelerator for general-purpose sparse-matrix dense-matrix multiplication
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Oblivious Sketching of High-Degree Polynomial Kernels , pages 141–160
Thomas D. Ahle, Michael Kapralov, Jakob B. T. Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, and Amir Zandieh · 2020
Cited alongside, same era.
Structured random sketching for PDE inverse problems
Ke Chen, Qin Li, Kit Newton, and Stephen J. Wright · 2020
Cited alongside, same era.
Optimal approximate sampling from discrete probability distributions
Feras A. Saad, Cameron E. Freer, Martin C. Rinard, and Vikash K. Mansinghka · 2020
Cited alongside, same era.
Subquadratic Kronecker regression with applications to tensor decomposition
Matthew Fahrbach, Gang Fu, and Mehrdad Ghadiri · 2022
Cited alongside, same era.
Linghao Song, Yuze Chi, Atefeh Sohrabizadeh, Young-kyu Choi, Jason Lau, and Jason Cong · 2022
Later among the works it cites.
Leverage score sampling for tensor product matrices in input sparsity time
David Woodruff and Amir Zandieh · 2022
Later among the works it cites.
Randomized numerical linear algebra : A perspective on the field with an eye to software, 2023
Riley Murray, James Demmel, Michael W. Mahoney, N. Benjamin Erichson, Maksim Melnichenko, Osman Asif Malik, Laura Grigori, Piotr Luszczek, Michał Dereziński, Miles E. Lopes, Tianyu Liang, Hengrui Luo, and Jack Dongarra · 2023
Closest in time.
Accelerating sparse MTTKRP for tensor decomposition on FPGA
Sasindu Wijeratne, Ta-Yang Wang, Rajgopal Kannan, and Viktor Prasanna · 2023
Closest in time.
Faster Johnson–Lindenstrauss transforms via Kronecker products
Ruhui Jin, Tamara G Kolda, and Rachel Ward · 2049
Closest in time.