false

Developing A Multi-Agent and Self-Adaptive Framework with Deep Reinforcement Learning for Dynamic Portfolio Risk Management

Developing A Multi-Agent and Self-Adaptive Framework with Deep Reinforcement Learning for Dynamic Portfolio Risk Management ArXiv ID: 2402.00515 “View on arXiv” Authors: Unknown Abstract Deep or reinforcement learning (RL) approaches have been adapted as reactive agents to quickly learn and respond with new investment strategies for portfolio management under the highly turbulent financial market environments in recent years. In many cases, due to the very complex correlations among various financial sectors, and the fluctuating trends in different financial markets, a deep or reinforcement learning based agent can be biased in maximising the total returns of the newly formulated investment portfolio while neglecting its potential risks under the turmoil of various market conditions in the global or regional sectors. Accordingly, a multi-agent and self-adaptive framework namely the MASA is proposed in which a sophisticated multi-agent reinforcement learning (RL) approach is adopted through two cooperating and reactive agents to carefully and dynamically balance the trade-off between the overall portfolio returns and their potential risks. Besides, a very flexible and proactive agent as the market observer is integrated into the MASA framework to provide some additional information on the estimated market trends as valuable feedbacks for multi-agent RL approach to quickly adapt to the ever-changing market conditions. The obtained empirical results clearly reveal the potential strengths of our proposed MASA framework based on the multi-agent RL approach against many well-known RL-based approaches on the challenging data sets of the CSI 300, Dow Jones Industrial Average and S&P 500 indexes over the past 10 years. More importantly, our proposed MASA framework shed lights on many possible directions for future investigation. ...

February 1, 2024 · 2 min · Research Team

Option pricing for Barndorff-Nielsen and Shephard model by supervised deep learning

Option pricing for Barndorff-Nielsen and Shephard model by supervised deep learning ArXiv ID: 2402.00445 “View on arXiv” Authors: Unknown Abstract This paper aims to develop a supervised deep-learning scheme to compute call option prices for the Barndorff-Nielsen and Shephard model with a non-martingale asset price process having infinite active jumps. In our deep learning scheme, teaching data is generated through the Monte Carlo method developed by Arai and Imai (2024). Moreover, the BNS model includes many variables, which makes the deep learning accuracy worse. Therefore, we will create another input variable using the Black-Scholes formula. As a result, the accuracy is improved dramatically. ...

February 1, 2024 · 2 min · Research Team

Convergence of the deep BSDE method for stochastic control problems formulated through the stochastic maximum principle

Convergence of the deep BSDE method for stochastic control problems formulated through the stochastic maximum principle ArXiv ID: 2401.17472 “View on arXiv” Authors: Unknown Abstract It is well-known that decision-making problems from stochastic control can be formulated by means of a forward-backward stochastic differential equation (FBSDE). Recently, the authors of Ji et al. 2022 proposed an efficient deep learning algorithm based on the stochastic maximum principle (SMP). In this paper, we provide a convergence result for this deep SMP-BSDE algorithm and compare its performance with other existing methods. In particular, by adopting a strategy as in Han and Long 2020, we derive a-posteriori estimate, and show that the total approximation error can be bounded by the value of the loss functional and the discretization error. We present numerical examples for high-dimensional stochastic control problems, both in case of drift- and diffusion control, which showcase superior performance compared to existing algorithms. ...

January 30, 2024 · 2 min · Research Team

Sparse Portfolio Selection via Topological Data Analysis based Clustering

Sparse Portfolio Selection via Topological Data Analysis based Clustering ArXiv ID: 2401.16920 “View on arXiv” Authors: Unknown Abstract This paper uses topological data analysis (TDA) tools and introduces a data-driven clustering-based stock selection strategy tailored for sparse portfolio construction. Our asset selection strategy exploits the topological features of stock price movements to select a subset of topologically similar (different) assets for a sparse index tracking (Markowitz) portfolio. We introduce new distance measures, which serve as an input to the clustering algorithm, on the space of persistence diagrams and landscapes that consider the time component of a time series. We conduct an empirical analysis on the S&P index from 2009 to 2022, including a study on the COVID-19 data to validate the robustness of our methodology. Our strategy to integrate TDA with the clustering algorithm significantly enhanced the performance of sparse portfolios across various performance measures in diverse market scenarios. ...

January 30, 2024 · 2 min · Research Team

CFTM: Continuous time fractional topic model

CFTM: Continuous time fractional topic model ArXiv ID: 2402.01734 “View on arXiv” Authors: Unknown Abstract In this paper, we propose the Continuous Time Fractional Topic Model (cFTM), a new method for dynamic topic modeling. This approach incorporates fractional Brownian motion~(fBm) to effectively identify positive or negative correlations in topic and word distribution over time, revealing long-term dependency or roughness. Our theoretical analysis shows that the cFTM can capture these long-term dependency or roughness in both topic and word distributions, mirroring the main characteristics of fBm. Moreover, we prove that the parameter estimation process for the cFTM is on par with that of LDA, traditional topic models. To demonstrate the cFTM’s property, we conduct empirical study using economic news articles. The results from these tests support the model’s ability to identify and track long-term dependency or roughness in topics over time. ...

January 29, 2024 · 2 min · Research Team

From GARCH to Neural Network for Volatility Forecast

