谨慎下降法是求解随机约束满足问题的常用方法
Circumspect descent prevails in solving random constraint satisfaction problems
摘要:
我们研究了随机局部搜索算法的性能随机情况下的$K$ -可满足性($K$ -SAT)问题。我们介绍了一种新的随机局部搜索算法,ChainSAT,它移动的能量景观的问题实例的{ \em永远不会向上}的能量。ChainSAT是一种\emph{focused}算法,因为它只考虑出现在未满足子句中的变量。我们通过大量的数值研究表明,ChainSAT和其他集中的算法解决大型$K$ -SAT的情况下,几乎肯定在线性时间,高条款变量比$α$,例如,对于K=4,我们观察到线性时间性能远远超出了最近假设的集群和凝聚过渡的解决方案空间。ChainSAT的性能令人惊讶,因为通过设计,该算法被困在它遇到的第一个局部能量最小值中,但没有遇到这样的最小值。我们还研究了随机局部搜索算法访问的解空间的几何形状。
英文摘要:
We study the performance of stochastic local search algorithms for random instances of the $K$-satisfiability ($K$-SAT) problem. We introduce a new stochastic local search algorithm, ChainSAT, which moves in the energy landscape of a problem instance by {\em never going upwards} in energy. ChainSAT is a \emph{focused} algorithm in the sense that it considers only variables occurring in unsatisfied clauses. We show by extensive numerical investigations that ChainSAT and other focused algorithms solve large $K$-SAT instances almost surely in linear time, up to high clause-to-variable ratios $α$; for example, for K=4 we observe linear-time performance well beyond the recently postulated clustering and condensation transitions in the solution space. The performance of ChainSAT is a surprise given that by design the algorithm gets trapped into the first local energy minimum it encounters, yet no such minima are encountered. We also study the geometry of the solution space as accessed by stochastic local search algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。