Multi-Asset

Supervised Autoencoder MLP for Financial Time Series Forecasting ArXiv ID: 2404.01866 “View on arXiv” Authors: Unknown Abstract This paper investigates the enhancement of financial time series forecasting with the use of neural networks through supervised autoencoders, aiming to improve investment strategy performance. It specifically examines the impact of noise augmentation and triple barrier labeling on risk-adjusted returns, using the Sharpe and Information Ratios. The study focuses on the S&P 500 index, EUR/USD, and BTC/USD as the traded assets from January 1, 2010, to April 30, 2022. Findings indicate that supervised autoencoders, with balanced noise augmentation and bottleneck size, significantly boost strategy effectiveness. However, excessive noise and large bottleneck sizes can impair performance, highlighting the importance of precise parameter tuning. This paper also presents a derivation of a novel optimization metric that can be used with triple barrier labeling. The results of this study have substantial policy implications, suggesting that financial institutions and regulators could leverage techniques presented to enhance market stability and investor protection, while also encouraging more informed and strategic investment approaches in various financial sectors. ...

Asset management with an ESG mandate ArXiv ID: 2403.11622 “View on arXiv” Authors: Unknown Abstract We investigate the portfolio frontier and risk premia in equilibrium when institutional investors aim to minimize the tracking error variance under an ESG score mandate. If a negative ESG premium is priced in the market, this mandate can reduce portfolio inefficiency when the return over-performance target is limited. In equilibrium, with asset managers endowed with an ESG mandate and mean-variance investors, a negative ESG premium arises. A result that is supported by empirical data. The negative ESG premium is due to the ESG constraint imposed on institutional investors and is not associated with a risk factor. ...

Portfolio Analysis in High Dimensions with TE and Weight Constraints ArXiv ID: 2402.17523 “View on arXiv” Authors: Unknown Abstract This paper explores the statistical properties of forming constrained optimal portfolios within a high-dimensional set of assets. We examine portfolios with tracking error constraints, those with simultaneous tracking error and weight restrictions, and portfolios constrained solely by weight. Tracking error measures portfolio performance against a benchmark (typically an index), while weight constraints determine asset allocation based on regulatory requirements or fund prospectuses. Our approach employs a novel statistical learning technique that integrates factor models with nodewise regression, named the Constrained Residual Nodewise Optimal Weight Regression (CROWN) method. We demonstrate its estimation consistency in large dimensions, even when assets outnumber the portfolio’s time span. Convergence rate results for constrained portfolio weights, risk, and Sharpe Ratio are provided, and simulation and empirical evidence highlight the method’s outstanding performance. ...

Finding Near-Optimal Portfolios With Quality-Diversity ArXiv ID: 2402.16118 “View on arXiv” Authors: Unknown Abstract The majority of standard approaches to financial portfolio optimization (PO) are based on the mean-variance (MV) framework. Given a risk aversion coefficient, the MV procedure yields a single portfolio that represents the optimal trade-off between risk and return. However, the resulting optimal portfolio is known to be highly sensitive to the input parameters, i.e., the estimates of the return covariance matrix and the mean return vector. It has been shown that a more robust and flexible alternative lies in determining the entire region of near-optimal portfolios. In this paper, we present a novel approach for finding a diverse set of such portfolios based on quality-diversity (QD) optimization. More specifically, we employ the CVT-MAP-Elites algorithm, which is scalable to high-dimensional settings with potentially hundreds of behavioral descriptors and/or assets. The results highlight the promising features of QD as a novel tool in PO. ...

The Boosted Difference of Convex Functions Algorithm for Value-at-Risk Constrained Portfolio Optimization ArXiv ID: 2402.09194 “View on arXiv” Authors: Unknown Abstract A highly relevant problem of modern finance is the design of Value-at-Risk (VaR) optimal portfolios. Due to contemporary financial regulations, banks and other financial institutions are tied to use the risk measure to control their credit, market, and operational risks. Despite its practical relevance, the non-convexity induced by VaR constraints in portfolio optimization problems remains a major challenge. To address this complexity more effectively, this paper proposes the use of the Boosted Difference-of-Convex Functions Algorithm (BDCA) to approximately solve a Markowitz-style portfolio selection problem with a VaR constraint. As one of the key contributions, we derive a novel line search framework that allows the application of the algorithm to Difference-of-Convex functions (DC) programs where both components are non-smooth. Moreover, we prove that the BDCA linearly converges to a Karush-Kuhn-Tucker point for the problem at hand using the Kurdyka-Lojasiewicz property. We also outline that this result can be generalized to a broader class of piecewise-linear DC programs with linear equality and inequality constraints. In the practical part, extensive numerical experiments under consideration of best practices then demonstrate the robustness of the BDCA under challenging constraint settings and adverse initialization. In particular, the algorithm consistently identifies the highest number of feasible solutions even under the most challenging conditions, while other approaches from chance-constrained programming lead to a complete failure in these settings. Due to the open availability of all data sets and code, this paper further provides a practical guide for transparent and easily reproducible comparisons of VaR-constrained portfolio selection problems in Python. ...

