arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.3511cs.LGcs.CLstat.ML
收藏

通过最小化大小、散度或其和进行推理

Inference by Minimizing Size, Divergence, or their Sum

University of Massachusetts(马萨诸塞大学)

Sebastian Riedel, David A. Smith, Andrew McCallum

摘要:

我们通过忽略对整体准确性没有显著贡献的因素来加速边缘推理。为了选择一个合适的子集的因素忽略,我们提出了三个方案:最小化的修剪和完整的模型之间的KL分歧的约束下的模型因子的数量;最小化的KL分歧下的约束上的因素计数;和最小化的加权和KL分歧和因素计数。所有这三个问题的解决,使用近似的KL发散比可以计算在一个简单的种子图上计算的边缘。应用于合成图像去噪和三种不同类型的NLP解析模型,该技术执行边缘推理的速度比循环BP快11倍,图形大小减少了98%-边缘和解析精度的误差相当。我们还表明,最小化的发散和大小的加权和是大大快于最小化的基础上,在这里提出的近似发散的其他目标。

英文摘要:

We speed up marginal inference by ignoring factors that do not significantly contribute to overall accuracy. In order to pick a suitable subset of factors to ignore, we propose three schemes: minimizing the number of model factors under a bound on the KL divergence between pruned and full models; minimizing the KL divergence under a bound on factor count; and minimizing the weighted sum of KL divergence and factor count. All three problems are solved using an approximation of the KL divergence than can be calculated in terms of marginals computed on a simple seed graph. Applied to synthetic image denoising and to three different types of NLP parsing models, this technique performs marginal inference up to 11 times faster than loopy BP, with graph sizes reduced up to 98%-at comparable error in marginals and parsing accuracy. We also show that minimizing the weighted sum of divergence and size is substantially faster than minimizing either of the other objectives based on the approximation to divergence presented here.

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

↑