Optimizes sparse mean-reverting portfolios for higher returns.
problem Finding optimal stock weights for mean-reverting portfolios.
method Transformed optimization problem into SDP, added constraints.
result Sparse mean-reverting portfolios provide higher returns with transaction costs.
New methods show sparse portfolios offer no advantage over mean-variance in diversification.
problem Investment diversification and risk management with sparse portfolios.
method Developed and implemented a new estimation procedure for sparse second-order stochastic spanning using a greedy algorithm and Linear Programming.
result No benefit from expanding a sparse opportunity set beyond 45 assets; optimal sparse portfolio reduces tail risk.
EFS uses LLMs to optimize sparse portfolios by evolving alpha factors.
problem Sparse portfolio optimization in dynamic market regimes.
method Evolutionary feedback loop with LLM-generated alpha factors.
result Significantly outperforms baselines in diverse datasets.
A scalable gradient-based framework for sparse portfolio selection.
problem Sparse minimum-variance portfolio selection with cardinality constraint.
method Gradient-based optimization with Boolean relaxation and tunable parameter.
result Matches commercial solvers in most instances, differing by a few assets with negligible error in portfolio variance.
BPASGM uses sparse graphical models to optimize portfolio selection.
problem Portfolio optimization in high-dimensional settings with estimation error.
method BPASGM extends BPA to a sparse graphical model, screening assets for diversification.
result BPASGM portfolios outperform standard mean-variance portfolios in risk-adjusted performance.
This paper considers portfolio construction in a dynamic setting. We specify a loss function comprised of utility and complexity components with an unknown tradeoff parameter. We develop a novel regret-based criterion for selecting the tradeoff parameter to construct optimal sparse portfolios over time.
Sparse modeling improves portfolio optimization by reducing errors in complex market systems.
problem Errors in multivariate modeling of markets and economy.
method L0-norm sparse elliptical modeling to reduce oversimplification, and study likelihood in- and out-of-sample for different parameter lengths.
result Sparse models lead to better portfolio performance, higher out-of-sample likelihood, and lower volatility.
Proposes a robust and sparse portfolio selection model to reduce estimation errors and transaction costs.
problem Reduces impact of estimation errors and fixed transaction costs in portfolio selection.
method Develops an efficient algorithm to solve a mixed integer problem with an ellipsoidal uncertainty set.
result Proves the convergence of the algorithm to at least a local minimizer with a locally linear convergence rate.
New model approximates sparse mean-CVaR portfolio optimization efficiently.
problem NP-hard ℓ0-constrained mean-CVaR optimization. method Proximal alternating linearized minimization algorithm with nested fixed-point proximity.
result The model offers a guaranteed approximation of the ℓ0-constrained mean-CVaR model. Paper tackles non-convex optimization for higher moments in portfolio management.
problem Complexity of higher moments in optimization problems.
method Method of successive convex approximation.
result Solves mean-variance-skewness problem using non-convex optimization.
Machine learning factors outperform traditional portfolio optimization methods.
problem Comparing machine learning and traditional portfolio optimization methods.
method Examined machine learning and factor-based portfolio optimization using autoencoder neural networks and dimensionality reduction techniques.
result Minimum-variance portfolios using latent factors derived from autoencoders and sparse methods outperform simpler benchmarks in risk minimization.
This paper considers mean-variance optimization under uncertainty, specifically when one desires a sparsified set of optimal portfolio weights. From the standpoint of a Bayesian investor, our approach produces a small portfolio from many potential assets while acknowledging uncertainty in asset returns and parameter es…
Develops sparse portfolio strategy for high-dimensional assets.
problem Sparse wealth allocations in high dimensions are limited by existing approaches.
method Establishes theoretical bounds and empirical analysis of sparse weight estimators.
result Sparse portfolios are robust to recessions and can be used as a hedging vehicle.
Sparse portfolio strategy from mutual funds' favorite stocks in China A share market.
problem Building a sparse portfolio from mutual funds' favorite stocks in a market with limited fund information.
method Analyzed mutual fund favorite stocks, used portfolio optimizer with constraints, and compared different methods.
result Sparse portfolios consistently outperform the benchmark index 930950.CSI.
We consider the problem of portfolio selection within the classical Markowitz mean-variance framework, reformulated as a constrained least-squares regression problem. We propose to add to the objective function a penalty proportional to the sum of the absolute values of the portfolio weights. This penalty regularizes (…
Proposes an efficient method for sparse index tracking with ℓ0-norm constraints.
problem Constructing a sparse portfolio to track a financial index.
method Formulates a new problem using ℓ0-norm constraints, develops an efficient algorithm based on primal-dual splitting. result Demonstrates effectiveness through experiments on S&P500 and Russell3000 datasets.
Bayesian model reduces stock volatility by identifying key cointegrated relationships.
problem Constructing low volatility stock portfolios from a large number of stocks.
method High dimensional Bayesian cointegration estimation.
result Portfolios with reduced volatility and persistence of cointegration relationships.
New heuristic selects fewer assets for efficient portfolios, reducing costs.
problem High transaction costs and fees from including many assets in portfolios.
method Surrogate formulation to select assets, re-optimizes portfolio with fewer assets.
result Effective in constructing portfolios with fewer assets, reducing costs.
We solve a portfolio selection problem with four objectives, finding convex scalarizations for part of the Pareto front.
problem Portfolio selection with four objectives: mean, variance, skewness, and kurtosis.
method Linearly scalarize MVSK objectives into a convex polynomial Fλ over the probability simplex, compute optimizers for each λ. result Identify a set of hyper-parameters for which the scalarization is convex, allowing computation of part of the Pareto front.
Paper solves high-order portfolio optimization with cardinality constraint.
problem Solving non-convex cardinality constrained high-order portfolio optimization.
method Transformed cardinality constraint into penalty term, proposed pDCA, pDCAe, and SCA algorithms.
result Proposed algorithms achieve high utility and sparse solutions efficiently.
The paper uses TDA to select stocks for a sparse portfolio, improving performance across market scenarios.
problem Sparse portfolio selection in financial markets.
method Topological data analysis (TDA) for clustering stock price movements.
result The TDA-based clustering strategy significantly enhances sparse portfolio performance.
We propose a unified framework to address a family of classical mixed-integer optimization problems with logically constrained decision variables, including network design, facility location, unit commitment, sparse portfolio selection, binary quadratic optimization, sparse principal analysis and sparse learning proble…
In this short report, we discuss how coordinate-wise descent algorithms can be used to solve minimum variance portfolio (MVP) problems in which the portfolio weights are constrained by lq norms, where 1≤q≤2. A portfolio which weights are regularised by such norms is called a sparse portfolio (Brodie et …
In this paper, we propose ℓp-norm regularized models to seek near-optimal sparse portfolios. These sparse solutions reduce the complexity of portfolio implementation and management. Theoretical results are established to guarantee the sparsity of the second-order KKT points of the ℓp-norm regularized models…
We introduce a financial portfolio optimization framework that allows us to automatically select the relevant assets and estimate their weights by relying on a sorted ℓ1-Norm penalization, henceforth SLOPE. Our approach is able to group constituents with similar correlation properties, and with the same underlyin…
Sparse grids reduce xVA exposure evaluations by up to 6000 times.
problem Efficiently computing exposures for xVA in large portfolios with many risk factors.
method Sparse Grid Method combined with Stochastic Collocation and Smolyak's extension.
result Significant reduction in the number of portfolio evaluations, up to 6000 times.
Bayesian approach for constructing and rebalancing sparse index-tracking portfolios.
problem Sparse tracking of a reference index with uncertainty quantification.
method Sparse linear regression with Laplace prior, empirical-Bayes calibration, Langevin-type MCMC, threshold-based rules.
result Posterior uncertainty on tracking error, portfolio composition, and rebalancing moves.
Markowitz (1952, 1959) laid down the ground-breaking work on the mean-variance analysis. Under his framework, the theoretical optimal allocation vector can be very different from the estimated one for large portfolios due to the intrinsic difficulty of estimating a vast covariance matrix and return vector. This can res…
Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the ℓ1-norm. However, several important learning applications cannot benefit from this approach as they feature these convex norms as constraints in addition to the non-convex rank a…
Develops FGL for better portfolio allocation under common factor influence.
problem Sparsity assumption fails for stock returns driven by common factors.
method Integrates graphical models with factor structure to estimate portfolio weights and risk exposure robust to heavy-tailed distributions.
result FGL-based portfolios outperform equal-weighted and Index portfolios in empirical applications.
A new method tracks index using topological data analysis for sparse portfolios.
problem Sparse index tracking with robust risk management.
method Topological learning via Vietoris-Rips filtration for sparse regularization.
result The method outperforms state-of-the-art techniques in various market conditions.
HRT uses bi-level reinforcement learning to optimize stock selection and execution in multi-asset equity markets.
problem Optimizing automated equity trading decisions under risk, turnover, and transaction costs.
method Hierarchical Reinforced Trader (HRT) framework that separates selection and execution decisions.
result HRT outperforms other methods in learning-based return-risk-cost trade-offs, improving Sharpe ratio and reducing turnover.
ML helps select variables for minimum-variance portfolios, reducing risk and improving performance.
problem Optimizing minimum-variance portfolios with relevant predictors.
method Parameterized minimum-variance portfolio weights using a large pool of firm-level characteristics and their transformations.
result ML-selected predictors lead to lower risk and better performance in minimum-variance portfolios.
Dynamic risk factor model improves portfolio performance in high dimensions.
problem Dynamic portfolio allocation in high-dimensional financial markets.
method Time-varying sparsity on factor loadings, sequential learning of parameters and volatilities.
result Significant portfolio performance improvements and higher utility gains.
Paper tackles P vs NP problem in portfolio optimization with cardinality constraints and Black-Scholes derivatives.
problem Operationalizing the P vs NP problem in cardinality-constrained portfolio selection.
method Mixed-integer quadratic program with genetic algorithms, Monte Carlo sampling, and greedy screening.
result Cardinality constraint reshapes efficient frontier, highlighting trade-offs between stability and computational cost.
The paper examines extreme value statistics of high-dimensional sample covariances, with applications in finance and image analysis.
problem Statistical validation of normal conditions in high-dimensional time series data.
method Generalizes the maximal deviation of sample autocovariances to high dimensions and applies Gumbel-type extreme value asymptotics.
result Gumbel-type extreme value asymptotics holds true for high-dimensional sample covariances.
A new penalty-free method optimizes portfolios without quantum annealing penalties.
problem Optimizing portfolios with quantum annealing penalties.
method Removing the penalty term and using a classical feasibility projector.
result Significant reduction in chain-break fractions and post-processed regret.
The popularity of modern portfolio theory has decreased among practitioners because of its unfavorable out-of-sample performance. Estimation errors tend to affect the optimal weight calculation noticeably, especially when a large number of assets is considered. To overcome these issues, many methods have been proposed …
A new portfolio model improves on Kelly's by accounting for estimation error.
problem Estimation error in Kelly portfolio optimization.
method Wasserstein distributionally robust optimization (DRO) to define a robust log-optimal portfolio.
result The Wasserstein-Kelly portfolio outperforms the Kelly portfolio in out-of-sample testing.
Improved FDR control for sparse financial index tracking.
problem Maintaining FDR control in high-dimensional financial data with strong variable dependencies.
method Expanding T-Rex framework to handle overlapping groups of correlated variables with nearest neighbors penalization.
result Accurately tracks the S&P 500 index using only a small number of stocks.
Optimizes option portfolios for skewed-t returns using VaR and variance measures.
problem Optimizing portfolios for skewed-t returns with heavy tails and skewness.
method Uses variance and VaR measures, departing from normal returns, and provides explicit portfolio weights.
result Optimal portfolio weights differ significantly from variance optimal weights due to skewness.
Develops pathwise analysis for log-optimal portfolios using rough paths theory.
problem Analyzing stability and approximation of log-optimal portfolios.
method Pathwise approach based on càdlàg rough paths theory.
result Establishes pathwise stability and error estimates for log-optimal portfolios.
In this paper Portfolio Optimization techniques were used to determine the most favorable investment portfolio. In particular, stock indices of three companies, namely Microsoft Corporation, Christian Dior Fashion House and Shevron Corporation were evaluated. Using this data the amounts invested in each asset when a po…
LoCoV reduces portfolio optimization errors from sample covariance matrices.
problem Large errors in sample covariance matrix for optimal portfolio weights.
method LoCoV (low dimension covariance voting) algorithm to reduce these errors.
result LoCoV outperforms classical methods in portfolio optimization experiments.
Signature portfolios approximate optimal wealth in non-Markovian markets.
problem Approximating optimal wealth in non-Markovian markets.
method Linear path-functional portfolios based on signatures of market weights.
result Signature portfolios can uniformly approximate any continuous portfolio function.
The paper optimizes portfolios using a new GARCH model with regime switching and tempered stable innovations.
problem Mitigating left tail risk in multi-asset portfolios.
method Proposes a Markov regime-switching GARCH model with multivariate normal tempered stable innovation (MRS-MNTS-GARCH) for portfolio optimization.
result Optimal portfolios with tail risk measures outperform standard deviation-based portfolios and equally weighted portfolios in various performance metrics.
Analog method solves portfolio optimization problems faster and more efficiently.
problem Accurate covariance matrix estimation and fast optimal portfolio selection for financial applications.
method Two-step process using equilibrium propagation and analog Hopfield networks.
result Fully analog pipeline calculates optimal portfolios in energy-efficient manner.
We discuss a class of risk-sensitive portfolio optimization problems. We consider the portfolio optimization model investigated by Nagai in 2003. The model by its nature can include fixed income securities as well in the portfolio. Under fairly general conditions, we prove the existence of optimal portfolio in both fin…