arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.11481cond-mat.stat-mechmath.OC
收藏

平均场自旋玻璃中的量子阱

Algorithmic Thresholds in Mean Field Spin Glasses

Ahmed El Alaoui, Andrea Montanari

摘要:

优化一个高维非凸函数,一般来说,计算困难,这种类型的许多问题很难解决,甚至近似。复杂性理论描述了在最坏情况下在多项式时间内可达到的最佳逼近比。另一方面,当目标函数是随机的,最坏情况下的近似比过于悲观。平均场自旋玻璃是离散超立方体$\{-1,+1\}^N$上随机能量函数的正则族。这些能源景观的近优组织根据超度量树状结构,享有高度的普遍性。最近,一个精确的连接已经开始出现之间的超度量结构和最佳逼近比在多项式时间内实现的典型情况。一个新的近似消息传递(AMP)算法已经提出,利用这种连接。在变分问题解的性质的条件下,分析了该算法的渐近性态。在本文中,我们描述了该算法的第一个实现和相关的变分问题的第一个数值解。我们测试我们的方法在两个原型的平均场自旋玻璃:谢灵顿-柯克帕特里克(SK)模型,和$3$ -自旋伊辛自旋玻璃。我们观察到,该算法已经在中等大小($N\gtrsim 1000$)和它的行为是一致的理论预期。对于SK模型,它渐近地达到全局最优的任意好的近似。对于$3$ -自旋模型,它实现了一个恒定的近似比,这是预测的理论,它似乎击败了“阈值能量”实现的格劳伯动力学。最后,我们通过数值计算观察到该算法产生的中间态具有超度规树中祖先态的性质。

英文摘要:

Optimizing a high-dimensional non-convex function is, in general, computationally hard and many problems of this type are hard to solve even approximately. Complexity theory characterizes the optimal approximation ratios achievable in polynomial time in the worst case. On the other hand, when the objective function is random, worst case approximation ratios are overly pessimistic. Mean field spin glasses are canonical families of random energy functions over the discrete hypercube $\{-1,+1\}^N$. The near-optima of these energy landscapes are organized according to an ultrametric tree-like structure, which enjoys a high degree of universality. Recently, a precise connection has begun to emerge between this ultrametric structure and the optimal approximation ratio achievable in polynomial time in the typical case. A new approximate message passing (AMP) algorithm has been proposed that leverages this connection. The asymptotic behavior of this algorithm has been analyzed, conditional on the nature of the solution of a certain variational problem. In this paper we describe the first implementation of this algorithm and the first numerical solution of the associated variational problem. We test our approach on two prototypical mean-field spin glasses: the Sherrington-Kirkpatrick (SK) model, and the $3$-spin Ising spin glass. We observe that the algorithm works well already at moderate sizes ($N\gtrsim 1000$) and its behavior is consistent with theoretical expectations. For the SK model it asymptotically achieves arbitrarily good approximations of the global optimum. For the $3$-spin model, it achieves a constant approximation ratio that is predicted by the theory, and it appears to beat the `threshold energy' achieved by Glauber dynamics. Finally, we observe numerically that the intermediate states generated by the algorithm have the properties of ancestor states in the ultrametric tree.

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

↑