false

Portfolio Optimization under Transaction Costs with Recursive Preferences

Portfolio Optimization under Transaction Costs with Recursive Preferences ArXiv ID: 2402.08387 “View on arXiv” Authors: Unknown Abstract The Merton investment-consumption problem is fundamental, both in the field of finance, and in stochastic control. An important extension of the problem adds transaction costs, which is highly relevant from a financial perspective but also challenging from a control perspective because the solution now involves singular control. A further significant extension takes us from additive utility to stochastic differential utility (SDU), which allows time preferences and risk preferences to be disentangled. In this paper, we study this extended version of the Merton problem with proportional transaction costs and Epstein-Zin SDU. We fully characterise all parameter combinations for which the problem is well posed (which may depend on the level of transaction costs) and provide a full verification argument that relies on no additional technical assumptions and uses primal methods only. The case with SDU requires new mathematical techniques as duality methods break down. Even in the special case of (additive) power utility, our arguments are significantly simpler, more elegant and more far-reaching than the ones in the extant literature. This means that we can easily analyse aspects of the problem which previously have been very challenging, including comparative statics, boundary cases which heretofore have required separate treatment and the situation beyond the small transaction cost regime. A key and novel idea is to parametrise consumption and the value function in terms of the shadow fraction of wealth, which may be of much wider applicability. ...

February 13, 2024 · 2 min · Research Team

Optimizing Transition Strategies for Small to Medium Sized Portfolios

Optimizing Transition Strategies for Small to Medium Sized Portfolios ArXiv ID: 2401.13126 “View on arXiv” Authors: Unknown Abstract This work discusses the benefits of constrained portfolio turnover strategies for small to medium-sized portfolios. We propose a dynamic multi-period model that aims to minimize transaction costs and maximize terminal wealth levels whilst adhering to strict portfolio turnover constraints. Our results demonstrate that using our framework in combination with a reasonable forecast, can lead to higher portfolio values and lower transaction costs on average when compared to a naive, single-period model. Such results were maintained given different problem cases, such as, trading horizon, assets under management, wealth levels, etc. In addition, the proposed model lends itself to a reformulation that makes use of the column generation algorithm which can be strategically leveraged to reduce complexity and solving times. ...

January 23, 2024 · 2 min · Research Team

Almost Perfect Shadow Prices

Almost Perfect Shadow Prices ArXiv ID: 2401.00970 “View on arXiv” Authors: Unknown Abstract Shadow prices simplify the derivation of optimal trading strategies in markets with transaction costs by transferring optimization into a more tractable, frictionless market. This paper establishes that a naïve shadow price Ansatz for maximizing long term returns given average volatility yields a strategy that is, for small bid-ask-spreads, asymptotically optimal at third order. Considering the second-order impact of transaction costs, such a strategy is essentially optimal. However, for risk aversion different from one, we devise alternative strategies that outperform the shadow market at fourth order. Finally, it is shown that the risk-neutral objective rules out the existence of shadow prices. ...

January 1, 2024 · 2 min · Research Team

Onflow: an online portfolio allocation algorithm

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. ...

December 8, 2023 · 2 min · Research Team

Discretization of continuous-time arbitrage strategies in financial markets with fractional Brownian motion

Discretization of continuous-time arbitrage strategies in financial markets with fractional Brownian motion ArXiv ID: 2311.15635 “View on arXiv” Authors: Unknown Abstract This study evaluates the practical usefulness of continuous-time arbitrage strategies designed to exploit serial correlation in fractional financial markets. Specifically, we revisit the strategies of Shiryaev (1998) and Salopek (1998) and transfer them to a real-world setting by distretizing their dynamics and introducing transaction costs. In Monte Carlo simulations with various market and trading parameter settings as well as a formal analysis of discretization error, we show that both are promising with respect to terminal portfolio values and loss probabilities. These features and complementary sparsity make them worth serious consideration in the toolkit of quantitative investors. ...

November 27, 2023 · 2 min · Research Team

Reinforcement Learning and Deep Stochastic Optimal Control for Final Quadratic Hedging

Reinforcement Learning and Deep Stochastic Optimal Control for Final Quadratic Hedging ArXiv ID: 2401.08600 “View on arXiv” Authors: Unknown Abstract We consider two data driven approaches, Reinforcement Learning (RL) and Deep Trajectory-based Stochastic Optimal Control (DTSOC) for hedging a European call option without and with transaction cost according to a quadratic hedging P&L objective at maturity (“variance-optimal hedging” or “final quadratic hedging”). We study the performance of the two approaches under various market environments (modeled via the Black-Scholes and/or the log-normal SABR model) to understand their advantages and limitations. Without transaction costs and in the Black-Scholes model, both approaches match the performance of the variance-optimal Delta hedge. In the log-normal SABR model without transaction costs, they match the performance of the variance-optimal Barlett’s Delta hedge. Agents trained on Black-Scholes trajectories with matching initial volatility but used on SABR trajectories match the performance of Bartlett’s Delta hedge in average cost, but show substantially wider variance. To apply RL approaches to these problems, P&L at maturity is written as sum of step-wise contributions and variants of RL algorithms are implemented and used that minimize expectation of second moments of such sums. ...

