Efficient volume sampling for row/column subset selection

DOI10.1109/FOCS.2010.38MaRDI QIDQ6990315zbMATH OpenFDO

Authors Amit Deshpande, Luis Rademacher

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1109/FOCS.2010.38

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(15)

• Randomized approach to matrix completion: applications in recommendation systems and image inpainting
• Adaptive randomized pivoting for column subset selection, DEIM, and low-rank approximation
• Estimating a matrix's singular values with interpolative decompositions
• A statistical view of column subset selection
• Turning big data into tiny data: coresets for unsupervised learning problems
• Optimal sublinear sampling of spanning trees and determinantal point processes via average-case entropic independence
• A two-level simultaneous orthogonal matching pursuit algorithm for simultaneous sparse approximation problems
• Close to optimal column approximation using a single SVD
• Structure-aware analyses and algorithms for interpolative decompositions
• Sampling arborescences in parallel
• Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows
• Entry growth in Gaussian elimination
• Interlacing polynomial method for matrix approximation via generalized column and row selection
• Collect, commit, expand: efficient CPQR-based column selection for extremely wide matrices
• Guessing efficiently for constrained subspace approximation

This page was built for publication: Efficient volume sampling for row/column subset selection

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