false

A case study on different one-factor Cheyette models for short maturity caplet calibration

A case study on different one-factor Cheyette models for short maturity caplet calibration ArXiv ID: 2408.11257 “View on arXiv” Authors: Unknown Abstract In [“1”], we calibrated a one-factor Cheyette SLV model with a local volatility that is linear in the benchmark forward rate and an uncorrelated CIR stochastic variance to 3M caplets of various maturities. While caplet smiles for many maturities could be reasonably well calibrated across the range of strikes, for instance the 1Y maturity could not be calibrated well across that entire range of strikes. Here, we study whether models with alternative local volatility terms and/or alternative stochastic volatility or variance models can calibrate the 1Y caplet smile better across the strike range better than the model studied in [“1”]. This is made possible and feasible by the generic simulation, pricing, and calibration frameworks introduced in [“1”] and some new frameworks presented in this paper. We find that some model settings calibrate well to the 1Y smile across the strike range under study. In particular, a model setting with a local volatility that is piece-wise linear in the benchmark forward rate together with an uncorrelated CIR stochastic variance and one with a local volatility that is linear in the benchmark rate together with a correlated lognormal stochastic volatility with quadratic drift (QDLNSV) as in [“2”] calibrate well. We discuss why the later might be a preferable model. [“1”] Arun Kumar Polala and Bernhard Hientzsch. Parametric differential machine learning for pricing and calibration. arXiv preprint arXiv:2302.06682 , 2023. [“2”] Artur Sepp and Parviz Rakhmonov. A Robust Stochastic Volatility Model for Interest Rate Dynamics. Risk Magazine, 2023 ...

August 21, 2024 · 3 min · Research Team

Deviations from the Nash equilibrium and emergence of tacit collusion in a two-player optimal execution game with reinforcement learning

Deviations from the Nash equilibrium and emergence of tacit collusion in a two-player optimal execution game with reinforcement learning ArXiv ID: 2408.11773 “View on arXiv” Authors: Unknown Abstract The use of reinforcement learning algorithms in financial trading is becoming increasingly prevalent. However, the autonomous nature of these algorithms can lead to unexpected outcomes that deviate from traditional game-theoretical predictions and may even destabilize markets. In this study, we examine a scenario in which two autonomous agents, modeled with Double Deep Q-Learning, learn to liquidate the same asset optimally in the presence of market impact, using the Almgren-Chriss (2000) framework. Our results show that the strategies learned by the agents deviate significantly from the Nash equilibrium of the corresponding market impact game. Notably, the learned strategies exhibit tacit collusion, closely aligning with the Pareto-optimal solution. We further explore how different levels of market volatility influence the agents’ performance and the equilibria they discover, including scenarios where volatility differs between the training and testing phases. ...

August 21, 2024 · 2 min · Research Team

Dynamical analysis of financial stocks network: improving forecasting using network properties

Dynamical analysis of financial stocks network: improving forecasting using network properties ArXiv ID: 2408.11759 “View on arXiv” Authors: Unknown Abstract Applying a network analysis to stock return correlations, we study the dynamical properties of the network and how they correlate with the market return, finding meaningful variables that partially capture the complex dynamical processes of stock interactions and the market structure. We then use the individual properties of stocks within the network along with the global ones, to find correlations with the future returns of individual S&P 500 stocks. Applying these properties as input variables for forecasting, we find a 50% improvement on the R2score in the prediction of stock returns on long time scales (per year), and 3% on short time scales (2 days), relative to baseline models without network variables. ...

August 21, 2024 · 2 min · Research Team

Less is more: AI Decision-Making using Dynamic Deep Neural Networks for Short-Term Stock Index Prediction

Less is more: AI Decision-Making using Dynamic Deep Neural Networks for Short-Term Stock Index Prediction ArXiv ID: 2408.11740 “View on arXiv” Authors: Unknown Abstract In this paper we introduce a multi-agent deep-learning method which trades in the Futures markets based on the US S&P 500 index. The method (referred to as Model A) is an innovation founded on existing well-established machine-learning models which sample market prices and associated derivatives in order to decide whether the investment should be long/short or closed (zero exposure), on a day-to-day decision. We compare the predictions with some conventional machine-learning methods namely, Long Short-Term Memory, Random Forest and Gradient-Boosted-Trees. Results are benchmarked against a passive model in which the Futures contracts are held (long) continuously with the same exposure (level of investment). Historical tests are based on daily daytime trading carried out over a period of 6 calendar years (2018-23). We find that Model A outperforms the passive investment in key performance metrics, placing it within the top quartile performance of US Large Cap active fund managers. Model A also outperforms the three machine-learning classification comparators over this period. We observe that Model A is extremely efficient (doing less and getting more) with an exposure to the market of only 41.95% compared to the 100% market exposure of the passive investment, and thus provides increased profitability with reduced risk. ...

August 21, 2024 · 2 min · Research Team

MEV Capture and Decentralization in Execution Tickets

MEV Capture and Decentralization in Execution Tickets ArXiv ID: 2408.11255 “View on arXiv” Authors: Unknown Abstract We provide an economic model of Execution Tickets and use it to study the ability of the Ethereum protocol to capture MEV from block construction. We demonstrate that Execution Tickets extract all MEV when all buyers are homogeneous, risk neutral and face no capital costs. We also show that MEV capture decreases with risk aversion and capital costs. Moreover, when buyers are heterogeneous, MEV capture can be especially low and a single dominant buyer can extract much of the MEV. This adverse effect can be partially mitigated by the presence of a Proposer Builder Separation (PBS) mechanism, which gives ET buyers access to a market of specialized builders, but in practice centralization vectors still persist. With PBS, ETs are concentrated among those with the highest ex-ante MEV extraction ability and lowest cost of capital. We show how it is possible that large investors that are not builders but have substantial advantage in capital cost can come to dominate the ET market. ...

