arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.2474cs.AI
收藏

基于变换的算法组合特征计算

Transformation-based Feature Computation for Algorithm Portfolios

Insight Centre for Data Analytics(洞察数据分析中心);University College Cork(科克大学学院);Oracle America Inc.(甲骨文美国公司)

Barry Hurley, Serdar Kadioglu, Yuri Malitsky, Barry O'Sullivan

摘要:

实例特定的算法配置和算法组合已被证明在各种应用领域中提供比单一算法方法显著的改进。在SAT和CSP领域,算法组合在过去五年中一直主导着这些领域的主要竞争。要使组合办法有效,必须满足两个关键条件。首先,需要一组互补的求解器来制作投资组合。其次,必须有一个问题特征的集合,可以准确地识别实例之间的结构差异。本文重点讨论后一个问题:特征表示,因为,与SAT不同,不是每个问题都有很好的研究特征。我们采用著名的SATzilla功能集,但计算不同的SAT编码的CSP的替代集。我们表明,无论使用什么编码转换的实例,保持足够的结构信息,以区分问题的实例,这可以被利用,使一个有效的投资组合为基础的CSP求解器。

英文摘要:

Instance-specific algorithm configuration and algorithm portfolios have been shown to offer significant improvements over single algorithm approaches in a variety of application domains. In the SAT and CSP domains algorithm portfolios have consistently dominated the main competitions in these fields for the past five years. For a portfolio approach to be effective there are two crucial conditions that must be met. First, there needs to be a collection of complementary solvers with which to make a portfolio. Second, there must be a collection of problem features that can accurately identify structural differences between instances. This paper focuses on the latter issue: feature representation, because, unlike SAT, not every problem has well-studied features. We employ the well-known SATzilla feature set, but compute alternative sets on different SAT encodings of CSPs. We show that regardless of what encoding is used to convert the instances, adequate structural information is maintained to differentiate between problem instances, and that this can be exploited to make an effective portfolio-based CSP solver.

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

↑