Fetching the paper…
Reading the bibliography…
The Kronecker product is an important matrix operation with a wide range of applications in supporting fast linear transforms, including signal processing, graph theory, quantum computing and deep learning.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
A bound on tail probabilities for quadratic forms in independent random variables
D. L. Hanson and F. T. Wright · 1971
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
William B. Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
Fast fourier transforms for nonequispaced data
A. Dutt and V. Rokhlin · 1993
Earlier work this paper cites.
Constructive Approximation (Advanced Problems)
George G. Lorentz, Manfred V. Golitschek, and Yuly Makovoz · 1996
Earlier work this paper cites.
Quantum wavelet transforms: Fast algorithms and complete circuits
Amir Fijany and Colin P. Williams · 1998
Earlier work this paper cites.
Concentration inequalities using the entropy method
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2003
Earlier work this paper cites.
An elementary proof of a theorem of Johnson and Lindenstrauss
Sanjoy Dasgupta and Anupam Gupta · 2003
Earlier work this paper cites.
Finding frequent items in data streams
Moses Charikar, Kevin C. Chen, and Martin Farach-Colton · 2004
Earlier work this paper cites.
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Nir Ailon and Bernard Chazelle · 2006
Earlier work this paper cites.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Emmanuel J. Candès, Justin Romberg, and Terence Tao · 2006
Earlier work this paper cites.
Near-optimal signal recovery from random projections: universal encoding strategies?
Emmanuel J. Candes and Terence Tao · 2006
Earlier work this paper cites.
A simple proof of the restricted isometry property for random matrices
Richard Baraniuk, Mark Davenport, Ronald DeVore, and Michael Wakin · 2008
Earlier work this paper cites.
On sparse reconstruction from Fourier and Gaussian measurements
Mark Rudelson and Roman Vershynin · 2008
Earlier work this paper cites.
The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
Nir Ailon and Bernard Chazelle · 2009
Cited alongside, same era.
Kronecker graphs: An approach to modeling networks
Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani · 2010
Cited alongside, same era.
Compressive sensing and structured random matrices
Holger Rauhut · 2010
Cited alongside, same era.
New and improved johnson-lindenstrauss embeddings via the restricted isometry property
F. Krahmer and R. Ward · 2011
Cited alongside, same era.
Kronecker compressive sensing
M. F. Duarte and R. G. Baraniuk · 2012
Cited alongside, same era.
An almost optimal unrestricted fast johnson-lindenstrauss transform
Nir Ailon and Edo Liberty · 2013
Cited alongside, same era.
Optimizing Neural Networks with Kronecker-factored Approximate Curvature
James Martens and Roger. Grosse · 2015
Later among the works it cites.
The restricted isometry property of subsampled fourier matrices
Ishay Haviv and Oded Regev · 2016
Later among the works it cites.
Optimality of the Johnson-Lindenstrauss Lemma
K. G. Larsen and J. Nelson · 2017
Later among the works it cites.
A practical randomized CP tensor decomposition
Casey Battaglino, Grey Ballard, and Tamara G. Kolda · 2018
Later among the works it cites.
Sketching for Kronecker Product Regression and P-splines
Huaian Diao, Zhao Song, Wen Sun, and David P. Woodruff · 2018
Later among the works it cites.
Tensor random projection for low memory dimension reduction
Yiming Sun, Yang Guo, Joel A Tropp, and Madeleine Udell · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Restricted isometry of Fourier matrices and list decodability of random linear codes
Mahdi Cheraghchi, Venkatesan Guruswami, and Ameya Velingker · 2013
Cited alongside, same era.
A mathematical introduction to compressive sensing
Simon Foucart and Holger Rauhut · 2013
Cited alongside, same era.
Fast and scalable polynomial kernels via explicit feature maps
Ninh Pham and Rasmus Pagh · 2013
Cited alongside, same era.
Subspace embeddings for the polynomial kernel
Haim Avron, Huy Nguyen, and David Woodruff · 2014
Cited alongside, same era.
An improved estimate in the restricted isometry problem
Jean Bourgain · 2014
Cited alongside, same era.
Suprema of chaos processes and the restricted isometry property
Felix Krahmer, Shahar Mendelson, and Holger Rauhut · 2014
Cited alongside, same era.
Matlab tensor toolbox version 3.1
Brett W. Bader, Tamara G. Kolda, et al · 2019
Closest in time.
Structured random sketching for PDE inverse problems
Ke Chen, Qin Li, Kit Newton, and Steve Wright · 2019
Closest in time.
Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
M. A. Iwen, D. Needell, E. Rebrova, and A. Zare · 2019
Closest in time.
Sparse sampling for inverse problems with tensors
G. Ortiz-Jimenez, M. Coutino, S. P. Chepuri, and G. Leus · 2019
Closest in time.
Oblivious sketching of high-degree polynomial kernels
Thomas D. Ahle, Michael Kapralov, Jakob Bæk Tejs Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, and Amir Zandieh · 2020
Closest in time.
Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition
Brett W. Larsen and Tamara G. Kolda · 2020
Closest in time.
Guarantees for the kronecker fast johnson-lindenstrauss transform using a coherence and sampling argument
Osman A. Malik and Stephen Becker · 2020
Closest in time.