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

DOI10.1145/3564246.3585100MaRDI QIDQ6499343FDOQ6499343

Authors: David P. Woodruff, Taisuke Yasuda 

Publication date: 8 May 2024

zbMATH Keywords

low rank approximationsubset selectionoblivious subspace embeddings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Optimal CUR Matrix Decompositions
• 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
• 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
• Title not available (Why is that?)
• On the Complexity of Robust PCA and ℓ₁-Norm Low-Rank Matrix Approximation
• Minimum-volume ellipsoids. Theory and algorithms
• A PTAS for ℓ_p-Low Rank Approximation
• A new coreset framework for clustering
• Title not available (Why is that?)
• Subspace approximation with outliers
• Title not available (Why is that?)
• Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
• Subspace embeddings for the L ₁ -norm with applications
• Iterative Refinement for ℓ_p-norm Regression
• Title not available (Why is that?)
• Low rank approximation with entrywise l ₁ -norm error
• Title not available (Why is that?)
• Tight Bounds for ℓ_p Oblivious Subspace Embeddings
• Tight Bounds for the Subspace Sketch Problem with Applications
• Title not available (Why is that?)
• Non-adaptive adaptive sampling on turnstile streams
• Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
• Title not available (Why is that?)

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)