mlsanityData to 7 Oct 2026

Deep Learning Methods for S Shaped Utility Maximisation with a Random Reference Point

arXiv 2410.05524 ↗First posted 7 Oct 2024q-fin.CP math.OC stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We consider the portfolio optimisation problem where the terminal function is an S-shaped utility applied at the difference between the wealth and a random benchmark process. We develop several numerical methods for solving the problem using deep learning and duality methods. We use deep learning methods to solve the associated Hamilton-Jacobi-Bellman equation for both the primal and dual problems, and the adjoint equation arising from the stochastic maximum principle. We compare the solution of this non-concave problem to that of concavified utility, a random function depending on the benchmark, in both complete and incomplete markets. We give some numerical results for power and log utilities to show the accuracy of the suggested algorithms.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 21 references that are in the map. First posted on arXiv 7 Oct 2024.

Builds on

5 of 21 references.

References · 5

  1. 2017Solving high-dimensional partial differential equations using deep learningcited by 549
  2. 2018A proof that artificial neural networks overcome the curse of dimensionality in the numerical approximation of Black-Scholes partial differential equationscited by 55
  3. 2016Deep Learning Approximation for Stochastic Control Problemscited by 51
  4. 2020Deep Learning for Constrained Utility Maximisationcited by 3
  5. 2015On the dual problem of utility maximization in incomplete marketscited by 1

Built on by

Not cited yet.