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

预测+优化中递归和迭代可解问题的分支和学习

Branch & Learn for Recursively and Iteratively Solvable Problems in Predict+Optimize

The Chinese University of Hong Kong(香港中文大学);The University of Wisconsin-Madison(威斯康星大学麦迪逊分校)

Xinyi Hu, Jasper C. H. Lee, Jimmy H. M. Lee, Allen Z. Zhong

摘要:

本文提出了Branch & Learn,这是一个预测+优化的框架,用于解决包含在求解时未知参数的优化问题。给定一个最优化问题,可以用一个满足简单条件的递归算法来求解,我们展示了如何从递归算法中直接而有条理地构造出相应的学习算法。我们的框架也适用于迭代算法,将它们视为递归的退化形式。大量的实验表明,我们的建议在经典和国家的最先进的方法更好的性能。

英文摘要:

This paper proposes Branch & Learn, a framework for Predict+Optimize to tackle optimization problems containing parameters that are unknown at the time of solving. Given an optimization problem solvable by a recursive algorithm satisfying simple conditions, we show how a corresponding learning algorithm can be constructed directly and methodically from the recursive algorithm. Our framework applies also to iterative algorithms by viewing them as a degenerate form of recursion. Extensive experimentation shows better performance for our proposal over classical and state-of-the-art approaches.

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

↑