Lassoing Eigenvalues

05/21/2018
by   David E. Tyler, et al.
0

The properties of penalized sample covariance matrices depend on the choice of the penalty function. In this paper, we introduce a class of non-smooth penalty functions for the sample covariance matrix, and demonstrate how this method results in a grouping of the estimated eigenvalues. We refer to this method as "lassoing eigenvalues" or as the "elasso".

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/19/2019

Shrinking the Sample Covariance Matrix using Convex Penalties on the Matrix-Log Transformation

For q-dimensional data, penalized versions of the sample covariance matr...
research
11/25/2021

Cleaning the covariance matrix of strongly nonstationary systems with time-independent eigenvalues

We propose a data-driven way to clean covariance matrices in strongly no...
research
02/17/2017

How close are the eigenvectors and eigenvalues of the sample and actual covariance matrices?

How many samples are sufficient to guarantee that the eigenvectors and e...
research
02/14/2012

New Probabilistic Bounds on Eigenvalues and Eigenvectors of Random Kernel Matrices

Kernel methods are successful approaches for different machine learning ...
research
05/29/2019

Spiked separable covariance matrices and principal components

We introduce a class of separable sample covariance matrices of the form...
research
12/14/2021

On the Eigenstructure of Covariance Matrices with Divergent Spikes

For a generalization of Johnstone's spiked model, a covariance matrix wi...
research
08/06/2021

Estimating Graph Dimension with Cross-validated Eigenvalues

In applied multivariate statistics, estimating the number of latent dime...

Please sign up or login with your details

Forgot password? Click here to reset