Compressed and Penalized Linear Regression
From MaRDI portal
Publication:3391428
DOI10.1080/10618600.2019.1660179OpenAlexW2619002440MaRDI QIDQ3391428
Daniel J. McDonald, Darren Homrighausen
Publication date: 28 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.08036
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Faster least squares approximation
- ``Preconditioning for feature selection and regression in high-dimensional problems
- Estimation of the mean of a multivariate normal distribution
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- A sparse Johnson
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Computational Advertising: Techniques for Targeting Relevant Ads
- A fast randomized algorithm for overdetermined linear least-squares regression
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Sparser Johnson-Lindenstrauss Transforms
- How Biased is the Apparent Error Rate of a Prediction Rule?
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Compressed and Privacy-Sensitive Sparse Regression
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Some Comments on C P
- Prediction by Supervised Principal Components
This page was built for publication: Compressed and Penalized Linear Regression
