Tyler's Covariance Matrix Estimator in Elliptical Models with Convex Structure

04/07/2014
by   Ilya Soloveychik, et al.
0

We address structured covariance estimation in elliptical distributions by assuming that the covariance is a priori known to belong to a given convex set, e.g., the set of Toeplitz or banded matrices. We consider the General Method of Moments (GMM) optimization applied to robust Tyler's scatter M-estimator subject to these convex constraints. Unfortunately, GMM turns out to be non-convex due to the objective. Instead, we propose a new COCA estimator - a convex relaxation which can be efficiently solved. We prove that the relaxation is tight in the unconstrained case for a finite number of samples, and in the constrained case asymptotically. We then illustrate the advantages of COCA in synthetic simulations with structured compound Gaussian distributions. In these examples, COCA outperforms competing methods such as Tyler's estimator and its projection onto the structure set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/17/2015

Robust Estimation of Structured Covariance Matrix for Heavy-Tailed Elliptical Distributions

This paper considers the problem of robustly estimating a structured cov...
research
05/23/2014

Convex Banding of the Covariance Matrix

We introduce a new sparse estimator of the covariance matrix for high-di...
research
06/18/2013

Group Symmetry and non-Gaussian Covariance Estimation

We consider robust covariance estimation with group symmetry constraints...
research
04/14/2023

Ledoit-Wolf linear shrinkage with unknown mean

This work addresses large dimensional covariance matrix estimation with ...
research
12/22/2020

MLE of Jointly Constrained Mean-Covariance of Multivariate Normal Distributions

Estimating the unconstrained mean and covariance matrix is a popular top...
research
06/08/2018

Estimation of Covariance Matrices for Portfolio Optimization using Gaussian Processes

Estimating covariances between financial assets plays an important role ...
research
07/10/2014

A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation

A key problem in statistics and machine learning is the determination of...

Please sign up or login with your details

Forgot password? Click here to reset