.png){kind=icon}
返回
High-dimensional graphs and variable selection with the Lasso
.png){kind=icon}
OA
AI
DOI：10.1214/009053606000000281.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs. Neighborhood selection estimates the conditional independence restrictions separately for each node in the graph and is hence equivalent to variable selection for Gaussian linear models. We show that the proposed neighborhood selection scheme is consistent for sparse high-dimensional graphs. Consistency hinges on the choice of the penalty parameter. The oracle value for optimal prediction does not lead to a consistent neighborhood estimate. Controlling instead the probability of falsely joining some distinct connectivity components of the graph, consistent estimation for sparse graphs is achieved (with exponential rates), even when the number of variables grows as the number of observations raised to an arbitrary power.
Keyword:
linear regression
covariance selection
Gaussian graphical models
penalized regression
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
暂无机构信息
引用论文
Microsurgical treatment of injury to peripheral nerves in upper and lower limbs: A critical review of the last 8 years.png)
Microsurgery
MicrosurgeryIF0
PREAI
分享收藏分享收藏分享收藏分享收藏Variance models of the last age interval and their impact on life expectancy at subnational scales
OAAI
OAAI分享收藏
查看更多内容