false

Offline Digital Euro: a Minimum Viable CBDC using Groth-Sahai proofs

Offline Digital Euro: a Minimum Viable CBDC using Groth-Sahai proofs ArXiv ID: 2407.13776 “View on arXiv” Authors: Unknown Abstract Current digital payment solutions are fragile and offer less privacy than traditional cash. Their critical dependency on an online service used to perform and validate transactions makes them void if this service is unreachable. Moreover, no transaction can be executed during server malfunctions or power outages. Due to climate change, the likelihood of extreme weather increases. As extreme weather is a major cause of power outages, the frequency of power outages is expected to increase. The lack of privacy is an inherent result of their account-based design or the use of a public ledger. The critical dependency and lack of privacy can be resolved with a Central Bank Digital Currency that can be used offline. This thesis proposes a design and a first implementation for an offline-first digital euro. The protocol offers complete privacy during transactions using zero-knowledge proofs. Furthermore, transactions can be executed offline without third parties and retroactive double-spending detection is facilitated. To protect the users’ privacy, but also guard against money laundering, we have added the following privacy-guarding mechanism. The bank and trusted third parties for law enforcement must collaborate to decrypt transactions, revealing the digital pseudonym used in the transaction. Importantly, the transaction can be decrypted without decrypting prior transactions attached to the digital euro. The protocol has a working initial implementation showcasing its usability and demonstrating functionality. ...

July 1, 2024 · 2 min · Research Team

Portfolio optimisation: bridging the gap between theory and practice

Portfolio optimisation: bridging the gap between theory and practice ArXiv ID: 2407.00887 “View on arXiv” Authors: Unknown Abstract Portfolio optimisation is essential in quantitative investing, but its implementation faces several practical difficulties. One particular challenge is converting optimal portfolio weights into real-life trades in the presence of realistic features, such as transaction costs and integral lots. This is especially important in automated trading, where the entire process happens without human intervention. Several works in literature have extended portfolio optimisation models to account for these features. In this paper, we highlight and illustrate difficulties faced when employing the existing literature in a practical setting, such as computational intractability, numerical imprecision and modelling trade-offs. We then propose a two-stage framework as an alternative approach to address this issue. Its goal is to optimise portfolio weights in the first stage and to generate realistic trades in the second. Through extensive computational experiments, we show that our approach not only mitigates the difficulties discussed above but also can be successfully employed in a realistic scenario. By splitting the problem in two, we are able to incorporate new features without adding too much complexity to any single model. With this in mind we model two novel features that are critical to many investment strategies: first, we integrate two classes of assets, futures contracts and equities, into a single framework, with an example illustrating how this can help portfolio managers in enhancing investment strategies. Second, we account for borrowing costs in short positions, which have so far been neglected in literature but which significantly impact profits in long/short strategies. Even with these new features, our two-stage approach still effectively converts optimal portfolios into actionable trades. ...

July 1, 2024 · 2 min · Research Team

Predicting public market behavior from private equity deals

Predicting public market behavior from private equity deals ArXiv ID: 2407.01818 “View on arXiv” Authors: Unknown Abstract We process private equity transactions to predict public market behavior with a logit model. Specifically, we estimate our model to predict quarterly returns for both the broad market and for individual sectors. Our hypothesis is that private equity investments (in aggregate) carry predictive signal about publicly traded securities. The key source of such predictive signal is the fact that, during their diligence process, private equity fund managers are privy to valuable company information that may not yet be reflected in the public markets at the time of their investment. Thus, we posit that we can discover investors’ collective near-term insight via detailed analysis of the timing and nature of the deals they execute. We evaluate the accuracy of the estimated model by applying it to test data where we know the correct output value. Remarkably, our model performs consistently better than a null model simply based on return statistics, while showing a predictive accuracy of up to 70% in sectors such as Consumer Services, Communications, and Non Energy Minerals. ...

July 1, 2024 · 2 min · Research Team

Deep Reinforcement Learning Strategies in Finance: Insights into Asset Holding, Trading Behavior, and Purchase Diversity

