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

在图上使用随机森林估计逆迹

Estimating the inverse trace using random forests on graphs

Simon Barthelmé, Nicolas Tremblay, Alexandre Gaudillière, Luca Avena, Pierre-Olivier Amblard

AI总结:

针对大型矩阵正则化逆迹难以直接计算的问题,提出基于 Wilson 随机森林算法的无偏估计器,兼具快速、易实现和可扩展性,但仅适用于对角占优矩阵。

摘要:

一些数据分析问题需要计算(正则化)逆迹,即形如 $\Tr(q\bI+\bL)^{-1}$ 的量。对于大型矩阵,直接方法不可行,必须借助近似,例如使用共轭梯度求解器并结合 Girard 迹估计器(也称为 Hutchinson 迹估计器)。本文描述了一种正则化逆迹的无偏估计器,其基于 Wilson 算法,该算法最初是为在图中抽取均匀生成树而设计的。我们的方法快速、易于实现,并可扩展到超大型矩阵。其主要缺点是仅限于对角占优矩阵 $\bL$。

英文摘要:

Some data analysis problems require the computation of (regularised) inverse traces, i.e. quantities of the form $\Tr (q \bI + \bL)^{-1}$. For large matrices, direct methods are unfeasible and one must resort to approximations, for example using a conjugate gradient solver combined with Girard's trace estimator (also known as Hutchinson's trace estimator). Here we describe an unbiased estimator of the regularized inverse trace, based on Wilson's algorithm, an algorithm that was initially designed to draw uniform spanning trees in graphs. Our method is fast, easy to implement, and scales to very large matrices. Its main drawback is that it is limited to diagonally dominant matrices $\bL$.

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

↑