Growth-Optimal Portfolio Selection under CVaR Constraints
Guy Uziel, Ran El-Yaniv

TL;DR
This paper develops an online portfolio selection method that maximizes wealth while controlling CVaR risk, providing asymptotic optimality guarantees and validating performance on real datasets.
Contribution
It introduces a novel strategy for online portfolio selection that ensures asymptotic optimality under CVaR constraints, a significant advancement over existing regret-based methods.
Findings
Achieves asymptotic optimal risk-adjusted performance
Guarantees portfolio compliance with CVaR constraints
Validated effectiveness on standard financial datasets
Abstract
Online portfolio selection research has so far focused mainly on minimizing regret defined in terms of wealth growth. Practical financial decision making, however, is deeply concerned with both wealth and risk. We consider online learning of portfolios of stocks whose prices are governed by arbitrary (unknown) stationary and ergodic processes, where the goal is to maximize wealth while keeping the conditional value at risk (CVaR) below a desired threshold. We characterize the asymptomatically optimal risk-adjusted performance and present an investment strategy whose portfolios are guaranteed to achieve the asymptotic optimal solution while fulfilling the desired risk constraint. We also numerically demonstrate and validate the viability of our method on standard datasets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Risk and Portfolio Optimization · Smart Grid Energy Management
