Computational Statistics and Data Analysis Covariance Structure Regularization via Entropy Loss Function

The need to estimate structured covariance matrices arises in a variety of applications and the problem is widely studied in statistics. A new method is proposed for regularizing the covariance structure of a given covariance matrix whose underlying structure has been blurred by random noise, particularly when the dimension of the covariance matrix is high. The regularization is made by choosing an optimal structure from an available class of covariance structures in terms of minimizing the discrepancy, defined via the entropy loss function, between the given matrix and the class. A range of potential candidate structures comprising tridiagonal Toeplitz, compound symmetry, AR(1), and banded Toeplitz is considered. It is shown that for the first three structures local or global minimizers of the discrepancy can be computed by one-dimensional optimization, while for the fourth structure Newton's method enables efficient computation of the global minimizer. Simulation studies are conducted, showing that the proposed new approach provides a reliable way to regularize covariance structures. The approach is also applied to real data analysis, demonstrating the usefulness of the proposed approach in practice.

[1]  Jianxin Pan,et al.  Growth curve models and statistical diagnostics , 2002 .

[2]  E. Polak,et al.  Maximum likelihood estimation of positive definite Hermitian Toeplitz matrices using outer approximations , 1998, Ninth IEEE Signal Processing Workshop on Statistical Signal and Array Processing (Cat. No.98TH8381).

[3]  Tryphon T. Georgiou,et al.  Geometric methods for estimation of structured covariances , 2011, ArXiv.

[4]  Nicholas J. Higham,et al.  Computing a Nearest Correlation Matrix with Factor Structure , 2010, SIAM J. Matrix Anal. Appl..

[5]  Tryphon T. Georgiou,et al.  Geometric methods for structured covariance estimation , 2012, 2012 American Control Conference (ACC).

[6]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[7]  D. Luenberger,et al.  Estimation of structured covariance matrices , 1982, Proceedings of the IEEE.

[8]  J. Magnus,et al.  Matrix Differential Calculus with Applications in Statistics and Econometrics , 2019, Wiley Series in Probability and Statistics.

[9]  Michele Pavon,et al.  A Maximum Entropy Enhancement for a Family of High-Resolution Spectral Estimators , 2012, IEEE Transactions on Automatic Control.

[10]  José Mario Martínez,et al.  Algorithm 813: SPG—Software for Convex-Constrained Optimization , 2001, TOMS.

[11]  Nicholas J. Higham,et al.  Accuracy and stability of numerical algorithms, Second Edition , 2002 .

[12]  Suliman S. Al-Homidan SQP algorithms for solving Toeplitz matrix approximation problem , 2002, Numer. Linear Algebra Appl..

[13]  T. Hayden,et al.  Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix , 1993, SIAM J. Matrix Anal. Appl..

[14]  D. Dey,et al.  Estimation of a covariance matrix under Stein's loss , 1985 .

[15]  C. Stein,et al.  Estimation with Quadratic Loss , 1992 .

[16]  Edgard M. Maboudou-Tchao,et al.  Monitoring the covariance matrix with fewer observations than variables , 2013, Comput. Stat. Data Anal..

[17]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[18]  Philippe Forster,et al.  Covariance Structure Maximum-Likelihood Estimates in Compound Gaussian Noise: Existence and Algorithm Analysis , 2008, IEEE Transactions on Signal Processing.

[19]  J. Magnus,et al.  Matrix Differential Calculus with Applications in Statistics and Econometrics (Revised Edition) , 1999 .

[20]  Inderjit S. Dhillon,et al.  Matrix Nearness Problems with Bregman Divergences , 2007, SIAM J. Matrix Anal. Appl..

[21]  Anton van den Hengel,et al.  Semidefinite Programming , 2014, Computer Vision, A Reference Guide.

[22]  Seymour V. Parter An observation on the numerical solution of difference equations and a theorem of Szegö , 1962 .

[23]  José Mario Martínez,et al.  Nonmonotone Spectral Projected Gradient Methods on Convex Sets , 1999, SIAM J. Optim..

[24]  Michael G. Kenward,et al.  A Method for Comparing Profiles of Repeated Measurements , 1987 .

[25]  Gilbert MacKenzie,et al.  On modelling mean‐covariance structures in longitudinal studies , 2003 .

[26]  Veronica Vinciotti,et al.  Robust methods for inferring sparse network structures , 2013, Comput. Stat. Data Anal..

[27]  Fu Lin,et al.  On the least-squares approximation of structured covariances , 2007, 2007 American Control Conference.

[28]  E. Lieb,et al.  Analysis, Second edition , 2001 .

[29]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[30]  M. Pourahmadi Joint mean-covariance models with applications to longitudinal data: Unconstrained parameterisation , 1999 .

[31]  Jianxin Pan,et al.  Modelling of covariance structures in generalised estimating equations for longitudinal data , 2006 .