A fast randomized algorithm for overdetermined linear least-squares regression
From MaRDI portal
Recommendations
Cited in
(81)- Randomized LU decomposition
- Fast model-fitting of Bayesian variable selection regression using the iterative complex factorization algorithm
- New tests of uniformity on the compact classical groups as diagnostics for weak-\(^{*}\) mixing of Markov chains
- Unbiased predictive risk estimation of the Tikhonov regularization parameter: convergence with increasing rank approximations of the singular value decomposition
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten p-norms
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Surface temperature monitoring in liver procurement via functional variance change-point analysis
- A randomized method for solving discrete ill-posed problems
- Randomized core reduction for discrete ill-posed problem
- Randomized generalized singular value decomposition
- Tikhonov regularization and randomized GSVD
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- A fast randomized algorithm for orthogonal projection
- General error estimates for the Longstaff-Schwartz least-squares Monte Carlo algorithm
- Compressed and Penalized Linear Regression
- Sampling algorithms for l₂ regression and applications
- scientific article; zbMATH DE number 3960951 (Why is no real title available?)
- Random design analysis of ridge regression
- Randomized algorithms in numerical linear algebra
- Fast spatial Gaussian process maximum likelihood estimation via skeletonization factorizations
- Scalable approximations for generalized linear problems
- A Practical Randomized CP Tensor Decomposition
- Optimal subsampling for large sample logistic regression
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Tensor-structured sketching for constrained least squares
- Semi-Infinite Linear Regression and Its Applications
- Some comments on preconditioning for normal equations and least squares
- Stochastic reformulations of linear systems: algorithms and convergence theory
- Structured random sketching for PDE inverse problems
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- scientific article; zbMATH DE number 6402625 (Why is no real title available?)
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- Random reordering in SOR-type methods
- Subspace Iteration Randomization and Singular Value Problems
- Fast randomized iteration: diffusion Monte Carlo through the Lens of numerical linear algebra
- Sketching for principal component regression
- Randomized numerical linear algebra: Foundations and algorithms
- Generative modeling via tensor train sketching
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Solution of the EEG inverse problem by random dipole sampling
- Preconditioners for Krylov subspace methods: An overview
- Fast randomized numerical rank estimation for numerically low-rank matrices
- Randomized Nyström Preconditioning
- XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation
- Faster least squares approximation
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
- Fast and forward stable randomized algorithms for linear least-squares problems
- A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format
- Randomized sketching of nonlinear eigenvalue problems
- Efficient bounds and estimates for canonical angles in randomized subspace approximations
- Krylov subspace recycling with randomized sketching for matrix functions
- High-precision randomized preconditioned iterative methods for the random feature method
- \(S^{\top}S\)-SVD via sketching and the nearest \(S^{\top}S\)-orthogonal matrix
- A unified convergence analysis of random sketch methods for rank deficient linear systems
- Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers
- Fine-grained analysis and faster algorithms for iteratively solving linear systems
- TT-LSQR for tensor least squares problems and application to data mining
- Least squares and the not-normal equations
- On the randomized multiple row-action methods for solving linear least-squares problems
- Analysis of randomized Householder-Cholesky QR factorization with multisketching
- Mixed precision sketching for least-squares problems and its application in GMRES-based iterative refinement
- CholeskyQR with randomization and pivoting for tall matrices (CQRRPT)
- Truncated LSQR for matrix least squares problems
- Surrogate-based autotuning for randomized sketching algorithms in regression problems
- A comparison of mixed precision iterative refinement approaches for least-squares problems
- Sketched and truncated polynomial Krylov subspace methods: matrix Sylvester equations
- Randomized block Gram-Schmidt process for the solution of linear systems and eigenvalue problems
- Linear discriminant analysis with the randomized Kaczmarz method
- Training (overparametrized) neural networks in near-linear time
- Preconditioning without a preconditioner using randomized block Krylov subspace methods
- Randomized Householder QR
- librla: Randomized Linear Algebra Library
- Stable algorithms for general linear systems by preconditioning the normal equations
- Robust, randomized preconditioning for kernel ridge regression
This page was built for publication: A fast randomized algorithm for overdetermined linear least-squares regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073999)
