arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2307.00670cs.LGmath.OC
收藏

通过学习问题相似性自动配置MILP求解器

Automatic MILP Solver Configuration By Learning Problem Similarities

Brown University(布朗大学)

Abdelrahman Hosny, Sherief Reda

AI总结:

本研究提出基于深度度量学习的方法,通过学习MILP问题实例间的相似性来预测配置参数,避免了求解时的搜索开销,在现实基准上将解决方案成本降低高达38%。

摘要:

大量现实世界的优化问题可以被表述为混合整数线性规划(MILP)。MILP求解器暴露了大量配置参数来控制其内部算法。即使问题实例具有相同数量的决策变量和约束,配置参数的选择也会显著影响解决方案及其相关成本或运行时间。一方面,使用默认求解器配置会导致次优解。另一方面,为每个问题实例搜索和评估大量配置非常耗时,在某些情况下甚至不可行。在本研究中,我们旨在为未见问题实例预测配置参数,以获得更低成本的解决方案,同时避免在求解时搜索和评估配置的时间开销。为此,我们首先调查了来自同一分布的MILP问题实例在使用不同配置求解时的成本相关性。我们表明,在使用一种求解器配置时具有相似成本的实例,在相同的运行时环境中使用另一种配置时也具有相似成本。随后,我们提出了一种基于深度度量学习的方法来学习MILP相似性,该相似性与最终解决方案的成本相关。在推理阶段,给定新问题实例,首先使用训练好的模型将其投影到学习的度量空间中,然后利用学习嵌入空间中最近邻实例的先前探索配置立即预测配置参数。在现实世界问题基准上的实证结果表明,与现有方法相比,我们的方法预测的配置参数可将解决方案成本降低高达38%。

英文摘要:

A large number of real-world optimization problems can be formulated as Mixed Integer Linear Programs (MILP). MILP solvers expose numerous configuration parameters to control their internal algorithms. Solutions, and their associated costs or runtimes, are significantly affected by the choice of the configuration parameters, even when problem instances have the same number of decision variables and constraints. On one hand, using the default solver configuration leads to suboptimal solutions. On the other hand, searching and evaluating a large number of configurations for every problem instance is time-consuming and, in some cases, infeasible. In this study, we aim to predict configuration parameters for unseen problem instances that yield lower-cost solutions without the time overhead of searching-and-evaluating configurations at the solving time. Toward that goal, we first investigate the cost correlation of MILP problem instances that come from the same distribution when solved using different configurations. We show that instances that have similar costs using one solver configuration also have similar costs using another solver configuration in the same runtime environment. After that, we present a methodology based on Deep Metric Learning to learn MILP similarities that correlate with their final solutions' costs. At inference time, given a new problem instance, it is first projected into the learned metric space using the trained model, and configuration parameters are instantly predicted using previously-explored configurations from the nearest neighbor instance in the learned embedding space. Empirical results on real-world problem benchmarks show that our method predicts configuration parameters that improve solutions' costs by up to 38% compared to existing approaches.

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

↑