Search arXivSearch

arXiv · 2502.02619

Regret-Optimized Portfolio Enhancement through Deep Reinforcement Learning and Future Looking Rewards

Abstract

This paper introduces a novel agent-based approach for enhancing existing portfolio strategies using Proximal Policy Optimization (PPO). Rather than focusing solely on traditional portfolio construction, our approach aims to improve an already high-performing strategy through dynamic rebalancing driven by PPO and Oracle agents. Our target is to enhance the traditional 60/40 benchmark (60% stocks, 40% bonds) by employing the Regret-based Sharpe reward function. To address the impact of transaction fee frictions and prevent signal loss, we develop a transaction cost scheduler. We introduce a future-looking reward function and employ synthetic data training through a circular block bootstrap method to facilitate the learning of generalizable allocation strategies. We focus on two key evaluation measures: return and maximum drawdown. Given the high stochasticity of financial markets, we train 20 independent agents each period and evaluate their average performance against the benchmark. Our method not only enhances the performance of the existing portfolio strategy through strategic rebalancing but also demonstrates strong results compared to other baselines.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniil Karzanov, Rubén Garzón, Mikhail Terekhov, Caglar Gulcehre, Thomas Raffinot, Marcin Detyniecki. 2025-02-04. Regret-Optimized Portfolio Enhancement through Deep Reinforcement Learning and Future Looking Rewards. https://arxiv.org/abs/2502.02619

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The geometry of higher order modern portfolio theory

In this article, we study the generalized modern portfolio theory, with utility functions admitting higher-order cumulants. We establish that under certain genericity conditions, the utility function has a constant number of complex critical points. We study the discriminant locus of complex critical points with multiplicity. Finally, we switch our attention to the generalization of the feasible portfolio set (variety), determine its dimension, and give a formula for its degree.

q-fin.PM

Special Markowitz: Thermodynamic Formalism for the Joint Regularisation of Returns and Covariance

Special Markowitz (SM) regularises returns and covariance jointly, relative to a reference state (mu_ref, Sigma_ref). Each eigendirection of the whitened relative operator carries a signed spectral potential Phi_k, with persistence factor psi_k = exp(-Phi_k) > 0. Positive potentials attenuate empirical deviations from the reference geometry, zero potential preserves them, and negative potentials amplify them. The persistence factor psi_k governs both the return signal and the covariance deviation: the regularised deviation from the reference is psi_k times the empirical deviation. The logarithmic potential coordinate is characterised by a multiplicative composition law on the multiplicative group of positive real numbers; the Stein loss is characterised as the unique free-energy density (within a natural class) compatible with the resulting coupling. The SM pressure functional is additive across modes the defining property of Special Markowitz.

q-fin.PM

Separated Signal Libraries: Packing, Saturation, and Joint Spectral Limits

We study libraries of cross-sectional signals: at each date, a forecast vector over $d$ assets intended to predict the next period's cross-sectional return. Demeaned and unit-normalized, a signal is a point on a sphere and its $T$-date history a point on a product of $T$ spheres. A pairwise correlation cap on histories is a minimum angular separation on that product, so growing a library under such a cap is a packing problem. If a large library is not too pairwise correlated and is equally weighted, does the equally weighted sum (EWS) tend to a known principal-component quantity as it grows? We answer this under explicit assumptions on how the library is filled. Separation alone guarantees nothing: it fixes no limiting distribution; a saturated library covers the sphere yet can carry a biased count; and near-maximum packing on a fixed domain forces uniform volume, which on the unrestricted sphere gives zero mean and no distinguished principal component (PC1). Alignment depends on the admission rule and candidate distribution. Under the uniform product-volume benchmark, screening on positive average information coefficient (IC) yields a nonzero, target-aligned mean but an isotropic second moment, whereas a positive IC margin $β$ makat every finite $T$, with athree-level spectrum whose leading eigenvalue tends to $β^2$ while residual levels decay as $1/T$; margins of order $T^{-1/2}$ keep a positive admission rate but a vanishing eigengA finite residual-spectrum criteS-PC1 alignment.Gilbert-Varshamov codes show separation permits both outcomes: exponentially large positive-IC libraries exist whose EWS is PC1, and others whose EWS is orthogonal to PC1. $\log J=o(T)$ suffices for uniform estimation among $J$ candidates from $T$ iid dates. Derived results are proved and checked numerically; no market data are used.

q-fin.PM