- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a new optimization for robust PCA and a strategy to solve it. In doing so, they introduce two RPCA variants. In experiments, they find their method is robust and produces low reconstruction error.
Critical strengths
The paper contributes to the well-studied problem of robust PCA by contributing a new optimization problem and an algorithm to approximate it's solution. Overall, the message is simple and self-contained, contributing to an active field of research.
Critical weaknesses
-
There are some mathematical details that need clarification.
-
Some work including dual principal component pursuit and robust subspace analysis were missed as related works and potential baselines.
-
The work is missing rigorous ablation studies and assessment of the method compared to baselines under various metrics. This is especially important to see that kind/ quantity of noise and outliers break this method.
Questions for authors
Mathematics
- L99 Maybe better to write V = U^\top X
- L102 Cite or explain your statement about Laplacian noise
- L136 We switch from a data matrix X to a data matrix (X,b) what is b?
- Lemma 3 is an upper bound for ||\Delta U V|| but in the proof of theorem 1, we reference lemma 3 for an upper bound of ||U \Delta V^\top||_1. Where is the upper bound of ||U \Delta V^\top||_1 proven?
- L237 Maybe say the Frobenius norm of difference is 0, rather than restrict the difference to 0 since this is what is actually used to formulate the Lagrangian.
- L237 Shouldn’t there be orthogonality constraints on U for it to be PCA?
Related works and citations
- Inline
- L39 Hotelling, Analysis of a complex of statistical variables into principal components
- L247 Has this strategy been used before? If so, please cite.
- Introduction and/ or potential baselines to compare to
- Gilad et al, Fast, robust and non-convex subspace recovery
- Gilad et al, A novel m-estimator for robust pca
- Gilad et al, An overview of robust subspace recovery
- Gilad et al, A well-tempered landscape for non-convex robust subspace recovery
- Vidal et al, Robust principal component analysis
- Vidal et al, Generalized principal component analysis (gpca): an algebraic geometric approach to subspace clustering and motion segmentation
- Vidal et al, Generalized principal component analysis
- Mankovich et al, Fun with Flags: Robust Principal Directions via Flag Manifolds
Experiments
- Tab 1 Maybe use relative reconstruction error rather than raw reconstruction error?
- Tab 1 & Fig 1 Was only one noise value checked? An appropriate evaluation of this method would be a noise ablation study as well as an outlier ablation study.
- Fig 1 The text in these plots is too small and is unreadable in a printed version of the text. The legend, axis ticks and axis labels should be increased for readability.
Smaller points:
- some citations appear as links and others do not
- there is not AI nor repreocibility statement
- Do you have any intuition for why this method is more robust than other methods?