Portfolio Optimization

Neural Functionally Generated Portfolios ArXiv ID: 2506.19715 “View on arXiv” Authors: Michael Monoyios, Olivia Pricilia Abstract We introduce a novel neural-network-based approach to learning the generating function $G(\cdot)$ of a functionally generated portfolio (FGP) from synthetic or real market data. In the neural network setting, the generating function is represented as $G_θ(\cdot)$, where $θ$ is an iterable neural network parameter vector, and $G_θ(\cdot)$ is trained to maximise investment return relative to the market portfolio. We compare the performance of the Neural FGP approach against classical FGP benchmarks. FGPs provide a robust alternative to classical portfolio optimisation by bypassing the need to estimate drifts or covariances. The neural FGP framework extends this by introducing flexibility in the design of the generating function, enabling it to learn from market dynamics while preserving self-financing and pathwise decomposition properties. ...

Accelerated Portfolio Optimization and Option Pricing with Reinforcement Learning ArXiv ID: 2507.01972 “View on arXiv” Authors: Hadi Keramati, Samaneh Jazayeri Abstract We present a reinforcement learning (RL)-driven framework for optimizing block-preconditioner sizes in iterative solvers used in portfolio optimization and option pricing. The covariance matrix in portfolio optimization or the discretization of differential operators in option pricing models lead to large linear systems of the form $\mathbf{“A”}\textbf{“x”}=\textbf{“b”}$. Direct inversion of high-dimensional portfolio or fine-grid option pricing incurs a significant computational cost. Therefore, iterative methods are usually used for portfolios in real-world situations. Ill-conditioned systems, however, suffer from slow convergence. Traditional preconditioning techniques often require problem-specific parameter tuning. To overcome this limitation, we rely on RL to dynamically adjust the block-preconditioner sizes and accelerate iterative solver convergence. Evaluations on a suite of real-world portfolio optimization matrices demonstrate that our RL framework can be used to adjust preconditioning and significantly accelerate convergence and reduce computational cost. The proposed accelerated solver supports faster decision-making in dynamic portfolio allocation and real-time option pricing. ...

Multi-period Mean-Buffered Probability of Exceedance in Defined Contribution Portfolio Optimization ArXiv ID: 2505.22121 “View on arXiv” Authors: Duy-Minh Dang, Chang Chen Abstract We investigate multi-period mean-risk portfolio optimization for long-horizon Defined Contribution plans, focusing on buffered Probability of Exceedance (bPoE), a more intuitive, dollar-based alternative to Conditional Value-at-Risk (CVaR). We formulate both pre-commitment and time-consistent Mean-bPoE and Mean-CVaR portfolio optimization problems under realistic investment constraints (e.g., no leverage, no short selling) and jump-diffusion dynamics. These formulations are naturally framed as bilevel optimization problems, with an outer search over the shortfall threshold and an inner optimization over rebalancing decisions. We establish an equivalence between the pre-commitment formulations through a one-to-one correspondence of their scalarization optimal sets, while showing that no such equivalence holds in the time-consistent setting. We develop provably convergent numerical schemes for the value functions associated with both pre-commitment and time-consistent formulations of these mean-risk control problems. Using nearly a century of market data, we find that time-consistent Mean-bPoE strategies closely resemble their pre-commitment counterparts. In particular, they maintain alignment with investors’ preferences for a minimum acceptable terminal wealth level-unlike time-consistent Mean-CVaR, which often leads to counterintuitive control behavior. We further show that bPoE, as a strictly tail-oriented measure, prioritizes guarding against catastrophic shortfalls while allowing meaningful upside exposure, making it especially appealing for long-horizon wealth security. These findings highlight bPoE’s practical advantages for Defined Contribution investment planning. ...