Deep Reinforcement Learning Strategies in Finance: Insights into Asset Holding, Trading Behavior, and Purchase Diversity ArXiv ID: 2407.09557 “View on arXiv” Authors: Unknown Abstract Recent deep reinforcement learning (DRL) methods in finance show promising outcomes. However, there is limited research examining the behavior of these DRL algorithms. This paper aims to investigate their tendencies towards holding or trading financial assets as well as purchase diversity. By analyzing their trading behaviors, we provide insights into the decision-making processes of DRL models in finance applications. Our findings reveal that each DRL algorithm exhibits unique trading patterns and strategies, with A2C emerging as the top performer in terms of cumulative rewards. While PPO and SAC engage in significant trades with a limited number of stocks, DDPG and TD3 adopt a more balanced approach. Furthermore, SAC and PPO tend to hold positions for shorter durations, whereas DDPG, A2C, and TD3 display a propensity to remain stationary for extended periods. ...

June 29, 2024 · 2 min · Research Team

Vector-valued robust stochastic control

Vector-valued robust stochastic control ArXiv ID: 2407.00266 “View on arXiv” Authors: Unknown Abstract We study a dynamic stochastic control problem subject to Knightian uncertainty with multi-objective (vector-valued) criteria. Assuming the preferences across expected multi-loss vectors are represented by a given, yet general, preorder, we address the model uncertainty by adopting a robust or minimax perspective, minimizing expected loss across the worst-case model. For loss functions taking real (or scalar) values, there is no ambiguity in interpreting supremum and infimum. In contrast to the scalar case, major challenges for multi-loss control problems include properly defining and interpreting the notions of supremum and infimum, and addressing the non-uniqueness of these suprema and infima. To deal with these, we employ the notion of an ideal point vector-valued supremum for the robust part of the problem, while we view the control part as a multi-objective (or vector) optimization problem. Using a set-valued framework, we derive both a weak and strong version of the dynamic programming principle (DPP) or Bellman equations by taking the value function as the collection of all worst expected losses across all feasible actions. The weak version of Bellman’s principle is proved under minimal assumptions. To establish a stronger version of DPP, we introduce the rectangularity property with respect to a general preorder. We also further study a particular, but important, case of component-wise partial order of vectors, for which we additionally derive DPP under a different set-valued notion for the value function, the so-called upper image of the multi-objective problem. Finally, we provide illustrative examples motivated by financial problems. These results will serve as a foundation for addressing time-inconsistent problems subject to model uncertainty through the lens of a set-valued framework, as well as for studying multi-portfolio allocation problems under model uncertainty. ...

June 29, 2024 · 2 min · Research Team

Optimal consumption under loss-averse multiplicative habit-formation preferences

Optimal consumption under loss-averse multiplicative habit-formation preferences ArXiv ID: 2406.20063 “View on arXiv” Authors: Unknown Abstract This paper studies a loss-averse version of the multiplicative habit formation preference and the corresponding optimal investment and consumption strategies over an infinite horizon. The agent’s consumption preference is depicted by a general S-shaped utility function of her consumption-to-habit ratio. By considering the concave envelope of the S-shaped utility and the associated dual value function, we provide a thorough analysis of the HJB equation for the concavified problem via studying a related nonlinear free boundary problem. Based on established properties of the solution to this free boundary problem, we obtain the optimal consumption and investment policies in feedback form. Some new and technical verification arguments are developed to cope with generality of the utility function. The equivalence between the original problem and the concavified problem readily follows from the structure of the feedback controls. We also discuss some quantitative properties of the optimal policies, complemented by illustrative numerical examples and their financial implications. ...

June 28, 2024 · 2 min · Research Team

A Reflective LLM-based Agent to Guide Zero-shot Cryptocurrency Trading

