非凸排除体积约束下的高维优化问题
High dimensional optimization under non-convex excluded volume constraints
摘要:
本文研究高维随机优化问题,其中动力学变量受非凸的排斥体积约束。我们专注于的情况下,成本函数是一个简单的二次成本和排除的体积约束建模的感知器约束满足问题。我们表明,根据密度的约束,可以有不同的情况。如果约束的数量很小,则通常具有这样的阶段,其中成本函数的基态是唯一的并且位于约束所允许的配置岛的边界上。在这种情况下,有一个本质数量的边际满足的约束。如果约束的数量增加,则进入玻璃相,其中成本函数具有再次位于允许配置的区域的边界上的许多局部极小值。在相变点,边际满足的约束的总数等于问题中的自由度的数目,因此我们说这些最小值是均衡的。我们推测,通过进一步增加的限制,系统保持均衡的可用相空间的体积收缩到零的点。我们得到我们的结果,使用副本的方法,我们还分析了一个动态的算法,Karush-Kuhn-Tucker算法,通过动态平均场论,我们展示了如何恢复副本的方法在副本对称阶段的结果。
英文摘要:
We consider high dimensional random optimization problems where the dynamical variables are subjected to non-convex excluded volume constraints. We focus on the case in which the cost function is a simple quadratic cost and the excluded volume constraints are modeled by a perceptron constraint satisfaction problem. We show that depending on the density of constraints, one can have different situations. If the number of constraints is small, one typically has a phase where the ground state of the cost function is unique and sits on the boundary of the island of configurations allowed by the constraints. In this case, there is a hypostatic number of marginally satisfied constraints. If the number of constraints is increased one enters a glassy phase where the cost function has many local minima sitting again on the boundary of the regions of allowed configurations. At the phase transition point, the total number of marginally satisfied constraints becomes equal to the number of degrees of freedom in the problem and therefore we say that these minima are isostatic. We conjecture that by increasing further the constraints the system stays isostatic up to the point where the volume of available phase space shrinks to zero. We derive our results using the replica method and we also analyze a dynamical algorithm, the Karush-Kuhn-Tucker algorithm, through dynamical mean-field theory and we show how to recover the results of the replica approach in the replica symmetric phase.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。