arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.01093cs.AI
收藏

用ILP引导抽样生成近优解

Generation of Near-Optimal Solutions Using ILP-Guided Sampling

BITS-Pilani, Goa Campus(比尔拉理工学院果阿校区);TCS Research(TCS研究院)

Ashwin Srinivasan, Gautam Shroff, Lovekesh Vig, Sarmimala Saikia, Puneet Agarwal

摘要:

我们在本文中的兴趣是在优化问题是难以解决的直接数值优化,但仍然有大量的相关领域的特定知识。被称为分布估计算法(EDA)的启发式搜索技术的类别寻求从概率分布中递增地采样,其中最优(或接近最优)解具有越来越高的概率。我们能否使用领域知识来帮助估计这些分布?要对此做出肯定的回答,我们需要:(a)在构建最优值模型时纳入领域知识的通用技术;以及(b)使用这些模型生成新数据样本的方法。在这里,我们研究的组合使用归纳逻辑程序设计(ILP)(a),和标准的逻辑编程机器生成新的样本(b)。具体而言,在分布估计的每次迭代中,使用ILP引擎来构造用于良好解决方案的模型。然后使用所得到的理论来指导新数据实例的生成,新数据实例现在限于使用ILP模型结合背景知识可导出的数据实例。我们展示了两个优化问题的方法(预测最佳深度的KRK残局,和车间作业调度)。我们的结果是有希望的:(a)在每次迭代的分布估计中,用ILP理论获得的样本比没有理论的样本具有更大比例的良好解;以及(b)在分布估计终止时,用ILP理论获得的样本比没有理论的样本包含更多的接近最优的样本。两者合计,这些结果表明,使用ILP构建的理论可能是一个有用的技术,将复杂的领域知识的估计分布程序。

英文摘要:

Our interest in this paper is in optimisation problems that are intractable to solve by direct numerical optimisation, but nevertheless have significant amounts of relevant domain-specific knowledge. The category of heuristic search techniques known as estimation of distribution algorithms (EDAs) seek to incrementally sample from probability distributions in which optimal (or near-optimal) solutions have increasingly higher probabilities. Can we use domain knowledge to assist the estimation of these distributions? To answer this in the affirmative, we need: (a)a general-purpose technique for the incorporation of domain knowledge when constructing models for optimal values; and (b)a way of using these models to generate new data samples. Here we investigate a combination of the use of Inductive Logic Programming (ILP) for (a), and standard logic-programming machinery to generate new samples for (b). Specifically, on each iteration of distribution estimation, an ILP engine is used to construct a model for good solutions. The resulting theory is then used to guide the generation of new data instances, which are now restricted to those derivable using the ILP model in conjunction with the background knowledge). We demonstrate the approach on two optimisation problems (predicting optimal depth-of-win for the KRK endgame, and job-shop scheduling). Our results are promising: (a)On each iteration of distribution estimation, samples obtained with an ILP theory have a substantially greater proportion of good solutions than samples without a theory; and (b)On termination of distribution estimation, samples obtained with an ILP theory contain more near-optimal samples than samples without a theory. Taken together, these results suggest that the use of ILP-constructed theories could be a useful technique for incorporating complex domain-knowledge into estimation distribution procedures.

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

↑