scientific article; zbMATH DE number 6982912

MaRDI QIDQ4558476zbMATH OpenFDO

Authors Yining Wang, Aarti Singh

Publication date 22 November 2018

Full work available at URL https://arxiv.org/abs/1505.04343, http://jmlr.csail.mit.edu/papers/v18/15-233.html

zbMATH Keywords

active learningcolumn subset selectionleverage scores

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Numerical linear algebra (65F99) Learning and adaptive systems in artificial intelligence (68T05) Randomized algorithms (68W20) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Column subset selection via sparse approximation of SVD
• An improved approximation algorithm for the column subset selection problem
• Subset selection in sparse matrices
• A note on column subset selection
• A note on subset selection for matrices
• Column subset selection, matrix factorization, and eigenvalue optimization
• scientific article; zbMATH DE number 7307477
• Subset selection for matrices
• Low rank approximation of binary matrices: column subset selection and generalizations
• Determinant and Exchange Algorithms for Observation Subset Selection

Cites work

• A fast unified algorithm for solving group-lasso penalize learning problems
• A generalization of permanent inequalities and applications in counting and optimization
• A simpler approach to matrix completion
• Adaptive estimation of a quadratic functional by model selection.
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Completing any low-rank matrix, provably
• Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Fast approximation of matrix coherence and statistical leverage
• Fast computation of low-rank matrix approximations
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
• Fast monte-carlo algorithms for finding low-rank approximations
• Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
• Matrix approximation and projective clustering via volume sampling
• Matrix Completion From a Few Entries
• Model Selection and Estimation in Regression with Grouped Variables
• Near-optimal column-based matrix reconstruction
• Nonparametric sparsity and regularization
• Oracle inequalities and optimal inference under group sparsity
• Random projections for the nonnegative least-squares problem
• Rang revealing QR factorizations
• Relative-Error CUR Matrix Decompositions
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Tighter low-rank approximation via sampling the leveraged element
• Uniform sampling for matrix approximation
• User-friendly tail bounds for sums of random matrices

Cited in

(11)

• Cross: efficient low-rank tensor completion
• A divide-and-conquer algorithm for binary matrix completion
• Regularized greedy column subset selection
• Near-optimal discrete optimization for experimental design: a regret minimization approach
• scientific article; zbMATH DE number 7307477 (Why is no real title available?)
• Determinant and Exchange Algorithms for Observation Subset Selection
• Perturbations of CUR Decompositions
• Randomized approach to matrix completion: applications in recommendation systems and image inpainting
• A statistical view of column subset selection
• Interlacing polynomial method for matrix approximation via generalized column and row selection
• Subset selection for matrices

Describes a project that uses

Uses Software

• gglasso

This page was built for publication:

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