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

树木密度估计

Tree density estimation

Budapest University of Technology and Economics(布达佩斯技术与经济大学);Ben-Gurion University of the Negev(本-古里安大学);Ariel University(阿里埃勒大学)

László Györfi, Aryeh Kontorovich, Roi Weiss

摘要:

研究了随机向量$f(\boldsymbol x)$的密度估计问题。对于在顶点集$\{1,\dots ,d\}$上定义的生成树$T$,树密度$f_{T}$是二元条件密度的乘积。最优生成树使$f$和$f_{T}$之间的Kullback-Leibler分歧最小化。从内务部。数据,我们识别最优树$T^*$并有效地构造树密度估计$f_n$,使得在密度$f$上没有任何规律性条件的情况下,具有$\lim_{n\to \infty} \int |f_n(\boldsymbol x)-f_{T^*}(\boldsymbol x)|d\boldsymbol x=0$ a.s.对于Lipschitz有界支撑$f$,$\mathbb E \left\{ \int |f_n(\boldsymbol x)-f_{T^*}(\boldsymbol x)|d\boldsymbol x\right\}=O\big(n^{-1/4}\big)$,无量纲速率。

英文摘要:

We study the problem of estimating the density $f(\boldsymbol x)$ of a random vector ${\boldsymbol X}$ in $\mathbb R^d$. For a spanning tree $T$ defined on the vertex set $\{1,\dots ,d\}$, the tree density $f_{T}$ is a product of bivariate conditional densities. An optimal spanning tree minimizes the Kullback-Leibler divergence between $f$ and $f_{T}$. From i.i.d. data we identify an optimal tree $T^*$ and efficiently construct a tree density estimate $f_n$ such that, without any regularity conditions on the density $f$, one has $\lim_{n\to \infty} \int |f_n(\boldsymbol x)-f_{T^*}(\boldsymbol x)|d\boldsymbol x=0$ a.s. For Lipschitz $f$ with bounded support, $\mathbb E \left\{ \int |f_n(\boldsymbol x)-f_{T^*}(\boldsymbol x)|d\boldsymbol x\right\}=O\big(n^{-1/4}\big)$, a dimension-free rate.

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

↑