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

CVaR-based变分不等式的随机逼近

Stochastic approximation of CVaR-based variational inequalities

Jasper Verbree, Ashish Cherukuri

摘要:

本文研究了由不确定函数的条件风险价值(CVaR)定义的变分不等式(VI)。我们引入随机逼近计划,采用经验估计的CVaR在每次迭代解决这些VI。我们调查这些算法的收敛性在各种假设下的单调性的VI和准确性的CVaR估计。我们的第一个算法收敛到精确解的VI时,CVaR的估计误差变得越来越小,沿任何执行的算法。当估计误差是非零的,我们提供了两个算法,证明收敛到附近的VI的解决方案。对于这些计划,在强单调性,我们提供了一个明确的关系样本量,估计误差,和大小的邻域收敛。一个模拟的例子说明了我们的理论研究结果。

英文摘要:

In this paper we study variational inequalities (VI) defined by the conditional value-at-risk (CVaR) of uncertain functions. We introduce stochastic approximation schemes that employ an empirical estimate of the CVaR at each iteration to solve these VIs. We investigate convergence of these algorithms under various assumptions on the monotonicity of the VI and accuracy of the CVaR estimate. Our first algorithm is shown to converge to the exact solution of the VI when the estimation error of the CVaR becomes progressively smaller along any execution of the algorithm. When the estimation error is nonvanishing, we provide two algorithms that provably converge to a neighborhood of the solution of the VI. For these schemes, under strong monotonicity, we provide an explicit relationship between sample size, estimation error, and the size of the neighborhood to which convergence is achieved. A simulation example illustrates our theoretical findings.

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

↑