Fetching the paper…
Reading the bibliography…
We create classical (non-quantum) dynamic data structures supporting queries for recommender systems and least-squares regression that are comparable to their quantum analogues.
Adaptive estimation of a quadratic functional by model selection
B. Laurent and P. Massart · 2000
Earlier work this paper cites.
Fast Monte-Carlo algorithms for finding low-rank approximations
Alan M. Frieze, Ravi Kannan, and Santosh Vempala · 2004
Earlier work this paper cites.
Subgradient and sampling algorithms for ℓ 1 \ell_{1} regression
Kenneth L Clarkson · 2005
Earlier work this paper cites.
Subspace sampling and relative-error matrix approximation: Column-based methods
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 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.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Earlier work this paper cites.
A fast randomized algorithm for overdetermined linear least-squares regression
Vladimir Rokhlin and Mark Tygert · 2008
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
Spectral algorithms
Ravi Kannan and Santosh S. Vempala · 2009
Earlier work this paper cites.
Randomized algorithms for matrices and data
Michael W. Mahoney · 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.
OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L Nguyên · 2013
Earlier work this paper cites.
Quantum principal component analysis
Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost · 2014
Earlier work this paper cites.
Quantum support vector machine for big data classification
Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd · 2014
Earlier work this paper cites.
Sketching as a tool for numerical linear algebra
David P. Woodruff · 2014
Earlier work this paper cites.
Hamiltonian simulation with nearly optimal dependence on all parameters
D. W. Berry, A. M. Childs, and R. Kothari · 2015
Earlier work this paper cites.
Dimensionality reduction for k-means clustering and low rank approximation
Michael B Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu · 2015
Earlier work this paper cites.
L p L_{p} row sampling by Lewis weights
Michael B Cohen and Richard Peng · 2015
Earlier work this paper cites.
Input sparsity and hardness for robust subspace approximation
Kenneth L Clarkson and David P Woodruff · 2015
Earlier work this paper cites.
Cargese lecture notes
Nisheeth Vishnoi · 2015
Earlier work this paper cites.
Optimal principal component analysis in distributed and streaming models
Christos Boutsidis, David P Woodruff, and Peilin Zhong · 2016
Earlier work this paper cites.
Quantum discriminant analysis for dimensionality reduction and classification
Iris Cong and Luming Duan · 2016
Cited alongside, same era.
The movielens datasets: History and context
F. Maxwell Harper and Joseph A. Konstan · 2016
Cited alongside, same era.
Quantum recommendation systems
Iordanis Kerenidis and Anupam Prakash · 2016
Cited alongside, same era.
Quantum algorithms for topological and geometric analysis of data
Seth Lloyd, Silvano Garnerone, and Paolo Zanardi · 2016
Cited alongside, same era.
Sharper bounds for regularized data fitting
Haim Avron, Kenneth L. Clarkson, and David P. Woodruff · 2017
Cited alongside, same era.
Input sparsity time low-rank approximation via ridge leverage score sampling
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Later among the works it cites.
Sample-optimal low-rank approximation of distance matrices
Piotr Indyk, Ali Vakilian, Tal Wagner, and David Woodruff · 2019
Later among the works it cites.
Sublinear time numerical linear algebra for structured matrices
Xiaofei Shi and David P Woodruff · 2019
Later among the works it cites.
Relative error tensor low rank approximation
Zhao Song, David P Woodruff, and Peilin Zhong · 2019
Later among the works it cites.
A quantum-inspired classical algorithm for recommendation systems
Ewin Tang · 2019
Later among the works it cites.
Improvements in Quantum SDP-Solving with Applications
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Michael B Cohen, Cameron Musco, and Christopher Musco · 2017
Cited alongside, same era.
Low rank approximation and regression in input sparsity time
Kenneth L Clarkson and David P Woodruff · 2017
Cited alongside, same era.
Randomized algorithms in numerical linear algebra
Ravindran Kannan and Santosh Vempala · 2017
Cited alongside, same era.
Sublinear time low-rank approximation of positive semidefinite matrices
Cameron Musco 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.
Sublinear time low-rank approximation of distance matrices
Ainesh Bakshi and David Woodruff · 2018
Cited alongside, same era.
Quantum-inspired sublinear classical algorithms for solving low-rank linear systems
Nai-Hui Chia, Han-Hsuan Lin, and Chunhao Wang · 2018
Cited alongside, same era.
Joran van Apeldoorn and András Gilyén · 2019
Later among the works it cites.
Tight bounds for ℓ p \ell_{p} oblivious subspace embeddings
Ruosong Wang and David P Woodruff · 2019
Later among the works it cites.
Quantum-assisted gaussian process regression
Zhikuan Zhao, Jack K. Fitzsimons, and Joseph F. Fitzsimons · 2019
Later among the works it cites.
Quantum-inspired algorithms in practice
Juan Miguel Arrazola, Alain Delgado, Bhaskar Roy Bardhan, and Seth Lloyd · 2020
Closest in time.
Testing positive semi-definiteness via random submatrices
Ainesh Bakshi, Nadiia Chepurko, and Rajesh Jayaram · 2020
Closest in time.
Training (overparametrized) neural networks in near-linear time
Jan van den Brand, Binghui Peng, Zhao Song, and Omri Weinstein · 2020
Closest in time.
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
Nai-Hui Chia, András Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, and Chunhao Wang · 2020
Closest in time.
A non-review of quantum machine learning: trends and explorations
Vedran Dunjko and Peter Wittek · 2020
Closest in time.
An improved quantum-inspired algorithm for linear regression
András Gilyén, Zhao Song, and Ewin Tang · 2020
Closest in time.
An improved quantum-inspired algorithm for linear regression
András Gilyén, Zhao Song, and Ewin Tang · 2020
Closest in time.
A faster interior point method for semidefinite programming
Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, and Zhao Song · 2020
Closest in time.
Faster dynamic matrix inverse for faster LPs
Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang · 2020
Closest in time.
Low-rank toeplitz matrix estimation via random ultra-sparse rulers
Hannah Lawrence, Jerry Li, Cameron Musco, and Christopher Musco · 2020
Closest in time.
Input-sparsity low rank approximation in Schatten norm
Yi Li and David Woodruff · 2020
Closest in time.
Near-optimal algorithms for linear algebra in the current matrix multiplication time
Nadiia Chepurko, Kenneth L Clarkson, Praneeth Kacham, and David P Woodruff · 2022
Closest in time.