scientific article; zbMATH DE number 6982974
From MaRDI portal
Publication:4558555
zbMath1473.62253arXiv1702.04837MaRDI QIDQ4558555
Michael W. Mahoney, Alex Gittens, Shu-Sen Wang
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1702.04837
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ridge regression; shrinkage estimators (Lasso) (62J07) Random matrices (probabilistic aspects) (60B20)
Related Items (17)
On principal components regression, random projections, and column subsampling ⋮ Functional principal subspace sampling for large scale functional data analysis ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Sketch-based empirical natural gradient methods for deep learning ⋮ Unnamed Item ⋮ RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression ⋮ Distributed learning for sketched kernel regression ⋮ Sketched approximation of regularized canonical correlation analysis ⋮ Optimal subsampling for functional quantile regression ⋮ Sketching for Principal Component Regression ⋮ An investigation of Newton-Sketch and subsampled Newton methods ⋮ Reduced rank regression with matrix projections for high-dimensional multivariate linear regression model ⋮ Randomized sketches for kernel CCA ⋮ Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms ⋮ Approximate nonparametric quantile regression in reproducing kernel Hilbert spaces via random projection ⋮ On nonparametric randomized sketches for kernels with further smoothness ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random design analysis of ridge regression
- Faster least squares approximation
- A fast randomized algorithm for the approximation of matrices
- Sketching meets random projection in the dual: a provable recovery algorithm for big and high-dimensional data
- Finding frequent items in data streams
- Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates
- Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
- Computational Advertising: Techniques for Targeting Relevant Ads
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Randomized Algorithms for Matrices and Data
- Low-Rank Approximation and Regression in Input Sparsity Time
- Extensions of Lipschitz mappings into a Hilbert space
- Sampling algorithms for l2 regression and applications
- Relative-Error $CUR$ Matrix Decompositions
- Random Projections for Large-Scale Regression
- On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models
- Sharper Bounds for Regularized Data Fitting
- The Power of Simple Tabulation Hashing
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
This page was built for publication:
