scientific article; zbMATH DE number 6982912

zbMath1467.68154arXiv1505.04343MaRDI QIDQ4558476

Aarti Singh, Yining Wang

Publication date: 22 November 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

active learningcolumn subset selectionleverage scores

Mathematics Subject Classification ID

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

Related Items (4)

A divide-and-conquer algorithm for binary matrix completion ⋮ Cross: efficient low-rank tensor completion ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ Perturbations of CUR Decompositions

Uses Software

• gglasso

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rang revealing QR factorizations
• Oracle inequalities and optimal inference under group sparsity
• User-friendly tail bounds for sums of random matrices
• Random projections for the nonnegative least-squares problem
• Adaptive estimation of a quadratic functional by model selection.
• Completing Any Low-rank Matrix, Provably
• Nonparametric sparsity and regularization
• Optimal CUR Matrix Decompositions
• Uniform Sampling for Matrix Approximation
• Fast computation of low-rank matrix approximations
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• Relative-Error $CUR$ Matrix Decompositions
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• A generalization of permanent inequalities and applications in counting and optimization
• Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Matrix Completion From a Few Entries
• Tighter Low-rank Approximation via Sampling the Leveraged Element
• A Simpler Approach to Matrix Completion
• Model Selection and Estimation in Regression with Grouped Variables
• Fast monte-carlo algorithms for finding low-rank 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
• Near-Optimal Column-Based Matrix Reconstruction
• A fast unified algorithm for solving group-lasso penalize learning problems

This page was built for publication: