# Regularized Tyler's Scatter Estimator: Existence, Uniqueness, and Algorithms

arXiv: https://arxiv.org/abs/1407.3079 · HTML: https://mlsanity.com/paper/1407.3079/

## Key facts

- Cited by 12 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Jul 2014.

## Built on by (most cited first, 12 of 12)

- [SPD Matrix Learning for Neuroimaging Analysis: Perspectives, Methods, and Challenges](https://mlsanity.com/paper/2504.18882/) (2025)
- [The Fisher-Rao geometry of CES distributions](https://mlsanity.com/paper/2310.01032/) (2023)
- [Riemannian optimization for non-centered mixture of scaled Gaussian distributions](https://mlsanity.com/paper/2209.03315/) (2022)
- [Tensor-Based Synchronization and the Low-Rankness of the Block Trifocal Tensor](https://mlsanity.com/paper/2409.09313/) (2024)
- [Accelerating Regularized Attention Kernel Regression for Spectrum Cartography](https://mlsanity.com/paper/2604.25138/) (2026)
- [Regularized EM algorithm](https://mlsanity.com/paper/2303.14989/) (2023)
- [Algorithme EM r'egularis'e](https://mlsanity.com/paper/2307.01955/) (2023)
- [Convex Parameter Estimation of Perturbed Multivariate Generalized Gaussian Distributions](https://mlsanity.com/paper/2312.07479/) (2023)
- [T-Rex: Fitting a Robust Factor Model via Expectation-Maximization](https://mlsanity.com/paper/2505.12117/) (2025)
- [Efficient Estimation of Regularized Tyler's M-Estimator Using Approximate LOOCV](https://mlsanity.com/paper/2505.24781/) (2025)
- [Dynamic Elliptical Graph Factor Models via Riemannian Optimization with Geodesic Temporal Regularization](https://mlsanity.com/paper/2605.18316/) (2026)
- [Difference-of-Convex Regularization for Graph Learning by Differentiable Programming](https://mlsanity.com/paper/2608.12757/) (2026)

## Abstract (arXiv)

This paper considers the regularized Tyler's scatter estimator for elliptical distributions, which has received considerable attention recently. Various types of shrinkage Tyler's estimators have been proposed in the literature and proved work effectively in the "small n large p" scenario. Nevertheless, the existence and uniqueness properties of the estimators are not thoroughly studied, and in certain cases the algorithms may fail to converge. In this work, we provide a general result that analyzes the sufficient condition for the existence of a family of shrinkage Tyler's estimators, which quantitatively shows that regularization indeed reduces the number of required samples for estimation and the convergence of the algorithms for the estimators. For two specific shrinkage Tyler's estimators, we also proved that the condition is necessary and the estimator is unique. Finally, we show that the two estimators are actually equivalent. Numerical algorithms are also derived based on the majorization-minimization framework, under which the convergence is analyzed systematically.