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

算法预测:方法与评估

Algorithm Runtime Prediction: Methods & Evaluation

University of British Columbia(不列颠哥伦比亚大学)

Frank Hutter, Lin Xu, Holger H. Hoos, Kevin Leyton-Brown

摘要:

也许令人惊讶的是,使用机器学习技术来构建算法运行时的模型,作为特定于问题的实例特征的函数,可以预测算法在以前看不见的输入上运行多长时间。这些模型在算法分析、基于组合的算法选择以及参数化算法的自动配置等方面有着重要的应用。在过去的十年中,已经研究了各种各样的技术来建立这样的模型。在这里,我们描述了现有模型的扩展和改进,新的模型家族,以及-也许最重要的-更彻底的处理算法参数作为模型输入。我们还全面描述了新的和现有的功能预测算法运行时的命题可满足性(SAT),旅行推销员(TSP)和混合整数规划(MIP)的问题。我们评估这些创新,通过最大的实证分析,比较广泛的运行时建模技术的文献。我们的实验考虑了11种算法和35种实例分布;它们也涵盖了非常广泛的SAT、MIP和TSP实例,其中结构化程度最低的是随机均匀生成的,而结构化程度最高的是从实际工业应用中产生的。总的来说,我们证明了我们的新模型产生更好的运行时预测比以前的方法在其推广到新的问题实例,新的算法从参数化空间,并同时。

英文摘要:

Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a previously unseen input, using machine learning techniques to build a model of the algorithm's runtime as a function of problem-specific instance features. Such models have important applications to algorithm analysis, portfolio-based algorithm selection, and the automatic configuration of parameterized algorithms. Over the past decade, a wide variety of techniques have been studied for building such models. Here, we describe extensions and improvements of existing models, new families of models, and -- perhaps most importantly -- a much more thorough treatment of algorithm parameters as model inputs. We also comprehensively describe new and existing features for predicting algorithm runtime for propositional satisfiability (SAT), travelling salesperson (TSP) and mixed integer programming (MIP) problems. We evaluate these innovations through the largest empirical analysis of its kind, comparing to a wide range of runtime modelling techniques from the literature. Our experiments consider 11 algorithms and 35 instance distributions; they also span a very wide range of SAT, MIP, and TSP instances, with the least structured having been generated uniformly at random and the most structured having emerged from real industrial applications. Overall, we demonstrate that our new models yield substantially better runtime predictions than previous approaches in terms of their generalization to new problem instances, to new algorithms from a parameterized space, and to both simultaneously.

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

↑