Scale matrix estimation under data-based loss in high and low dimensions
Mohamed Anis Haddouche, Dominique Fourdrinier, Fatiha Mezoued

TL;DR
This paper develops improved estimators for the scale matrix in high and low-dimensional settings, using data-driven corrections to outperform natural estimators under a specific loss function.
Contribution
It introduces a new class of estimators that adapt to invertibility conditions of the data matrix, providing conditions for improvement over traditional estimators.
Findings
Proposes estimators that outperform natural ones under data-based loss.
Provides conditions for the correction matrix to ensure estimator improvement.
Unifies treatment of invertible and non-invertible cases.
Abstract
We consider the problem of estimating the scale matrix of the additif model , under a theoretical decision point of view. Here, is the number of variables, is the number of observations, is a matrix of unknown parameters with rank and is a random noise, whose distribution is elliptically symmetric with covariance matrix proportional to \,. We deal with a canonical form of this model where is decomposed in two matrices, namely, which summarizes the information contained in , and , where , which summarizes the sufficient information to estimate . As the natural estimators of the form (where and is a positive constant) perform poorly when (S non-invertible), we propose estimators…
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.
Taxonomy
TopicsRandom Matrices and Applications · Blind Source Separation Techniques · Sparse and Compressive Sensing Techniques
