arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.04086math.OCcs.LG
收藏

随机组合优化与组合约束

Stochastic Compositional Optimization with Compositional Constraints

Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology(香港理工大学工业工程与决策分析系);School of Industrial Engineering, Purdue University(普渡大学工业工程学院);Department of Biostatistics and Bioinformatics, Duke University(杜克大学生物统计与生物信息学系)

Shuoguang Yang, Wei You, Zhe Zhang, Ethan X. Fang

AI总结:

本文提出一种融合单层期望值与两层组合约束的随机组合优化模型,并设计原始-对偶算法,以$O(1/√N)$速率收敛至最优解,适用于风险规避优化与投资组合选择。

摘要:

随机组合优化(SCO)因其在重要现实问题中的广泛适用性而受到广泛关注。然而,现有的SCO研究假设解更新中的投影是简单的,这在约束以期望形式出现的问题实例中不成立,例如经验条件风险值约束。我们研究了一种新颖的模型,将单层期望值约束和两层组合约束纳入当前的SCO框架。我们的模型可广泛应用于数据驱动优化和风险管理,包括风险规避优化和高阶矩投资组合选择,并能处理多个约束。我们进一步提出了一类原始-对偶算法,该算法在单层期望值约束和两层组合约束下,以$\cO(\frac{1}{\sqrt{N}})$的速率生成收敛到最优解序列,其中$N$为迭代计数,为期望值约束SCO建立了基准。

英文摘要:

Stochastic compositional optimization (SCO) has attracted considerable attention because of its broad applicability to important real-world problems. However, existing works on SCO assume that the projection within a solution update is simple, which fails to hold for problem instances where the constraints are in the form of expectations, such as empirical conditional value-at-risk constraints. We study a novel model that incorporates single-level expected value and two-level compositional constraints into the current SCO framework. Our model can be applied widely to data-driven optimization and risk management, including risk-averse optimization and high-moment portfolio selection, and can handle multiple constraints. We further propose a class of primal-dual algorithms that generates sequences converging to the optimal solution at the rate of $\cO(\frac{1}{\sqrt{N}})$under both single-level expected value and two-level compositional constraints, where $N$ is the iteration counter, establishing the benchmarks in expected value constrained SCO.

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

↑