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

学习随机优势约束优化

Learning to Optimize with Stochastic Dominance Constraints

ETH Zurich(苏黎世联邦理工学院);Harvard University(哈佛大学);University of Alberta(阿尔伯塔大学);Georgia Tech(佐治亚理工学院);Google Research(谷歌研究院)

Hanjun Dai, Yuan Xue, Niao He, Bethany Wang, Na Li, Dale Schuurmans, Bo Dai

摘要:

在现实世界的决策中,不确定性很重要,但很难处理。随机优势为比较不确定量提供了一种理论上合理的方法,但是具有随机优势约束的优化通常在计算上是昂贵的,这限制了实用性。在本文中,我们开发了一种简单而有效的方法,光随机优势求解器(light-SD),利用拉格朗日的有用特性。我们将拉格朗日函数中的内部优化转换为替代近似的学习问题,这绕过了明显的棘手问题,并导致易于处理的更新,甚至是梯度计算的封闭形式的解决方案。我们证明了算法的收敛性,并进行了经验测试。建议轻SD表现出优越的性能,从金融到供应链管理的几个代表性的问题。

英文摘要:

In real-world decision-making, uncertainty is important yet difficult to handle. Stochastic dominance provides a theoretically sound approach for comparing uncertain quantities, but optimization with stochastic dominance constraints is often computationally expensive, which limits practical applicability. In this paper, we develop a simple yet efficient approach for the problem, the Light Stochastic Dominance Solver (light-SD), that leverages useful properties of the Lagrangian. We recast the inner optimization in the Lagrangian as a learning problem for surrogate approximation, which bypasses apparent intractability and leads to tractable updates or even closed-form solutions for gradient calculations. We prove convergence of the algorithm and test it empirically. The proposed light-SD demonstrates superior performance on several representative problems ranging from finance to supply chain management.

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

↑