Fetching the paper…
Reading the bibliography…
We study the Kronecker product regression problem, in which the design matrix is a Kronecker product of two or more matrices.
Computational frameworks for the fast Fourier transform
Charles F Van Loan · 1992
Earlier work this paper cites.
Approximation with Kronecker products
Charles F Van Loan and N. Pitsianis · 1993
Earlier work this paper cites.
The ubiquitous kronecker product
Charles F Van Loan · 2000
Earlier work this paper cites.
Finding frequent items in data streams
Moses Charikar, Kevin Chen, and Martin Farach-Colton · 2004
Earlier work this paper cites.
Subgradient and sampling algorithms for ℓ 1 \ell_{1} regression
Kenneth L Clarkson · 2005
Earlier work this paper cites.
An improved data stream summary: the count-min sketch and its applications
Graham Cormode and Shan Muthukrishnan · 2005
Earlier work this paper cites.
A method for structured linear total least norm on blind deconvolution problem
S. Oh, S. Kwon and J. Yun · 2005
Earlier work this paper cites.
Multidimensional density smoothing with p-splines
Paul HC Eilers and Brian D Marx · 2006
Earlier work this paper cites.
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Piotr Indyk · 2006
Earlier work this paper cites.
Stable distributions
John P Nolan · 2007
Earlier work this paper cites.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Earlier work this paper cites.
Sampling algorithms and coresets for ℓ p \ell_{p} regression
Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael W Mahoney · 2009
Earlier work this paper cites.
Local rank inference for varying coefficient models
Lan Wang, Bo Kai, and Runze Li · 2009
Earlier work this paper cites.
Weighted wilcoxon-type smoothly clipped absolute deviation method
Lan Wang and Runze Li · 2009
Earlier work this paper cites.
On the exact space complexity of sketching and streaming small norms
Daniel M Kane, Jelani Nelson, and David P Woodruff · 2010
Earlier work this paper cites.
Streaming algorithms via precision sampling
Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak · 2011
Earlier work this paper cites.
Fast moment estimation in data streams in optimal space
Daniel M Kane, Jelani Nelson, Ely Porat, and David P Woodruff · 2011
Earlier work this paper cites.
Randomized algorithms for matrices and data
Michael W. Mahoney · 2011
Earlier work this paper cites.
Subspace embeddings for the ℓ 1 \ell_{1} -norm with applications
Christian Sohler and David P Woodruff · 2011
Earlier work this paper cites.
Joshua Batson, Daniel A Spielman, and Nikhil Srivastava · 2012
Earlier work this paper cites.
The fast cauchy transform and faster robust linear regression
Kenneth L Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W Mahoney, Xiangrui Meng, and David P Woodruff · 2013
Earlier work this paper cites.
Low rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2013
Earlier work this paper cites.
Matrix computations
Gene H. Golub and Charles F. Van Loan · 2013
Cited alongside, same era.
Xiangrui Meng and Michael W Mahoney · 2013
Cited alongside, same era.
Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L Nguyên · 2013
Cited alongside, same era.
Optimal CUR matrix decompositions
Christos Boutsidis and David P Woodruff · 2014
Cited alongside, same era.
Sparser johnson-lindenstrauss transforms
Daniel M Kane and Jelani Nelson · 2014
Cited alongside, same era.
An homotopy method for ℓ p \ell_{p} regression provably beyond self-concordance and in input-sparsity time
Sébastien Bubeck, Michael B Cohen, Yin Tat Lee, and Yuanzhi Li · 2018
Later among the works it cites.
Sublinear time low-rank approximation of distance matrices
Ainesh Bakshi and David Woodruff · 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.
Perfect lp sampling in a data stream
Rajesh Jayaram and David P Woodruff · 2018
Later among the works it cites.
Towards a zero-one law for entrywise low rank approximation
Zhao Song, David P Woodruff, and Peilin Zhong · 2018
Later among the works it cites.
A tuning-free robust and efficient approach to high-dimensional regression
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Path finding methods for linear programming: Solving linear programs in O ( r a n k ) {O}(\sqrt{rank}) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Cited alongside, same era.
Sketching as a tool for numerical linear algebra
David P. Woodruff · 2014
Cited alongside, same era.
Dimensionality reduction for k-means clustering and low rank approximation
Michael B Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu · 2015
Cited alongside, same era.
Input sparsity and hardness for robust subspace approximation
Kenneth L Clarkson and David P Woodruff · 2015
Cited alongside, same era.
Sketching for m-estimators: A unified approach to robust regression
Kenneth L Clarkson and David P Woodruff · 2015
Cited alongside, same era.
Efficient inverse maintenance and faster algorithms for linear programming
Yin Tat Lee and Aaron Sidford · 2015
Cited alongside, same era.
Optimal principal component analysis in distributed and streaming models
Christos Boutsidis, David P Woodruff, and Peilin Zhong · 2016
Cited alongside, same era.
Lan Wang, Bo Peng, Jelena Bradic, Runze Li, and Yunan Wu · 2018
Later among the works it cites.
Iterative refinement for ℓ p \ell_{p} -norm regression
Deeksha Adil, Rasmus Kyng, Richard Peng, and Sushant Sachdeva · 2019
Closest in time.
A ptas for ℓ p \ell_{p} -low rank approximation
Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, and David P Woodruff · 2019
Closest in time.
Solving linear programs in the current matrix multiplication time
Michael B Cohen, Yin Tat Lee, and Zhao Song · 2019
Closest in time.
Sample-optimal low-rank approximation of distance matrices
Piotr Indyk, Ali Vakilian, Tal Wagner, and David P. Woodruff · 2019
Closest in time.
Solving empirical risk minimization in the current matrix multiplication time
Yin Tat Lee, Zhao Song, and Qiuyi Zhang · 2019
Closest in time.
Stronger L2/L2 compressed sensing; without iterating
Vasileios Nakos and Zhao Song · 2019
Closest in time.
Average case column subset selection for entrywise ℓ 1 \ell_{1} -norm loss
Zhao Song, David P Woodruff, and Peilin Zhong · 2019
Closest in time.
Relative error tensor low rank approximation
Zhao Song, David P Woodruff, and Peilin Zhong · 2019
Closest in time.
Towards a zero-one law for column subset selection
Zhao Song, David P Woodruff, and Peilin Zhong · 2019
Closest in time.
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
M.J. Wainwright · 2019
Closest in time.
A new tuning-free approach to high-dimensional regression
Lan Wang · 2019
Closest in time.
Personal communication
Lan Wang · 2019
Closest in time.
Tight bounds for ℓ p \ell_{p} oblivious subspace embeddings
Ruosong Wang and David P Woodruff · 2019
Closest in time.
Oblivious sketching of high-degree polynomial kernels
Thomas D. Ahle, Michael Kapralov, Jakob B. T. Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, and Amir Zandieh · 2020
Closest in time.
A deterministic linear program solver in current matrix multiplication time
Jan van den Brand · 2020
Closest in time.