[2506.20533] Global Convergence of Iteratively Reweighted Least Squares for Robust Subspace Recovery

Dataemia
2 Min Read


View a PDF of the paper titled Global Convergence of Iteratively Reweighted Least Squares for Robust Subspace Recovery, by Gilad Lerman and 3 other authors

View PDF
HTML (experimental)

Abstract:Robust subspace estimation is fundamental to many machine learning and data analysis tasks. Iteratively Reweighted Least Squares (IRLS) is an elegant and empirically effective approach to this problem, yet its theoretical properties remain poorly understood. This paper establishes that, under deterministic conditions, a variant of IRLS with dynamic smoothing regularization converges linearly to the underlying subspace from any initialization. We extend these guarantees to affine subspace estimation, a setting that lacks prior recovery theory. Additionally, we illustrate the practical benefits of IRLS through an application to low-dimensional neural network training. Our results provide the first global convergence guarantees for IRLS in robust subspace recovery and, more broadly, for nonconvex IRLS on a Riemannian manifold.

Submission history

From: Teng Zhang [view email]
[v1]
Wed, 25 Jun 2025 15:23:32 UTC (5,436 KB)
[v2]
Sun, 29 Jun 2025 13:53:45 UTC (5,420 KB)
[v3]
Sun, 24 Aug 2025 09:44:00 UTC (5,659 KB)
[v4]
Tue, 10 Mar 2026 17:23:27 UTC (8,873 KB)



Source link

Share This Article
Leave a Comment

Leave a Reply

Your email address will not be published. Required fields are marked *

error: Content is protected !!