arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.06531q-fin.RMmath.PRq-fin.CP
收藏

自适应多级随机逼近法计算风险价值

Adaptive Multilevel Stochastic Approximation of the Value-at-Risk

Université Paris Cité(巴黎西岱大学);CNRS(法国国家科学研究中心);Université Paris 1 Panthéon-Sorbonne(巴黎第一先贤祠-索邦大学);Centre d’Economie de la Sorbonne (CES)(索邦经济学中心);Maxwell Institute for Mathematical Sciences(马克斯韦尔数学科学研究所);School of Mathematics, University of Edinburgh(爱丁堡大学数学学院)

Stéphane Crépey, Noufel Frikha, Azar Louzi, Jonathan Spence

AI总结:

本文提出自适应多级随机逼近算法,通过动态选择每层内部样本数,改进了计算风险价值的复杂度,理论分析通过数值实验验证。

摘要:

Crepey, Frikha 和 Louzi (2025) 引入了一种多级随机逼近方案来计算仅能通过蒙特卡洛模拟的金融损失的价值-at-风险。该方案的最佳复杂度为 O($\varepsilon^{-\frac52}$),$\varepsilon>0$ 是给定的精度,相较于传统的多级蒙特卡洛方法来说是次优的。这种次优性源于 Heaviside 函数的不连续性,该函数在有偏随机梯度的递归计算中被涉及以推导价值-at-风险。为缓解这一问题,本文提出并分析了一种多级随机逼近算法,该算法能够自适应地在每一级选择内部样本数,并证明其最佳复杂度为 O($\varepsilon^{-2}|\ln{\varepsilon}|^\frac52$)。我们的理论分析通过数值实验进行了示例说明。

英文摘要:

Crépey, Frikha, and Louzi (2025) introduced a multilevel stochastic approximation scheme to compute the value-at-risk of a financial loss that is only simulatable by Monte Carlo. The best complexity of the scheme is in O($\varepsilon^{-\frac52}$), $\varepsilon>0$ being a prescribed accuracy, which is suboptimal compared to the canonical multilevel Monte Carlo performance. This suboptimality stems from the discontinuity ofthe Heaviside function involved in the biased stochastic gradient that is recursively evaluated to derive the value-at-risk. To mitigate this issue, this paper proposes and analyzes a multilevel stochastic approximation algorithm that adaptively selects the number of inner samples at each level, and proves that its best complexity is in O($\varepsilon^{-2}|\ln{\varepsilon}|^\frac52$). Our theoretical analysis is exemplified through numerical experiments.

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

↑