Metraipolis › archive › dc_71aa292d4f4d

Robust Principal Component Analysis via $\ell_0$ Alternating Minimization — arXiv:2610.41492

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41492
License (as archived)
CC0-1.0
Archived
2026-11-03T05:43:17.211Z
SHA-256 of the archived text
ba18da2cf6ac8fbd45d80c741def042ed0c28b3ed8f2601efcd1f97e7d22c097
Stable URL of this page
https://metraipolis.com/documento/dc_71aa292d4f4d

How to cite

Robust Principal Component Analysis via $\ell_0$ Alternating Minimization — arXiv:2610.41492 — arXiv (en), https://arxiv.org/abs/2610.41492 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_71aa292d4f4d (Metraipolis archive dc_71aa292d4f4d, sha256 ba18da2cf6ac8fbd45d80c741def042ed0c28b3ed8f2601efcd1f97e7d22c097)
BibTeX
@misc{dc71aa292d4f4d,
  title = {Robust Principal Component Analysis via $ell_0$ Alternating Minimization — arXiv:2610.41492},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41492},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_71aa292d4f4d; sha256 ba18da2cf6ac8fbd45d80c741def042ed0c28b3ed8f2601efcd1f97e7d22c097},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41492. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Robust principal component analysis concerns the recovery of a low-rank matrix $Z$ and a sparse matrix $S$ from their observed sum $D = Z + S$. In this paper, we study this recovery problem under an $\ell_0$ sparsity penalty and a rank constraint on the low-rank component. By exploiting the entrywise separable structure of the sparse subproblem, we obtain an exact closed-form solution via hard thresholding with box clipping, avoiding the shrinkage bias of $\ell_1$-based methods. The low-rank subproblem is solved by truncated SVD. We prove block-coordinate convergence of the resulting alternating minimization scheme, establish uniqueness of block minimizers under non-degeneracy and singular value gap conditions, establish local linear convergence under a contraction condition on the Fréchet derivative of the truncated SVD operator restricted to the sparse support, and provide a second-order optimality analysis via the Riemannian Hessian. Experiments on synthetic data, images, and video show that the proposed algorithm outperforms the existing convex and nonconvex algorithms, most notably in support recovery and in the accuracy-efficiency trade-off.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.41492 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:31:17.166Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).