Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
From MaRDI portal
Publication:5495779
DOI10.1145/2488608.2488621zbMath1293.68150arXiv1210.3135OpenAlexW2134342155MaRDI QIDQ5495779
Xiangrui Meng, Michael W. Mahoney
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.3135
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (33)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Spectral estimation from simulations via sketching ⋮ A User-Friendly Computational Framework for Robust Structured Regression with the L2 Criterion ⋮ Sparser Johnson-Lindenstrauss Transforms ⋮ An efficient algorithm for computing the approximate t-URV and its applications ⋮ Sampling Lasso quantile regression for large-scale data ⋮ Sharper Bounds for Regularized Data Fitting ⋮ Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation ⋮ Unnamed Item ⋮ Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions ⋮ Optimal subsampling for large‐sample quantile regression with massive data ⋮ Randomized algorithms in numerical linear algebra ⋮ Principled interpolation of Green's functions learned from data ⋮ Unnamed Item ⋮ Practical Sketching Algorithms for Low-Rank Matrix Approximation ⋮ On randomized sketching algorithms and the Tracy-Widom law ⋮ Erasure Coding for Fault-Oblivious Linear System Solvers ⋮ Single Pass Spectral Sparsification in Dynamic Streams ⋮ Optimal CUR Matrix Decompositions ⋮ Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces ⋮ Quantile regression for large-scale data via sparse exponential transform method ⋮ Structured Random Sketching for PDE Inverse Problems ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ Unnamed Item ⋮ A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation ⋮ On Approximating Matrix Norms in Data Streams ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Unnamed Item ⋮ Tensor-Structured Sketching for Constrained Least Squares ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching
Uses Software
This page was built for publication: Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
