arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0302003cs.CCcond-mat.stat-mech
收藏

用“物理”方法近似分析搜索算法

Approximate analysis of search algorithms with "physical" methods

Simona Cocco, Remi Monasson, Andrea Montanari, Guilhem Semerjian

摘要:

概述了一些统计物理学方法应用于分析算法的优化问题(布尔约束的可满足性,图的顶点覆盖,解码,.)随机输入的分布。两种类型的算法进行了分析:完整的程序与回溯(戴维斯-普特南-洛夫兰-Logeman算法)和不完整的,本地搜索程序(梯度下降,随机walksat,.)。完整算法的研究利用物理概念,如相变,动力学重整化流,生长过程,…至于局部搜索过程,计算复杂性和结构的成本函数景观之间的联系受到质疑,强调亚稳态的概念。

英文摘要:

An overview of some methods of statistical physics applied to the analysis of algorithms for optimization problems (satisfiability of Boolean constraints, vertex cover of graphs, decoding, ...) with distributions of random inputs is proposed. Two types of algorithms are analyzed: complete procedures with backtracking (Davis-Putnam-Loveland-Logeman algorithm) and incomplete, local search procedures (gradient descent, random walksat, ...). The study of complete algorithms makes use of physical concepts such as phase transitions, dynamical renormalization flow, growth processes, ... As for local search procedures, the connection between computational complexity and the structure of the cost function landscape is questioned, with emphasis on the notion of metastability.

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

↑