Inference in Bayes Nets (BAYES) is an important problem with numerous applications in probabilistic reasoning. Counting the number of satisfying assignments of a propositional formula (#SAT) is a closely related problem of fundamental theoretical importance. Both these problems, and others, are members of the class of sum-of-products (SUMPROD) problems. In this paper we show that standard backtracking search when augmented with a simple memoization scheme (caching) can solve any sum-of-products problem with time complexity that is at least as good any other state-of-the-art exact algorithm, and that it can also achieve the best known time-space tradeoff. Furthermore, backtracking's ability to utilize more flexible variable orderings allows us to prove that it can achieve an exponential speedup over other standard algorithms for SUMPROD on some instances.
The ideas presented here have been utilized in a number of solvers that have been applied to various types of sum-of-product problems. These system's have exploited the fact that backtracking can naturally exploit more of the problem's structure to achieve improved performance on a range of probleminstances. Empirical evidence of this performance gain has appeared in published works describing these solvers, and we provide references to these works.
The backtracking survey propagation algorithm for solving random K-SAT problems
NORDITA(北欧理论物理研究所);AlbaNova University Centre(阿尔巴诺瓦大学中心);KTH-Royal Institute of Technology(KTH皇家理工学院);Stockholm University(斯德哥尔摩大学);Sapienza Università di Roma(罗马第一大学);Istituto Nazionale di Fisica Nucleare(意大利国家核物理研究所);CNR-Nanotec(意大利国家研究委员会纳米技术研究所)
Intelligent search strategies based on adaptive Constraint Handling Rules
自适应约束处理与约束处理规则(约束处理规则)的最先进的实现允许智能搜索策略的应用,以解决约束满足问题(CSP)。本报告比较了改进版本的冲突导向的backjumping和两个变种的动态回溯相对于时间回溯的一些AIM的情况下,这是一个基准集的随机3-SAT问题。因此,在Java中与这些不同的搜索策略相结合的布尔约束求解器的并行实现与在SICStus Prolog中与时间回溯相结合的相同布尔约束求解器的并行实现进行比较。这一比较表明,在搜索过程中增加“情报”可能会大大减少搜索步骤的数量。此外,它们的Java实现的运行时在大多数情况下比按时间顺序回溯的实现更快。更具体地说,冲突导向的反向跳转甚至比SICStus Prolog实现的时间回溯更快,尽管我们的Java实现缺少SICStus Prolog系统中的优化。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)
Learning Variable Ordering Heuristics for Solving Constraint Satisfaction Problems
Shandong University(山东大学);Singapore Institute of Manufacturing Technology(新加坡制造技术研究院);Nanyang Technological University(南洋理工大学);Southwest Jiaotong University(西南交通大学)
Solving Bayesian inverse problems with diffusion priors and off-policy RL
Mila, Université de Montréal(米拉-蒙特利尔大学);KAIST(韩国科学技术院);Jagiellonian University(雅盖隆大学);Ciela Institute(西拉研究所);Dreamfold(德雷姆福尔德公司);Recursion(递归公司);CIFAR(加拿大高级研究院);University of Edinburgh(爱丁堡大学)
Can Transformers Learn to Verify During Backtracking Search?
Yin Jun Phua (corresponding author) Institute of Science Tokyo, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8550, Japan Tony Ribeiro Centrale Nantes, CNRS, Laboratoire des Sciences du Num\'erique de Nantes, LS2N, UMR 6004, F-44000 Nantes, France National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan Steelous Protocol, 8-20-32, Ginza, Chuo-ku, Tokyo 104-0061, Japan Tuan Nguyen Hanoi University of Science;Technology, No. 1 Dai Co Viet, Hai Ba Trung, Ha Noi, Vietnam Katsumi Inoue National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan
School of Computer Science and Technology, Anhui University(安徽大学计算机科学与技术学院);School of Computer and Information, Hefei University of Technology(合肥工业大学计算机与信息学院);School of Information Technology and Mathematical Sciences, University of South Australia(南澳大学信息技术与数学科学学院)