arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.6933math.STcs.LGstat.MLstat.TH
收藏

弱假设下的无向图估计

Estimating Undirected Graphs Under Weak Assumptions

Carnegie Mellon University(卡内基梅隆大学);The University of Chicago(芝加哥大学)

Larry Wasserman, Mladen Kolar, Alessandro Rinaldo

摘要:

我们考虑在弱假设下为无向图提供非参数置信保证的问题。特别是,我们不假设稀疏性,不相干性或正态性。我们允许尺寸$D$随样本量$n$增加。首先,我们证明了下界表明,如果我们想要准确的推断与低假设,那么有限制的尺寸作为一个函数的样本量。当维度随着样本量的增加而缓慢增加时,我们表明基于正态近似和自举的方法导致有效的推断,并且我们提供了关于正态近似的准确性的Berry-Esseen界。当维数相对于样本量较大时,不可能在低假设下对图形进行准确推断。相反,我们建议估计的东西要求低于整个偏相关图。特别地,我们考虑:聚类图,限制偏相关图和相关图。

英文摘要:

We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension $D$ to increase with the sample size $n$. First, we prove lower bounds that show that if we want accurate inferences with low assumptions then there are limitations on the dimension as a function of sample size. When the dimension increases slowly with sample size, we show that methods based on Normal approximations and on the bootstrap lead to valid inferences and we provide Berry-Esseen bounds on the accuracy of the Normal approximation. When the dimension is large relative to sample size, accurate inferences for graphs under low assumptions are not possible. Instead we propose to estimate something less demanding than the entire partial correlation graph. In particular, we consider: cluster graphs, restricted partial correlation graphs and correlation graphs.

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

↑