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

基于组合的算法选择中的推广

Generalization in portfolio-based algorithm selection

Carnegie Mellon University(卡内基梅隆大学);Optimized Markets, Inc.(优化市场公司);Strategic Machine, Inc.(战略机器公司);Strategy Robot, Inc.(战略机器人公司)

Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

摘要:

基于投资组合的算法选择在过去二十年中取得了巨大的实际成功。该算法配置过程的工作原理是首先选择不同算法参数设置的组合,然后在给定的问题实例上,使用算法选择器从具有强预测性能的组合中选择参数设置。通常,投资组合和算法选择器都是使用来自当前应用领域的典型问题实例的训练集来选择的。在本文中,我们提供了第一个可证明的保证投资组合为基础的算法选择。我们分析了训练集应该有多大,以确保所得到的算法选择器在训练集上的平均性能接近其未来(预期)性能。这涉及到分析这两个量可能出现分歧的三个关键原因:1)算法选择器的学习理论复杂度,2)投资组合的大小,以及3)算法性能的学习理论复杂度作为其参数的函数。我们一起介绍了投资组合构建和算法选择的端到端学习理论分析。我们证明,如果投资组合是大的,过拟合是不可避免的,即使是一个非常简单的算法选择器。通过实验,我们说明了我们的理论分析所暴露的权衡:随着我们增加投资组合的规模,我们可以希望为每个可能的问题实例包括一个非常合适的参数设置,但它变得不可能避免过拟合。

英文摘要:

Portfolio-based algorithm selection has seen tremendous practical success over the past two decades. This algorithm configuration procedure works by first selecting a portfolio of diverse algorithm parameter settings, and then, on a given problem instance, using an algorithm selector to choose a parameter setting from the portfolio with strong predicted performance. Oftentimes, both the portfolio and the algorithm selector are chosen using a training set of typical problem instances from the application domain at hand. In this paper, we provide the first provable guarantees for portfolio-based algorithm selection. We analyze how large the training set should be to ensure that the resulting algorithm selector's average performance over the training set is close to its future (expected) performance. This involves analyzing three key reasons why these two quantities may diverge: 1) the learning-theoretic complexity of the algorithm selector, 2) the size of the portfolio, and 3) the learning-theoretic complexity of the algorithm's performance as a function of its parameters. We introduce an end-to-end learning-theoretic analysis of the portfolio construction and algorithm selection together. We prove that if the portfolio is large, overfitting is inevitable, even with an extremely simple algorithm selector. With experiments, we illustrate a tradeoff exposed by our theoretical analysis: as we increase the portfolio size, we can hope to include a well-suited parameter setting for every possible problem instance, but it becomes impossible to avoid overfitting.

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

↑