New subset selection algorithms for low rank approximation: offline and online

Cites Work

Relative-Error $CUR$ Matrix Decompositions
Sampling Algorithms and Coresets for $\ell_p$ Regression
Sketching for M-Estimators: A Unified Approach to Robust Regression
Fast monte-carlo algorithms for finding low-rank approximations
Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
Basic concepts in the geometry of Banach spaces
Profit-earning facility location
An algorithm for online $k$-means clustering
A unified framework for approximating and clustering data
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Univariate stable distributions. Models for heavy tailed data
Finite dimensional subspaces of $L_{p}$
Subgradient and sampling algorithms for $\ell_1$ regression
Sampling-based dimension reduction for subspace approximation
Adaptive Sampling and Fast Low-Rank Matrix Approximation
Algorithms and hardness for subspace approximation
On the complexity of robust PCA and $\ell_1$-norm low-rank matrix approximation
Minimum-volume ellipsoids. Theory and algorithms
A PTAS for ℓ_p-Low Rank Approximation
A new coreset framework for clustering
On the sensitivity of shape fitting problems
Subspace approximation with outliers
Universal ${\epsilon}$-approximators for integrals
Input sparsity time low-rank approximation via ridge leverage score sampling
Subspace embeddings for the L ₁ -norm with applications
Iterative refinement for $\ell_p$-norm regression
Coresets and sketches for high dimensional subspace approximation problems
Low rank approximation with entrywise $\ell_1$-norm error
Title not available (Why is that?)
Tight bounds for $\ell_p$ oblivious subspace embeddings
Tight bounds for the subspace sketch problem with applications
Low rank approximation of binary matrices: column subset selection and generalizations
Non-adaptive adaptive sampling on turnstile streams
Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
Online row sampling

This page was built for publication: New subset selection algorithms for low rank approximation: offline and online

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499343)