REVIEW 2 cited by
A Universal End-to-End Approach to Portfolio Optimization via Deep Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We propose a universal end-to-end framework for portfolio optimization where asset distributions are directly obtained. The designed framework circumvents the traditional forecasting step and avoids the estimation of the covariance matrix, lifting the bottleneck for generalizing to a large amount of instruments. Our framework has the flexibility of optimizing various objective functions including Sharpe ratio, mean-variance trade-off etc. Further, we allow for short selling and study several constraints attached to objective functions. In particular, we consider cardinality, maximum position for individual instrument and leverage. These constraints are formulated into objective functions by utilizing several neural layers and gradient ascent can be adopted for optimization. To ensure the robustness of our framework, we test our methods on two datasets. Firstly, we look at a synthetic dataset where we demonstrate that weights obtained from our end-to-end approach are better than classical predictive methods. Secondly, we apply our framework on a real-life dataset with historical observations of hundreds of instruments with a testing period of more than 20 years.
Forward citations
Cited by 2 Pith papers
-
Decision-informed Neural Networks with Large Language Model Integration for Portfolio Optimization
A decision-focused neural network using GPT-2 embeddings for stocks and macro context reports higher Sharpe ratios and terminal wealth than deep learning baselines, but flawed proofs and survivorship-biased data under...
-
Smooth Learning with Hard Constraints via Legendre-Regularized Policies
Legendre-regularized policies—decisions defined as solutions of strongly convex regularized optimization problems—are feasible, smooth, surjective onto the relative interior, and universal-approximating, and beat deci...
Discussion (0). Continue with ORCID to comment.