Simplex Decomposition for Portfolio Allocation Constraints in Reinforcement Learning

2024-04-16 · David Winkel, Niklas Strauß, Matthias Schubert, Thomas Seidl

Portfolio optimization tasks describe sequential decision problems in which the investor's wealth is distributed across a set of assets. Allocation constraints are used to enforce minimal or maximal investments into particular subsets of assets to control for objectives such as limiting the portfolio's exposure to a certain sector due to environmental concerns. Although methods for constrained Reinforcement Learning (CRL) can optimize policies while considering allocation constraints, it can be observed that these general methods yield suboptimal results. In this paper, we propose a novel approach to handle allocation constraints based on a decomposition of the constraint action space into a set of unconstrained allocation problems. In particular, we examine this approach for the case of two constraints. For example, an investor may wish to invest at least a certain percentage of the portfolio into green technologies while limiting the investment in the fossil energy sector. We show that the action space of the task is equivalent to the decomposed action space, and introduce a new reinforcement learning (RL) approach CAOSD, which is built on top of the decomposition. The experimental evaluation on real-world Nasdaq-100 data demonstrates that our approach consistently outperforms state-of-the-art CRL benchmarks for portfolio optimization.

📄 PDF Abstract BibTeX arXiv:2404.10683

Code (0)

등록된 구현이 없습니다.

Tasks

Portfolio Optimization reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Autoregressive Policy Optimization for Constrained Allocation Tasks

2024-09-27 · David Winkel, Niklas Strauß, Maximilian Bernhard, Zongyue Li 외

Allocation tasks represent a class of problems where a limited amount of resources must be allocated to a set of entities at each time step. Prominent examples of this task include portfolio optimization or distributing …

Portfolio Optimization

Mind the Cap! -- Constrained Portfolio Optimisation in Heston's Stochastic Volatility Model

2023-06-19 · Marcos Escobar-Anel, Michel Kschonnek, Rudi Zagst

We consider a portfolio optimisation problem for a utility-maximising investor who faces convex constraints on his portfolio allocation in Heston's stochastic volatility model. We apply the duality methods developed in p…

Sparse projections onto the simplex

2012-06-07 · Anastasios Kyrillidis, Stephen Becker, Volkan Cevher and, Christoph Koch

Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the $\ell_1$-norm. However, several important learning applications cannot benefit from …

Density Estimation

SAMP-HDRL: Segmented Allocation with Momentum-Adjusted Utility for Multi-agent Portfolio Management via Hierarchical Deep Reinforcement Learning

2025-12-28 · Xiaotian Ren, Nuerxiati Abudurexiti, Zhengyong Jiang, Angelos Stefanidis 외 arxiv

Portfolio optimization in non-stationary markets is challenging due to regime shifts, dynamic correlations, and the limited interpretability of deep reinforcement learning (DRL) policies. We propose a Segmented Allocatio…

Reinforcement Learning Portfolio Optimization

A Prescriptive Dirichlet Power Allocation Policy with Deep Reinforcement Learning

2022-01-20 · Yuan Tian, Minghao Han, Chetan Kulkarni, Olga Fink

Prescribing optimal operation based on the condition of the system and, thereby, potentially prolonging the remaining useful lifetime has a large potential for actively managing the availability, maintenance and costs of…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)