scientific article; zbMATH DE number 7307477
From MaRDI portal
Publication:5149239
Rémi Bardenet, Ayoub Belhadji, Pierre Chainais
Publication date: 8 February 2021
Full work available at URL: https://arxiv.org/abs/1812.09771
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
low-rank approximationdeterminantal point processcolumn subset selectionvolume samplingleverage score sampling
Related Items
Unnamed Item, Extended L-ensembles: a new representation for determinantal point processes, On sampling determinantal and Pfaffian point processes on a quantum computer, On estimating the structure factor of a point process, with applications to hyperuniformity, Determinantal Point Processes for Image Processing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing all self-adjoint matrices with prescribed spectrum and diagonal
- Clustering large graphs via the singular value decomposition
- Determinantal processes and independence
- On principal components regression, random projections, and column subsampling
- Monte Carlo with determinantal point processes
- Numerical methods for solving linear least squares problems
- Determinantal random point fields
- Determinantal Point Processes for Machine Learning
- Certifying the Restricted Isometry Property is Hard
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap
- Sampling from large matrices
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Course 1 Random matrices and determinantal processes
- Matrix approximation and projective clustering via volume sampling
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Relative-Error $CUR$ Matrix Decompositions
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- The coincidence approach to stochastic point processes
- Numerical Methods for Computing Angles Between Linear Subspaces
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Twice-ramanujan sparsifiers
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Determinantal Point Process Models and Statistical Inference
- Sketching for Principal Component Regression
- Faster Subset Selection for Matrices and Applications
- Near Optimal Column-Based Matrix Reconstruction
- Optimal Column-Based Low-Rank Matrix Reconstruction
- Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
- Inequalities: theory of majorization and its applications
- GUEs and queues
- Adaptive greedy approximations
