arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.20004math.OC

基于残差的上下文分布鲁棒优化与决策依赖不确定性:理论保证与分解算法

Residuals-Based Contextual Distributionally Robust Optimization with Decision-Dependent Uncertainty: Theoretical Guarantees and Decomposition Algorithm

Qing Zhu, Xian Yu, Guzin Bayraksan

AI总结:

本文提出了一种基于残差的分布鲁棒优化模型,考虑了不确定性依赖于协变量信息和决策的情况,通过参数和非参数回归模型学习决策依赖性,并利用经验残差构建名义分布,利用Wasserstein距离定义模糊集,提供满足渐近最优性、收敛速度和有限样本保证的条件,并开发了专用的Bender分解算法求解模型。

摘要:

我们考虑了一种基于残差的分布鲁棒优化(DRO)模型,其中底层不确定性依赖于协变量信息和我们的决策。我们采用参数和非参数回归模型来学习潜在的决策依赖性,并利用回归中的经验残差构建名义分布(从而定义模糊集)。我们通过Wasserstein距离定义模糊集,其中名义分布同时依赖于决策和协变量。我们提供了条件,以确保所需的统计性质,如渐近最优性、收敛速度和有限样本保证。为了解决由此产生的DRO模型,我们开发了专门的Bender分解算法,结合非线性切割,并证明其有限收敛性。通过数值实验,我们展示了我们方法的有效性以及将决策依赖性整合到基于残差的DRO框架中的优势。

英文摘要:

We consider a residuals-based distributionally robust optimization (DRO) model, where the underlying uncertainty depends on both covariate information and our decisions. We adopt both parametric and nonparametric regression models to learn the latent decision dependency and construct a nominal distribution (thereby ambiguity sets) around the learned model using empirical residuals from the regressions. We formulate the ambiguity set via the Wasserstein distance, where the nominal distribution is both decision- and covariate-dependent. We provide conditions under which desired statistical properties such as asymptotic optimality, rate of convergence, and finite sample guarantees are satisfied. To solve the resulting DRO model, we develop a specialized Bender's decomposition algorithm with nonlinear cuts and prove its finite convergence. Through numerical experiments, we illustrate the effectiveness of our approach and the benefits of integrating decision dependency into a residuals-based DRO framework.

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

↑