Regularized $M$-estimators of scatter matrix
Esa Ollila, David E. Tyler

TL;DR
This paper introduces a new class of regularized M-estimators for scatter matrices, suitable for small sample sizes, with theoretical guarantees, practical algorithms, and demonstrated improvements in radar detection tasks.
Contribution
It generalizes M-estimators with regularization, derives conditions for solution uniqueness, and provides a practical data-driven regularization method and iterative algorithm.
Findings
Regularized estimators outperform non-regularized in low sample scenarios.
Closed-form regularization parameter selection improves practical applicability.
Enhanced radar detection performance with adaptive NMF using regularized estimators.
Abstract
In this paper, a general class of regularized -estimators of scatter matrix are proposed which are suitable also for low or insufficient sample support (small and large ) problems. The considered class constitutes a natural generalization of -estimators of scatter matrix (Maronna, 1976) and are defined as a solution to a penalized -estimation cost function that depend on a pair of regularization parameters. We derive general conditions for uniqueness of the solution using concept of geodesic convexity. Since these conditions do not include Tyler's -estimator, necessary and sufficient conditions for uniqueness of the penalized Tyler's cost function are established separately. For the regularized Tyler's -estimator, we also derive a simple, closed form and data dependent solution for choosing the regularization parameter based on shape matrix…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
