Research map / Learning theory and algorithms / Matrix and tensor methods
A Well-Tempered Landscape for Non-convex Robust Subspace Recovery
Tyler Maunu, Teng Zhang, Gilad Lerman
Read the paperCheck your idea against 137,217 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
- Implicit Bias of Projected Subgradient Method Gives Provable Robust Recovery of Subspaces of Unknown Codimension (ICLR 2022 · similarity 0.90)
- Local Linear Convergence of Gradient Methods for Subspace Optimization via Strict Complementarity (NeurIPS 2022 · similarity 0.89)
- A Nullspace Property for Subspace-Preserving Recovery (ICML 2021 · similarity 0.89)
- Subspace Recovery from Heterogeneous Data with Non-isotropic Noise (NeurIPS 2022 · similarity 0.89)
- Dual Principal Component Pursuit for Robust Subspace Learning: Theory and Algorithms for a Holistic Approach (ICML 2021 · similarity 0.89)
- A Subspace-Constrained Tyler's Estimator and its Applications to Structure from Motion (CVPR 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