Distributionally Robust Deep Q-Learning ArXiv ID: 2505.19058 “View on arXiv” Authors: Chung I Lu, Julian Sester, Aijia Zhang Abstract We propose a novel distributionally robust $Q$-learning algorithm for the non-tabular case accounting for continuous state spaces where the state transition of the underlying Markov decision process is subject to model uncertainty. The uncertainty is taken into account by considering the worst-case transition from a ball around a reference probability measure. To determine the optimal policy under the worst-case state transition, we solve the associated non-linear Bellman equation by dualising and regularising the Bellman operator with the Sinkhorn distance, which is then parameterized with deep neural networks. This approach allows us to modify the Deep Q-Network algorithm to optimise for the worst case state transition. We illustrate the tractability and effectiveness of our approach through several applications, including a portfolio optimisation task based on S&{“P”}~500 data. ...

A Scalable Gradient-Based Optimization Framework for Sparse Minimum-Variance Portfolio Selection ArXiv ID: 2505.10099 “View on arXiv” Authors: Sarat Moka, Matias Quiroz, Vali Asimit, Samuel Muller Abstract Portfolio optimization involves selecting asset weights to minimize a risk-reward objective, such as the portfolio variance in the classical minimum-variance framework. Sparse portfolio selection extends this by imposing a cardinality constraint: only $k$ assets from a universe of $p$ may be included. The standard approach models this problem as a mixed-integer quadratic program and relies on commercial solvers to find the optimal solution. However, the computational costs of such methods increase exponentially with $k$ and $p$, making them too slow for problems of even moderate size. We propose a fast and scalable gradient-based approach that transforms the combinatorial sparse selection problem into a constrained continuous optimization task via Boolean relaxation, while preserving equivalence with the original problem on the set of binary points. Our algorithm employs a tunable parameter that transmutes the auxiliary objective from a convex to a concave function. This allows a stable convex starting point, followed by a controlled path toward a sparse binary solution as the tuning parameter increases and the objective moves toward concavity. In practice, our method matches commercial solvers in asset selection for most instances and, in rare instances, the solution differs by a few assets whilst showing a negligible error in portfolio variance. ...

Latent Variable Estimation in Bayesian Black-Litterman Models ArXiv ID: 2505.02185 “View on arXiv” Authors: Thomas Y. L. Lin, Jerry Yao-Chieh Hu, Paul W. Chiou, Peter Lin Abstract We revisit the Bayesian Black-Litterman (BL) portfolio model and remove its reliance on subjective investor views. Classical BL requires an investor “view”: a forecast vector $q$ and its uncertainty matrix $Ω$ that describe how much a chosen portfolio should outperform the market. Our key idea is to treat $(q,Ω)$ as latent variables and learn them from market data within a single Bayesian network. Consequently, the resulting posterior estimation admits closed-form expression, enabling fast inference and stable portfolio weights. Building on these, we propose two mechanisms to capture how features interact with returns: shared-latent parametrization and feature-influenced views; both recover classical BL and Markowitz portfolios as special cases. Empirically, on 30-year Dow-Jones and 20-year sector-ETF data, we improve Sharpe ratios by 50% and cut turnover by 55% relative to Markowitz and the index baselines. This work turns BL into a fully data-driven, view-free, and coherent Bayesian framework for portfolio optimization. ...

Multilayer Perceptron Neural Network Models in Asset Pricing: An Empirical Study on Large-Cap US Stocks ArXiv ID: 2505.01921 “View on arXiv” Authors: Shanyan Lai Abstract In this study, MLP models with dynamic structure are applied to factor models for asset pricing tasks. Concretely, the MLP pyramid model structure was employed on firm-characteristic-sorted portfolio factors for modelling the large-capital US stocks. It was further developed as a practicable factor investing strategy based on the predictions. The main findings in this chapter were evaluated from two angles: model performance and investing performance, which were compared from the periods with and without COVID-19. The empirical results indicated that with the restrictions of the data size, the MLP models no longer perform “deeper, better”, while the proposed MLP models with two and three hidden layers have higher flexibility to model the factors in this case. This study also verified the idea of previous works that MLP models for factor investing have more meaning in the downside risk control than in pursuing the absolute annual returns. ...

