arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2504.04576stat.MLcs.LGeess.SP
收藏

拉普拉斯矩阵估计的克拉美-罗界

Cramer-Rao Bounds for Laplacian Matrix Estimation

School of Electrical and Computer Engineering, Ben-Gurion University of the Negev(内盖夫本-古里安大学电气与计算机工程学院);Department of Electrical and Computer Engineering, Princeton University(普林斯顿大学电气与计算机工程系)

Morad Halihal, Tirza Routtenberg, H. Vincent Poor

AI总结:

本文针对拉普拉斯矩阵估计问题,利用线性重参数化推导了闭式克拉美-罗界,并扩展到稀疏约束情形提出两种oracle CRB,通过电力系统拓扑识别等应用验证了约束最大似然估计器的均方误差可收敛到所提界。

摘要:

本文分析了在一般观测模型下拉普拉斯矩阵估计的性能。拉普拉斯矩阵估计涉及结构约束,包括对称性、零空间性质以及矩阵稀疏性。通过利用一种强制结构约束的线性重参数化方法,我们推导出了专门适用于拉普拉斯矩阵估计的克拉美-罗界(CRB)的闭式矩阵表达式。我们进一步将推导扩展到稀疏约束情形,引入了两个oracle CRB,它们融合了支撑集的先验信息,即拉普拉斯矩阵中非零元素的位置。我们考察了这些界之间的性质和序关系,并给出了高斯情形下相应的Slepian-Bangs公式。我们在三个代表性应用中展示了新CRB的用途:(i)电力系统中的拓扑识别,(ii)扩散模型中的图滤波器识别,以及(iii)拉普拉斯约束下高斯马尔可夫随机场中的精度矩阵估计。我们对CRB与约束最大似然估计器(CMLE)以及oracle CMLE的均方误差(MSE)进行了评估和比较,其中CMLE同时集成了等式约束、不等式约束和稀疏约束,而oracle CMLE已知拉普拉斯矩阵中非零元素的位置。我们针对电力系统拓扑识别和图形LASSO这两个应用进行了该分析,并证明在测量数量足够的情况下,估计器的MSE收敛到CRB和oracle CRB。

英文摘要:

In this paper, we analyze the performance of the estimation of Laplacian matrices under general observation models. Laplacian matrix estimation involves structural constraints, including symmetry and null-space properties, along with matrix sparsity. By exploiting a linear reparametrization that enforces the structural constraints, we derive closed-form matrix expressions for the Cramer-Rao Bound (CRB) specifically tailored to Laplacian matrix estimation. We further extend the derivation to the sparsity-constrained case, introducing two oracle CRBs that incorporate prior information of the support set, i.e. the locations of the nonzero entries in the Laplacian matrix. We examine the properties and order relations between the bounds, and provide the associated Slepian-Bangs formula for the Gaussian case. We demonstrate the use of the new CRBs in three representative applications: (i) topology identification in power systems, (ii) graph filter identification in diffused models, and (iii) precision matrix estimation in Gaussian Markov random fields under Laplacian constraints. The CRBs are evaluated and compared with the mean-squared-errors (MSEs) of the constrained maximum likelihood estimator (CMLE), which integrates both equality and inequality constraints along with sparsity constraints, and of the oracle CMLE, which knows the locations of the nonzero entries of the Laplacian matrix. We perform this analysis for the applications of power system topology identification and graphical LASSO, and demonstrate that the MSEs of the estimators converge to the CRB and oracle CRB, given a sufficient number of measurements.

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

↑