2019
DOI: 10.48550/arxiv.1912.00244
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Machine Learning Approach to Adaptive Robust Utility Maximization and Hedging

Abstract: We investigate the adaptive robust control framework for portfolio optimization and loss-based hedging under drift and volatility uncertainty. Adaptive robust problems offer many advantages but require handling a double optimization problem (infimum over market measures, supremum over the control) at each instance. Moreover, the underlying Bellman equations are intrinsically multi-dimensional. We propose a novel machine learning approach that solves for the local saddle-point at a chosen set of inputs and then… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…In this section, we describe our machine learning based method and present the numerical results for our example. Similarly to [CL19], we discretize the state space the relevant state space in the spirit of the regression Monte Carlo method and adaptive design by creating a random (non-gridded) mesh for the process Y = (X, C). Note that the component X depends on the control process, hence at each time t we randomly select from the set A a value of ϕ t , and we randomly generate a value of Z t+1 , so to simulate the value of X t+1 .…”
Section: Machine Learning Algorithm and Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we describe our machine learning based method and present the numerical results for our example. Similarly to [CL19], we discretize the state space the relevant state space in the spirit of the regression Monte Carlo method and adaptive design by creating a random (non-gridded) mesh for the process Y = (X, C). Note that the component X depends on the control process, hence at each time t we randomly select from the set A a value of ϕ t , and we randomly generate a value of Z t+1 , so to simulate the value of X t+1 .…”
Section: Machine Learning Algorithm and Numerical Resultsmentioning
confidence: 99%
“…The main goal of this work is to study finite time horizon risk-sensitive Markovian control problems subject to model uncertainty in a discrete time setup, and to develop a methodology to solve such problems efficiently. The proposed approach hinges on the following main building concepts: incorporating model uncertainty through the adaptive robust paradigm introduced in [BCC + 19] and developing efficient numerical solutions for the obtained Bellman equations by adopting the machine learning techniques proposed in [CL19].…”
Section: Introductionmentioning
confidence: 99%
“…In view of the above mentioned computational challenges, we numerically tackle the adaptive robust stochastic control problem by following the novel method introduced in [CL19]. The key idea of this method is to utilize a non-parametric value function approximation strategy (cf.…”
Section: Description Of the Algorithmmentioning
confidence: 99%
“…The main goal of this study is to develop a methodology to solve efficiently some time-inconsistent Markovian control problems subject to model uncertainty in a discrete time setup. The proposed approach hinges on the following main building concepts: incorporating model uncertainty through the adaptive robust paradigm introduced in [BCC + 19]; dealing with time-inconsistency of the stochastic control problem at hand by exploding the concept of sub-game perfect strategies as studied in [BM14]; developing efficient numerical solutions for the obtained Bellman equations by adopting the machine learning techniques proposed in [CL19].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation