🤖 AI Summary
Robust low-dimensional subspace recovery under highly contaminated data—where inliers constitute an extremely small fraction—is challenging for existing methods. Method: We propose the Subspace-Constrained Tyler Estimator (STE), which embeds the Tyler M-estimator into a subspace-constrained optimization framework and solves it via iterative reweighted least squares. Contributions: First, we establish the first convergence guarantee for STE. Second, under a weak inlier–outlier model, we prove its exact subspace recovery property. Third, we significantly lower the feasible inlier rate bound—enabling exact recovery even when inliers drop far below the failure threshold of classical Tyler estimation, i.e., in extreme sparsity regimes. Experiments on the generalized haystack model demonstrate that STE, initialized with the Tyler Mean Estimator (TME), successfully recovers subspaces with as little as 0.1% inlier fraction—substantially expanding the practical applicability of robust subspace learning.
📝 Abstract
This work analyzes the subspace-constrained Tyler's estimator (STE) designed for recovering a low-dimensional subspace within a dataset that may be highly corrupted with outliers. It assumes a weak inlier-outlier model and allows the fraction of inliers to be smaller than a fraction that leads to computational hardness of the robust subspace recovery problem. It shows that in this setting, if the initialization of STE, which is an iterative algorithm, satisfies a certain condition, then STE can effectively recover the underlying subspace. It further shows that under the generalized haystack model, STE initialized by the Tyler's M-estimator (TME), can recover the subspace when the fraction of iniliers is too small for TME to handle.