arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.09030stat.MLcs.AIcs.LG
收藏

Cakewalk抽样

Cakewalk Sampling

Weizmann Institute of Science(魏茨曼科学研究所)

Uri Patish, Shimon Ullman

摘要:

我们研究了在组合优化问题中寻找好的局部最优解的任务。虽然组合优化一般是NP难的,但在实践中经常使用局部最优解。然而,局部搜索方法通常会收敛到一组有限的最优值,这取决于它们的初始化。另一方面,抽样方法可以访问任何有效的解决方案,因此可以直接使用或与前一种方法一起使用,作为寻找良好局部最优解的方法。由于这种策略的有效性取决于采样分布,我们得到一个强大的学习算法,适应采样分布对良好的局部最优的任意目标函数。作为第一个用例,我们经验性地研究了采样方法可以在无向图中恢复局部最大团的效率。我们不仅展示了我们的自适应采样器如何优于相关方法,我们还展示了它如何甚至可以接近既定的团算法的性能。作为第二个用例,我们考虑如何将贪婪算法与我们的自适应采样器相结合,并演示了这如何在k-medoid聚类中实现卓越的性能。总之,这些发现表明,我们的自适应采样器可以提供一个有效的策略,在实践中出现的组合优化问题。

英文摘要:

We study the task of finding good local optima in combinatorial optimization problems. Although combinatorial optimization is NP-hard in general, locally optimal solutions are frequently used in practice. Local search methods however typically converge to a limited set of optima that depend on their initialization. Sampling methods on the other hand can access any valid solution, and thus can be used either directly or alongside methods of the former type as a way for finding good local optima. Since the effectiveness of this strategy depends on the sampling distribution, we derive a robust learning algorithm that adapts sampling distributions towards good local optima of arbitrary objective functions. As a first use case, we empirically study the efficiency in which sampling methods can recover locally maximal cliques in undirected graphs. Not only do we show how our adaptive sampler outperforms related methods, we also show how it can even approach the performance of established clique algorithms. As a second use case, we consider how greedy algorithms can be combined with our adaptive sampler, and we demonstrate how this leads to superior performance in k-medoid clustering. Together, these findings suggest that our adaptive sampler can provide an effective strategy to combinatorial optimization problems that arise in practice.

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

↑