arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math-ph/0407078math-phcs.NAmath.MPmath.NA
收藏

在复杂景观中寻找最小值:退火、贪婪与不情愿算法

Finding Minima in Complex Landscapes: Annealed, Greedy and Reluctant Algorithms

Pierluigi Contucci, Cristian Giardina', Claudio Giberti, Cecilia Vernia

AI总结:

针对具有多谷景观的复杂系统优化问题,提出一类结合退火与平衡贪婪-不情愿策略的新动力学算法,以驱动系统趋向成本函数的最深最小值,并在自旋玻璃的Sherrington-Kirkpatrick模型上展示了结果。

摘要:

我们考虑复杂系统的优化问题,其中成本函数具有多谷景观。我们引入了一类新的动力学算法,通过合适的退火过程结合平衡的贪婪-不情愿策略,驱动系统趋向成本函数的最深最小值。给出了自旋玻璃的Sherrington-Kirkpatrick模型的结果。

英文摘要:

We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced greedy-reluctant strategy drive the systems towards the deepest minimum of the cost function. Results are presented for the Sherrington-Kirkpatrick model of spin-glasses.

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

↑