arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.05504cs.LGcs.AIstat.ML
收藏

融合数据-决策管道:面向组合优化的决策学习

Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization

Center for Artificial Intelligence in Society, University of Southern California(南加州大学社会人工智能中心)

Bryan Wilder, Bistra Dilkina, Milind Tambe

摘要:

在现实世界中创造影响力需要人工智能技术来跨越从数据到预测模型再到决策的整个流程。这些组件通常单独处理:首先通过预测准确性的测量来训练机器学习模型,然后将其预测用作优化算法的输入,从而产生决策。然而,用于训练模型的损失函数可能很容易与最终目标不一致,最终目标是做出可能的最佳决策。手动调整损失函数以与优化一致是一个困难且容易出错的过程(通常完全跳过)。我们专注于组合优化问题,并介绍了一个通用的框架,决策为重点的学习,机器学习模型直接训练结合优化算法,以产生高质量的决策。从技术上讲,我们的贡献是将常见的离散优化问题集成到深度学习或其他预测模型中,这些模型通常通过梯度下降进行训练。其主要思想是使用离散问题的连续松弛来通过优化过程传播梯度。我们实例化这个框架的两大类组合问题:线性规划和次模最大化。跨多个领域的实验结果表明,与传统方法相比,以决策为中心的学习通常会提高优化性能。我们发现,准确性的标准度量并不是预测模型在优化中的实用性的可靠代理,并且我们的方法能够将真正的目标指定为模型的训练目标,从而在一系列决策问题中产生大量的红利。

英文摘要:

Creating impact in real-world settings requires artificial intelligence techniques to span the full pipeline from data, to predictive models, to decisions. These components are typically approached separately: a machine learning model is first trained via a measure of predictive accuracy, and then its predictions are used as input into an optimization algorithm which produces a decision. However, the loss function used to train the model may easily be misaligned with the end goal, which is to make the best decisions possible. Hand-tuning the loss function to align with optimization is a difficult and error-prone process (which is often skipped entirely). We focus on combinatorial optimization problems and introduce a general framework for decision-focused learning, where the machine learning model is directly trained in conjunction with the optimization algorithm to produce high-quality decisions. Technically, our contribution is a means of integrating common classes of discrete optimization problems into deep learning or other predictive models, which are typically trained via gradient descent. The main idea is to use a continuous relaxation of the discrete problem to propagate gradients through the optimization procedure. We instantiate this framework for two broad classes of combinatorial problems: linear programs and submodular maximization. Experimental results across a variety of domains show that decision-focused learning often leads to improved optimization performance compared to traditional methods. We find that standard measures of accuracy are not a reliable proxy for a predictive model's utility in optimization, and our method's ability to specify the true goal as the model's training objective yields substantial dividends across a range of decision problems.

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

↑