atlas

Research map / Learning theory and algorithms / Sample complexity

Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares

ICML 2019 · Learning theory and algorithms › Sample complexity · approach: Learning under log-concave distributions · 0 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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use long-step updates instead of short-step updates (ablation)IRLS for ℓ∞ regression · Random 150 × 200 matrices with orthogonal rows; ε = 1/2^k, k ∈ {1, …, 12}iterationsHelped
Use long-step updates instead of short-step updates (ablation)IRLS for ℓ1 and ℓ∞ regression · Random regression instancesiterations and running timeHelped
Vary the number of columns mIRLS for ℓ1 and ℓ∞ regression · Random 150 × (200·k) matrices; ε = .01iterations and running timeHelped
Vary ε using short-step updatesIRLS for ℓ1 and ℓ∞ regression · Random 150 × 200 matrices with orthogonal rowsiterationsMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy