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

基于多层级蒙特卡洛方法的条件风险价值梯度优化

Gradient-based optimisation of the conditional-value-at-risk using the multi-level Monte Carlo method

Sundar Ganesh, Fabio Nobile

AI总结:

本文提出结合多层级蒙特卡洛与梯度下降算法优化条件风险价值,并证明指数收敛,数值实验显示与标准MLMC相同的渐近成本-容差性能。

摘要:

本文研究了使用基于梯度的算法结合多层级蒙特卡洛(MLMC)方法,对具有随机输入数据的复杂微分模型输出量的条件风险价值(CVaR)进行最小化的问题。特别地,我们考虑了参数化期望的多层级蒙特卡洛框架,并提出了对MLMC估计器、误差估计过程和自适应MLMC参数选择的修改,以确保在给定设计下以规定精度估计CVaR及其灵敏度。随后,我们提出将MLMC框架与一种交替非精确最小化梯度下降算法相结合,并证明了在目标函数梯度强凸且Lipschitz连续的假设下,该算法在优化迭代中具有指数收敛性。我们通过两个具有实际相关性的数值示例展示了所提方法的性能,这些示例表明,与用于固定设计输出期望计算的标准MLMC方法相比,该方法具有相同的最优渐近成本-容差行为。

英文摘要:

In this work, we tackle the problem of minimising the Conditional-Value-at-Risk (CVaR) of output quantities of complex differential models with random input data, using gradient-based approaches in combination with the Multi-Level Monte Carlo (MLMC) method. In particular, we consider the framework of multi-level Monte Carlo for parametric expectations and propose modifications of the MLMC estimator, error estimation procedure, and adaptive MLMC parameter selection to ensure the estimation of the CVaR and sensitivities for a given design with a prescribed accuracy. We then propose combining the MLMC framework with an alternating inexact minimisation-gradient descent algorithm, for which we prove exponential convergence in the optimisation iterations under the assumptions of strong convexity and Lipschitz continuity of the gradient of the objective function. We demonstrate the performance of our approach on two numerical examples of practical relevance, which evidence the same optimal asymptotic cost-tolerance behaviour as standard MLMC methods for fixed design computations of output expectations.

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

↑