arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.2686stat.MEstat.ML
收藏

基于Kronecker乘积展开的高维协方差估计

Covariance Estimation in High Dimensions via Kronecker Product Expansions

Theodoros Tsiligkaridis, Alfred O. Hero

摘要:

本文提出了一种估计高维协方差阵的新方法。该方法,置换秩惩罚最小二乘(PRLS),是基于真实的协方差阵的克罗内克积级数展开。假设有身份证。高斯随机样本,我们建立高维收敛到真正的协方差的速度,因为样本数和变量数都趋于无穷大。对于低分离秩的协方差矩阵,我们的研究结果表明,PRLS具有显着更快的收敛速度比标准的样本协方差阵(SCM)估计。收敛速率捕获估计误差和近似误差之间的基本折衷,从而提供在分离秩方面的可缩放协方差估计框架,类似于协方差阵的低秩近似。MSE收敛速度推广了最近得到的Kronecker乘积协方差估计的ML触发器算法的高维速度。我们证明了一类块Toeplitz协方差阵是近似的低分离秩,并给出了最小分离秩$r$,以确保一个给定的偏差水平的界限。仿真验证了理论界。作为一个现实世界的应用程序,我们说明了实用的建议克罗内克协方差估计时空线性最小二乘预测的多变量风速测量。

英文摘要:

This paper presents a new method for estimating high dimensional covariance matrices. The method, permuted rank-penalized least-squares (PRLS), is based on a Kronecker product series expansion of the true covariance matrix. Assuming an i.i.d. Gaussian random sample, we establish high dimensional rates of convergence to the true covariance as both the number of samples and the number of variables go to infinity. For covariance matrices of low separation rank, our results establish that PRLS has significantly faster convergence than the standard sample covariance matrix (SCM) estimator. The convergence rate captures a fundamental tradeoff between estimation error and approximation error, thus providing a scalable covariance estimation framework in terms of separation rank, similar to low rank approximation of covariance matrices. The MSE convergence rates generalize the high dimensional rates recently obtained for the ML Flip-flop algorithm for Kronecker product covariance estimation. We show that a class of block Toeplitz covariance matrices is approximatable by low separation rank and give bounds on the minimal separation rank $r$ that ensures a given level of bias. Simulations are presented to validate the theoretical bounds. As a real world application, we illustrate the utility of the proposed Kronecker covariance estimator for spatio-temporal linear least squares prediction of multivariate wind speed measurements.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