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

CITS:求解组合优化问题的一致伊辛树搜索算法

CITS: Coherent Ising Tree Search Algorithm Towards Solving Combinatorial Optimization Problems

National University of Singapore(新加坡国立大学)

Yunuo Cen, Debasis Das, Xuanyao Fong

摘要:

在经典的启发式算法中,模拟退火(SA)算法由于其能将组合优化问题的解自然地映射到伊辛哈密顿量的基态而备受关注。然而,在实际实施中,退火过程不能任意慢,因此,它可能偏离预期的稳态玻尔兹曼分布,并陷入局部能量最小值。针对这一问题,提出了一种启发式搜索算法,将搜索空间从马尔可夫链扩展到基于SA的递归深度有限树,其中父节点和子节点代表当前和未来的自旋状态.在每一次迭代中,该算法将通过在“向前看”的意义上沿着树进行探索,在可行的搜索空间内选择最佳的近优解。此外,受相干伊辛机(CIM)的启发,我们放松的自旋状态的离散表示连续表示与正则化项,并利用约化动力学的振子探索周围的邻居所选择的树节点。我们测试了我们的算法上的一个代表性的NP难问题(MAX-CUT),以说明该算法的有效性相比,半定规划(SDP),SA,和模拟CIM。我们的研究结果表明,以上的原始算法SA和CIM,我们的高层次树搜索策略是能够提供解决方案,在更少的时代伊辛制定的NP-优化问题。

英文摘要:

Simulated annealing (SA) attracts more attention among classical heuristic algorithms because the solution of the combinatorial optimization problem can be naturally mapped to the ground state of the Ising Hamiltonian. However, in practical implementation, the annealing process cannot be arbitrarily slow and hence, it may deviate from the expected stationary Boltzmann distribution and become trapped in a local energy minimum. To overcome this problem, this paper proposes a heuristic search algorithm by expanding search space from a Markov chain to a recursive depth limited tree based on SA, where the parent and child nodes represent the current and future spin states. At each iteration, the algorithm will select the best near-optimal solution within the feasible search space by exploring along the tree in the sense of `look ahead'. Furthermore, motivated by coherent Ising machine (CIM), we relax the discrete representation of spin states to continuous representation with a regularization term and utilize the reduced dynamics of the oscillators to explore the surrounding neighborhood of the selected tree nodes. We tested our algorithm on a representative NP-hard problem (MAX-CUT) to illustrate the effectiveness of this algorithm compared to semi-definite programming (SDP), SA, and simulated CIM. Our results show that above the primal heuristics SA and CIM, our high-level tree search strategy is able to provide solutions within fewer epochs for Ising formulated NP-optimization problems.

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

↑