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

CaVE:一种用于二元线性规划快速预测后优化的锥对齐方法

CaVE: A Cone-Aligned Approach for Fast Predict-then-optimize with Binary Linear Programs

University of Toronto(多伦多大学);SCALE AI Research Chair in Data-Driven Algorithms for Modern Supply Chains(SCALE AI现代供应链数据驱动算法研究讲席)

Bo Tang, Elias B. Khalil

AI总结:

提出CaVE方法,通过将预测成本向量与法锥对齐,避免求解二元线性规划,实现快速决策聚焦学习,在车辆路径等大规模问题上取得训练时间与解质量的良好平衡。

摘要:

端到端的预测后优化框架,也称为决策聚焦学习,因其能够将优化集成到机器学习模型的训练过程中而受到欢迎,这些模型根据上下文实例信息预测优化问题的未知成本(目标函数)系数。自然,该领域中大多数感兴趣的问题可以表示为整数线性规划。在这项工作中,我们专注于二元线性规划(BLPs),并提出了一种新的端到端训练方法用于预测后优化。我们的方法,锥对齐向量估计(CaVE),将预测的成本向量与训练实例的真实最优解对应的法锥对齐。当预测的成本向量位于锥内时,二元问题的线性松弛的最优解即为最优。这种对齐不仅产生了决策感知的学习模型,而且大幅减少了训练时间,因为它避免了求解BLP来计算损失函数及其梯度的需要。跨多个数据集的实验表明,我们的方法在训练时间和解质量之间表现出有利的权衡,特别是在大规模优化问题如车辆路径规划中,这是一个困难的BLP,由于难度,文献中尚未受益于预测后优化方法。

英文摘要:

The end-to-end predict-then-optimize framework, also known as decision-focused learning, has gained popularity for its ability to integrate optimization into the training procedure of machine learning models that predict the unknown cost (objective function) coefficients of optimization problems from contextual instance information. Naturally, most of the problems of interest in this space can be cast as integer linear programs. In this work, we focus on binary linear programs (BLPs) and propose a new end-to-end training method to predict-then-optimize. Our method, Cone-aligned Vector Estimation (CaVE), aligns the predicted cost vectors with the normal cone corresponding to the true optimal solution of a training instance. When the predicted cost vector lies inside the cone, the optimal solution to the linear relaxation of the binary problem is optimal. This alignment not only produces decision-aware learning models but also dramatically reduces training time as it circumvents the need to solve BLPs to compute a loss function with its gradients. Experiments across multiple datasets show that our method exhibits a favorable trade-off between training time and solution quality, particularly with large-scale optimization problems such as vehicle routing, a hard BLP that has yet to benefit from predict-then-optimize methods in the literature due to its difficulty.

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

↑