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.
Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems
Beijing Institute for Scientific and Engineering Computing(北京科学与工程计算研究院);Beijing University of Technology(北京工业大学);Berlin University of Technology(柏林工业大学)
Failure Prediction at Runtime for Generative Robot Policies
Technical University of Munich(慕尼黑工业大学);Munich Institute of Robotics and Machine Intelligence (MIRMI)(慕尼黑机器人与机器智能研究院);Robotics Institute Germany(德国机器人研究所);Munich Center for Machine Learning(慕尼黑机器学习中心)
Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise
University of Birmingham(伯明翰大学)
我们执行一个严格的运行时分析的单变量边际分布算法上的LeadingOnes功能,一个著名的基准功能,在理论界的演化计算与决策变量之间的高度相关性。对于大小为$n$的问题实例,当前已知的关于预期运行时间的上限是$\mathcal{O}(nλ\logλ+n^2)$(Dang and Lehre,GECCO 2015),而理解算法如何处理变量依赖关系所需的下限仍然缺失。出于这一动机,我们表明,该算法需要一个$e^{Ω(μ)}$运行时具有很高的概率,并在预期中,如果选择压力低,否则,我们得到一个下界的$Ω(\frac{nλ}{\log(λ-μ)})$的预期运行时间。此外,我们第一次考虑算法的功能下的先验噪声模型,并获得一个$\mathcal{O}(n^2)$预期运行时间的最佳参数设置。最后,我们的理论结果伴随着实证研究结果,不仅与严格的分析相匹配,而且还提供了新的见解算法的行为。
Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
Southern University of Science and Technology(南方科技大学);International Research Institute for Artificial Intelligence(国际人工智能研究院);School of Computer Science and Technology(计算机科学与技术学院);Harbin Institute of Technology(哈尔滨工业大学);Laboratoire d’Informatique (LIX)(计算机科学实验室(LIX));École Polytechnique, CNRS(法国国家科学研究中心、巴黎综合理工学院);Institute Polytechnique de Paris(巴黎理工学院)
Runtime Analysis of Evolutionary Algorithms for Multi-party Multi-objective Optimization
School of Artificial Intelligence, Nanjing University of Information Science and Technology(人工智能学院,南京信息工程大学);Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies, Institute of Cyberspace Security, School of Computer Science and Technology, Harbin Institute of Technology(新型安全智能技术广东省重点实验室,网络空间安全学院,计算机科学与技术学院,哈尔滨工业大学)