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

利用矩阵乘法求解最大可满足性问题(MaxSAT)

Solving MaxSAT with Matrix Multiplication

Google DeepMind(谷歌DeepMind)

David Warde-Farley, Vinod Nair, Yujia Li, Ivan Lobov, Felix Gimeno, Simon Osindero

AI总结:

该研究提出适配神经网络加速器的MaxSAT不完全算法RbmSAT,通过构建RBM结合块吉布斯采样搜索解空间,辅以单元传播启发式,在多组MaxSAT评测基准上性能优于现有求解器。

摘要:

我们提出了一种专门针对GPU、TPU等神经网络加速器设计的最大可满足性(MaxSAT)不完全算法。给定一个合取范式形式的MaxSAT问题实例,我们的方法会构建一个受限玻尔兹曼机(Restricted Boltzmann Machine,RBM),其平衡分布中,布尔赋值的概率与该赋值满足的子句数量呈指数关系。我们采用块吉布斯采样(Block Gibbs sampling),通过并行马尔可夫链对赋值空间进行随机搜索。由于矩阵乘法是RBM中块吉布斯采样的核心计算基元,我们的方法形成了一种简洁优雅的算法(仅40行JAX代码),非常适配神经网络加速器。关于RBM的理论结果保证,RBM所需的可见单元和隐藏单元数量仅与MaxSAT实例中的变量数量和固定大小子句数量呈线性关系,确保吉布斯步的计算成本随实例规模增长处于合理范围。我们既可以通过在单个加速器内批量运行并行链,也可以通过将其分布到多个加速器上来提升搜索吞吐量。作为进一步增强,我们会周期性地对采样得到的赋值应用一种基于CPU上运行的单元传播的启发式方法。我们将该方法命名为RbmSAT,是MaxSAT领域算法-硬件协同设计空间中的一个新设计点。我们在2018至2021年年度MaxSAT评测的不完全无权重赛道的部分问题实例上给出了计时结果。在分配相同运行时间和CPU计算预算(但不使用TPU)的情况下,RbmSAT在四年中三年的竞赛问题上表现优于其他参赛求解器。在专为RbmSAT设计的TPU集群上分配相同运行时间时,它在所有四年的问题上表现均优于所有求解器。

英文摘要:

We propose an incomplete algorithm for Maximum Satisfiability (MaxSAT) specifically designed to run on neural network accelerators such as GPUs and TPUs. Given a MaxSAT problem instance in conjunctive normal form, our procedure constructs a Restricted Boltzmann Machine (RBM) with an equilibrium distribution wherein the probability of a Boolean assignment is exponential in the number of clauses it satisfies. Block Gibbs sampling is used to stochastically search the space of assignments with parallel Markov chains. Since matrix multiplication is the main computational primitive for block Gibbs sampling in an RBM, our approach leads to an elegantly simple algorithm (40 lines of JAX) well-suited for neural network accelerators. Theoretical results about RBMs guarantee that the required number of visible and hidden units of the RBM scale only linearly with the number of variables and constant-sized clauses in the MaxSAT instance, ensuring that the computational cost of a Gibbs step scales reasonably with the instance size. Search throughput can be increased by batching parallel chains within a single accelerator as well as by distributing them across multiple accelerators. As a further enhancement, a heuristic based on unit propagation running on CPU is periodically applied to the sampled assignments. Our approach, which we term RbmSAT, is a new design point in the algorithm-hardware co-design space for MaxSAT. We present timed results on a subset of problem instances from the annual MaxSAT Evaluation's Incomplete Unweighted Track for the years 2018 to 2021. When allotted the same running time and CPU compute budget (but no TPUs), RbmSAT outperforms other participating solvers on problems drawn from three out of the four years' competitions. Given the same running time on a TPU cluster for which RbmSAT is uniquely designed, it outperforms all solvers on problems drawn from all four years.

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

↑