A Reflective LLM-based Agent to Guide Zero-shot Cryptocurrency Trading ArXiv ID: 2407.09546 “View on arXiv” Authors: Unknown Abstract The utilization of Large Language Models (LLMs) in financial trading has primarily been concentrated within the stock market, aiding in economic and financial decisions. Yet, the unique opportunities presented by the cryptocurrency market, noted for its on-chain data’s transparency and the critical influence of off-chain signals like news, remain largely untapped by LLMs. This work aims to bridge the gap by developing an LLM-based trading agent, CryptoTrade, which uniquely combines the analysis of on-chain and off-chain data. This approach leverages the transparency and immutability of on-chain data, as well as the timeliness and influence of off-chain signals, providing a comprehensive overview of the cryptocurrency market. CryptoTrade incorporates a reflective mechanism specifically engineered to refine its daily trading decisions by analyzing the outcomes of prior trading decisions. This research makes two significant contributions. Firstly, it broadens the applicability of LLMs to the domain of cryptocurrency trading. Secondly, it establishes a benchmark for cryptocurrency trading strategies. Through extensive experiments, CryptoTrade has demonstrated superior performance in maximizing returns compared to traditional trading strategies and time-series baselines across various cryptocurrencies and market conditions. Our code and data are available at \url{“https://anonymous.4open.science/r/CryptoTrade-Public-92FC/"}. ...

June 27, 2024 · 2 min · Research Team

Benchmarking M6 Competitors: An Analysis of Financial Metrics and Discussion of Incentives

Benchmarking M6 Competitors: An Analysis of Financial Metrics and Discussion of Incentives ArXiv ID: 2406.19105 “View on arXiv” Authors: Unknown Abstract The M6 Competition assessed the performance of competitors using a ranked probability score and an information ratio (IR). While these metrics do well at picking the winners in the competition, crucial questions remain for investors with longer-term incentives. To address these questions, we compare the competitors’ performance to a number of conventional (long-only) and alternative indices using standard industry metrics. We apply factor models to measure the competitors’ value-adds above industry-standard benchmarks and find that competitors with more extreme performance are less dependent on the benchmarks. We also uncover that most competitors could not generate significant out-performance compared to randomly selected long-only and long-short portfolios but did generate out-performance compared to short-only portfolios. We further introduce two new strategies by picking the competitors with the best (Superstars) and worst (Superlosers) recent performance and show that it is challenging to identify skill amongst investment managers. We also discuss the incentives of winning the competition compared to professional investors, where investors wish to maximize fees over an extended period of time. ...

June 27, 2024 · 2 min · Research Team

AlphaForge: A Framework to Mine and Dynamically Combine Formulaic Alpha Factors

AlphaForge: A Framework to Mine and Dynamically Combine Formulaic Alpha Factors ArXiv ID: 2406.18394 “View on arXiv” Authors: Unknown Abstract The complexity of financial data, characterized by its variability and low signal-to-noise ratio, necessitates advanced methods in quantitative investment that prioritize both performance and interpretability.Transitioning from early manual extraction to genetic programming, the most advanced approach in the alpha factor mining domain currently employs reinforcement learning to mine a set of combination factors with fixed weights. However, the performance of resultant alpha factors exhibits inconsistency, and the inflexibility of fixed factor weights proves insufficient in adapting to the dynamic nature of financial markets. To address this issue, this paper proposes a two-stage formulaic alpha generating framework AlphaForge, for alpha factor mining and factor combination. This framework employs a generative-predictive neural network to generate factors, leveraging the robust spatial exploration capabilities inherent in deep learning while concurrently preserving diversity. The combination model within the framework incorporates the temporal performance of factors for selection and dynamically adjusts the weights assigned to each component alpha factor. Experiments conducted on real-world datasets demonstrate that our proposed model outperforms contemporary benchmarks in formulaic alpha factor mining. Furthermore, our model exhibits a notable enhancement in portfolio returns within the realm of quantitative investment and real money investment. ...

June 26, 2024 · 2 min · Research Team

LSTM-ARIMA as a Hybrid Approach in Algorithmic Investment Strategies

LSTM-ARIMA as a Hybrid Approach in Algorithmic Investment Strategies ArXiv ID: 2406.18206 “View on arXiv” Authors: Unknown Abstract This study focuses on building an algorithmic investment strategy employing a hybrid approach that combines LSTM and ARIMA models referred to as LSTM-ARIMA. This unique algorithm uses LSTM to produce final predictions but boosts the results of this RNN by adding the residuals obtained from ARIMA predictions among other inputs. The algorithm is tested across three equity indices (S&P 500, FTSE 100, and CAC 40) using daily frequency data from January 2000 to August 2023. The testing architecture is based on the walk-forward procedure for the hyperparameter tunning phase that uses Random Search and backtesting the algorithms. The selection of the optimal model is determined based on adequately selected performance metrics focused on risk-adjusted return measures. We considered two strategies for each algorithm: Long-Only and Long-Short to present the situation of two various groups of investors with different investment policy restrictions. For each strategy and equity index, we compute the performance metrics and visualize the equity curve to identify the best strategy with the highest modified information ratio. The findings conclude that the LSTM-ARIMA algorithm outperforms all the other algorithms across all the equity indices which confirms the strong potential behind hybrid ML-TS (machine learning - time series) models in searching for the optimal algorithmic investment strategies. ...

June 26, 2024 · 2 min · Research Team