Pages that link to "Item:Q3177880"

The following pages link to Low-Rank Approximation and Regression in Input Sparsity Time (Q3177880):

Displaying 50 items.

• Random projections for Bayesian regression (Q144017) (← links)
• Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
• Fast quantum algorithms for least squares regression and statistic leverage scores (Q507434) (← links)
• Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss (Q683720) (← links)
• Matrix sketching for supervised classification with imbalanced classes (Q832649) (← links)
• Randomized LU decomposition (Q1690696) (← links)
• Regression-aware decompositions (Q1736216) (← links)
• An improvement of the parameterized frequent directions algorithm (Q1741237) (← links)
• Randomized LU decomposition using sparse projections (Q2012724) (← links)
• Fast randomized matrix and tensor interpolative decomposition using countsketch (Q2025436) (← links)
• Sparse random matrices have simple spectrum (Q2028938) (← links)
• Randomized block Krylov subspace methods for trace and log-determinant estimators (Q2045172) (← links)
• An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
• Tail bounds for gaps between eigenvalues of sparse random matrices (Q2076604) (← links)
• Spectral estimation from simulations via sketching (Q2133499) (← links)
• Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
• An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
• Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
• Adaptive iterative Hessian sketch via \(A\)-optimal subsampling (Q2195850) (← links)
• Sublinear update time randomized algorithms for dynamic graph regression (Q2245047) (← links)
• A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems (Q2245100) (← links)
• Small-deviation inequalities for sums of random matrices (Q2338012) (← links)
• Low-complexity \(l_0\)-norm penalized shrinkage linear and widely linear affine projection algorithms (Q2405550) (← links)
• Structural conditions for projection-cost preservation via randomized matrix multiplication (Q2419040) (← links)
• The fast Cauchy transform and faster robust linear regression (Q2812147) (← links)
• Frequent directions: simple and deterministic matrix sketching (Q2821796) (← links)
• Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
• Optimal CUR Matrix Decompositions (Q2968164) (← links)
• Randomized Local Model Order Reduction (Q3174769) (← links)
• Low-Rank Approximation and Regression in Input Sparsity Time (Q3177880) (← links)
• Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• Massively parallel entity matching with linear classification in low dimensional space (Q3305368) (← links)
• Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores (Q3452567) (← links)
• (Q4558165) (← links)
• (Q4558543) (← links)
• (Q4558555) (← links)
• Low-Rank PSD Approximation in Input-Sparsity Time (Q4575882) (← links)
• Randomized algorithms in numerical linear algebra (Q4594242) (← links)
• Max-Plus Algebraic Statistical Leverage Scores (Q4598335) (← links)
• Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (Q4610132) (← links)
• Optimal Bounds for Johnson-Lindenstrauss Transformations (Q4614115) (← links)
• (Q4614128) (← links)
• (Q4633019) (← links)
• (Q4633051) (← links)
• (Q4633059) (← links)
• (Q4633078) (← links)
• Optimal Subsampling for Large Sample Logistic Regression (Q4962448) (← links)
• (Q4969259) (← links)