Robust Subspace Discovery via Relaxed Rank Minimization
From MaRDI portal
Publication:5378336
Recommendations
- A framework for robust subspace learning
- Fast, robust and non-convex subspace recovery
- Robust subspace segmentation via nonconvex low rank representation
- Robust subspace clustering
- Relations among some low-rank subspace recovery models
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Subspace Methods for Joint Sparse Recovery
- A well-tempered landscape for non-convex robust subspace recovery
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
- Computer Vision - ECCV 2004
- Dense Error Correction Via $\ell^1$-Minimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Robust PCA via Outlier Pursuit
- Robust computation of linear models by convex relaxation
- Robust principal component analysis?
- Solving the multiple instance problem with axis-parallel rectangles.
- TILT: transform invariant low-rank textures
Cited in
(6)- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Robust subspace segmentation via nonconvex low rank representation
- Robust computation of linear models by convex relaxation
- A framework for robust subspace learning
- Active subspace: toward scalable low-rank learning
- Variance estimation based on blocked \(3\times 2\) cross-validation in high-dimensional linear regression
This page was built for publication: Robust Subspace Discovery via Relaxed Rank Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378336)
