arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.02634cs.DScs.DMq-bio.PE
收藏

何时局部搜索既有效又高效?

When is local search both effective and efficient?

Utrecht University(乌得勒支大学)

Artem Kaznatcheev, Sofia Vazquez Alferez

AI总结:

研究探讨了局部搜索在条件光滑适应度景观上的效率问题,证明了某些算法在特定条件下高效,但其他算法仍需超多项式时间。

摘要:

组合优化问题隐式地定义了适应度景观,这些景观将要最大化的目标函数的数值结构与哪些赋值是'相邻'的组合结构结合起来。局部搜索从这个景观中的一个赋值开始,并依次移动赋值,直到在相邻赋值中无法进一步改进为止。经典对局部搜索算法的分析更关注有效性的问题(

英文摘要:

Combinatorial optimization problems implicitly define fitness landscapes that combine the numeric structure of the 'fitness' function to be maximized with the combinatorial structure of which assignments are 'adjacent'. Local search starts at an assignment in this landscape and successively moves assignments until no further improvement is possible among the adjacent assignments. Classic analyses of local search algorithms have focused more on the question of effectiveness ("did we find a good solution?") and often implicitly assumed that there are no doubts about their efficiency ("did we find it quickly?"). But there are many reasons to doubt the efficiency of local search. Even if we focus on fitness landscapes on the hypercube that are single peaked on every subcube (i.e., semismooth fitness landscapes) where effectiveness is obvious, many local search algorithms are known to be inefficient. Since fitness landscapes are unwieldy exponentially large objects, we focus on their polynomial-sized representations by instances of valued constraint satisfaction problems (VCSP). We define a "direction" for valued constraints such that directed VCSPs generate semismooth fitness landscapes. We call VCSPs oriented if they do not have any pair of variables with arcs in both directions. Since recognizing if a VCSP-instance is directed or oriented is coNP-complete, we generalized oriented VCSPs as conditionally-smooth fitness landscapes that are recognizable in polynomial time for a VCSP-instance. We prove that many popular local search algorithms like random ascent, simulated annealing, history-based rules, jumping rules, and the Kernighan-Lin heuristic are very efficient on conditionally-smooth landscapes. But conditionally-smooth landscapes are still expressive enough so that algorithms like steepest ascent and random facet require a super-polynomial number of steps to find the fitness peak.

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

↑