Research map / Learning theory and algorithms / Matrix and tensor methods

Noisy Dual Principal Component Pursuit

ICML 2019 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization · 9 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• Dual Principal Component Pursuit: Improved Analysis and Efficient Algorithms (NeurIPS 2018 · similarity 0.95)
• Dual Principal Component Pursuit for Robust Subspace Learning: Theory and Algorithms for a Holistic Approach (ICML 2021 · similarity 0.91)
• Implicit Bias of Projected Subgradient Method Gives Provable Robust Recovery of Subspaces of Unknown Codimension (ICLR 2022 · similarity 0.90)
• Hyperplane Clustering via Dual Principal Component Pursuit (ICML 2017 · similarity 0.86)
• Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery (NeurIPS 2021 · similarity 0.86)
• Rethinking PCA Through Duality (NeurIPS 2025 · similarity 0.84)