Smooth-projected Neighborhood Pursuit for High-dimensional Nonparanormal Graph Estimation
| 
73 | 
45 | 
0
Abstract
We introduce a new learning algorithm, named smooth-projected neighborhood pursuit, for estimating high dimensional undirected graphs. In particularly, we focus on the nonparanormal graphical model and provide theoretical guarantees for graph estimation consistency. In addition to new computational and theoretical analysis, we also provide an alternative view to analyze the tradeoff between computational efficiency and statistical error under a smoothing optimization framework. Numerical results on both synthetic and real datasets are provided to support our theory.
还没有评论，说两句吧！
热门资源
Stratified Strate...
In this paper we introduce Stratified Strategy ...
The Variational S...
Unlike traditional images which do not offer in...
Learning to learn...
The move from hand-designed features to learned...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Learning to Predi...
Much of model-based reinforcement learning invo...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
