arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1006.3972stat.MLstat.ME
收藏

图值回归

Graph-Valued Regression

Han Liu, Xi Chen, John Lafferty, Larry Wasserman

摘要:

无向图形模型在图$G$中编码随机向量$Y$的依赖性结构。在许多应用中,在给定另一个随机向量$X$作为输入的情况下对$Y$建模是有意义的。我们把估计以$X=x$为条件的$Y$的图$G(x)$的问题称为“图值回归”。在本文中,我们提出了一种半参数方法来估计$G(x)$,该方法在$X$空间上建立一棵树,就像在CART(分类和回归树)中一样,但在树的每个叶子上估计一个图。我们称这种方法为“图优化的CART”或Go-CART。我们研究了基于二元划分树的Go-CART的理论性质,建立了关于风险最小化和树划分一致性的预言不等式。我们还演示了Go-CART在气象数据集上的应用,展示了图值回归如何为分析复杂数据提供有用的工具。

英文摘要:

Undirected graphical models encode in a graph $G$ the dependency structure of a random vector $Y$. In many applications, it is of interest to model $Y$ given another random vector $X$ as input. We refer to the problem of estimating the graph $G(x)$ of $Y$ conditioned on $X=x$ as ``graph-valued regression.'' In this paper, we propose a semiparametric method for estimating $G(x)$ that builds a tree on the $X$ space just as in CART (classification and regression trees), but at each leaf of the tree estimates a graph. We call the method ``Graph-optimized CART,'' or Go-CART. We study the theoretical properties of Go-CART using dyadic partitioning trees, establishing oracle inequalities on risk minimization and tree partition consistency. We also demonstrate the application of Go-CART to a meteorological dataset, showing how graph-valued regression can provide a useful tool for analyzing complex data.

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

↑