Research map / Learning theory and algorithms / Matrix and tensor methods
Global Linear and Local Superlinear Convergence of IRLS for Non-Smooth Robust Regression
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
- On the Convergence of IRLS and Its Variants in Outlier-Robust Estimation (CVPR 2023 · similarity 0.90)
- Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares (ICML 2019 · similarity 0.88)
- Iteratively Reweighted Least Squares for Basis Pursuit with Global Linear Convergence Rate (NeurIPS 2021 · similarity 0.87)
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 2024 · similarity 0.86)
- Precise asymptotics of reweighted least-squares algorithms for linear diagonal networks (NeurIPS 2024 · similarity 0.84)
- Universal Robustness via Median Randomized Smoothing for Real-World Super-Resolution (CVPR 2024 · similarity 0.84)
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.