Fetching the paper…
Reading the bibliography…
In this work, we initiate the study of \emph{Dynamic Tensor Product Regression}.
Principia mathematica
Alfred North Whitehead and Bertrand Russell · 1912
Earlier work this paper cites.
Theory and application of digital signal processing
L. R. Rabiner, B. Go ld, and C. K. Yuen · 1978
Earlier work this paper cites.
Gauss and the Invention of Least Squares
Stephen M. Stigler · 1981
Earlier work this paper cites.
Flexible smoothing with b-splines and penalties
Paul HC Eilers and Brian D Marx · 1996
Earlier work this paper cites.
The ubiquitous kronecker product
Charles F Van Loan · 2000
Earlier work this paper cites.
Spline Regression Models
L.C. Marsh and D.R. Cormier · 2001
Earlier work this paper cites.
Finding frequent items in data streams
Moses Charikar, Kevin Chen, and Martin Farach-Colton · 2002
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A Spielman and Shang-Hua Teng · 2004
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.
Kronecker product approximation for preconditioning in three-dimensional imaging applications
James G Nagy and Misha Elena Kilmer · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
Tamás Sarlós · 2006
Earlier work this paper cites.
Kronecker graphs: an approach to modeling networks
Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani · 2010
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
Earlier work this paper cites.
Faster ridge regression via the subsampled randomized hadamard transform
Yichao Lu, Paramveer Dhillon, Dean P Foster, and Lyle Ungar · 2013
Earlier work this paper cites.
Navigating central path with electrical flows: From flows to matchings, and back
Aleksander Madry · 2013
Earlier work this paper cites.
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Xiangrui Meng and Michael W Mahoney · 2013
Earlier work this paper cites.
Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L Nguyên · 2013
Earlier work this paper cites.
Compressed matrix multiplication
Rasmus Pagh · 2013
Earlier work this paper cites.
Fast and scalable polynomial kernels via explicit feature maps
Ninh Pham and Rasmus Pagh · 2013
Earlier work this paper cites.
Optimal cur matrix decompositions
Christos Boutsidis and David P Woodruff · 2014
Earlier work this paper cites.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
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.
Optimal principal component analysis in distributed and streaming models
Christos Boutsidis, David P Woodruff, and Peilin Zhong · 2016
Cited alongside, same era.
Computing maximum flow with augmenting electrical flows
Aleksander Madry · 2016
Cited alongside, same era.
Weighted low rank approximations with provable guarantees
Ilya Razenshteyn, Zhao Song, and David P. Woodruff · 2016
Cited alongside, same era.
Distributed low rank approximation of implicit functions of a matrix
David P Woodruff and Peilin Zhong · 2016
Cited alongside, same era.
A faster interior point method for semidefinite programming
Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, and Zhao Song · 2020
Later among the works it cites.
An improved cutting plane method for convex optimization, convex-concave games and its applications
Haotian Jiang, Yin Tat Lee, Zhao Song, and Sam Chiu-wai Wong · 2020
Later among the works it cites.
Planning with general objective functions: Going beyond total rewards
Ruosong Wang, Peilin Zhong, Simon S Du, Russ R Salakhutdinov, and Lin F Yang · 2020
Later among the works it cites.
Training (overparametrized) neural networks in near-linear time
Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein · 2021
Later among the works it cites.
Almost linear time density level set estimation via dbscan
Hossein Esfandiari, Vahab Mirrokni, and Peilin Zhong · 2021
Later among the works it cites.
Solving sdp faster: A robust ipm framework and efficient implementation, 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sharper bounds for regularized data fitting
Haim Avron, Kenneth L. Clarkson, and David P. Woodruff · 2017
Cited alongside, same era.
Near optimal sketching of low-rank tensor regression
Jarvis Haupt, Xingguo Li, and David P Woodruff · 2017
Cited alongside, same era.
Low rank approximation with entrywise ℓ 1 \ell_{1} -norm error
Zhao Song, David P Woodruff, and Peilin Zhong · 2017
Cited alongside, same era.
Subspace embedding and linear regression with orlicz norm
Alexandr Andoni, Chengyu Lin, Ying Sheng, Peilin Zhong, and Ruiqi Zhong · 2018
Cited alongside, same era.
Sketching for kronecker product regression and p-splines
Huaian Diao, Zhao Song, Wen Sun, and David Woodruff · 2018
Cited alongside, same era.
Bourgan: generative networks with metric embeddings
Chang Xiao, Peilin Zhong, and Changxi Zheng · 2018
Cited alongside, same era.
Baihe Huang, Shunhua Jiang, Zhao Song, Runzhou Tao, and Ruizhe Zhang · 2021
Later among the works it cites.
Faster dynamic matrix inverse for faster lps
Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang · 2021
Later among the works it cites.
Optimal ℓ 1 \ell_{1} column subset selection and a fast ptas for low rank approximation
Arvind V. Mahankali and David P. Woodruff · 2021
Later among the works it cites.
Shapeshifter: a parameter-efficient transformer using factorized reshaped matrices
Aliakbar Panahi, Seyran Saeedi, and Tom Arodz · 2021
Later among the works it cites.
Sublinear least-squares value iteration via locality sensitive hashing
Anshumali Shrivastava, Zhao Song, and Zhaozhuo Xu · 2021
Later among the works it cites.
Fast sketching of polynomial kernels of polynomial degree
Zhao Song, David P. Woodruff, Zheng Yu, and Lichen Zhang · 2021
Later among the works it cites.
Oblivious sketching-based central path method for solving linear programming problems
Zhao Song and Zheng Yu · 2021
Later among the works it cites.
Does preprocessing help training over-parameterized neural networks?
Zhao Song, Shuo Yang, and Ruizhe Zhang · 2021
Later among the works it cites.
Training multi-layer over-parametrized neural network in subquadratic time
Zhao Song, Lichen Zhang, and Ruizhe Zhang · 2021
Later among the works it cites.
Breaking the linear iteration cost barrier for some well-known conditional gradient methods using maxip data-structures
Zhaozhuo Xu, Zhao Song, and Anshumali Shrivastava · 2021
Later among the works it cites.
Dynamic algorithms against an adaptive adversary: Generic constructions and lower bounds
Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, and Uri Stemmer · 2022
Closest in time.
Symmetric sparse boolean matrix factorization and applications
Sitan Chen, Zhao Song, Runzhou Tao, and Ruizhe Zhang · 2022
Closest in time.
Subquadratic kronecker regression with applications to tensor decomposition
Matthew Fahrbach, Thomas Fu, and Mehrdad Ghadiri · 2022
Closest in time.
Dynamic least-squares regression
Shunhua Jiang, Binghui Peng, and Omri Weinstein · 2022
Closest in time.
One-pass algorithms for map inference of nonsymmetric determinantal point processes
Aravind Reddy, Ryan A Rossi, Zhao Song, Anup Rao, Tung Mai, Nedim Lipka, Gang Wu, Eunyee Koh, and Nesreen Ahmed · 2022
Closest in time.
Improved algorithms for low rank approximation from sparsity
David P Woodruff and Taisuke Yasuda · 2022
Closest in time.