November 20, 2023 · 2 min · Research Team

Deeper Hedging: A New Agent-based Model for Effective Deep Hedging

Deeper Hedging: A New Agent-based Model for Effective Deep Hedging ArXiv ID: 2310.18755 “View on arXiv” Authors: Unknown Abstract We propose the Chiarella-Heston model, a new agent-based model for improving the effectiveness of deep hedging strategies. This model includes momentum traders, fundamental traders, and volatility traders. The volatility traders participate in the market by innovatively following a Heston-style volatility signal. The proposed model generalises both the extended Chiarella model and the Heston stochastic volatility model, and is calibrated to reproduce as many empirical stylized facts as possible. According to the stylised facts distance metric, the proposed model is able to reproduce more realistic financial time series than three baseline models: the extended Chiarella model, the Heston model, and the Geometric Brownian Motion. The proposed model is further validated by the Generalized Subtracted L-divergence metric. With the proposed Chiarella-Heston model, we generate a training dataset to train a deep hedging agent for optimal hedging strategies under various transaction cost levels. The deep hedging agent employs the Deep Deterministic Policy Gradient algorithm and is trained to maximize profits and minimize risks. Our testing results reveal that the deep hedging agent, trained with data generated by our proposed model, outperforms the baseline in most transaction cost levels. Furthermore, the testing process, which is conducted using empirical data, demonstrates the effective performance of the trained deep hedging agent in a realistic trading environment. ...

October 28, 2023 · 2 min · Research Team

Optimal Entry and Exit with Signature in Statistical Arbitrage

Optimal Entry and Exit with Signature in Statistical Arbitrage ArXiv ID: 2309.16008 “View on arXiv” Authors: Unknown Abstract In this paper, we explore an optimal timing strategy for the trading of price spreads exhibiting mean-reverting characteristics. A sequential optimal stopping framework is formulated to analyze the optimal timings for both entering and subsequently liquidating positions, all while considering the impact of transaction costs. Then we leverages a refined signature optimal stopping method to resolve this sequential optimal stopping problem, thereby unveiling the precise entry and exit timings that maximize gains. Our framework operates without any predefined assumptions regarding the dynamics of the underlying mean-reverting spreads, offering adaptability to diverse scenarios. Numerical results are provided to demonstrate its superior performance when comparing with conventional mean reversion trading rules. ...

September 27, 2023 · 2 min · Research Team

Sparse Index Tracking: Simultaneous Asset Selection and Capital Allocation via $ll_0$-Constrained Portfolio

Sparse Index Tracking: Simultaneous Asset Selection and Capital Allocation via $\ell_0$-Constrained Portfolio ArXiv ID: 2309.10152 “View on arXiv” Authors: Unknown Abstract Sparse index tracking is a prominent passive portfolio management strategy that constructs a sparse portfolio to track a financial index. A sparse portfolio is preferable to a full portfolio in terms of reducing transaction costs and avoiding illiquid assets. To achieve portfolio sparsity, conventional studies have utilized $\ell_p$-norm regularizations as a continuous surrogate of the $\ell_0$-norm regularization. Although these formulations can construct sparse portfolios, their practical application is challenging due to the intricate and time-consuming process of tuning parameters to define the precise upper limit of assets in the portfolio. In this paper, we propose a new problem formulation of sparse index tracking using an $\ell_0$-norm constraint that enables easy control of the upper bound on the number of assets in the portfolio. Moreover, our approach offers a choice between constraints on portfolio and turnover sparsity, further reducing transaction costs by limiting asset updates at each rebalancing interval. Furthermore, we develop an efficient algorithm for solving this problem based on a primal-dual splitting method. Finally, we illustrate the effectiveness of the proposed method through experiments on the S&P500 and Russell3000 index datasets. ...

July 22, 2023 · 2 min · Research Team

Reinforcement Learning for Credit Index Option Hedging

Reinforcement Learning for Credit Index Option Hedging ArXiv ID: 2307.09844 “View on arXiv” Authors: Unknown Abstract In this paper, we focus on finding the optimal hedging strategy of a credit index option using reinforcement learning. We take a practical approach, where the focus is on realism i.e. discrete time, transaction costs; even testing our policy on real market data. We apply a state of the art algorithm, the Trust Region Volatility Optimization (TRVO) algorithm and show that the derived hedging strategy outperforms the practitioner’s Black & Scholes delta hedge. ...

July 19, 2023 · 1 min · Research Team