New algorithms improve robust PCA for vision tasks with heavy-tailed distributions.
problem Challenging non-convex, non-smooth, non-Lipschitz problems in robust PCA.
method Bilinear factor matrix norm minimization models with double nuclear and hybrid norms.
result Our methods yield more accurate solutions than original Schatten quasi-norm minimization.