Research map / Learning theory and algorithms / Matrix and tensor methods
Outlier-Robust Sparse Estimation via Non-Convex Optimization
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
- Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering (NeurIPS 2019 · similarity 0.95)
- High-dimensional Robust Mean Estimation via Gradient Descent (ICML 2020 · similarity 0.92)
- Outlier Robust Mean Estimation with Subgaussian Rates via Stability (NeurIPS 2020 · similarity 0.90)
- A Subquadratic Time Algorithm for Robust Sparse Mean Estimation (ICML 2024 · similarity 0.90)
- Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination (ICML 2024 · similarity 0.88)
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 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.