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

价值消除:基于回溯搜索的贝叶斯推理

Value Elimination: Bayesian Inference via Backtracking Search

University of Toronto(多伦多大学)

Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi

摘要:

回溯搜索是一种强大的算法范例,可用于解决许多问题。它在某种意义上是变量消去的对偶;但在许多问题上,例如,SAT,它在实践中大大优于变量消除。出于这一动机,我们研究应用回溯搜索的贝叶斯推理(贝叶斯)的问题。我们表明,自然的概括已知的技术允许回溯搜索,以实现类似的贝叶斯标准算法的性能保证,并存在的问题,回溯实际上可以做得更好。我们还表明,这些想法可以应用于实现贝叶斯推理引擎,其性能是有竞争力的标准算法。由于回溯搜索可以非常自然地利用上下文特定的结构,因此在许多问题上存在优于标准算法的性能的潜力。

英文摘要:

Backtracking search is a powerful algorithmic paradigm that can be used to solve many problems. It is in a certain sense the dual of variable elimination; but on many problems, e.g., SAT, it is vastly superior to variable elimination in practice. Motivated by this we investigate the application of backtracking search to the problem of Bayesian inference (Bayes). We show that natural generalizations of known techniques allow backtracking search to achieve performance guarantees similar to standard algorithms for Bayes, and that there exist problems on which backtracking can in fact do much better. We also demonstrate that these ideas can be applied to implement a Bayesian inference engine whose performance is competitive with standard algorithms. Since backtracking search can very naturally take advantage of context specific structure, the potential exists for performance superior to standard algorithms on many problems.

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

↑