带增益过程约束的倒向随机微分方程的离散化和机器学习逼近
Discretization and Machine Learning Approximation of BSDEs with a Constraint on the Gains-Process
摘要:
研究了带增益过程约束的倒向随机微分方程的逼近问题。我们首先通过在网格的时间应用所谓的整容算子来离散约束。我们表明,这种离散约束的Battlefield收敛到连续约束的网格网格收敛到零。然后,我们专注于离散约束的近似的。为此,我们采用了机器学习方法。我们表明,整容可以近似为一类神经网络的约束下的神经网络及其衍生物的优化问题。然后,我们推导出一个算法收敛到离散约束的神经元的数量趋于无穷大。最后,我们进行数值实验。数学学科分类(2010):65C30、65M75、60H35、93E20、49L25。
英文摘要:
We study the approximation of backward stochastic differential equations (BSDEs for short) with a constraint on the gains process. We first discretize the constraint by applying a so-called facelift operator at times of a grid. We show that this discretely constrained BSDE converges to the continuously constrained one as the mesh grid converges to zero. We then focus on the approximation of the discretely constrained BSDE. For that we adopt a machine learning approach. We show that the facelift can be approximated by an optimization problem over a class of neural networks under constraints on the neural network and its derivative. We then derive an algorithm converging to the discretely constrained BSDE as the number of neurons goes to infinity. We end by numerical experiments. Mathematics Subject Classification (2010): 65C30, 65M75, 60H35, 93E20, 49L25.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。