[10] Azzam Haidar, Tingxing Dong, Stanimire Tomov, Piotr Luszczek, and Jack Dongarra. Framework for batched and GPU-resident factorization algorithms to block Householder transformations. In ISC High Performance, Frankfurt, Germany, 07-2015 2015. Springer, Springer.
[11] N. Halko, P. G. Martinsson, and J. A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2):217-288, 2011. doi: 10.1137/090771806.
[12] Ruhui Jin, Tamara G Kolda, and Rachel Ward. Faster Johnson-Lindenstrauss transforms via Kronecker products. Information and Inference: A Journal of the IMA, 10(4):1533-1562, October 2020. ISSN 2049-8772. doi: 10.1093/imaaiai/iaaa028.
[13] Tamara G. Kolda and Brett W. Bader. Tensor decompositions and applications. SIAM Review, 51(3):455-500, August 2009. ISSN 0036-1445. doi: 10.1137/07070111X. Publisher: Society for Industrial and Applied Mathematics.
[14] Jean Kossaifi, Yannis Panagakis, Anima Anandkumar, and Maja Pantic. Tensorly: Tensor learning in python. Journal of Machine Learning Research (JMLR), 20(26), 2019.
[15] Brett W. Larsen and Tamara G. Kolda. Practical leverage-based sampling for low-rank tensor decomposition. SIAM J. Matrix Analysis and Applications, 43(3):1488-1517, August 2022. doi: 10.1137/21M1441754.
[16] Shuangzhe Liu and Gotoz Trenkler. Hadamard, Khatri-Rao, Kronecker and other matrix products. International Journal of Information and Systems Sciences, 4(1):160-177, 2008.
[17] Linjian Ma and Edgar Solomonik. Cost-efficient gaussian tensor network embeddings for tensor-structured inputs. In Advances in Neural Information Processing Systems, volume 35, pages 38980–38993. Curran Associates, Inc., 2022.
[18] Osman Asif Malik. More efficient sampling for tensor decomposition with worst-case guarantees. In Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, pages 14887-14917. PMLR, 17-23 Jul 2022.
[19] Osman Asif Malik, Vivek Bharadwaj, and Riley Murray. Sampling-based decomposition algorithms for arbitrary tensor networks, October 2022. arXiv:2210.03828 [cs, math].
[20] Riley Murray, James Demmel, Michael W. Mahoney, N. Benjamin Erichson, Maksim Melnichenko, Osman Asif Malik, Laura Grigori, Piotr Luszczek, Michal Dereziński, Miles E. Lopes, Tianyu Liang, Hengrui Luo, and Jack Dongarra. Randomized numerical linear algebra: A perspective on the field with an eye to software, 2023.
[21] Aravind Reddy, Zhao Song, and Lichen Zhang. Dynamic tensor product regression. In Advances in Neural Information Processing Systems, volume 35, pages 4791-4804. Curran Associates, Inc., 2022.
[22] Feras A. Saad, Cameron E. Freer, Martin C. Rinard, and Vikash K. Mansinghka. Optimal approximate sampling from discrete probability distributions. Proceedings of the ACM on Programming Languages, 4(POPL):1-31, January 2020. ISSN 2475-1421. doi: 10.1145/3371104.
[23] N.D. Sidiropoulos and R.S. Budampati. Khatri-Rao space-time codes. IEEE Transactions on Signal Processing, 50(10):2396-2407, 2002. doi: 10.1109/TSP.2002.803341.
[24] Shaden Smith and George Karypis. SPLATT: The Surprisingly ParalleL spArse Tensor Toolkit. https://github.com/ShadenSmith/splatt, 2016.
[25] Shaden Smith, Jee W. Choi, Jiajia Li, Richard Vuduc, Jongsoo Park, Xing Liu, and George Karypis. FROSTT: The formidable repository of open sparse tensors and tools, 2017. URL http://frostt.io/.