Change Point Detection in Precision Matrices with D-trace Loss
The University of Hong Kong(香港大学);Keio University(庆应义塾大学);RIKEN(理化学研究所);OIST (MLDS unit)(冲绳科学技术大学院大学(机器学习与数据科学单元));The Hong Kong Polytechnic University(香港理工大学);The University of Tokyo(东京大学);Center for Advanced Intelligence Project, RIKEN(理化学研究所先进智能项目中心)
Ying Lin, Benjamin Poignard, Ting Kei Pong, Akiko Takeda
We consider the problem of estimating a time-varying sparse precision matrix, which is assumed to evolve in a piecewise constant manner. Building upon the Group Fused LASSO and LASSO penalty functions, we estimate both the precision matrix and the change points. We propose an alternative estimator to the commonly employed Gaussian likelihood loss, namely the D-trace loss. We provide the conditions for the consistency of the estimated change points and of the sparse estimators in each block. We show that the solutions to the corresponding estimation problem exist when some conditions relating to the tuning parameters of the penalty functions are satisfied. Unfortunately, these conditions are not verifiable in general, posing challenges for tuning the parameters in practice. To address this issue, we introduce a modified regularizer and develop a revised problem that always admits solutions: these solutions can be used for detecting possible unsolvability of the original problem or obtaining a solution of the original problem otherwise. An alternating direction method of multipliers (ADMM) is then proposed to solve the revised problem. The relevance of the method is illustrated through numerical experiments.
Application of fused graphical lasso to statistical inference for multiple sparse precision matrices
本文利用融合图套索(FGL)方法同时估计多个总体的多个精度矩阵。FGL模型中的套索惩罚是对精度矩阵稀疏性的约束,并且对来自不同组的两个精度矩阵的适度惩罚抑制了多个组之间的相似结构。在高维情形下,给出了FGL估计的一个预言不等式,这是建立中心极限律所必需的。本文不仅研究了精度矩阵的点估计问题,而且研究了多个精度矩阵元素的线性组合的假设检验问题。受Jankova a和van de Geer的启发[用于高维逆协方差估计的置信区间,Electron. J. Stat. 9(1)(2015)1205-1229.],为了实现统计推断,研究了一种去偏技术以获得一个新的具有已知分布的相容估计,我们将统计推断问题推广到多总体,并提出了去偏FGL估计。给出了相应的去偏FGL估计量的渐近性质。仿真研究表明,所提出的测试工程以及在高维的情况下。
Estimating Large Precision Matrices via Modified Cholesky Decomposition
我们引入了$k$带状Cholesky先验估计的高维带状精度矩阵通过修改的Cholesky分解。对分解的Cholesky因子施加了可带性假设。在谱范数和矩阵$\ell_{\infty}$范数下得到了P-损失收敛速度和极大极小下界。由于P损失收敛速度(Lee and Lee(2017))比后验收敛速度更强,因此获得的速度也是后验收敛速度。当真精度矩阵为具有有限$k_0$的$k_0$带状矩阵时,所得的P-损失收敛速度与极小极大收敛速度一致.所建立的收敛速度略慢于极小极大下界,但这些是最快的速度为带宽精度矩阵之间的现有贝叶斯方法。仿真研究进行比较的性能,在各种情况下的其他竞争力的估计。
Miscellaneous results related to the Gaussian product inequality conjecture for the joint distribution of traces of Wishart matrices
本文报道了Wishart矩阵迹的联合分布的Gaussian乘积不等式(GPI)猜想的部分结果。特别是,Wei(2014)和Liu et al.(2015)的几个GPI相关结果以两种方式扩展:用更一般的函数类替换幂函数,以及用更一般的trace-Wishart分布假设替换通常的高斯和多元伽马分布假设。这些研究结果表明,克罗内克积形式的GPI持有对角块的任何Wishart分布。
Simultaneous Inference for Covariance and Precision Matrices of Long-Range Dependent Time Series
Booth School of Business, The University of Chicago(芝加哥大学布斯商学院);Marshall School of Business, University of Southern California(南加州大学马歇尔商学院);Department of Statistics and Data Science, Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学统计与数据科学系);Department of Statistics, The University of Chicago(芝加哥大学统计学系)