.png){kind=icon}
.png){kind=icon}
Return
Convergence Analysis of Iterative Deep Learning Algorithms for Fully Nonlinear BSPDEs in Non-Markovian Utility Maximization
.png){kind=icon}
OA
AI
J
H
H
DOI：10.1007/s10915-026-03416-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In utility maximization with non-Markovian setting, the value function satisfies a stochastic Hamilton-Jacobi-Bellman (HJB) equation, a fully nonlinear backward stochastic partial differential equation (BSPDE). We propose iterative deep learning algorithms for such BSPDEs and analyze their convergence. We derive the error estimate of the time discretization scheme for BSPDEs, that of the policy iteration scheme for discretized BSPDEs, and that of the iterative deep learning scheme for discretized BSPDEs. We also test the algorithms and show their convergence and accuracy with numerical examples, including Markovian Heston volatility model and non-Markovian rough volatility model.
Keywords:
Utility maximization
Non-Markovian model
Fully nonlinear BSPDE
Policy iteration
Deep learning
Error estimate
Convergence analysis
Journal
IF:
3.3
Papers:
652
Citations:
9.6K
Organization
Cited Papers