Matrix approximation and projective clustering via volume sampling

Recommendations

Adaptive Sampling and Fast Low-Rank Matrix Approximation
Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Fast monte-carlo algorithms for finding low-rank approximations
Relative-Error CUR Matrix Decompositions
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

Cited in

(40)

Exponential inapproximability of selecting a maximum volume sub-matrix
Randomized algorithms for the low multilinear rank approximations of tensors
Linear-time CUR approximation of BEM matrices
On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
Least squares approximations of measures via geometric condition numbers
Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
scientific article; zbMATH DE number 6982912 (Why is no real title available?)
Randomized algorithms in numerical linear algebra
Literature survey on low rank approximation of matrices
Greedy minimization of weakly supermodular set functions
A Local Search Framework for Experimental Design
Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
Efficient methods for grouping vectors into low-rank clusters
On multiplicative $\lambda$-approximations and some geometric applications
Optimal column-based low-rank matrix reconstruction
One-pass additive-error subset selection for $\ell_p$ subspace approximation and $(k, p)$-clustering
Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
Randomized Quasi-Optimal Local Approximation Spaces in Time
Lower bounds for column matrix approximations
Block discrete empirical interpolation methods
On the approximation of vector-valued functions by volume sampling
Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
Optimal sampling for least-squares approximation
Embrace rejection: kernel matrix approximation by accelerated randomly pivoted Cholesky
On the existence of a close to optimal cross approximation in the Frobenius norm
Turning big data into tiny data: coresets for unsupervised learning problems
Close to optimal column approximation using a single SVD
Robust blockwise random pivoting: fast and accurate adaptive interpolative decomposition
Low-rank approximation of parameter-dependent matrices via CUR decomposition
Efficient algorithms for Tucker decomposition via approximate matrix multiplication
Weighted least-squares approximation with determinantal point processes and generalized volume sampling
Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
Accuracy and stability of CUR decompositions with oversampling
A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations
On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows
Entry growth in Gaussian elimination
A sharp bound for sampling widths in the uniform norm: kernel D-optimal designs and oversampling
Incremental Column Subset Selection via Conditional Determinantal Point Processes

This page was built for publication: Matrix approximation and projective clustering via volume sampling

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