Fast quantum algorithms for least squares regression and statistic leverage scores
From MaRDI portal
Publication:507434
DOI10.1016/j.tcs.2016.05.044zbMath1356.68078OpenAlexW2412592673MaRDI QIDQ507434
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.044
Linear regression; mixed models (62J05) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (7)
Quantum regularized least squares solver with parameter estimate ⋮ Quantum kernel logistic regression based Newton method ⋮ Quantum radial basis function method for scattered data interpolation ⋮ An improved quantum algorithm for support matrix machines ⋮ A survey on HHL algorithm: from theory to application in quantum machine learning ⋮ Unnamed Item ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CUR matrix decompositions for improved data analysis
- Faster least squares approximation
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Influential observations, high leverage points, and outliers in linear regression
- The truncated SVD as a method for regularization
- Exact matrix completion via convex optimization
- Low-Rank Approximation and Regression in Input Sparsity Time
- Relative-Error $CUR$ Matrix Decompositions
- The Hat Matrix in Regression and ANOVA
- Quantum algorithms revisited
- Tikhonov Regularization and Total Least Squares
This page was built for publication: Fast quantum algorithms for least squares regression and statistic leverage scores