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

次随机蒙特卡罗算法

Substochastic Monte Carlo Algorithms

Michael Jarret, Brad Lackey

摘要:

本文介绍并形式化了次随机蒙特卡罗(SSMC)算法。这些算法,最初打算是一个更好的经典箔量子退火比模拟退火,证明是值得优化算法在自己的权利。在SSMC中,根据任意搜索空间上的已知分布初始化步行者群体,并将其改变为感兴趣的某些优化问题的解。本文的第一个论点表明,如何现有的经典算法,“去与赢家”(GWW),是一个限制的情况下,SSMC时,限制二进制搜索和特定的驾驶动态。虽然仅限于GWW,但SSMC更普遍。我们证明了(1)GWW可以在SSMC框架内有效地模拟,(2)SSMC可以比GWW以指数方式更快,(3)通过自然地结合结构信息,SSMC可以以指数方式优于最初启发它的量子算法,(4)SSMC在一般空间中表现出理想的搜索特性。我们的方法结合了遗传算法(GWW),理论概率(Fleming-Viot过程)和量子计算的思想。我们不仅证明了SSMC通常比竞争算法更有效,而且我们还希望我们将这些学科联系起来的结果将独立地影响每个学科。SSMC的一个实现版本以前已经作为Max-$k$-SAT的竞争性优化算法取得了一些成功。

英文摘要:

In this paper we introduce and formalize Substochastic Monte Carlo (SSMC) algorithms. These algorithms, originally intended to be a better classical foil to quantum annealing than simulated annealing, prove to be worthy optimization algorithms in their own right. In SSMC, a population of walkers is initialized according to a known distribution on an arbitrary search space and varied into the solution of some optimization problem of interest. The first argument of this paper shows how an existing classical algorithm, "Go-With-The-Winners" (GWW), is a limiting case of SSMC when restricted to binary search and particular driving dynamics. Although limiting to GWW, SSMC is more general. We show that (1) GWW can be efficiently simulated within the SSMC framework, (2) SSMC can be exponentially faster than GWW, (3) by naturally incorporating structural information, SSMC can exponentially outperform the quantum algorithm that first inspired it, and (4) SSMC exhibits desirable search features in general spaces. Our approach combines ideas from genetic algorithms (GWW), theoretical probability (Fleming-Viot processes), and quantum computing. Not only do we demonstrate that SSMC is often more efficient than competing algorithms, but we also hope that our results connecting these disciplines will impact each independently. An implemented version of SSMC has previously enjoyed some success as a competitive optimization algorithm for Max-$k$-SAT.

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

↑