A combinatorial approach to robust PCA
From MaRDI portal
Cites work
- (1 + eps)-Approximate Sparse Recovery
- A mathematical introduction to compressive sensing
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Adaptive sparse recovery with limited adaptivity
- Algorithmic High-Dimensional Robust Statistics
- Atomic decomposition by basis pursuit
- Compressed sensing
- Efficient algorithms and lower bounds for robust linear regression
- Erdös–Ko–Rado Theorem—22 Years Later
- Extremal combinatorics. With applications in computer science
- High-dimensional statistics. A non-asymptotic viewpoint
- scientific article; zbMATH DE number 5485581 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- scientific article; zbMATH DE number 7788416 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
- Learning from untrusted data
- Lower bounds for adaptive sparse recovery
- Lower bounds for sparse recovery
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- On a packing and covering problem
- On representatives of subsets.
- On the Power of Adaptivity in Sparse Recovery
- Outlier-Robust PCA: The High-Dimensional Case
- Pseudorandom bits for constant depth circuits
- Robust Matrix Decomposition With Sparse Corruptions
- Robust PCA via Outlier Pursuit
- Robust principal component analysis?
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- The Erdős matching conjecture and concentration inequalities
This page was built for publication: A combinatorial approach to robust PCA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906357)