Deep Reinforcement Learning for Investor-Specific Portfolio Optimization: A Volatility-Guided Asset Selection Approach ArXiv ID: 2505.03760 “View on arXiv” Authors: Unknown Abstract Portfolio optimization requires dynamic allocation of funds by balancing the risk and return tradeoff under dynamic market conditions. With the recent advancements in AI, Deep Reinforcement Learning (DRL) has gained prominence in providing adaptive and scalable strategies for portfolio optimization. However, the success of these strategies depends not only on their ability to adapt to market dynamics but also on the careful pre-selection of assets that influence overall portfolio performance. Incorporating the investor’s preference in pre-selecting assets for a portfolio is essential in refining their investment strategies. This study proposes a volatility-guided DRL-based portfolio optimization framework that dynamically constructs portfolios based on investors’ risk profiles. The Generalized Autoregressive Conditional Heteroscedasticity (GARCH) model is utilized for volatility forecasting of stocks and categorizes them based on their volatility as aggressive, moderate, and conservative. The DRL agent is then employed to learn an optimal investment policy by interacting with the historical market data. The efficacy of the proposed methodology is established using stocks from the Dow $30$ index. The proposed investor-specific DRL-based portfolios outperformed the baseline strategies by generating consistent risk-adjusted returns. ...

End-to-End Portfolio Optimization with Quantum Annealing ArXiv ID: 2504.08843 “View on arXiv” Authors: Unknown Abstract Hybrid-quantum classical optimization has emerged as a promising direction for addressing financial decision problems under current quantum hardware constraints. In this work we present a practical end-to-end portfolio optimization pipeline that combines (i) a continuous mean-variance and Sharpe-ratio formulation, (ii) a QUBO/CQM-based discrete asset selection stage solved using D-Wave’s hybrid quantum annealing solver, (iii) classical convex optimization for computing optimal asset weights, and (iv) a quarterly rebalancing mechanism. Rather than claiming quantum advantage, our goal is to evaluate the feasibility and integration of these components within a deployable financial workflow. We empirically compare our hybrid pipeline against a fund manager in real time and indexes used in Indian stock market. The results indicate that the proposed framework can construct diversified portfolios and achieve competitive returns. We also report computational considerations and scalability observations drawn from the hybrid solver behaviour. While the experiments are limited to moderate sized portfolios dictated by current annealing hardware and QUBO embedding constraints, the study illustrates how quantum assisted selection and classical allocation can be combined coherently in a real-world setting. This work emphasizes methodological reproducibility and practical applicability, and aims to serve as a step toward larger-scale financial optimization workflows as quantum annealers continue to mature. ...

Diffusion Factor Models: Generating High-Dimensional Returns with Factor Structure ArXiv ID: 2504.06566 “View on arXiv” Authors: Unknown Abstract Financial scenario simulation is essential for risk management and portfolio optimization, yet it remains challenging especially in high-dimensional and small data settings common in finance. We propose a diffusion factor model that integrates latent factor structure into generative diffusion processes, bridging econometrics with modern generative AI to address the challenges of the curse of dimensionality and data scarcity in financial simulation. By exploiting the low-dimensional factor structure inherent in asset returns, we decompose the score function–a key component in diffusion models–using time-varying orthogonal projections, and this decomposition is incorporated into the design of neural network architectures. We derive rigorous statistical guarantees, establishing nonasymptotic error bounds for both score estimation at O(d^{“5/2”} n^{"-2/(k+5)"}) and generated distribution at O(d^{“5/4”} n^{"-1/2(k+5)"}), primarily driven by the intrinsic factor dimension k rather than the number of assets d, surpassing the dimension-dependent limits in the classical nonparametric statistics literature and making the framework viable for markets with thousands of assets. Numerical studies confirm superior performance in latent subspace recovery under small data regimes. Empirical analysis demonstrates the economic significance of our framework in constructing mean-variance optimal portfolios and factor portfolios. This work presents the first theoretical integration of factor structure with diffusion models, offering a principled approach for high-dimensional financial simulation with limited data. Our code is available at https://github.com/xymmmm00/diffusion_factor_model. ...