From GARCH to Neural Network for Volatility Forecast ArXiv ID: 2402.06642 “View on arXiv” Authors: Unknown Abstract Volatility, as a measure of uncertainty, plays a crucial role in numerous financial activities such as risk management. The Econometrics and Machine Learning communities have developed two distinct approaches for financial volatility forecasting: the stochastic approach and the neural network (NN) approach. Despite their individual strengths, these methodologies have conventionally evolved in separate research trajectories with little interaction between them. This study endeavors to bridge this gap by establishing an equivalence relationship between models of the GARCH family and their corresponding NN counterparts. With the equivalence relationship established, we introduce an innovative approach, named GARCH-NN, for constructing NN-based volatility models. It obtains the NN counterparts of GARCH models and integrates them as components into an established NN architecture, thereby seamlessly infusing volatility stylized facts (SFs) inherent in the GARCH models into the neural network. We develop the GARCH-LSTM model to showcase the power of the GARCH-NN approach. Experiment results validate that amalgamating the NN counterparts of the GARCH family models into established NN models leads to enhanced outcomes compared to employing the stochastic and NN models in isolation. ...

January 29, 2024 · 2 min · Research Team

Estimation of domain truncation error for a system of PDEs arising in option pricing

Estimation of domain truncation error for a system of PDEs arising in option pricing ArXiv ID: 2401.15570 “View on arXiv” Authors: Unknown Abstract In this paper, a multidimensional system of parabolic partial differential equations arising in European option pricing under a regime-switching market model is studied in details. For solving that numerically, one must truncate the domain and impose an artificial boundary data. By deriving an estimate of the domain truncation error at all the points in the truncated domain, we extend some results in the literature those deal with option pricing equation under constant regime case only. We differ from the existing approach to obtain the error estimate that is sharper in certain region of the domain. Hence, the minimum of proposed and existing gives a strictly sharper estimate. A comprehensive comparison with the existing literature is carried out by considering some numerical examples. Those examples confirm that the improvement in the error estimates is significant. ...

January 28, 2024 · 2 min · Research Team

Fast and General Simulation of Lévy-driven OU processes for Energy Derivatives

Fast and General Simulation of Lévy-driven OU processes for Energy Derivatives ArXiv ID: 2401.15483 “View on arXiv” Authors: Unknown Abstract Lévy-driven Ornstein-Uhlenbeck (OU) processes represent an intriguing class of stochastic processes that have garnered interest in the energy sector for their ability to capture typical features of market dynamics. However, in the current state of play, Monte Carlo simulations of these processes are not straightforward for two main reasons: i) algorithms are available only for some specific processes within this class; ii) they are often computationally expensive. In this paper, we introduce a new simulation technique designed to address both challenges. It relies on the numerical inversion of the characteristic function, offering a general methodology applicable to all Lévy-driven OU processes. Moreover, leveraging FFT, the proposed methodology ensures fast and accurate simulations, providing a solid basis for the widespread adoption of these processes in the energy sector. Lastly, the algorithm allows an optimal control of the numerical error. We apply the technique to the pricing of energy derivatives, comparing the results with the existing benchmarks. Our findings indicate that the proposed methodology is at least one order of magnitude faster than the existing algorithms, while maintaining an equivalent level of accuracy. ...

January 27, 2024 · 2 min · Research Team

ESG driven pairs algorithm for sustainable trading: Analysis from the Indian market

ESG driven pairs algorithm for sustainable trading: Analysis from the Indian market ArXiv ID: 2401.14761 “View on arXiv” Authors: Unknown Abstract This paper proposes an algorithmic trading framework integrating Environmental, Social, and Governance (ESG) ratings with a pairs trading strategy. It addresses the demand for socially responsible investment solutions by developing a unique algorithm blending ESG data with methods for identifying co-integrated stocks. This allows selecting profitable pairs adhering to ESG principles. Further, it incorporates technical indicators for optimal trade execution within this sustainability framework. Extensive back-testing provides evidence of the model’s effectiveness, consistently generating positive returns exceeding conventional pairs trading strategies, while upholding ESG principles. This paves the way for a transformative approach to algorithmic trading, offering insights for investors, policymakers, and academics. ...

January 26, 2024 · 2 min · Research Team

FDR-Controlled Portfolio Optimization for Sparse Financial Index Tracking

FDR-Controlled Portfolio Optimization for Sparse Financial Index Tracking ArXiv ID: 2401.15139 “View on arXiv” Authors: Unknown Abstract In high-dimensional data analysis, such as financial index tracking or biomedical applications, it is crucial to select the few relevant variables while maintaining control over the false discovery rate (FDR). In these applications, strong dependencies often exist among the variables (e.g., stock returns), which can undermine the FDR control property of existing methods like the model-X knockoff method or the T-Rex selector. To address this issue, we have expanded the T-Rex framework to accommodate overlapping groups of highly correlated variables. This is achieved by integrating a nearest neighbors penalization mechanism into the framework, which provably controls the FDR at the user-defined target level. A real-world example of sparse index tracking demonstrates the proposed method’s ability to accurately track the S&P 500 index over the past 20 years based on a small number of stocks. An open-source implementation is provided within the R package TRexSelector on CRAN. ...

January 26, 2024 · 2 min · Research Team