Faster Subset Selection for Matrices and Applications

DOI10.1137/120867287zbMath1425.65059arXiv1201.0127OpenAlexW2150907712MaRDI QIDQ5413658

Christos Boutsidis, Haim Avron

Publication date: 30 April 2014

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.0127

zbMATH Keywords

subset selectionsparse approximationlow-rank approximationsfeature selection\(k\)-means clusteringlow-stretch spanning treesvolume sampling

Mathematics Subject Classification ID

Related Items (18)

Optimal column subset selection for image classification by genetic algorithms ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ A Local Search Framework for Experimental Design ⋮ Lower bounds for column matrix approximations ⋮ Unnamed Item ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ Extracting a basis with fixed block inside a matrix ⋮ Unnamed Item ⋮ Provable accelerated gradient method for nonconvex low rank optimization ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Subset selection for matrices with fixed blocks ⋮ On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models ⋮ Unnamed Item ⋮ On a new method for controlling the entire spectrum in the problem of column subset selection ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization ⋮ Robust CUR Decomposition: Theory and Imaging Applications ⋮ Gaussian Process Landmarking on Manifolds

Uses Software

• Blendenpik

This page was built for publication: Faster Subset Selection for Matrices and Applications