论文检索

超越可分解图的高斯图模型贝叶斯推断AI 解读

Summary Bayesian inference for graphical models has received much attention in the literature in recent years. It is well known that, when the graph G is decomposable, Bayesian inference is significantly more tractable than in the general non-decomposable setting. Penalized likelihood inference in contrast has made tremendous gains in the past few years in terms of scalability and tractability. Bayesian inference, however, has not had the same level of success, though a…

通过交替最小化估计稀疏高斯图模型AI 解读

Several methods have recently been proposed for estimating sparse Gaussian graphical models using |$\ell_{1}$|-regularization on the inverse covariance or precision matrix. Despite recent advances, contemporary applications require even faster methods to handle ill-conditioned high-dimensional datasets. In this paper, we propose a new method for solving the sparse inverse covariance estimation problem using the alternating minimization algorithm, which effectively works as a…

Stein 协方差估计量的理论研究AI 解读

Stein proposed an estimator to address the poor performance of the sample covariance matrix for samples of small size. The estimator does not impose sparsity conditions and uses an isotonizing algorithm to preserve the order of the sample eigenvalues. Despite its superior numerical performance, its theoretical properties are not well understood. We demonstrate that Stein's covariance estimator gives modest risk reductions when it is not isotonized, and when it is isotonized…

Lasso 回归：通过 Gibbs 抽样的极限实现估计与收缩AI 解读

Summary The application of the lasso is espoused in high dimensional settings where only a small number of the regression coefficients are believed to be non-zero (i.e. the solution is sparse). Moreover, statistical properties of high dimensional lasso estimators are often proved under the assumption that the correlation between the predictors is bounded. In this vein, co-ordinatewise methods, which are the most common means of computing the lasso solution, naturally work…

具有收敛保证的高维偏相关估计凸伪似然框架AI 解读

Summary Sparse high dimensional graphical model selection is a topic of much interest in modern day statistics. A popular approach is to apply l 1-penalties to either parametric likelihoods, or regularized regression/pseudolikelihoods, with the latter having the distinct advantage that they do not explicitly assume Gaussianity. As none of the popular methods proposed for solving pseudolikelihood-based objective functions have provable convergence guarantees, it is not clear…

稳健多代理古气候重建与温度条件分位数建模AI 解读

Great strides have been made in the field of reconstructing past temperatures based on models relating temperature to temperature-sensitive paleoclimate proxies. One of the goals of such reconstructions is to assess if current climate is anomalous in a millennial context. These regression based approaches model the conditional mean of the temperature distribution as a function of paleoclimate proxies (or vice versa). Some of the recent focus in the area has considered…

基于条件数正则化的协方差估计AI 解读

Summary Estimation of high dimensional covariance matrices is known to be a difficult problem, has many applications and is of current interest to the larger statistics community. In many applications including the so-called ‘large p, small n’ setting, the estimate of the covariance matrix is required to be not only invertible but also well conditioned. Although many regularization schemes attempt to do this, none of them address the ill conditioning problem directly. We…

大规模相关性筛选AI 解读

This article addresses the problem of screening for variables with high correlations in high-dimensional data in which there can be many fewer samples than variables. We focus on threshold-based correlation screening methods for three related applications: screening for variables with large correlations within a single treatment (autocorrelation screening), screening for variables with large cross-correlations over two treatments (cross-correlation screening), and screening…

可分解协方差图模型的 Wishart 分布AI 解读

Gaussian covariance graph models encode marginal independence among the components of a multivariate random vector by means of a graph G. These models are distinctly different from the traditional concentration graph models (often also referred to as Gaussian graphical models or covariance selection models) since the zeros in the parameter are now reflected in the covariance matrix Σ, as compared to the concentration matrix Ω = Σ−1. The parameter space of interest for…

高斯图模型中的灵活协方差估计AI 解读

In this paper, we propose a class of Bayes estimators for the covariance matrix of graphical Gaussian models Markov with respect to a decomposable graph G. Working with the WPG family defined by Letac and Massam [Ann. Statist. 35 (2007) 1278–1323] we derive closed-form expressions for Bayes estimators under the entropy and squared-error losses. The WPG family includes the classical inverse of the hyper inverse Wishart but has many more shape parameters, thus allowing for…