Matrix approximation and projective clustering via volume sampling
From MaRDI portal
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
(31)- A Local Search Framework for Experimental Design
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Lower bounds for column matrix approximations
- Efficient methods for grouping vectors into low-rank clusters
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations
- Linear-time CUR approximation of BEM matrices
- Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
- Accuracy and stability of CUR decompositions with oversampling
- On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
- Optimal column-based low-rank matrix reconstruction
- Block discrete empirical interpolation methods
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
- On multiplicative \(\lambda\)-approximations and some geometric applications
- Least squares approximations of measures via geometric condition numbers
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- Randomized algorithms for the low multilinear rank approximations of tensors
- On the approximation of vector-valued functions by volume sampling
- Literature survey on low rank approximation of matrices
- Randomized Quasi-Optimal Local Approximation Spaces in Time
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- Close to optimal column approximation using a single SVD
- Greedy minimization of weakly supermodular set functions
- 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
- Randomized algorithms in numerical linear algebra
- Weighted least-squares approximation with determinantal point processes and generalized volume sampling
- Exponential inapproximability of selecting a maximum volume sub-matrix
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)