August 21, 2024 · 2 min · Research Team

Network-based diversification of stock and cryptocurrency portfolios

Network-based diversification of stock and cryptocurrency portfolios ArXiv ID: 2408.11739 “View on arXiv” Authors: Unknown Abstract Maintaining a balance between returns and volatility is a common strategy for portfolio diversification, whether investing in traditional equities or digital assets like cryptocurrencies. One approach for diversification is the application of community detection or clustering, using a network representing the relationships between assets. We examine two network representations, one based on a standard distance matrix based on correlation, and another based on mutual information. The Louvain and Affinity propagation algorithms were employed for finding the network communities (clusters) based on annual data. Furthermore, we examine building assets’ co-occurrence networks, where communities are detected for each month throughout a whole year and then the links represent how often assets belong to the same community. Portfolios are then constructed by selecting several assets from each community based on local properties (degree centrality), global properties (closeness centrality), or explained variance (Principal component analysis), with three value ranges (max, med, min), calculated on a maximal spanning tree or a fully connected community sub-graph. We explored these various strategies on data from the S&P 500 and the Top 203 cryptocurrencies with a market cap above 2M USD in the period from Jan 2019 to Sep 2022. Moreover, we study into more details the periods of the beginning of the COVID-19 outbreak and the start of the war in Ukraine. The results confirm some of the previous findings already known for traditional stock markets and provide some further insights, while they reveal an opposing trend in the crypto-assets market. ...

August 21, 2024 · 2 min · Research Team

Hedging in Jump Diffusion Model with Transaction Costs

Hedging in Jump Diffusion Model with Transaction Costs ArXiv ID: 2408.10785 “View on arXiv” Authors: Unknown Abstract We consider the jump-diffusion risky asset model and study its conditional prediction laws. Next, we explain the conditional least square hedging strategy and calculate its closed form for the jump-diffusion model, considering the Black-Scholes framework with interpretations related to investor priorities and transaction costs. We investigate the explicit form of this result for the particular case of the European call option under transaction costs and formulate recursive hedging strategies. Finally, we present a decision tree, table of values, and figures to support our results. ...

August 20, 2024 · 2 min · Research Team

Open-FinLLMs: Open Multimodal Large Language Models for Financial Applications

Open-FinLLMs: Open Multimodal Large Language Models for Financial Applications ArXiv ID: 2408.11878 “View on arXiv” Authors: Unknown Abstract Financial LLMs hold promise for advancing financial tasks and domain-specific applications. However, they are limited by scarce corpora, weak multimodal capabilities, and narrow evaluations, making them less suited for real-world application. To address this, we introduce \textit{“Open-FinLLMs”}, the first open-source multimodal financial LLMs designed to handle diverse tasks across text, tabular, time-series, and chart data, excelling in zero-shot, few-shot, and fine-tuning settings. The suite includes FinLLaMA, pre-trained on a comprehensive 52-billion-token corpus; FinLLaMA-Instruct, fine-tuned with 573K financial instructions; and FinLLaVA, enhanced with 1.43M multimodal tuning pairs for strong cross-modal reasoning. We comprehensively evaluate Open-FinLLMs across 14 financial tasks, 30 datasets, and 4 multimodal tasks in zero-shot, few-shot, and supervised fine-tuning settings, introducing two new multimodal evaluation datasets. Our results show that Open-FinLLMs outperforms afvanced financial and general LLMs such as GPT-4, across financial NLP, decision-making, and multi-modal tasks, highlighting their potential to tackle real-world challenges. To foster innovation and collaboration across academia and industry, we release all codes (https://anonymous.4open.science/r/PIXIU2-0D70/B1D7/LICENSE) and models under OSI-approved licenses. ...

August 20, 2024 · 2 min · Research Team

Can an unsupervised clustering algorithm reproduce a categorization system?

Can an unsupervised clustering algorithm reproduce a categorization system? ArXiv ID: 2408.10340 “View on arXiv” Authors: Unknown Abstract Peer analysis is a critical component of investment management, often relying on expert-provided categorization systems. These systems’ consistency is questioned when they do not align with cohorts from unsupervised clustering algorithms optimized for various metrics. We investigate whether unsupervised clustering can reproduce ground truth classes in a labeled dataset, showing that success depends on feature selection and the chosen distance metric. Using toy datasets and fund categorization as real-world examples we demonstrate that accurately reproducing ground truth classes is challenging. We also highlight the limitations of standard clustering evaluation metrics in identifying the optimal number of clusters relative to the ground truth classes. We then show that if appropriate features are available in the dataset, and a proper distance metric is known (e.g., using a supervised Random Forest-based distance metric learning method), then an unsupervised clustering can indeed reproduce the ground truth classes as distinct clusters. ...

August 19, 2024 · 2 min · Research Team

Causality-Inspired Models for Financial Time Series Forecasting

Causality-Inspired Models for Financial Time Series Forecasting ArXiv ID: 2408.09960 “View on arXiv” Authors: Unknown Abstract We introduce a novel framework to financial time series forecasting that leverages causality-inspired models to balance the trade-off between invariance to distributional changes and minimization of prediction errors. To the best of our knowledge, this is the first study to conduct a comprehensive comparative analysis among state-of-the-art causal discovery algorithms, benchmarked against non-causal feature selection techniques, in the application of forecasting asset returns. Empirical evaluations demonstrate the efficacy of our approach in yielding stable and accurate predictions, outperforming baseline models, particularly in tumultuous market conditions. ...

August 19, 2024 · 1 min · Research Team