In this paper, an empirical evaluation of three inference methods for uncertain reasoning is presented in the context of Pathfinder, a large expert system for the diagnosis of lymph-node pathology. The inference procedures evaluated are (1) Bayes' theorem, assuming evidence is conditionally independent given each hypothesis; (2) odds-likelihood updating, assuming evidence is conditionally independent given each hypothesis and given the negation of each hypothesis; and (3) a inference method related to the Dempster-Shafer theory of belief. Both expert-rating and decision-theoretic metrics are used to compare the diagnostic accuracy of the inference methods.
Inference Scaling Laws: An Empirical Analysis of Compute-Optimal Inference for Problem-Solving with Language Models
Institute for Interdisciplinary Information Sciences, Tsinghua University(清华大学交叉信息研究院);School of Computer Science, Carnegie Mellon University(卡内基梅隆大学计算机学院)
Branching Time Active Inference: empirical study and complexity class analysis
University of Kent(肯特大学);University of Birmingham(伯明翰大学)
主动推理是一种最先进的大脑建模框架,可以解释各种机制,如习惯形成,多巴胺能放电和好奇心。然而,最近的实现遭受的指数复杂度类时,计算所有可能的政策的时间范围内的先验。Fountas等人(2020)使用蒙特卡罗树搜索来解决这个问题,在两个不同的任务中得到了非常好的结果。此外,Champion等人(2021 a)提出了一种基于(时间)结构学习的树搜索方法。这是通过开发一种可变的消息传递方法来实现的,该方法可以实现贝叶斯网络的组合构建以进行主动推理。然而,这种消息传递树搜索方法,我们称之为分支时间主动推理(BTAI),从未进行过经验测试。在本文中,我们提出了一个实验研究的背景下,BTAI的迷宫解决代理。在这种情况下,我们表明,改进的先验偏好和更深入的搜索都有助于减轻局部最小值的脆弱性。然后,我们比较BTAI标准的主动推理(AcI)的图形导航任务。我们表明,对于小图,BTAI和AcI成功地解决了任务。对于较大的图,AcI表现出指数(空间)复杂性类,使该方法难以处理。然而,BTAI更有效地探索了政策空间,成功地扩展到更大的图表。然后,在冰冻湖环境下,将BTAI算法与POMCP算法进行了比较。实验表明,BTAI和POMCP算法积累了类似的奖励金额。此外,我们描述了当BTAI收到更多的奖励比POMCP代理,当相反的是真的。最后,我们将BTAI与Fountas et al(2020)在dSprite…