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.
Optimizes fund portfolio updates using linear programming and heuristic search.
problem Efficiently updating mutual fund portfolios with various instruments.
method Linear programming and heuristic search approaches.
result Cost improvements over traditional methods.
Heuristic algorithm for portfolio optimization reduces solve times to milliseconds.
problem Mean-variance portfolio optimization with various constraints.
method Alternating Direction Method of Multipliers (ADMM).
result Achieves performance bounds and solves problems in milliseconds.
Develops Heuristic Portfolio Optimization (HPO) as an information-restricted projection of Markowitz/tangency solution
problem Practitioners allocate capital with forecast-light rules like equal weight, inverse volatility, risk parity, HRP, and RA-HRP
method Implies-return principle and fixed-tree cluster-Sharpe recursion
result Formalizes HPO maps, proves defect equals squared inefficiency, and identifies nodewise alphas as policy-gradient coordinates
We consider the optimization of active extension portfolios. For this purpose, the optimization problem is rewritten as a stochastic programming model and solved using a clever multi-start local search heuristic, which turns out to provide stable solutions. The heuristic solutions are compared to optimization results o…
This survey reviews portfolio choice in settings where investment opportunities are stochastic due to, e.g., stochastic volatility or return predictability. It is explained how to heuristically compute candidate optimal portfolios using tools from stochastic control, and how to rigorously verify their optimality by mea…
RPS uses graph-based representation learning for better portfolio optimization.
problem Improving portfolio optimization with better returns and lower risks.
method RPS redefines the distance matrix of financial assets using Representation Learning and Clustering algorithms.
result RPS proposes a heuristic to select closer to the optimal subset of assets.
During the last few years, there has been an interest in comparing simple or heuristic procedures for portfolio selection, such as the naive, equal weights, portfolio choice, against more "sophisticated" portfolio choices, and in explaining why, in some cases, the heuristic choice seems to outperform the sophisticated …
In this paper we present an evolutionary optimization approach to solve the risk parity portfolio selection problem. While there exist convex optimization approaches to solve this problem when long-only portfolios are considered, the optimization problem becomes non-trivial in the long-short case. To solve this problem…
Paper connects two portfolio methods, HRP and Minimum Variance, revealing their underlying similarity.
problem Inability to universally adopt optimization-based portfolio construction methods.
method Unifies Hierarchical Risk Parity and Minimum Variance approaches.
result Schur complementary allocation reveals the connection between HRP and Minimum Variance.
In this paper, we solve portfolio rebalancing problem when security returns are represented by uncertain variables considering transaction costs. The performance of the proposed model is studied using constant-proportion portfolio insurance (CPPI) as rebalancing strategy. Numerical results showed that uncertain paramet…
We investigate the application of two heuristic methods, genetic algorithms and tabu/scatter search, to the optimisation of realistic portfolios. The model is based on the classical mean-variance approach, but enhanced with floor and ceiling constraints, cardinality constraints and nonlinear transaction costs which inc…
A metaheuristic approach solves portfolio optimization with constraints.
problem Portfolio Optimization Problem with cardinality and quantity constraints.
method Combination of TabuSearch and TokenRing Search with three neighborhood relations.
result The proposed techniques perform well on public benchmarks.
A new model tracks indices without rebalancing, solving NP-hard problems.
problem Tracking indices without rebalancing and minimizing deviations.
method Metaheuristic algorithms and local branching for solving mixed integer linear programming.
result The heuristic generates portfolios that outperform commercial solvers in both in-sample and out-of-sample data.
The paper identifies a mesoscopic market structure and uses it to improve portfolio optimization.
problem The optimal mean-variance allocation differs from the heuristic equally-weighted portfolio.
method Clustering techniques from Random Matrix Theory (RMT) to study mesoscopic market structure.
result A new wealth allocation scheme that attaches equal importance to stocks in the same community improves portfolio reliability.
Power-law portfolios improve diversification by scaling weights sub-linearly.
problem Optimization methods struggle with unstable pair correlations and non-Gaussian risk measures.
method Construct portfolios with penalty proportional to arbitrary order moment of returns, leading to sub-linear weight scaling.
result Infinite order power-law portfolios are perfectly diversified, improving diversification over Kelly portfolios.
With the advent of Web 2.0, various types of data are being produced every day. This has led to the revolution of big data. Huge amount of structured and unstructured data are produced in financial markets. Processing these data could help an investor to make an informed investment decision. In this paper, a framework …
Investing is a compression problem, maximizing growth by minimizing divergence.
problem Maximizing long-term wealth and minimizing risk of ruin in investing.
method Decomposes investing into three terms: money, entropy, and divergence. Uses Kelly Criterion and universal portfolio theory.
result Investing can be seen as a compression problem, with optimal strategies minimizing divergence.
This paper studies the portfolio optimization problem when the investor's utility is general and the return and volatility of the risky asset are fast mean-reverting, which are important to capture the fast-time scale in the modeling of stock price volatility. Motivated by the heuristic derivation in [J.-P. Fouque, R. …
Quantum computing promises faster finance algorithms.
problem Solving finance problems faster than classical methods.
method Quantum computing applications to finance, including Monte Carlo, portfolio optimization, and machine learning.
result Quantum speedups for finance problems, especially Monte Carlo and portfolio optimization.
Study optimizes portfolio liquidation strategies with complex market impacts.
problem Optimizing portfolio liquidation with transient market impacts and self-exciting order flow.
method Mean-field control problem with semimartingale strategies, passing to continuous-time limit, and solving Riccati equations.
result Existence of optimal strategy with jumps only at start and end of trading period.
Quantum computing aids in optimizing currency reserves for central banks.
problem Optimizing currency composition in foreign exchange reserves.
method Comparison of quantum and classical algorithms for portfolio optimization.
result Quantum algorithms outperform classical methods in currency optimization.
We propose a Markov chain model for credit rating changes. We do not use any distributional assumptions on the asset values of the rated companies but directly model the rating transitions process. The parameters of the model are estimated by a maximum likelihood approach using historical rating transitions and heurist…
In this paper, we study the portfolio optimization problem with general utility functions and when the return and volatility of underlying asset are slowly varying. An asymptotic optimal strategy is provided within a specific class of admissible controls under this problem setup. Specifically, we first establish a rigo…
The paper introduces isotropy as a regularizer to enhance portfolio stability.
problem Model uncertainty and estimation errors in diversification strategies.
method Integrates isotropy as a geometric regularizer into mean-variance optimization.
result Isotropy constraint systematically induces negative average-signal exposure, providing a robust crash hedge.
The 20/60/20 rule improves risk management and portfolio optimization in finance.
problem Understanding and managing financial data with heavy tails.
method Application of the 20/60/20 rule to stock market data, development of new measures for tail heaviness, and integration into portfolio optimization.
result The 20/60/20 rule enhances robustness and performance in portfolio optimization.
New method improves portfolio selection by filtering noisy covariance matrices.
problem Noisy covariance matrices in financial datasets affect portfolio performance evaluation.
method Combinatorial Optimization approach using Mixed Integer Quadratic Programming.
result Our method outperforms existing filtering strategies for real financial datasets.
New algorithm improves asset ranking for better cross-sectional portfolios.
problem Sub-optimal ranking of assets in cross-sectional systematic strategies.
method Learning-to-rank algorithms to enhance portfolio construction.
result Modern machine learning ranking algorithms boost Sharpe Ratios by approximately threefold.
We consider the problem of portfolio optimization in a simple incomplete market and under a general utility function. By working with the associated Hamilton-Jacobi-Bellman partial differential equation (HJB PDE), we obtain a closed-form formula for a trading strategy which approximates the optimal trading strategy whe…
HAMD optimizes cubic portfolios without quadratization, achieving better results.
problem Optimizing higher-order portfolio models with reduced distortion.
method Hybrid pipeline combining continuous Hamiltonian search, cardinality-preserving projection, and iterated local search.
result HAMD achieves significantly lower native cubic objective values than classical heuristics.
Financial portfolio optimization is a widely studied problem in mathematics, statistics, financial and computational literature. It adheres to determining an optimal combination of weights associated with financial assets held in a portfolio. In practice, it faces challenges by virtue of varying math. formulations, par…
Market sectors play a key role in the efficient flow of capital through the modern Global economy. We analyze existing sectorization heuristics, and observe that the most popular - the GICS (which informs the S&P 500), and the NAICS (published by the U.S. Government) - are not entirely quantitatively driven, but rather…
Quantum GBS boosts asset clustering for robust statistical arbitrage portfolios.
problem Identifying co-moving assets from correlation matrices for statistical arbitrage.
method Mapping S&P 500 correlation data to GBS-compatible adjacency matrices, benchmarking classical and quantum clustering algorithms.
result Quantum GBS generates superior alpha during high volatility periods, persisting under low-loss conditions.
Enhances multi-project scheduling with multiple priority rules.
problem Resource allocation in multi-project scheduling with limited time and resources.
method Simulation-based approach using composite priority rules.
result Increased probability of finding schedules with shortest duration.
Improved stock selection through predictive fundamentals and uncertainty estimates.
problem Selecting stocks based on future financial data to outperform traditional factor models.
method Train deep nets to forecast future fundamentals, incorporate uncertainty estimates, and adjust portfolios to manage risk.
result Simulated annualized return of 17.7% and Sharpe ratio of 0.84 for uncertainty-aware model, significantly higher than 14.0% and 0.52 for standard factor models.
D-Wave hybrid quantum-classical portfolio optimization shows classical decomposition is key, not quantum sampling.
problem Optimizing portfolios with constraints using hybrid quantum-classical methods.
method Operational decomposition audit of D-Wave's hybrid quantum-classical service on mean-variance-turnover instances.
result Classical decomposition and feasibility-aware reassembly are key to hybrid quantum-classical performance.
Quantum algorithm speeds up MIP solving by a near-quadratic factor.
problem Solving Mixed Integer Programs (MIPs) efficiently.
method Incremental-Quantum-Branch-and-Bound algorithm combining quantum speedup with classical search heuristics.
result Universal near-quadratic speedup over classical Branch-and-Bound algorithms.
This study tackles mutual fund portfolio prediction, focusing on novel items.
problem Predicting novel items in mutual fund portfolios is challenging and less explored.
method Created a comprehensive benchmark dataset and evaluated various recommender system models.
result Autoencoder-based approaches outperform state-of-the-art models in predicting novel items.
In this paper we propose and discuss different 0-1 linear models in order to solve the cardinality constrained portfolio problem by using factor models. Factor models are used to build portfolios to track indexes, together with other objectives, also need a smaller number of parameters to estimate than the classical Ma…
This work explores the non-convex optimization in compressive learning and the performance of heuristics.
problem The challenge of learning from compressed representations in compressive learning.
method Numerical simulations of the non-convex optimization landscape and heuristic performance.
result Properties of the non-convex optimization landscape and heuristic performance are explored.
Recently two search algorithms, A* and breadth-first branch and bound (BFBnB), were developed based on a simple admissible heuristic for learning Bayesian network structures that optimize a scoring function. The heuristic represents a relaxation of the learning problem such that each variable chooses optimal parents in…
A new algorithm improves efficiency and robustness of heuristic optimization in simulation-based problems.
problem Optimizing input parameters for stochastic simulation-based optimization.
method Reactive sample size algorithm based on parametric tests and indifference-zone selection.
result The reactive method improves efficiency and robustness of heuristic optimization techniques.
FinCARE combines financial data and AI reasoning to improve causal analysis of financial performance.
problem Correlation-based analysis fails to capture true causal relationships in financial performance.
method Hybrid framework integrating causal discovery algorithms with financial domain knowledge from SEC filings and LLM reasoning.
result KG+LLM-enhanced methods improve causal discovery across PC, GES, and NOTEARS by 36-366%.
Heuristic algorithms such as simulated annealing, Concorde, and METIS are effective and widely used approaches to find solutions to combinatorial optimization problems. However, they are limited by the high sample complexity required to reach a reasonable solution from a cold-start. In this paper, we introduce a novel …
Heuristic weighting improves denoising score matching without requiring noise distribution assumptions.
problem Improving denoising score matching without assuming noise distribution.
method Demonstrated heteroskedasticity, derived optimal weighting functions, and provided theoretical and empirical comparisons.
result Heuristical weighting function can achieve lower variance than optimal weighting, facilitating more stable and efficient training.
RL improves combinatorial optimization by automating heuristic search.
problem Hard combinatorial optimization problems with suboptimal solutions.
method Training RL agents to solve these problems.
result RL can outperform traditional algorithms in solving complex problems.
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.
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.