改进的branch-and-cut算法样本复杂度界
Improved Sample Complexity Bounds for Branch-and-Cut
摘要:
分支切割算法是求解整数规划最广泛使用的算法,被CPLEX和Guesthouse等商业求解器采用。branch-and-cut有各种各样的可调参数,这些参数对它构建的搜索树的大小有很大的影响,但手动调优很有挑战性。一种越来越流行的方法是使用机器学习来调整这些参数:使用来自当前应用领域的整数程序的训练集,目标是找到对来自同一领域的未来不可见整数程序具有强预测性能的配置。如果训练集太小,则配置可能在训练集上具有良好的性能,但在未来的整数程序上性能较差。在本文中,我们证明了这个过程的样本复杂性保证,这限制了训练集应该有多大,以确保对于任何配置,其在训练集上的平均性能接近其预期的未来性能。我们的保证适用于控制分支和切割的最重要方面的参数:节点选择,分支约束选择和切割平面选择,并且比以前的研究中发现的更尖锐和更一般。
英文摘要:
Branch-and-cut is the most widely used algorithm for solving integer programs, employed by commercial solvers like CPLEX and Gurobi. Branch-and-cut has a wide variety of tunable parameters that have a huge impact on the size of the search tree that it builds, but are challenging to tune by hand. An increasingly popular approach is to use machine learning to tune these parameters: using a training set of integer programs from the application domain at hand, the goal is to find a configuration with strong predicted performance on future, unseen integer programs from the same domain. If the training set is too small, a configuration may have good performance over the training set but poor performance on future integer programs. In this paper, we prove sample complexity guarantees for this procedure, which bound how large the training set should be to ensure that for any configuration, its average performance over the training set is close to its expected future performance. Our guarantees apply to parameters that control the most important aspects of branch-and-cut: node selection, branching constraint selection, and cutting plane selection, and are sharper and more general than those found in prior research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。