在本地搜索时不要太严格!
Don't Be Strict in Local Search!
摘要:
局部搜索是组合优化的基本方法之一,在人工智能中得到广泛应用。一些局部搜索算法是基于搜索k-交换邻域。这是可以通过交换最多k个元素从当前解获得的解的集合。根据经验,k越大,找到改进解决方案的机会就越大。然而,对于大小为n的输入,对k-交换邻域的简单蛮力搜索需要n的O(k)次幂,这即使对于非常小的k值也是不实际的。Fellows等人(IJCAI 2009)研究了这种暴力搜索是否可以避免,并对几个组合问题给出了肯定和否定的答案。他们使用严格意义上的局部搜索概念。也就是说,即使可以有效地找到全局最优解,也需要在k交换邻域中找到改进的解。在本文中,我们考虑了一种自然放松的本地搜索,称为允许本地搜索(马克思和Schlotter,IWPEC 2009),并调查它是否增强了易于处理的输入域。我们将这种方法应用于一个基本的组合问题,顶点覆盖。更确切地说,我们表明,对于一类输入,找到一个最佳的是很难的,严格的局部搜索是很难的,但允许的局部搜索是听话的。我们在参数化复杂性的框架下进行了这项研究。
英文摘要:
Local Search is one of the fundamental approaches to combinatorial optimization and it is used throughout AI. Several local search algorithms are based on searching the k-exchange neighborhood. This is the set of solutions that can be obtained from the current solution by exchanging at most k elements. As a rule of thumb, the larger k is, the better are the chances of finding an improved solution. However, for inputs of size n, a naïve brute-force search of the k-exchange neighborhood requires n to the power of O(k) time, which is not practical even for very small values of k. Fellows et al. (IJCAI 2009) studied whether this brute-force search is avoidable and gave positive and negative answers for several combinatorial problems. They used the notion of local search in a strict sense. That is, an improved solution needs to be found in the k-exchange neighborhood even if a global optimum can be found efficiently. In this paper we consider a natural relaxation of local search, called permissive local search (Marx and Schlotter, IWPEC 2009) and investigate whether it enhances the domain of tractable inputs. We exemplify this approach on a fundamental combinatorial problem, Vertex Cover. More precisely, we show that for a class of inputs, finding an optimum is hard, strict local search is hard, but permissive local search is tractable. We carry out this investigation in the framework of parameterized complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。