اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA machine learning approach to portfolio pricing and risk management for high-dimensional problems
66
0
0.0
(
0
)
تأليف
Lucio Fernandez-Arjona
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a general framework for portfolio risk management in discrete time, based on a replicating martingale. This martingale is learned from a finite sample in a supervised setting. The model learns the features necessary for an effective low-dimensional representation, overcoming the curse of dimensionality common to function approximation in high-dimensional spaces. We show results based on polynomial and neural network bases. Both offer superior results to naive Monte Carlo methods and other existing methods like least-squares Monte Carlo and replicating portfolios.
قيم البحث
اقرأ أيضاً
When applying Value at Risk (VaR) procedures to specific positions or portfolios, we often focus on developing procedures only for the specific assets in the portfolio. However, since this small portfolio risk analysis ignores information from assets
outside the target portfolio, there may be significant information loss. In this paper, we develop a dynamic process to incorporate the ignored information. We also study how to overcome the curse of dimensionality and discuss where and when benefits occur from a large number of assets, which is called the blessing of dimensionality. We find empirical support for the proposed method.
We propose some machine-learning-based algorithms to solve hedging problems in incomplete markets. Sources of incompleteness cover illiquidity, untradable risk factors, discrete hedging dates and transaction costs. The proposed algorithms resulting s
trategies are compared to classical stochastic control techniques on several payoffs using a variance criterion. One of the proposed algorithm is flexible enough to be used with several existing risk criteria. We furthermore propose a new moment-based risk criteria.
We extend the classical risk minimization model with scalar risk measures to the general case of set-valued risk measures. The problem we obtain is a set-valued optimization model and we propose a goal programming-based approach with satisfaction fun
ction to obtain a solution which represents the best compromise between goals and the achievement levels. Numerical examples are provided to illustrate how the method works in practical situations.
The goal of this paper is to investigate the method outlined by one of us (PR) in Cherubini et al. (2009) to compute option prices. We name it the SINC approach. While the COS method by Fang and Osterlee (2009) leverages the Fourier-cosine expansion
of truncated densities, the SINC approach builds on the Shannon Sampling Theorem revisited for functions with bounded support. We provide several results which were missing in the early derivation: i) a rigorous proof of the convergence of the SINC formula to the correct option price when the support grows and the number of Fourier frequencies increases; ii) ready to implement formulas for put, Cash-or-Nothing, and Asset-or-Nothing options; iii) a systematic comparison with the COS formula for several log-price models; iv) a numerical challenge against alternative Fast Fourier specifications, such as Carr and Madan (1999) and Lewis (2000); v) an extensive pricing exercise under the rough Heston model of Jaisson and Rosenbaum (2015); vi) formulas to evaluate numerically the moments of a truncated density. The advantages of the SINC approach are numerous. When compared to benchmark methodologies, SINC provides the most accurate and fast pricing computation. The method naturally lends itself to price all options in a smile concurrently by means of Fast Fourier techniques, boosting fast calibration. Pricing requires to resort only to odd moments in the Fourier space. A previous version of this manuscript circulated with the title `Rough Heston: The SINC way.
In this paper we propose two efficient techniques which allow one to compute the price of American basket options. In particular, we consider a basket of assets that follow a multi-dimensional Black-Scholes dynamics. The proposed techniques, called G
PR Tree (GRP-Tree) and GPR Exact Integration (GPR-EI), are both based on Machine Learning, exploited together with binomial trees or with a closed formula for integration. Moreover, these two methods solve the backward dynamic programming problem considering a Bermudan approximation of the American option. On the exercise dates, the value of the option is first computed as the maximum between the exercise value and the continuation value and then approximated by means of Gaussian Process Regression. The two methods mainly differ in the approach used to compute the continuation value: a single step of binomial tree or integration according to the probability density of the process. Numerical results show that these two methods are accurate and reliable in handling American options on very large baskets of assets. Moreover we also consider the rough Bergomi model, which provides stochastic volatility with memory. Despite this model is only bidimensional, the whole history of the process impacts on the price, and handling all this information is not obvious at all. To this aim, we present how to adapt the GPR-Tree and GPR-EI methods and we focus on pricing American options in this non-Markovian framework.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
