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

基于稀有事件的场景方法用于机会约束优化

Decision-Scaled Scenario Approach for Rare Chance-Constrained Optimization

Pennsylvania State University(宾夕法尼亚州立大学);Indian Institute of Management(印度管理学院)

Jaeseok Choi, Anand Deo, Constantino Lagoa, Anirudh Subramanyam

AI总结:

本文提出一种决策缩放方法,通过减少样本需求和保证渐进可行性,解决稀有事件下机会约束优化的计算问题。

摘要:

机会约束优化是一种适用于安全关键应用的建模框架,其中违反约束几乎不可接受。场景方法是这些问题的流行求解方法,因其实施简单且能保持问题结构。然而,在稀有事件领域,为保持约束违反极小,场景方法由于需要过度大的样本量而变得计算不可行。本文提出一种新的、简单的决策缩放方法,仅依赖原始数据样本和一个标量超参数,通过缩放约束以适应标准求解器。该方法利用大偏差原理,在温和的非参数假设下成立,这些假设适用于实践中常用的分布族。对于满足某些实际可验证结构假设的广泛问题类,该方法在样本规模要求上相比经典场景方法实现了多项式减少,同时在稀有事件领域保证渐进可行性。涵盖金融和工程应用的数值实验表明,该决策缩放方法显著扩展了能被高效可靠解决的问题范围。

英文摘要:

Chance-constrained optimization is a suitable modeling framework for safety-critical applications where violating constraints is nearly unacceptable. The scenario approach is a popular solution method for these problems, due to its straightforward implementation and ability to preserve problem structure. However, in the rare-event regime where constraint violations must be kept extremely unlikely, the scenario approach becomes computationally infeasible due to the excessively large sample sizes it demands. We address this limitation with a new yet straightforward decision-scaling method that relies exclusively on original data samples and a single scalar hyperparameter that scales the constraints in a way amenable to standard solvers. Our method leverages large deviation principles under mild nonparametric assumptions satisfied by commonly used distribution families in practice. For a broad class of problems satisfying certain practically verifiable structural assumptions, the method achieves a polynomial reduction in sample size requirements compared to the classical scenario approach, while also guaranteeing asymptotic feasibility in the rare-event regime. Numerical experiments spanning finance and engineering applications show that our decision-scaling method significantly expands the scope of problems that can be solved both efficiently and reliably.

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

↑