An improved approximation algorithm for the column subset selection problem

Recommendations

Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Faster subset selection for matrices and applications
Optimal column-based low-rank matrix reconstruction
Column subset selection via sparse approximation of SVD
Column subset selection, matrix factorization, and eigenvalue optimization

Cited in

(72)

Column subset selection, matrix factorization, and eigenvalue optimization
Effectively subsampled quadratures for least squares polynomial approximations
An efficient $K$-means clustering algorithm for tall data
Estimating Leverage Scores via Rank Revealing Methods and Randomization
Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
Far-field compression for fast kernel summation methods in high dimensions
scientific article; zbMATH DE number 7307477 (Why is no real title available?)
Sum-of-squares relaxations for information theory and variational inference
An improvement of the parameterized frequent directions algorithm
Column subset selection problem is UG-hard
A non-intrusive multifidelity method for the reduced order modeling of nonlinear problems
Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
Optimal column subset selection for image classification by genetic algorithms
Randomized numerical linear algebra: Foundations and algorithms
ALORA: affine low-rank approximations
Allocation Strategies for High Fidelity Models in the Multifidelity Regime
scientific article; zbMATH DE number 6982912 (Why is no real title available?)
scientific article; zbMATH DE number 7164697 (Why is no real title available?)
Linear-time CUR approximation of BEM matrices
Low rank approximation of binary matrices: column subset selection and generalizations
Scalable kernel $k$-means clustering with Nyström approximation: relative-error bounds
A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
Data representation using robust nonnegative matrix factorization for edge computing
A Riemannian optimization approach to clustering problems
Perspectives on CUR decompositions
On the optimality of Voronoi-based column selection
Optimal column-based low-rank matrix reconstruction
scientific article; zbMATH DE number 7626767 (Why is no real title available?)
Block discrete empirical interpolation methods
Fast randomized matrix and tensor interpolative decomposition using countsketch
Conditioning of leverage scores and computation by QR decomposition
One-pass additive-error subset selection for $\ell_p$ subspace approximation and $(k, p)$-clustering
Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
\texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
Column subset selection is NP-complete
Frequent directions: simple and deterministic matrix sketching
An Offline-Online Decomposition Method for Efficient Linear Bayesian Goal-Oriented Optimal Experimental Design: Application to Optimal Sensor Placement
Subspace Iteration Randomization and Singular Value Problems
Bayesian D-optimal experimental designs via column subset selection
A note on column subset selection
Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
A literature survey of matrix methods for data science
Geometric component analysis and its applications to data analysis
Subspaces analysis for random projection UTV framework
Interlacing polynomial method for the column subset selection problem
Importance sampling in signal processing applications
Near-optimal column-based matrix reconstruction
Regularized greedy column subset selection
A note on subset selection for matrices
Column subset selection via sparse approximation of SVD
A training set subsampling strategy for the reduced basis method
Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
Adaptive symplectic model order reduction of parametric particle-based Vlasov–Poisson equation
An ensemble feature ranking algorithm for clustering analysis
Clustered matrix approximation
A note on sparse least-squares regression
Random Projections for Low Multilinear Rank Tensors
Estimating a matrix's singular values with interpolative decompositions
High-dimensional model recovery from random sketched data by exploring intrinsic sparsity
Literature survey on low rank approximation of matrices
scientific article; zbMATH DE number 6860845 (Why is no real title available?)
Fast quantum algorithms for least squares regression and statistic leverage scores
A statistical view of column subset selection
Randomized local model order reduction
Fast quantum algorithms for least squares regression and statistic leverage scores
Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering
Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
A two-level simultaneous orthogonal matching pursuit algorithm for simultaneous sparse approximation problems
Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction
Close to optimal column approximation using a single SVD
Faster subset selection for matrices and applications

This page was built for publication: An improved approximation algorithm for the column subset selection problem

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