Robust Utility Optimization via a GAN Approach

Florian Krach, Josef Teichmann, Hanna Wutte
3/22/2024
q-fin.CPcs.LGq-fin.MF

No official code found. Best implementation: FlorianKrach/RobustUtilityOptimizationGAN (4 stars, last commit 2024-04-01).

Abstract

Robust utility optimization enables an investor to deal with market uncertainty in a structured way, with the goal of maximizing the worst-case outcome. In this work, we propose a generative adversarial network (GAN) approach to (approximately) solve robust utility optimization problems in general and realistic settings. In particular, we model both the investor and the market by neural networks (NN) and train them in a mini-max zero-sum game. This approach is applicable for any continuous utility function and in realistic market settings with trading costs, where only observable information of the market can be used. A large empirical study shows the versatile usability of our method. Whenever an optimal reference strategy is available, our method performs on par with it and in the (many) settings without known optimal strategy, our method outperforms all other reference strategies. Moreover, we can conclude from our study that the trained path-dependent strategies do not outperform Markovian ones. Lastly, we uncover that our generative approach for learning optimal, (non-) robust investments under trading costs generates universally applicable alternatives to well known asymptotic strategies of idealized settings.

View on arXivView PDF

Code Implementations(1)

Official implementation of the paper "Robust Utility Optimization via a GAN Approach"

42PythonFeb 27, 20242 years agoNOASSERTION

Similar Papers

Cite this paper

@article{krach2024robust,
  title  = {Robust Utility Optimization via a GAN Approach},
  author = {Florian Krach and Josef Teichmann and Hanna Wutte},
  year   = {2024},
  eprint = {2403.15243},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.15243v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.15243.svg)](https://codeofpaper.com/paper/2403.15243)

Discussion