arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.07615cs.AIcs.LG
收藏

预测算法分布的神经网络

Neural Networks for Predicting Algorithm Runtime Distributions

University of Freiburg(弗莱堡大学)

Katharina Eggensperger, Marius Lindauer, Frank Hutter

摘要:

许多用于解决人工智能(AI)中的困难组合问题的最先进算法包括随机性元素,这些元素导致运行时的高度变化,即使对于固定的问题实例也是如此。关于给定问题实例上的算法的所得运行时分布(RTD)的知识可以在各种元算法过程中被利用,例如算法选择、投资组合和随机重启。先前的工作已经表明,机器学习可以用于单独预测RTD的均值、中位数和方差。为了建立一个新的国家的最先进的预测RTD,我们证明了一个RTD的参数应该共同学习,神经网络可以做到这一点,通过直接优化RTD给定的运行时观察的可能性。在涉及SAT求解和AI规划的五种算法的实证研究中,我们表明,神经网络比以前的方法更好地预测未见过实例的真实RTD,甚至可以在每个训练实例只有很少的运行时观察时做到这一点。

英文摘要:

Many state-of-the-art algorithms for solving hard combinatorial problems in artificial intelligence (AI) include elements of stochasticity that lead to high variations in runtime, even for a fixed problem instance. Knowledge about the resulting runtime distributions (RTDs) of algorithms on given problem instances can be exploited in various meta-algorithmic procedures, such as algorithm selection, portfolios, and randomized restarts. Previous work has shown that machine learning can be used to individually predict mean, median and variance of RTDs. To establish a new state-of-the-art in predicting RTDs, we demonstrate that the parameters of an RTD should be learned jointly and that neural networks can do this well by directly optimizing the likelihood of an RTD given runtime observations. In an empirical study involving five algorithms for SAT solving and AI planning, we show that neural networks predict the true RTDs of unseen instances better than previous methods, and can even do so when only few runtime observations are available per training instance.

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

↑