Finding Moving-Band Statistical Arbitrages via Convex-Concave Optimization ArXiv ID: 2402.08108 “View on arXiv” Authors: Unknown Abstract We propose a new method for finding statistical arbitrages that can contain more assets than just the traditional pair. We formulate the problem as seeking a portfolio with the highest volatility, subject to its price remaining in a band and a leverage limit. This optimization problem is not convex, but can be approximately solved using the convex-concave procedure, a specific sequential convex programming method. We show how the method generalizes to finding moving-band statistical arbitrages, where the price band midpoint varies over time. ...

Markowitz Portfolio Construction at Seventy ArXiv ID: 2401.05080 “View on arXiv” Authors: Unknown Abstract More than seventy years ago Harry Markowitz formulated portfolio construction as an optimization problem that trades off expected return and risk, defined as the standard deviation of the portfolio returns. Since then the method has been extended to include many practical constraints and objective terms, such as transaction cost or leverage limits. Despite several criticisms of Markowitz’s method, for example its sensitivity to poor forecasts of the return statistics, it has become the dominant quantitative method for portfolio construction in practice. In this article we describe an extension of Markowitz’s method that addresses many practical effects and gracefully handles the uncertainty inherent in return statistics forecasting. Like Markowitz’s original formulation, the extension is also a convex optimization problem, which can be solved with high reliability and speed. ...

Causal Discovery in Financial Markets: A Framework for Nonstationary Time-Series Data ArXiv ID: 2312.17375 “View on arXiv” Authors: Unknown Abstract This paper introduces a new causal structure learning method for nonstationary time series data, a common data type found in fields such as finance, economics, healthcare, and environmental science. Our work builds upon the constraint-based causal discovery from nonstationary data algorithm (CD-NOD). We introduce a refined version (CD-NOTS) which is designed specifically to account for lagged dependencies in time series data. We compare the performance of different algorithmic choices, such as the type of conditional independence test and the significance level, to help select the best hyperparameters given various scenarios of sample size, problem dimensionality, and availability of computational resources. Using the results from the simulated data, we apply CD-NOTS to a broad range of real-world financial applications in order to identify causal connections among nonstationary time series data, thereby illustrating applications in factor-based investing, portfolio diversification, and comprehension of market dynamics. ...

Onflow: an online portfolio allocation algorithm ArXiv ID: 2312.05169 “View on arXiv” Authors: Unknown Abstract We introduce Onflow, a reinforcement learning technique that enables online optimization of portfolio allocation policies based on gradient flows. We devise dynamic allocations of an investment portfolio to maximize its expected log return while taking into account transaction fees. The portfolio allocation is parameterized through a softmax function, and at each time step, the gradient flow method leads to an ordinary differential equation whose solutions correspond to the updated allocations. This algorithm belongs to the large class of stochastic optimization procedures; we measure its efficiency by comparing our results to the mathematical theoretical values in a log-normal framework and to standard benchmarks from the ‘old NYSE’ dataset. For log-normal assets, the strategy learned by Onflow, with transaction costs at zero, mimics Markowitz’s optimal portfolio and thus the best possible asset allocation strategy. Numerical experiments from the ‘old NYSE’ dataset show that Onflow leads to dynamic asset allocation strategies whose performances are: a) comparable to benchmark strategies such as Cover’s Universal Portfolio or Helmbold et al. “multiplicative updates” approach when transaction costs are zero, and b) better than previous procedures when transaction costs are high. Onflow can even remain efficient in regimes where other dynamical allocation techniques do not work anymore. Therefore, as far as tested, Onflow appears to be a promising dynamic portfolio management strategy based on observed prices only and without any assumption on the laws of distributions of the underlying assets’ returns. In particular it could avoid model risk when building a trading strategy. ...

Narratives from GPT-derived Networks of News, and a link to Financial Markets Dislocations ArXiv ID: 2311.14419 “View on arXiv” Authors: Unknown Abstract Starting from a corpus of economic articles from The Wall Street Journal, we present a novel systematic way to analyse news content that evolves over time. We leverage on state-of-the-art natural language processing techniques (i.e. GPT3.5) to extract the most important entities of each article available, and aggregate co-occurrence of entities in a related graph at the weekly level. Network analysis techniques and fuzzy community detection are tested on the proposed set of graphs, and a framework is introduced that allows systematic but interpretable detection of topics and narratives. In parallel, we propose to consider the sentiment around main entities of an article as a more accurate proxy for the overall sentiment of such piece of text, and describe a case-study to motivate this choice. Finally, we design features that characterise the type and structure of news within each week, and map them to moments of financial markets dislocations. The latter are identified as dates with unusually high volatility across asset classes, and we find quantitative evidence that they relate to instances of high entropy in the high-dimensional space of interconnected news. This result further motivates the pursued efforts to provide a novel framework for the systematic analysis of narratives within news. ...