~/talk

Robust PCA via Non-convex Methods: Provable Bounds

links:none on file
slides:none on file

Claims a provable non‑convex algorithm that exactly recovers a low‑rank plus sparse decomposition under the same deterministic incoherence and sparsity regimes as convex methods, using an initial thresholding of large entries followed by alternating rank projections with stage‑wise rank growth and rank‑r SVD per iteration. Tolerates up to Θ(n/r) corruptions per row/column under incoherence, runs in roughly O(r^2 n^2) versus O(n^3) for full SVD convex solvers, converges in O(log(1/ε)) steps, and shows faster, cleaner foreground/background recovery in experiments.

AI-written summary · about

  1. 0:00Intro
  2. 1:38Learning with Big Data
  3. 2:28PCA: Classical Method
  4. 3:20Robust PCA Problem
  5. 6:02History
  6. 8:16Why is Robust PCA difficult?
  7. 9:28Convex Relaxation Techniques
  8. 10:29Other Alternatives for Robust PCA?
  9. 13:59Proposal for Non-convex Robust PCA
  10. 16:50Observations regarding non-convex analysis
  11. 18:17Non-convex success stories
  12. 22:40Outline
  13. 24:14Toy example: Rank-1 case
  14. 28:55Rank-1 Analysis Contd.
  15. 38:17Extension to general rank: challenges
  16. 40:56Improved Algorithm for General Rank Setting
  17. 45:16Synthetic Results
  18. 46:17Real data: Foreground/background Separation
  19. 48:21Conclusion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.